java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:45,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:45,697 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:45,712 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:45,712 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:45,713 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:45,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:45,720 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:45,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:45,723 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:45,727 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:45,728 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:45,729 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:45,730 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:45,731 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:45,736 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:45,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:45,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:45,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:45,751 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:45,756 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:45,757 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:45,759 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:45,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:45,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:45,760 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:45,761 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:45,762 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:45,763 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:45,764 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:45,764 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:45,765 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:45,765 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:45,765 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:45,766 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:45,767 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:45,767 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:00:45,790 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:45,791 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:45,792 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:45,792 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:45,792 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:45,797 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:45,797 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:45,797 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:45,797 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:45,797 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:45,798 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:45,798 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:45,798 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:45,798 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:45,798 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:45,799 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:45,799 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:45,800 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:45,800 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:45,800 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:45,800 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:45,801 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:45,801 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:45,801 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:45,801 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:45,801 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:45,802 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:45,802 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:45,802 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:45,802 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:45,802 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:45,846 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:45,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:45,862 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:45,864 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:45,864 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:45,865 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:00:45,919 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675c9ac38/c9a426dd159a498e818ec51564acf3d1/FLAGec84295d0 [2018-11-23 13:00:46,481 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:46,484 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:00:46,506 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675c9ac38/c9a426dd159a498e818ec51564acf3d1/FLAGec84295d0 [2018-11-23 13:00:46,764 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/675c9ac38/c9a426dd159a498e818ec51564acf3d1 [2018-11-23 13:00:46,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:46,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:46,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:46,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:46,782 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:46,783 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:46" (1/1) ... [2018-11-23 13:00:46,786 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f288c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:46, skipping insertion in model container [2018-11-23 13:00:46,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:46" (1/1) ... [2018-11-23 13:00:46,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:46,860 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:47,235 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:47,247 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:47,339 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:47,397 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:47,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47 WrapperNode [2018-11-23 13:00:47,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:47,399 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:47,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:47,399 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:47,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (1/1) ... [2018-11-23 13:00:47,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (1/1) ... [2018-11-23 13:00:47,514 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:47,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:47,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:47,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:47,526 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (1/1) ... [2018-11-23 13:00:47,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (1/1) ... [2018-11-23 13:00:47,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (1/1) ... [2018-11-23 13:00:47,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (1/1) ... [2018-11-23 13:00:47,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (1/1) ... [2018-11-23 13:00:47,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (1/1) ... [2018-11-23 13:00:47,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (1/1) ... [2018-11-23 13:00:47,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:47,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:47,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:47,581 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:47,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (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 13:00:47,639 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 13:00:47,639 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 13:00:47,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:47,639 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-23 13:00:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-23 13:00:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 13:00:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 13:00:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 13:00:47,640 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 13:00:47,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:47,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:47,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:00:47,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:47,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:48,561 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:48,562 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:00:48,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:48 BoogieIcfgContainer [2018-11-23 13:00:48,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:48,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:48,564 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:48,568 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:48,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:46" (1/3) ... [2018-11-23 13:00:48,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5859345d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:48, skipping insertion in model container [2018-11-23 13:00:48,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:47" (2/3) ... [2018-11-23 13:00:48,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5859345d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:48, skipping insertion in model container [2018-11-23 13:00:48,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:48" (3/3) ... [2018-11-23 13:00:48,572 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_length_check_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:00:48,583 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:48,594 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:00:48,611 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:00:48,643 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:48,644 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:48,644 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:48,644 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:48,644 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:48,645 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:48,645 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:48,645 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:48,645 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 13:00:48,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:00:48,673 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:48,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:48,676 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:48,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash 2078522992, now seen corresponding path program 1 times [2018-11-23 13:00:48,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:48,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:48,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:48,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:48,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:48,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2018-11-23 13:00:48,855 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {44#true} is VALID [2018-11-23 13:00:48,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 13:00:48,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #99#return; {44#true} is VALID [2018-11-23 13:00:48,857 INFO L256 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret12 := main(); {44#true} is VALID [2018-11-23 13:00:48,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {44#true} ~len~1 := 2; {44#true} is VALID [2018-11-23 13:00:48,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {44#true} assume !true; {45#false} is VALID [2018-11-23 13:00:48,858 INFO L256 TraceCheckUtils]: 7: Hoare triple {45#false} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {44#true} is VALID [2018-11-23 13:00:48,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {44#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID [2018-11-23 13:00:48,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#true} assume !true; {44#true} is VALID [2018-11-23 13:00:48,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {44#true} is VALID [2018-11-23 13:00:48,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 13:00:48,860 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {44#true} {45#false} #103#return; {45#false} is VALID [2018-11-23 13:00:48,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {45#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {45#false} is VALID [2018-11-23 13:00:48,861 INFO L256 TraceCheckUtils]: 14: Hoare triple {45#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {44#true} is VALID [2018-11-23 13:00:48,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {44#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {44#true} is VALID [2018-11-23 13:00:48,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {44#true} assume !(~head.base != 0 || ~head.offset != 0); {44#true} is VALID [2018-11-23 13:00:48,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {44#true} #res := ~len~0; {44#true} is VALID [2018-11-23 13:00:48,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 13:00:48,863 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {44#true} {45#false} #105#return; {45#false} is VALID [2018-11-23 13:00:48,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {45#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {45#false} is VALID [2018-11-23 13:00:48,863 INFO L273 TraceCheckUtils]: 21: Hoare triple {45#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {45#false} is VALID [2018-11-23 13:00:48,864 INFO L273 TraceCheckUtils]: 22: Hoare triple {45#false} assume !false; {45#false} is VALID [2018-11-23 13:00:48,869 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 13:00:48,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:48,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:00:48,878 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 13:00:48,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:48,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:00:49,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:49,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:00:49,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:00:49,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:49,052 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-11-23 13:00:49,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:49,189 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 13:00:49,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:00:49,189 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23 [2018-11-23 13:00:49,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:49,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:49,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2018-11-23 13:00:49,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 93 transitions. [2018-11-23 13:00:49,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 93 transitions. [2018-11-23 13:00:49,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:49,508 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:00:49,508 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:00:49,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:00:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:00:49,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:49,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:49,691 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:49,693 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:49,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:49,701 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 13:00:49,701 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 13:00:49,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:49,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:49,703 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:49,704 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 13:00:49,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:49,717 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 13:00:49,718 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 13:00:49,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:49,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:49,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:49,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:00:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-23 13:00:49,729 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 23 [2018-11-23 13:00:49,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:49,733 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-23 13:00:49,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:00:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-23 13:00:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:00:49,734 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:49,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:49,736 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:49,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:49,736 INFO L82 PathProgramCache]: Analyzing trace with hash 308454869, now seen corresponding path program 1 times [2018-11-23 13:00:49,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:49,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:49,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:49,977 INFO L256 TraceCheckUtils]: 0: Hoare triple {248#true} call ULTIMATE.init(); {248#true} is VALID [2018-11-23 13:00:49,978 INFO L273 TraceCheckUtils]: 1: Hoare triple {248#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {248#true} is VALID [2018-11-23 13:00:49,978 INFO L273 TraceCheckUtils]: 2: Hoare triple {248#true} assume true; {248#true} is VALID [2018-11-23 13:00:49,979 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {248#true} {248#true} #99#return; {248#true} is VALID [2018-11-23 13:00:49,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {248#true} call #t~ret12 := main(); {248#true} is VALID [2018-11-23 13:00:49,980 INFO L273 TraceCheckUtils]: 5: Hoare triple {248#true} ~len~1 := 2; {250#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:49,981 INFO L273 TraceCheckUtils]: 6: Hoare triple {250#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {250#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:49,983 INFO L273 TraceCheckUtils]: 7: Hoare triple {250#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {250#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:49,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {250#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {250#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:49,985 INFO L256 TraceCheckUtils]: 9: Hoare triple {250#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {248#true} is VALID [2018-11-23 13:00:49,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {248#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {251#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:49,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {251#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {252#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:49,989 INFO L273 TraceCheckUtils]: 12: Hoare triple {252#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {252#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:49,992 INFO L273 TraceCheckUtils]: 13: Hoare triple {252#(<= |sll_create_#in~len| 0)} assume true; {252#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:50,000 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {252#(<= |sll_create_#in~len| 0)} {250#(<= 2 main_~len~1)} #103#return; {249#false} is VALID [2018-11-23 13:00:50,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {249#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {249#false} is VALID [2018-11-23 13:00:50,001 INFO L256 TraceCheckUtils]: 16: Hoare triple {249#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {248#true} is VALID [2018-11-23 13:00:50,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {248#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {248#true} is VALID [2018-11-23 13:00:50,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {248#true} assume !(~head.base != 0 || ~head.offset != 0); {248#true} is VALID [2018-11-23 13:00:50,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {248#true} #res := ~len~0; {248#true} is VALID [2018-11-23 13:00:50,002 INFO L273 TraceCheckUtils]: 20: Hoare triple {248#true} assume true; {248#true} is VALID [2018-11-23 13:00:50,002 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {248#true} {249#false} #105#return; {249#false} is VALID [2018-11-23 13:00:50,002 INFO L273 TraceCheckUtils]: 22: Hoare triple {249#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {249#false} is VALID [2018-11-23 13:00:50,003 INFO L273 TraceCheckUtils]: 23: Hoare triple {249#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {249#false} is VALID [2018-11-23 13:00:50,003 INFO L273 TraceCheckUtils]: 24: Hoare triple {249#false} assume !false; {249#false} is VALID [2018-11-23 13:00:50,006 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 13:00:50,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:50,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:00:50,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 13:00:50,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:50,009 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:00:50,105 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 13:00:50,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:00:50,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:00:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:50,107 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 5 states. [2018-11-23 13:00:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:50,459 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 13:00:50,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:00:50,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-23 13:00:50,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:50,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:00:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-23 13:00:50,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:00:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2018-11-23 13:00:50,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2018-11-23 13:00:50,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:50,621 INFO L225 Difference]: With dead ends: 45 [2018-11-23 13:00:50,621 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 13:00:50,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:50,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 13:00:50,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-23 13:00:50,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:50,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 29 states. [2018-11-23 13:00:50,644 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 29 states. [2018-11-23 13:00:50,644 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 29 states. [2018-11-23 13:00:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:50,647 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 13:00:50,647 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 13:00:50,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:50,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:50,649 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 31 states. [2018-11-23 13:00:50,649 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 31 states. [2018-11-23 13:00:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:50,652 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 13:00:50,652 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 13:00:50,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:50,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:50,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:50,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 13:00:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-23 13:00:50,656 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 25 [2018-11-23 13:00:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:50,656 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-23 13:00:50,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:00:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 13:00:50,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 13:00:50,658 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:50,658 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:50,658 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:50,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1526105051, now seen corresponding path program 1 times [2018-11-23 13:00:50,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:50,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:50,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:50,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:50,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:50,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {423#true} call ULTIMATE.init(); {423#true} is VALID [2018-11-23 13:00:50,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {423#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {423#true} is VALID [2018-11-23 13:00:50,927 INFO L273 TraceCheckUtils]: 2: Hoare triple {423#true} assume true; {423#true} is VALID [2018-11-23 13:00:50,928 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {423#true} {423#true} #99#return; {423#true} is VALID [2018-11-23 13:00:50,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {423#true} call #t~ret12 := main(); {423#true} is VALID [2018-11-23 13:00:50,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {423#true} ~len~1 := 2; {423#true} is VALID [2018-11-23 13:00:50,929 INFO L273 TraceCheckUtils]: 6: Hoare triple {423#true} #t~short8 := ~len~1 < 32; {423#true} is VALID [2018-11-23 13:00:50,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {423#true} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {423#true} is VALID [2018-11-23 13:00:50,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {423#true} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {423#true} is VALID [2018-11-23 13:00:50,930 INFO L256 TraceCheckUtils]: 9: Hoare triple {423#true} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {423#true} is VALID [2018-11-23 13:00:50,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {423#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {423#true} is VALID [2018-11-23 13:00:50,932 INFO L273 TraceCheckUtils]: 11: Hoare triple {423#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {425#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:00:50,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {425#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {425#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:00:50,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {425#(not (= 0 sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {426#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:00:50,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {426#(not (= 0 sll_create_~head~0.base))} assume !(~len > 0); {426#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:00:50,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {426#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {427#(not (= 0 |sll_create_#res.base|))} is VALID [2018-11-23 13:00:50,943 INFO L273 TraceCheckUtils]: 16: Hoare triple {427#(not (= 0 |sll_create_#res.base|))} assume true; {427#(not (= 0 |sll_create_#res.base|))} is VALID [2018-11-23 13:00:50,944 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {427#(not (= 0 |sll_create_#res.base|))} {423#true} #103#return; {428#(not (= 0 |main_#t~ret10.base|))} is VALID [2018-11-23 13:00:50,953 INFO L273 TraceCheckUtils]: 18: Hoare triple {428#(not (= 0 |main_#t~ret10.base|))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {429#(not (= 0 main_~s~0.base))} is VALID [2018-11-23 13:00:50,954 INFO L256 TraceCheckUtils]: 19: Hoare triple {429#(not (= 0 main_~s~0.base))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {423#true} is VALID [2018-11-23 13:00:50,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {423#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {430#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2018-11-23 13:00:50,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {430#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {431#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-23 13:00:50,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {431#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {431#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-23 13:00:50,956 INFO L273 TraceCheckUtils]: 23: Hoare triple {431#(= 0 |sll_length_#in~head.base|)} assume true; {431#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-23 13:00:50,957 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {431#(= 0 |sll_length_#in~head.base|)} {429#(not (= 0 main_~s~0.base))} #105#return; {424#false} is VALID [2018-11-23 13:00:50,957 INFO L273 TraceCheckUtils]: 25: Hoare triple {424#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {424#false} is VALID [2018-11-23 13:00:50,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {424#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {424#false} is VALID [2018-11-23 13:00:50,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {424#false} assume !false; {424#false} is VALID [2018-11-23 13:00:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:50,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:50,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:00:50,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 13:00:50,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:50,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:00:51,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:51,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:00:51,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:00:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:00:51,006 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 9 states. [2018-11-23 13:00:51,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:51,503 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 13:00:51,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:00:51,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 13:00:51,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:00:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-23 13:00:51,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:00:51,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2018-11-23 13:00:51,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2018-11-23 13:00:51,567 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 13:00:51,569 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:00:51,570 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 13:00:51,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:00:51,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 13:00:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-23 13:00:51,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:51,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-23 13:00:51,614 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-23 13:00:51,615 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-23 13:00:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:51,617 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 13:00:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 13:00:51,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:51,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:51,619 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-23 13:00:51,619 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-23 13:00:51,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:51,622 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-11-23 13:00:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2018-11-23 13:00:51,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:51,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:51,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:51,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:51,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 13:00:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-11-23 13:00:51,625 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 28 [2018-11-23 13:00:51,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:51,626 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-11-23 13:00:51,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:00:51,626 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-11-23 13:00:51,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:00:51,627 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:51,627 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:51,628 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:51,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:51,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1811609727, now seen corresponding path program 1 times [2018-11-23 13:00:51,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:51,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:51,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:51,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:51,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {602#true} is VALID [2018-11-23 13:00:51,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {602#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {602#true} is VALID [2018-11-23 13:00:51,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {602#true} assume true; {602#true} is VALID [2018-11-23 13:00:51,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {602#true} {602#true} #99#return; {602#true} is VALID [2018-11-23 13:00:51,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {602#true} call #t~ret12 := main(); {602#true} is VALID [2018-11-23 13:00:51,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {602#true} ~len~1 := 2; {604#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:51,761 INFO L273 TraceCheckUtils]: 6: Hoare triple {604#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {604#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:51,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {604#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {604#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:51,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {604#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {604#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:51,763 INFO L256 TraceCheckUtils]: 9: Hoare triple {604#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {602#true} is VALID [2018-11-23 13:00:51,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {602#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {605#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:51,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {605#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {605#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:51,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {605#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {605#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:51,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {605#(<= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {606#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:00:51,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {607#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:51,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {607#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {607#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:51,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {607#(<= |sll_create_#in~len| 1)} assume true; {607#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:51,791 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {607#(<= |sll_create_#in~len| 1)} {604#(<= 2 main_~len~1)} #103#return; {603#false} is VALID [2018-11-23 13:00:51,792 INFO L273 TraceCheckUtils]: 18: Hoare triple {603#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {603#false} is VALID [2018-11-23 13:00:51,792 INFO L256 TraceCheckUtils]: 19: Hoare triple {603#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {602#true} is VALID [2018-11-23 13:00:51,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {602#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {602#true} is VALID [2018-11-23 13:00:51,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {602#true} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {602#true} is VALID [2018-11-23 13:00:51,793 INFO L273 TraceCheckUtils]: 22: Hoare triple {602#true} assume !(~head.base != 0 || ~head.offset != 0); {602#true} is VALID [2018-11-23 13:00:51,793 INFO L273 TraceCheckUtils]: 23: Hoare triple {602#true} #res := ~len~0; {602#true} is VALID [2018-11-23 13:00:51,793 INFO L273 TraceCheckUtils]: 24: Hoare triple {602#true} assume true; {602#true} is VALID [2018-11-23 13:00:51,793 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {602#true} {603#false} #105#return; {603#false} is VALID [2018-11-23 13:00:51,794 INFO L273 TraceCheckUtils]: 26: Hoare triple {603#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {603#false} is VALID [2018-11-23 13:00:51,794 INFO L273 TraceCheckUtils]: 27: Hoare triple {603#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {603#false} is VALID [2018-11-23 13:00:51,794 INFO L273 TraceCheckUtils]: 28: Hoare triple {603#false} assume !false; {603#false} is VALID [2018-11-23 13:00:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:51,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:51,797 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:51,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:51,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:52,158 INFO L256 TraceCheckUtils]: 0: Hoare triple {602#true} call ULTIMATE.init(); {602#true} is VALID [2018-11-23 13:00:52,159 INFO L273 TraceCheckUtils]: 1: Hoare triple {602#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {602#true} is VALID [2018-11-23 13:00:52,159 INFO L273 TraceCheckUtils]: 2: Hoare triple {602#true} assume true; {602#true} is VALID [2018-11-23 13:00:52,159 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {602#true} {602#true} #99#return; {602#true} is VALID [2018-11-23 13:00:52,159 INFO L256 TraceCheckUtils]: 4: Hoare triple {602#true} call #t~ret12 := main(); {602#true} is VALID [2018-11-23 13:00:52,164 INFO L273 TraceCheckUtils]: 5: Hoare triple {602#true} ~len~1 := 2; {604#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:52,164 INFO L273 TraceCheckUtils]: 6: Hoare triple {604#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {604#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:52,165 INFO L273 TraceCheckUtils]: 7: Hoare triple {604#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {604#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:52,166 INFO L273 TraceCheckUtils]: 8: Hoare triple {604#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {604#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:52,166 INFO L256 TraceCheckUtils]: 9: Hoare triple {604#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {602#true} is VALID [2018-11-23 13:00:52,167 INFO L273 TraceCheckUtils]: 10: Hoare triple {602#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {605#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:52,167 INFO L273 TraceCheckUtils]: 11: Hoare triple {605#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {605#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:52,168 INFO L273 TraceCheckUtils]: 12: Hoare triple {605#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {605#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:52,169 INFO L273 TraceCheckUtils]: 13: Hoare triple {605#(<= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {606#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:00:52,169 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {607#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:52,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {607#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {607#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:52,187 INFO L273 TraceCheckUtils]: 16: Hoare triple {607#(<= |sll_create_#in~len| 1)} assume true; {607#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:52,189 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {607#(<= |sll_create_#in~len| 1)} {604#(<= 2 main_~len~1)} #103#return; {603#false} is VALID [2018-11-23 13:00:52,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {603#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {603#false} is VALID [2018-11-23 13:00:52,190 INFO L256 TraceCheckUtils]: 19: Hoare triple {603#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {603#false} is VALID [2018-11-23 13:00:52,190 INFO L273 TraceCheckUtils]: 20: Hoare triple {603#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {603#false} is VALID [2018-11-23 13:00:52,191 INFO L273 TraceCheckUtils]: 21: Hoare triple {603#false} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {603#false} is VALID [2018-11-23 13:00:52,191 INFO L273 TraceCheckUtils]: 22: Hoare triple {603#false} assume !(~head.base != 0 || ~head.offset != 0); {603#false} is VALID [2018-11-23 13:00:52,192 INFO L273 TraceCheckUtils]: 23: Hoare triple {603#false} #res := ~len~0; {603#false} is VALID [2018-11-23 13:00:52,192 INFO L273 TraceCheckUtils]: 24: Hoare triple {603#false} assume true; {603#false} is VALID [2018-11-23 13:00:52,193 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {603#false} {603#false} #105#return; {603#false} is VALID [2018-11-23 13:00:52,193 INFO L273 TraceCheckUtils]: 26: Hoare triple {603#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {603#false} is VALID [2018-11-23 13:00:52,193 INFO L273 TraceCheckUtils]: 27: Hoare triple {603#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {603#false} is VALID [2018-11-23 13:00:52,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {603#false} assume !false; {603#false} is VALID [2018-11-23 13:00:52,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:52,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:52,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 13:00:52,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-23 13:00:52,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:52,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:00:52,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:52,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:00:52,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:00:52,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:52,433 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2018-11-23 13:00:52,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:52,745 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-11-23 13:00:52,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:00:52,745 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-23 13:00:52,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 13:00:52,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:00:52,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 13:00:52,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-23 13:00:52,840 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:52,842 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:00:52,842 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:00:52,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:00:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:00:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2018-11-23 13:00:52,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:52,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 33 states. [2018-11-23 13:00:52,877 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 33 states. [2018-11-23 13:00:52,877 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 33 states. [2018-11-23 13:00:52,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:52,880 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 13:00:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 13:00:52,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:52,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:52,881 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 35 states. [2018-11-23 13:00:52,881 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 35 states. [2018-11-23 13:00:52,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:52,883 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-11-23 13:00:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2018-11-23 13:00:52,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:52,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:52,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:52,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:52,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 13:00:52,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 13:00:52,887 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2018-11-23 13:00:52,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:52,887 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 13:00:52,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:00:52,888 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 13:00:52,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:00:52,889 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:52,889 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:52,889 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:52,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:52,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1815186809, now seen corresponding path program 2 times [2018-11-23 13:00:52,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:52,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:52,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:52,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:53,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2018-11-23 13:00:53,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {884#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {884#true} is VALID [2018-11-23 13:00:53,171 INFO L273 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2018-11-23 13:00:53,171 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #99#return; {884#true} is VALID [2018-11-23 13:00:53,172 INFO L256 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret12 := main(); {884#true} is VALID [2018-11-23 13:00:53,172 INFO L273 TraceCheckUtils]: 5: Hoare triple {884#true} ~len~1 := 2; {884#true} is VALID [2018-11-23 13:00:53,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {884#true} #t~short8 := ~len~1 < 32; {884#true} is VALID [2018-11-23 13:00:53,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {884#true} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {884#true} is VALID [2018-11-23 13:00:53,172 INFO L273 TraceCheckUtils]: 8: Hoare triple {884#true} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {884#true} is VALID [2018-11-23 13:00:53,173 INFO L256 TraceCheckUtils]: 9: Hoare triple {884#true} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {884#true} is VALID [2018-11-23 13:00:53,173 INFO L273 TraceCheckUtils]: 10: Hoare triple {884#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {884#true} is VALID [2018-11-23 13:00:53,174 INFO L273 TraceCheckUtils]: 11: Hoare triple {884#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {886#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:00:53,174 INFO L273 TraceCheckUtils]: 12: Hoare triple {886#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {886#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:00:53,175 INFO L273 TraceCheckUtils]: 13: Hoare triple {886#(not (= 0 sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {887#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:00:53,175 INFO L273 TraceCheckUtils]: 14: Hoare triple {887#(not (= 0 sll_create_~head~0.base))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {887#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:00:53,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {887#(not (= 0 sll_create_~head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {887#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:00:53,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {887#(not (= 0 sll_create_~head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {888#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-23 13:00:53,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {888#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} assume !(~len > 0); {888#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} is VALID [2018-11-23 13:00:53,183 INFO L273 TraceCheckUtils]: 18: Hoare triple {888#(not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {889#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2018-11-23 13:00:53,184 INFO L273 TraceCheckUtils]: 19: Hoare triple {889#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} assume true; {889#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} is VALID [2018-11-23 13:00:53,186 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {889#(not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)))} {884#true} #103#return; {890#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} is VALID [2018-11-23 13:00:53,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {890#(not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~ret10.base|) |main_#t~ret10.offset|)))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {891#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 13:00:53,187 INFO L256 TraceCheckUtils]: 22: Hoare triple {891#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {884#true} is VALID [2018-11-23 13:00:53,188 INFO L273 TraceCheckUtils]: 23: Hoare triple {884#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {892#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-23 13:00:53,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {892#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {893#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} is VALID [2018-11-23 13:00:53,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {893#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {894#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} is VALID [2018-11-23 13:00:53,191 INFO L273 TraceCheckUtils]: 26: Hoare triple {894#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} #res := ~len~0; {894#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} is VALID [2018-11-23 13:00:53,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {894#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} assume true; {894#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} is VALID [2018-11-23 13:00:53,195 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {894#(= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))} {891#(not (= 0 (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)))} #105#return; {885#false} is VALID [2018-11-23 13:00:53,195 INFO L273 TraceCheckUtils]: 29: Hoare triple {885#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {885#false} is VALID [2018-11-23 13:00:53,196 INFO L273 TraceCheckUtils]: 30: Hoare triple {885#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {885#false} is VALID [2018-11-23 13:00:53,196 INFO L273 TraceCheckUtils]: 31: Hoare triple {885#false} assume !false; {885#false} is VALID [2018-11-23 13:00:53,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:53,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:53,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:53,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:00:53,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:00:53,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:00:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:53,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:53,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {884#true} call ULTIMATE.init(); {884#true} is VALID [2018-11-23 13:00:53,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {884#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {884#true} is VALID [2018-11-23 13:00:53,522 INFO L273 TraceCheckUtils]: 2: Hoare triple {884#true} assume true; {884#true} is VALID [2018-11-23 13:00:53,523 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {884#true} {884#true} #99#return; {884#true} is VALID [2018-11-23 13:00:53,523 INFO L256 TraceCheckUtils]: 4: Hoare triple {884#true} call #t~ret12 := main(); {884#true} is VALID [2018-11-23 13:00:53,524 INFO L273 TraceCheckUtils]: 5: Hoare triple {884#true} ~len~1 := 2; {913#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:53,525 INFO L273 TraceCheckUtils]: 6: Hoare triple {913#(<= 2 main_~len~1)} #t~short8 := ~len~1 < 32; {913#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:53,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {913#(<= 2 main_~len~1)} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {913#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:53,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {913#(<= 2 main_~len~1)} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {913#(<= 2 main_~len~1)} is VALID [2018-11-23 13:00:53,526 INFO L256 TraceCheckUtils]: 9: Hoare triple {913#(<= 2 main_~len~1)} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {884#true} is VALID [2018-11-23 13:00:53,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {884#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {929#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:53,527 INFO L273 TraceCheckUtils]: 11: Hoare triple {929#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {929#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:53,528 INFO L273 TraceCheckUtils]: 12: Hoare triple {929#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {929#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:53,529 INFO L273 TraceCheckUtils]: 13: Hoare triple {929#(<= |sll_create_#in~len| sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {939#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:00:53,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {939#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {939#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:00:53,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {939#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {939#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:00:53,532 INFO L273 TraceCheckUtils]: 16: Hoare triple {939#(<= |sll_create_#in~len| (+ sll_create_~len 1))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {949#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2018-11-23 13:00:53,533 INFO L273 TraceCheckUtils]: 17: Hoare triple {949#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {953#(<= |sll_create_#in~len| 2)} is VALID [2018-11-23 13:00:53,534 INFO L273 TraceCheckUtils]: 18: Hoare triple {953#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {953#(<= |sll_create_#in~len| 2)} is VALID [2018-11-23 13:00:53,534 INFO L273 TraceCheckUtils]: 19: Hoare triple {953#(<= |sll_create_#in~len| 2)} assume true; {953#(<= |sll_create_#in~len| 2)} is VALID [2018-11-23 13:00:53,536 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {953#(<= |sll_create_#in~len| 2)} {913#(<= 2 main_~len~1)} #103#return; {885#false} is VALID [2018-11-23 13:00:53,536 INFO L273 TraceCheckUtils]: 21: Hoare triple {885#false} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {885#false} is VALID [2018-11-23 13:00:53,537 INFO L256 TraceCheckUtils]: 22: Hoare triple {885#false} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {885#false} is VALID [2018-11-23 13:00:53,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {885#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {885#false} is VALID [2018-11-23 13:00:53,538 INFO L273 TraceCheckUtils]: 24: Hoare triple {885#false} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {885#false} is VALID [2018-11-23 13:00:53,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {885#false} assume !(~head.base != 0 || ~head.offset != 0); {885#false} is VALID [2018-11-23 13:00:53,539 INFO L273 TraceCheckUtils]: 26: Hoare triple {885#false} #res := ~len~0; {885#false} is VALID [2018-11-23 13:00:53,539 INFO L273 TraceCheckUtils]: 27: Hoare triple {885#false} assume true; {885#false} is VALID [2018-11-23 13:00:53,540 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {885#false} {885#false} #105#return; {885#false} is VALID [2018-11-23 13:00:53,540 INFO L273 TraceCheckUtils]: 29: Hoare triple {885#false} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {885#false} is VALID [2018-11-23 13:00:53,541 INFO L273 TraceCheckUtils]: 30: Hoare triple {885#false} assume ~len~1 != #t~ret11;havoc #t~ret11; {885#false} is VALID [2018-11-23 13:00:53,541 INFO L273 TraceCheckUtils]: 31: Hoare triple {885#false} assume !false; {885#false} is VALID [2018-11-23 13:00:53,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:53,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:53,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2018-11-23 13:00:53,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-23 13:00:53,563 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:53,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 13:00:53,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:53,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 13:00:53,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:00:53,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:00:53,664 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 16 states. [2018-11-23 13:00:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:55,583 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-11-23 13:00:55,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:00:55,583 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-11-23 13:00:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:55,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:00:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-11-23 13:00:55,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 13:00:55,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 61 transitions. [2018-11-23 13:00:55,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 61 transitions. [2018-11-23 13:00:55,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:55,753 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:00:55,753 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 13:00:55,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-11-23 13:00:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 13:00:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-23 13:00:55,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:55,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-23 13:00:55,811 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-23 13:00:55,811 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-23 13:00:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:55,813 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 13:00:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 13:00:55,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:55,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:55,814 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-23 13:00:55,814 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-23 13:00:55,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:55,817 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 13:00:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 13:00:55,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:55,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:55,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:55,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 13:00:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-23 13:00:55,820 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 32 [2018-11-23 13:00:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:55,820 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-23 13:00:55,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 13:00:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-23 13:00:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 13:00:55,822 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:55,822 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:55,822 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:55,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1302029915, now seen corresponding path program 3 times [2018-11-23 13:00:55,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:55,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:55,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:00:55,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:56,073 INFO L256 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2018-11-23 13:00:56,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1226#true} is VALID [2018-11-23 13:00:56,074 INFO L273 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 13:00:56,074 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #99#return; {1226#true} is VALID [2018-11-23 13:00:56,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret12 := main(); {1226#true} is VALID [2018-11-23 13:00:56,081 INFO L273 TraceCheckUtils]: 5: Hoare triple {1226#true} ~len~1 := 2; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} #t~short8 := ~len~1 < 32; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,121 INFO L256 TraceCheckUtils]: 9: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1226#true} is VALID [2018-11-23 13:00:56,121 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1226#true} is VALID [2018-11-23 13:00:56,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1226#true} is VALID [2018-11-23 13:00:56,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1226#true} is VALID [2018-11-23 13:00:56,122 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1226#true} is VALID [2018-11-23 13:00:56,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1226#true} is VALID [2018-11-23 13:00:56,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1226#true} is VALID [2018-11-23 13:00:56,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1226#true} is VALID [2018-11-23 13:00:56,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1226#true} is VALID [2018-11-23 13:00:56,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1226#true} is VALID [2018-11-23 13:00:56,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1226#true} is VALID [2018-11-23 13:00:56,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {1226#true} assume !(~len > 0); {1226#true} is VALID [2018-11-23 13:00:56,123 INFO L273 TraceCheckUtils]: 21: Hoare triple {1226#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1226#true} is VALID [2018-11-23 13:00:56,123 INFO L273 TraceCheckUtils]: 22: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 13:00:56,125 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1226#true} {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} #103#return; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,125 INFO L273 TraceCheckUtils]: 24: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,125 INFO L256 TraceCheckUtils]: 25: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1226#true} is VALID [2018-11-23 13:00:56,128 INFO L273 TraceCheckUtils]: 26: Hoare triple {1226#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1229#(= sll_length_~len~0 0)} is VALID [2018-11-23 13:00:56,128 INFO L273 TraceCheckUtils]: 27: Hoare triple {1229#(= sll_length_~len~0 0)} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1230#(and (<= sll_length_~len~0 1) (<= 1 sll_length_~len~0))} is VALID [2018-11-23 13:00:56,129 INFO L273 TraceCheckUtils]: 28: Hoare triple {1230#(and (<= sll_length_~len~0 1) (<= 1 sll_length_~len~0))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1231#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2018-11-23 13:00:56,130 INFO L273 TraceCheckUtils]: 29: Hoare triple {1231#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} assume !(~head.base != 0 || ~head.offset != 0); {1231#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2018-11-23 13:00:56,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {1231#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} #res := ~len~0; {1232#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2018-11-23 13:00:56,131 INFO L273 TraceCheckUtils]: 31: Hoare triple {1232#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} assume true; {1232#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2018-11-23 13:00:56,132 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1232#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} #105#return; {1233#(and (< |main_#t~ret11| (+ main_~len~1 1)) (<= main_~len~1 |main_#t~ret11|))} is VALID [2018-11-23 13:00:56,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {1233#(and (< |main_#t~ret11| (+ main_~len~1 1)) (<= main_~len~1 |main_#t~ret11|))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1233#(and (< |main_#t~ret11| (+ main_~len~1 1)) (<= main_~len~1 |main_#t~ret11|))} is VALID [2018-11-23 13:00:56,136 INFO L273 TraceCheckUtils]: 34: Hoare triple {1233#(and (< |main_#t~ret11| (+ main_~len~1 1)) (<= main_~len~1 |main_#t~ret11|))} assume ~len~1 != #t~ret11;havoc #t~ret11; {1227#false} is VALID [2018-11-23 13:00:56,136 INFO L273 TraceCheckUtils]: 35: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2018-11-23 13:00:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:00:56,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:56,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:00:56,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:00:56,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 13:00:56,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:00:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:56,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:56,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2018-11-23 13:00:56,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1226#true} is VALID [2018-11-23 13:00:56,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 13:00:56,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #99#return; {1226#true} is VALID [2018-11-23 13:00:56,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret12 := main(); {1226#true} is VALID [2018-11-23 13:00:56,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {1226#true} ~len~1 := 2; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} #t~short8 := ~len~1 < 32; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,313 INFO L273 TraceCheckUtils]: 7: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} assume !#t~short8;havoc #t~nondet7;havoc #t~short8; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,313 INFO L256 TraceCheckUtils]: 9: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); {1226#true} is VALID [2018-11-23 13:00:56,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1226#true} is VALID [2018-11-23 13:00:56,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1226#true} is VALID [2018-11-23 13:00:56,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1226#true} is VALID [2018-11-23 13:00:56,314 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1226#true} is VALID [2018-11-23 13:00:56,314 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1226#true} is VALID [2018-11-23 13:00:56,314 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1226#true} is VALID [2018-11-23 13:00:56,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1226#true} is VALID [2018-11-23 13:00:56,315 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1226#true} is VALID [2018-11-23 13:00:56,315 INFO L273 TraceCheckUtils]: 18: Hoare triple {1226#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1226#true} is VALID [2018-11-23 13:00:56,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {1226#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1226#true} is VALID [2018-11-23 13:00:56,316 INFO L273 TraceCheckUtils]: 20: Hoare triple {1226#true} assume !(~len > 0); {1226#true} is VALID [2018-11-23 13:00:56,316 INFO L273 TraceCheckUtils]: 21: Hoare triple {1226#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1226#true} is VALID [2018-11-23 13:00:56,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 13:00:56,319 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1226#true} {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} #103#return; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,319 INFO L273 TraceCheckUtils]: 24: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} is VALID [2018-11-23 13:00:56,320 INFO L256 TraceCheckUtils]: 25: Hoare triple {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); {1226#true} is VALID [2018-11-23 13:00:56,321 INFO L273 TraceCheckUtils]: 26: Hoare triple {1226#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {1229#(= sll_length_~len~0 0)} is VALID [2018-11-23 13:00:56,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {1229#(= sll_length_~len~0 0)} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1230#(and (<= sll_length_~len~0 1) (<= 1 sll_length_~len~0))} is VALID [2018-11-23 13:00:56,322 INFO L273 TraceCheckUtils]: 28: Hoare triple {1230#(and (<= sll_length_~len~0 1) (<= 1 sll_length_~len~0))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {1231#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2018-11-23 13:00:56,323 INFO L273 TraceCheckUtils]: 29: Hoare triple {1231#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} assume !(~head.base != 0 || ~head.offset != 0); {1231#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} is VALID [2018-11-23 13:00:56,324 INFO L273 TraceCheckUtils]: 30: Hoare triple {1231#(and (<= sll_length_~len~0 2) (<= 2 sll_length_~len~0))} #res := ~len~0; {1232#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2018-11-23 13:00:56,325 INFO L273 TraceCheckUtils]: 31: Hoare triple {1232#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} assume true; {1232#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} is VALID [2018-11-23 13:00:56,326 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1232#(and (<= 2 |sll_length_#res|) (<= |sll_length_#res| 2))} {1228#(and (<= 2 main_~len~1) (<= main_~len~1 2))} #105#return; {1333#(and (<= 2 |main_#t~ret11|) (<= 2 main_~len~1) (<= main_~len~1 2) (<= |main_#t~ret11| 2))} is VALID [2018-11-23 13:00:56,327 INFO L273 TraceCheckUtils]: 33: Hoare triple {1333#(and (<= 2 |main_#t~ret11|) (<= 2 main_~len~1) (<= main_~len~1 2) (<= |main_#t~ret11| 2))} assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; {1333#(and (<= 2 |main_#t~ret11|) (<= 2 main_~len~1) (<= main_~len~1 2) (<= |main_#t~ret11| 2))} is VALID [2018-11-23 13:00:56,328 INFO L273 TraceCheckUtils]: 34: Hoare triple {1333#(and (<= 2 |main_#t~ret11|) (<= 2 main_~len~1) (<= main_~len~1 2) (<= |main_#t~ret11| 2))} assume ~len~1 != #t~ret11;havoc #t~ret11; {1227#false} is VALID [2018-11-23 13:00:56,328 INFO L273 TraceCheckUtils]: 35: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2018-11-23 13:00:56,332 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:00:56,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:56,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:00:56,361 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 13:00:56,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:56,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:00:56,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:56,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:00:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:00:56,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:00:56,421 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-11-23 13:00:56,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:56,943 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 13:00:56,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:00:56,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-11-23 13:00:56,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:00:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2018-11-23 13:00:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:00:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2018-11-23 13:00:56,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2018-11-23 13:00:57,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:57,093 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:00:57,093 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:00:57,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 2 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 13:00:57,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:00:57,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2018-11-23 13:00:57,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:57,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 47 states. [2018-11-23 13:00:57,142 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 47 states. [2018-11-23 13:00:57,142 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 47 states. [2018-11-23 13:00:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:57,147 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 13:00:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 13:00:57,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:57,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:57,148 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 51 states. [2018-11-23 13:00:57,148 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 51 states. [2018-11-23 13:00:57,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:57,151 INFO L93 Difference]: Finished difference Result 51 states and 58 transitions. [2018-11-23 13:00:57,151 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-23 13:00:57,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:57,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:57,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:57,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 13:00:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-23 13:00:57,155 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 36 [2018-11-23 13:00:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:57,155 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-23 13:00:57,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:00:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 13:00:57,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 13:00:57,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:57,157 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:57,157 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:57,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:57,157 INFO L82 PathProgramCache]: Analyzing trace with hash -168004351, now seen corresponding path program 4 times [2018-11-23 13:00:57,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:57,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:57,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:00:57,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:00:57,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:00:57,249 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=9, |#NULL.offset|=6, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] RET #99#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~len~1 := 2; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0] [?] #t~short8 := ~len~1 < 32; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=true] [?] assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet7|=0, |main_#t~short8|=false] [?] assume !#t~short8;havoc #t~nondet7;havoc #t~short8; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3] [?] ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume !(~len > 0); VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#res.base|=8, |sll_create_#res.offset|=0, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume true; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#res.base|=8, |sll_create_#res.offset|=0, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] RET #103#return; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10.base|=8, |main_#t~ret10.offset|=0] [?] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; VAL [sll_length_~head.base=8, sll_length_~head.offset=0, sll_length_~len~0=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=7, sll_length_~head.offset=0, sll_length_~len~0=1, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=5, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !(~head.base != 0 || ~head.offset != 0); VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] #res := ~len~0; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0, |sll_length_#res|=3] [?] assume true; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0, |sll_length_#res|=3] [?] RET #105#return; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3] [?] assume ~len~1 != #t~ret11;havoc #t~ret11; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L592] ~len~1 := 2; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=true, ~len~1=2] [L593] assume #t~short8; [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] assume !#t~short8; [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L596] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=5, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=7, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L565-L573] assume !(~len > 0); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L574] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L563-L575] ensures true; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L596] RET call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10.base=8, #t~ret10.offset=0, ~len~1=2] [L596] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; [L596] havoc #t~ret10.base, #t~ret10.offset; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L576-L583] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L577] ~len~0 := 0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=8, ~head.offset=0, ~len~0=0] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=7, ~head.offset=0, ~len~0=1] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=5, ~head.offset=0, ~len~0=2] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L578-L581] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L576-L583] ensures true; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597-L599] assume ~len~1 != #t~ret11; [L597] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L592] ~len~1 := 2; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=true, ~len~1=2] [L593] assume #t~short8; [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] assume !#t~short8; [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L596] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=5, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=7, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L565-L573] assume !(~len > 0); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L574] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L563-L575] ensures true; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L596] RET call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10.base=8, #t~ret10.offset=0, ~len~1=2] [L596] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; [L596] havoc #t~ret10.base, #t~ret10.offset; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L576-L583] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L577] ~len~0 := 0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=8, ~head.offset=0, ~len~0=0] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=7, ~head.offset=0, ~len~0=1] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=5, ~head.offset=0, ~len~0=2] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L578-L581] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L576-L583] ensures true; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597-L599] assume ~len~1 != #t~ret11; [L597] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L592] int len = 2; VAL [len=2] [L593] len < 32 && __VERIFIER_nondet_int() [L593] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L574] return head; VAL [\old(len)=3, \result={8:0}, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L596] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={8:0}] [L596] SLL s = sll_create(len + 1); [L597] CALL, EXPR sll_length(s) VAL [head={8:0}] [L577] int len = 0; VAL [head={8:0}, head={8:0}, len=0] [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) VAL [head={0:0}, head={8:0}, len=3] [L582] return len; VAL [\result=3, head={8:0}, head={0:0}, len=3] [L597] RET, EXPR sll_length(s) VAL [len=2, s={8:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() VAL [len=2, s={8:0}] ----- [2018-11-23 13:00:57,388 WARN L170 areAnnotationChecker]: exitENTRY has no Hoare annotation [2018-11-23 13:00:57,388 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 13:00:57,388 WARN L170 areAnnotationChecker]: sll_destroyENTRY has no Hoare annotation [2018-11-23 13:00:57,388 WARN L170 areAnnotationChecker]: sll_createENTRY has no Hoare annotation [2018-11-23 13:00:57,388 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:00:57,389 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:00:57,389 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:00:57,389 WARN L170 areAnnotationChecker]: sll_lengthENTRY has no Hoare annotation [2018-11-23 13:00:57,389 WARN L170 areAnnotationChecker]: L561 has no Hoare annotation [2018-11-23 13:00:57,389 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:00:57,389 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2018-11-23 13:00:57,389 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2018-11-23 13:00:57,389 WARN L170 areAnnotationChecker]: L585-2 has no Hoare annotation [2018-11-23 13:00:57,389 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: L565-2 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: L593-5 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: L593-5 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2018-11-23 13:00:57,390 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: L585-3 has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: L565-3 has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: L593-6 has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: L593-6 has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: L593-1 has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: L578-3 has no Hoare annotation [2018-11-23 13:00:57,391 WARN L170 areAnnotationChecker]: sll_destroyEXIT has no Hoare annotation [2018-11-23 13:00:57,392 WARN L170 areAnnotationChecker]: sll_createFINAL has no Hoare annotation [2018-11-23 13:00:57,392 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2018-11-23 13:00:57,392 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2018-11-23 13:00:57,392 WARN L170 areAnnotationChecker]: L567-1 has no Hoare annotation [2018-11-23 13:00:57,392 WARN L170 areAnnotationChecker]: L596 has no Hoare annotation [2018-11-23 13:00:57,392 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2018-11-23 13:00:57,392 WARN L170 areAnnotationChecker]: L593-3 has no Hoare annotation [2018-11-23 13:00:57,392 WARN L170 areAnnotationChecker]: sll_lengthFINAL has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: L600-1 has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: sll_createEXIT has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: sll_lengthEXIT has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2018-11-23 13:00:57,393 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2018-11-23 13:00:57,394 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-23 13:00:57,394 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2018-11-23 13:00:57,394 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2018-11-23 13:00:57,394 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2018-11-23 13:00:57,394 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 13:00:57,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:00:57 BoogieIcfgContainer [2018-11-23 13:00:57,396 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:00:57,397 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:00:57,397 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:00:57,397 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:00:57,398 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:48" (3/4) ... [2018-11-23 13:00:57,404 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|=9, |#NULL.offset|=6, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=9, |old(#NULL.offset)|=6] [?] RET #99#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~len~1 := 2; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0] [?] #t~short8 := ~len~1 < 32; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=true] [?] assume #t~short8;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;#t~short8 := 0 != #t~nondet7; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~nondet7|=0, |main_#t~short8|=false] [?] assume !#t~short8;havoc #t~nondet7;havoc #t~short8; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3] [?] ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=0, sll_create_~head~0.offset=0, sll_create_~len=3, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=5, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=5, |sll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=5, sll_create_~head~0.offset=0, sll_create_~len=2, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=7, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=7, |sll_create_#t~malloc2.offset|=0] [?] assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [sll_create_~head~0.base=7, sll_create_~head~0.offset=0, sll_create_~len=1, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume !(~len > 0); VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#res.base|=8, |sll_create_#res.offset|=0, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] assume true; VAL [sll_create_~head~0.base=8, sll_create_~head~0.offset=0, sll_create_~len=0, sll_create_~new_head~0.base=8, sll_create_~new_head~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_create_#in~len|=3, |sll_create_#res.base|=8, |sll_create_#res.offset|=0, |sll_create_#t~malloc2.base|=8, |sll_create_#t~malloc2.offset|=0] [?] RET #103#return; VAL [main_~len~1=2, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret10.base|=8, |main_#t~ret10.offset|=0] [?] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset;havoc #t~ret10.base, #t~ret10.offset; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [|#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; VAL [sll_length_~head.base=8, sll_length_~head.offset=0, sll_length_~len~0=0, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=7, sll_length_~head.offset=0, sll_length_~len~0=1, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=5, sll_length_~head.offset=0, sll_length_~len~0=2, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !!(~head.base != 0 || ~head.offset != 0);#t~post4 := ~len~0;~len~0 := 1 + #t~post4;havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] assume !(~head.base != 0 || ~head.offset != 0); VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0] [?] #res := ~len~0; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0, |sll_length_#res|=3] [?] assume true; VAL [sll_length_~head.base=0, sll_length_~head.offset=0, sll_length_~len~0=3, |#NULL.base|=0, |#NULL.offset|=0, |sll_length_#in~head.base|=8, |sll_length_#in~head.offset|=0, |sll_length_#res|=3] [?] RET #105#return; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3] [?] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret11|=3] [?] assume ~len~1 != #t~ret11;havoc #t~ret11; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~len~1=2, main_~s~0.base=8, main_~s~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L592] ~len~1 := 2; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=true, ~len~1=2] [L593] assume #t~short8; [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] assume !#t~short8; [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L596] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=5, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=7, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L565-L573] assume !(~len > 0); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L574] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L563-L575] ensures true; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L596] RET call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10.base=8, #t~ret10.offset=0, ~len~1=2] [L596] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; [L596] havoc #t~ret10.base, #t~ret10.offset; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L576-L583] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L577] ~len~0 := 0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=8, ~head.offset=0, ~len~0=0] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=7, ~head.offset=0, ~len~0=1] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=5, ~head.offset=0, ~len~0=2] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L578-L581] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L576-L583] ensures true; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597-L599] assume ~len~1 != #t~ret11; [L597] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=9, #NULL.offset=6, old(#NULL.base)=9, old(#NULL.offset)=6] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=9, old(#NULL.offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L592] ~len~1 := 2; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=true, ~len~1=2] [L593] assume #t~short8; [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL.base=0, #NULL.offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] assume !#t~short8; [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2] [L596] CALL call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0.base, ~head~0.offset := 0, 0; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=0, ~head~0.offset=0, ~len=3, ~new_head~0.base=5, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=5, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=5, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=5, ~head~0.offset=0, ~len=2, ~new_head~0.base=7, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=7, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=7, ~new_head~0.offset=0] [L565-L573] assume !!(~len > 0); [L566] call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4); [L566] ~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L567-L569] assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=7, ~head~0.offset=0, ~len=1, ~new_head~0.base=8, ~new_head~0.offset=0] [L570] call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4); [L571] ~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L565-L573] assume !(~len > 0); VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L574] #res.base, #res.offset := ~head~0.base, ~head~0.offset; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L563-L575] ensures true; VAL [#in~len=3, #NULL.base=0, #NULL.offset=0, #res.base=8, #res.offset=0, #t~malloc2.base=8, #t~malloc2.offset=0, ~head~0.base=8, ~head~0.offset=0, ~len=0, ~new_head~0.base=8, ~new_head~0.offset=0] [L596] RET call #t~ret10.base, #t~ret10.offset := sll_create(1 + ~len~1); VAL [#NULL.base=0, #NULL.offset=0, #t~ret10.base=8, #t~ret10.offset=0, ~len~1=2] [L596] ~s~0.base, ~s~0.offset := #t~ret10.base, #t~ret10.offset; [L596] havoc #t~ret10.base, #t~ret10.offset; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0] [L576-L583] ~head.base, ~head.offset := #in~head.base, #in~head.offset; [L577] ~len~0 := 0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=8, ~head.offset=0, ~len~0=0] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=7, ~head.offset=0, ~len~0=1] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=5, ~head.offset=0, ~len~0=2] [L578-L581] assume !!(~head.base != 0 || ~head.offset != 0); [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4); [L580] ~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset; [L580] havoc #t~mem5.base, #t~mem5.offset; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L578-L581] assume !(~head.base != 0 || ~head.offset != 0); VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, ~head.base=0, ~head.offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L576-L583] ensures true; VAL [#in~head.base=8, #in~head.offset=0, #NULL.base=0, #NULL.offset=0, #res=3, ~head.base=0, ~head.offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0.base, ~s~0.offset); VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret11=3, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L597-L599] assume ~len~1 != #t~ret11; [L597] havoc #t~ret11; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [L602] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~len~1=2, ~s~0.base=8, ~s~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=9, #NULL!offset=6, old(#NULL!base)=9, old(#NULL!offset)=6] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=9, old(#NULL!offset)=6] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L592] ~len~1 := 2; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L593] #t~short8 := ~len~1 < 32; VAL [#NULL!base=0, #NULL!offset=0, #t~short8=true, ~len~1=2] [L593] COND TRUE #t~short8 [L593] assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647; [L593] #t~short8 := 0 != #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, #t~nondet7=0, #t~short8=false, ~len~1=2] [L593-L595] COND TRUE !#t~short8 [L593] havoc #t~nondet7; [L593] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2] [L596] CALL call #t~ret10 := sll_create(1 + ~len~1); VAL [#in~len=3, #NULL!base=0, #NULL!offset=0] [L563-L575] ~len := #in~len; [L564] ~head~0 := { base: 0, offset: 0 }; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=0, ~head~0!offset=0, ~len=3, ~new_head~0!base=5, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=5, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=5, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=5, ~head~0!offset=0, ~len=2, ~new_head~0!base=7, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=7, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=7, ~new_head~0!offset=0] [L565-L573] COND FALSE !(!(~len > 0)) [L566] FCALL call #t~malloc2 := #Ultimate.alloc(4); [L566] ~new_head~0 := #t~malloc2; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L567] COND FALSE !({ base: 0, offset: 0 } == ~new_head~0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=7, ~head~0!offset=0, ~len=1, ~new_head~0!base=8, ~new_head~0!offset=0] [L570] FCALL call write~$Pointer$(~head~0, { base: ~new_head~0!base, offset: ~new_head~0!offset }, 4); [L571] ~head~0 := ~new_head~0; [L572] #t~post3 := ~len; [L572] ~len := #t~post3 - 1; [L572] havoc #t~post3; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L565-L573] COND TRUE !(~len > 0) VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L574] #res := ~head~0; VAL [#in~len=3, #NULL!base=0, #NULL!offset=0, #res!base=8, #res!offset=0, #t~malloc2!base=8, #t~malloc2!offset=0, ~head~0!base=8, ~head~0!offset=0, ~len=0, ~new_head~0!base=8, ~new_head~0!offset=0] [L596] RET call #t~ret10 := sll_create(1 + ~len~1); VAL [#NULL!base=0, #NULL!offset=0, #t~ret10!base=8, #t~ret10!offset=0, ~len~1=2] [L596] ~s~0 := #t~ret10; [L596] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] CALL call #t~ret11 := sll_length(~s~0); VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0] [L576-L583] ~head := #in~head; [L577] ~len~0 := 0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=8, ~head!offset=0, ~len~0=0] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=7, ~head!offset=0, ~len~0=1] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=5, ~head!offset=0, ~len~0=2] [L578-L581] COND FALSE !(!(~head != { base: 0, offset: 0 })) [L579] #t~post4 := ~len~0; [L579] ~len~0 := 1 + #t~post4; [L579] havoc #t~post4; [L580] FCALL call #t~mem5 := read~$Pointer$({ base: ~head!base, offset: ~head!offset }, 4); [L580] ~head := #t~mem5; [L580] havoc #t~mem5; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L578-L581] COND TRUE !(~head != { base: 0, offset: 0 }) VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, ~head!base=0, ~head!offset=0, ~len~0=3] [L582] #res := ~len~0; VAL [#in~head!base=8, #in~head!offset=0, #NULL!base=0, #NULL!offset=0, #res=3, ~head!base=0, ~head!offset=0, ~len~0=3] [L597] RET call #t~ret11 := sll_length(~s~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] assume -2147483648 <= #t~ret11 && #t~ret11 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret11=3, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L597] COND TRUE ~len~1 != #t~ret11 [L597] havoc #t~ret11; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L602] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~len~1=2, ~s~0!base=8, ~s~0!offset=0] [L592] int len = 2; VAL [len=2] [L593] len < 32 && __VERIFIER_nondet_int() [L593] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L574] return head; VAL [\old(len)=3, \result={8:0}, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L596] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={8:0}] [L596] SLL s = sll_create(len + 1); [L597] CALL, EXPR sll_length(s) VAL [head={8:0}] [L577] int len = 0; VAL [head={8:0}, head={8:0}, len=0] [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) VAL [head={0:0}, head={8:0}, len=3] [L582] return len; VAL [\result=3, head={0:0}, head={8:0}, len=3] [L597] RET, EXPR sll_length(s) VAL [len=2, s={8:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() VAL [len=2, s={8:0}] ----- [2018-11-23 13:00:57,515 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/list-ext3-properties/sll_length_check_false-unreach-call_false-valid-memcleanup.i-witness.graphml [2018-11-23 13:00:57,516 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:00:57,517 INFO L168 Benchmark]: Toolchain (without parser) took 10741.39 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 861.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -756.8 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:57,519 INFO L168 Benchmark]: CDTParser took 0.18 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 13:00:57,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:57,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.39 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: -832.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:57,520 INFO L168 Benchmark]: Boogie Preprocessor took 63.43 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:57,521 INFO L168 Benchmark]: RCFGBuilder took 984.34 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: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:57,521 INFO L168 Benchmark]: TraceAbstraction took 8832.68 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -18.7 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:57,522 INFO L168 Benchmark]: Witness Printer took 118.87 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:57,526 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.18 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 621.18 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 115.39 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: -832.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 63.43 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: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 984.34 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: 34.8 MB). Peak memory consumption was 34.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8832.68 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 124.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: -18.7 MB). Peak memory consumption was 105.5 MB. Max. memory is 7.1 GB. * Witness Printer took 118.87 ms. Allocated memory is still 2.4 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 602]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L592] int len = 2; VAL [len=2] [L593] len < 32 && __VERIFIER_nondet_int() [L593] len < 32 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, len=2, len < 32 && __VERIFIER_nondet_int()=0] [L593] COND FALSE !(len < 32 && __VERIFIER_nondet_int()) [L596] CALL, EXPR sll_create(len + 1) VAL [\old(len)=3] [L564] SLL head = ((void *)0); VAL [\old(len)=3, head={0:0}, len=3] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={0:0}, len=3, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={5:0}, new_head={5:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={5:0}, len=2, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={7:0}, new_head={7:0}] [L565] COND TRUE len > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L567] COND FALSE !(((void *)0) == new_head) VAL [\old(len)=3, head={7:0}, len=1, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L570] new_head->next = head [L571] head = new_head [L572] len-- VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L565] COND FALSE !(len > 0) VAL [\old(len)=3, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L574] return head; VAL [\old(len)=3, \result={8:0}, head={8:0}, len=0, malloc(sizeof(struct node))={8:0}, new_head={8:0}] [L596] RET, EXPR sll_create(len + 1) VAL [len=2, sll_create(len + 1)={8:0}] [L596] SLL s = sll_create(len + 1); [L597] CALL, EXPR sll_length(s) VAL [head={8:0}] [L577] int len = 0; VAL [head={8:0}, head={8:0}, len=0] [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND TRUE \read(head) [L579] len++ [L580] EXPR head->next [L580] head = head->next [L578] COND FALSE !(\read(head)) VAL [head={0:0}, head={8:0}, len=3] [L582] return len; VAL [\result=3, head={8:0}, head={0:0}, len=3] [L597] RET, EXPR sll_length(s) VAL [len=2, s={8:0}, sll_length(s)=3] [L597] COND TRUE len != sll_length(s) [L602] __VERIFIER_error() VAL [len=2, s={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 43 locations, 1 error locations. UNSAFE Result, 8.7s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 4.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 169 SDtfs, 79 SDslu, 703 SDs, 0 SdLazy, 415 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=6, 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.4s AutomataMinimizationTime, 6 MinimizatonAttempts, 12 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 307 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 261 ConstructedInterpolants, 0 QuantifiedInterpolants, 20294 SizeOfPredicates, 6 NumberOfNonLiveVariables, 388 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 30/47 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...