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_of_sll_nondet_append_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:48,759 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:48,763 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:48,776 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:48,777 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:48,780 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:48,781 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:48,783 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:48,785 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:48,786 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:48,787 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:48,787 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:48,788 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:48,789 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:48,790 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:48,791 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:48,792 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:48,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:48,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:48,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:48,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:48,807 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:48,815 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:48,815 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:48,815 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:48,816 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:48,817 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:48,818 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:48,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:48,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:48,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:48,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:48,823 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:48,824 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:48,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:48,829 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:48,829 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:48,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:48,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:48,859 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:48,859 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:48,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:48,862 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:48,862 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:48,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:48,863 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:48,863 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:48,863 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:48,863 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:48,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:48,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:48,864 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:48,864 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:48,864 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:48,866 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:48,866 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:48,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:48,866 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:48,867 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:48,867 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:48,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:48,867 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:48,868 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:48,868 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:48,868 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:48,868 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:48,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:48,869 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:48,932 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:48,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:48,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:48,954 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:48,954 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:48,955 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:00:49,022 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63defbe16/8ffa056c10d34f218de88eaf1a629f17/FLAGe90d76910 [2018-11-23 13:00:49,548 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:49,549 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:00:49,561 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63defbe16/8ffa056c10d34f218de88eaf1a629f17/FLAGe90d76910 [2018-11-23 13:00:49,840 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63defbe16/8ffa056c10d34f218de88eaf1a629f17 [2018-11-23 13:00:49,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:49,852 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:49,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:49,854 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:49,857 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:49,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:49" (1/1) ... [2018-11-23 13:00:49,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7594bbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:49, skipping insertion in model container [2018-11-23 13:00:49,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:49" (1/1) ... [2018-11-23 13:00:49,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:49,930 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:50,395 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:50,407 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:50,488 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:50,657 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:50,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:50 WrapperNode [2018-11-23 13:00:50,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:50,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:50,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:50,659 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:50,669 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:50" (1/1) ... [2018-11-23 13:00:50,697 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:50" (1/1) ... [2018-11-23 13:00:50,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:50,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:50,710 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:50,710 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:50,720 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:50" (1/1) ... [2018-11-23 13:00:50,721 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:50" (1/1) ... [2018-11-23 13:00:50,728 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:50" (1/1) ... [2018-11-23 13:00:50,728 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:50" (1/1) ... [2018-11-23 13:00:50,768 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:50" (1/1) ... [2018-11-23 13:00:50,781 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:50" (1/1) ... [2018-11-23 13:00:50,784 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:50" (1/1) ... [2018-11-23 13:00:50,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:50,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:50,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:50,789 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:50,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:50" (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:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:50,843 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-23 13:00:50,844 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-23 13:00:50,844 INFO L130 BoogieDeclarations]: Found specification of procedure sll_hierarchical_destroy [2018-11-23 13:00:50,844 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_hierarchical_destroy [2018-11-23 13:00:50,844 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 13:00:50,844 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 13:00:50,844 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 13:00:50,845 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 13:00:50,845 INFO L130 BoogieDeclarations]: Found specification of procedure node_create_with_sublist [2018-11-23 13:00:50,845 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create_with_sublist [2018-11-23 13:00:50,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:50,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:50,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:50,846 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2018-11-23 13:00:50,846 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2018-11-23 13:00:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:00:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 13:00:50,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:50,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:52,024 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:52,024 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 13:00:52,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:52 BoogieIcfgContainer [2018-11-23 13:00:52,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:52,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:52,026 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:52,029 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:52,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:49" (1/3) ... [2018-11-23 13:00:52,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d3019e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:52, skipping insertion in model container [2018-11-23 13:00:52,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:50" (2/3) ... [2018-11-23 13:00:52,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d3019e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:52, skipping insertion in model container [2018-11-23 13:00:52,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:52" (3/3) ... [2018-11-23 13:00:52,032 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append_false-unreach-call_false-valid-memcleanup.i [2018-11-23 13:00:52,042 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:52,051 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:00:52,068 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:00:52,097 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:52,098 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:52,098 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:52,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:52,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:52,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:52,099 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:52,099 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:52,099 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:52,117 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-11-23 13:00:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:00:52,124 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:52,125 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:52,128 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:52,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:52,134 INFO L82 PathProgramCache]: Analyzing trace with hash 70095022, now seen corresponding path program 1 times [2018-11-23 13:00:52,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:52,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:52,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:52,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:52,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {73#true} call ULTIMATE.init(); {73#true} is VALID [2018-11-23 13:00:52,348 INFO L273 TraceCheckUtils]: 1: Hoare triple {73#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {73#true} is VALID [2018-11-23 13:00:52,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {73#true} assume true; {73#true} is VALID [2018-11-23 13:00:52,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {73#true} {73#true} #212#return; {73#true} is VALID [2018-11-23 13:00:52,350 INFO L256 TraceCheckUtils]: 4: Hoare triple {73#true} call #t~ret26 := main(); {73#true} is VALID [2018-11-23 13:00:52,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {73#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {73#true} is VALID [2018-11-23 13:00:52,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {73#true} assume !true; {74#false} is VALID [2018-11-23 13:00:52,367 INFO L256 TraceCheckUtils]: 7: Hoare triple {74#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {73#true} is VALID [2018-11-23 13:00:52,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {73#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {73#true} is VALID [2018-11-23 13:00:52,368 INFO L256 TraceCheckUtils]: 9: Hoare triple {73#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {73#true} is VALID [2018-11-23 13:00:52,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {73#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {73#true} is VALID [2018-11-23 13:00:52,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {73#true} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {73#true} is VALID [2018-11-23 13:00:52,370 INFO L256 TraceCheckUtils]: 12: Hoare triple {73#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {73#true} is VALID [2018-11-23 13:00:52,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {73#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {73#true} is VALID [2018-11-23 13:00:52,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {73#true} assume !true; {73#true} is VALID [2018-11-23 13:00:52,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {73#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {73#true} is VALID [2018-11-23 13:00:52,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {73#true} assume true; {73#true} is VALID [2018-11-23 13:00:52,374 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {73#true} {73#true} #218#return; {73#true} is VALID [2018-11-23 13:00:52,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {73#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {73#true} is VALID [2018-11-23 13:00:52,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {73#true} assume true; {73#true} is VALID [2018-11-23 13:00:52,375 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {73#true} {73#true} #208#return; {73#true} is VALID [2018-11-23 13:00:52,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {73#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {73#true} is VALID [2018-11-23 13:00:52,376 INFO L273 TraceCheckUtils]: 22: Hoare triple {73#true} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {73#true} is VALID [2018-11-23 13:00:52,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {73#true} assume true; {73#true} is VALID [2018-11-23 13:00:52,377 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {73#true} {74#false} #202#return; {74#false} is VALID [2018-11-23 13:00:52,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {74#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {74#false} is VALID [2018-11-23 13:00:52,378 INFO L273 TraceCheckUtils]: 26: Hoare triple {74#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {74#false} is VALID [2018-11-23 13:00:52,378 INFO L273 TraceCheckUtils]: 27: Hoare triple {74#false} assume ~i~0 > ~max~0; {74#false} is VALID [2018-11-23 13:00:52,379 INFO L273 TraceCheckUtils]: 28: Hoare triple {74#false} assume !false; {74#false} is VALID [2018-11-23 13:00:52,385 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:52,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:52,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:00:52,400 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 13:00:52,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:52,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:00:52,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:52,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:00:52,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:00:52,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:00:52,540 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 2 states. [2018-11-23 13:00:53,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:53,112 INFO L93 Difference]: Finished difference Result 134 states and 192 transitions. [2018-11-23 13:00:53,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:00:53,113 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2018-11-23 13:00:53,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:53,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 192 transitions. [2018-11-23 13:00:53,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:00:53,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 192 transitions. [2018-11-23 13:00:53,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 192 transitions. [2018-11-23 13:00:53,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:53,777 INFO L225 Difference]: With dead ends: 134 [2018-11-23 13:00:53,777 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 13:00:53,782 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:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 13:00:53,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 13:00:53,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:53,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 13:00:53,850 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:00:53,850 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:00:53,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:53,857 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2018-11-23 13:00:53,857 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-23 13:00:53,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:53,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:53,859 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 13:00:53,859 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 13:00:53,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:53,865 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2018-11-23 13:00:53,865 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-23 13:00:53,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:53,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:53,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:53,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:53,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 13:00:53,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-23 13:00:53,874 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 29 [2018-11-23 13:00:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:53,874 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-23 13:00:53,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:00:53,875 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-23 13:00:53,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 13:00:53,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:53,877 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:53,877 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:53,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:53,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1155204360, now seen corresponding path program 1 times [2018-11-23 13:00:53,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:53,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:53,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:53,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:53,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:54,051 INFO L256 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {445#true} is VALID [2018-11-23 13:00:54,051 INFO L273 TraceCheckUtils]: 1: Hoare triple {445#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {445#true} is VALID [2018-11-23 13:00:54,052 INFO L273 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-23 13:00:54,052 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #212#return; {445#true} is VALID [2018-11-23 13:00:54,052 INFO L256 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret26 := main(); {445#true} is VALID [2018-11-23 13:00:54,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {445#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {447#(and (= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:54,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {447#(and (= main_~i~0 3) (<= 5 main_~max~0))} assume !(~i~0 <= ~max~0); {446#false} is VALID [2018-11-23 13:00:54,057 INFO L256 TraceCheckUtils]: 7: Hoare triple {446#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {445#true} is VALID [2018-11-23 13:00:54,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {445#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {445#true} is VALID [2018-11-23 13:00:54,057 INFO L256 TraceCheckUtils]: 9: Hoare triple {445#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {445#true} is VALID [2018-11-23 13:00:54,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {445#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {445#true} is VALID [2018-11-23 13:00:54,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {445#true} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {445#true} is VALID [2018-11-23 13:00:54,058 INFO L256 TraceCheckUtils]: 12: Hoare triple {445#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {445#true} is VALID [2018-11-23 13:00:54,058 INFO L273 TraceCheckUtils]: 13: Hoare triple {445#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {445#true} is VALID [2018-11-23 13:00:54,059 INFO L273 TraceCheckUtils]: 14: Hoare triple {445#true} assume !(~len > 0); {445#true} is VALID [2018-11-23 13:00:54,059 INFO L273 TraceCheckUtils]: 15: Hoare triple {445#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {445#true} is VALID [2018-11-23 13:00:54,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-23 13:00:54,059 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {445#true} {445#true} #218#return; {445#true} is VALID [2018-11-23 13:00:54,060 INFO L273 TraceCheckUtils]: 18: Hoare triple {445#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {445#true} is VALID [2018-11-23 13:00:54,060 INFO L273 TraceCheckUtils]: 19: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-23 13:00:54,060 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {445#true} {445#true} #208#return; {445#true} is VALID [2018-11-23 13:00:54,061 INFO L273 TraceCheckUtils]: 21: Hoare triple {445#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {445#true} is VALID [2018-11-23 13:00:54,061 INFO L273 TraceCheckUtils]: 22: Hoare triple {445#true} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {445#true} is VALID [2018-11-23 13:00:54,061 INFO L273 TraceCheckUtils]: 23: Hoare triple {445#true} assume true; {445#true} is VALID [2018-11-23 13:00:54,062 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {445#true} {446#false} #202#return; {446#false} is VALID [2018-11-23 13:00:54,062 INFO L273 TraceCheckUtils]: 25: Hoare triple {446#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {446#false} is VALID [2018-11-23 13:00:54,062 INFO L273 TraceCheckUtils]: 26: Hoare triple {446#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {446#false} is VALID [2018-11-23 13:00:54,063 INFO L273 TraceCheckUtils]: 27: Hoare triple {446#false} assume ~i~0 > ~max~0; {446#false} is VALID [2018-11-23 13:00:54,063 INFO L273 TraceCheckUtils]: 28: Hoare triple {446#false} assume !false; {446#false} is VALID [2018-11-23 13:00:54,067 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:54,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:54,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:00:54,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 13:00:54,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:54,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:00:54,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:54,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:00:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:00:54,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:00:54,168 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 3 states. [2018-11-23 13:00:54,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:54,455 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2018-11-23 13:00:54,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:00:54,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-23 13:00:54,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2018-11-23 13:00:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:00:54,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2018-11-23 13:00:54,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2018-11-23 13:00:54,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:54,723 INFO L225 Difference]: With dead ends: 100 [2018-11-23 13:00:54,723 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 13:00:54,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:00:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 13:00:54,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-23 13:00:54,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:54,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 54 states. [2018-11-23 13:00:54,779 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 54 states. [2018-11-23 13:00:54,779 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 54 states. [2018-11-23 13:00:54,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:54,784 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 13:00:54,784 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 13:00:54,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:54,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:54,786 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 60 states. [2018-11-23 13:00:54,786 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 60 states. [2018-11-23 13:00:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:54,791 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 13:00:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 13:00:54,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:54,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:54,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:54,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 13:00:54,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-23 13:00:54,796 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 29 [2018-11-23 13:00:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:54,797 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-23 13:00:54,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:00:54,797 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2018-11-23 13:00:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:00:54,799 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:54,799 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, 1, 1, 1, 1, 1] [2018-11-23 13:00:54,799 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:54,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash 848095082, now seen corresponding path program 1 times [2018-11-23 13:00:54,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:54,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:54,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:54,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:54,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:54,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {784#true} call ULTIMATE.init(); {784#true} is VALID [2018-11-23 13:00:54,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {784#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {784#true} is VALID [2018-11-23 13:00:54,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-23 13:00:54,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {784#true} {784#true} #212#return; {784#true} is VALID [2018-11-23 13:00:54,912 INFO L256 TraceCheckUtils]: 4: Hoare triple {784#true} call #t~ret26 := main(); {784#true} is VALID [2018-11-23 13:00:54,913 INFO L273 TraceCheckUtils]: 5: Hoare triple {784#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {784#true} is VALID [2018-11-23 13:00:54,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {784#true} assume !!(~i~0 <= ~max~0);~j~0 := 0; {786#(= main_~j~0 0)} is VALID [2018-11-23 13:00:54,915 INFO L273 TraceCheckUtils]: 7: Hoare triple {786#(= main_~j~0 0)} #t~short18 := ~j~0 < 10; {787#|main_#t~short18|} is VALID [2018-11-23 13:00:54,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {787#|main_#t~short18|} assume !#t~short18; {785#false} is VALID [2018-11-23 13:00:54,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {785#false} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {785#false} is VALID [2018-11-23 13:00:54,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {785#false} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {785#false} is VALID [2018-11-23 13:00:54,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {785#false} assume !(~i~0 <= ~max~0); {785#false} is VALID [2018-11-23 13:00:54,918 INFO L256 TraceCheckUtils]: 12: Hoare triple {785#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {784#true} is VALID [2018-11-23 13:00:54,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {784#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {784#true} is VALID [2018-11-23 13:00:54,919 INFO L256 TraceCheckUtils]: 14: Hoare triple {784#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {784#true} is VALID [2018-11-23 13:00:54,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {784#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {784#true} is VALID [2018-11-23 13:00:54,920 INFO L273 TraceCheckUtils]: 16: Hoare triple {784#true} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {784#true} is VALID [2018-11-23 13:00:54,920 INFO L256 TraceCheckUtils]: 17: Hoare triple {784#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {784#true} is VALID [2018-11-23 13:00:54,921 INFO L273 TraceCheckUtils]: 18: Hoare triple {784#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {784#true} is VALID [2018-11-23 13:00:54,921 INFO L273 TraceCheckUtils]: 19: Hoare triple {784#true} assume !(~len > 0); {784#true} is VALID [2018-11-23 13:00:54,921 INFO L273 TraceCheckUtils]: 20: Hoare triple {784#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {784#true} is VALID [2018-11-23 13:00:54,921 INFO L273 TraceCheckUtils]: 21: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-23 13:00:54,922 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {784#true} {784#true} #218#return; {784#true} is VALID [2018-11-23 13:00:54,922 INFO L273 TraceCheckUtils]: 23: Hoare triple {784#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {784#true} is VALID [2018-11-23 13:00:54,922 INFO L273 TraceCheckUtils]: 24: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-23 13:00:54,923 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {784#true} {784#true} #208#return; {784#true} is VALID [2018-11-23 13:00:54,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {784#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {784#true} is VALID [2018-11-23 13:00:54,923 INFO L273 TraceCheckUtils]: 27: Hoare triple {784#true} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {784#true} is VALID [2018-11-23 13:00:54,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {784#true} assume true; {784#true} is VALID [2018-11-23 13:00:54,924 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {784#true} {785#false} #202#return; {785#false} is VALID [2018-11-23 13:00:54,924 INFO L273 TraceCheckUtils]: 30: Hoare triple {785#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {785#false} is VALID [2018-11-23 13:00:54,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {785#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {785#false} is VALID [2018-11-23 13:00:54,925 INFO L273 TraceCheckUtils]: 32: Hoare triple {785#false} assume ~i~0 > ~max~0; {785#false} is VALID [2018-11-23 13:00:54,925 INFO L273 TraceCheckUtils]: 33: Hoare triple {785#false} assume !false; {785#false} is VALID [2018-11-23 13:00:54,928 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:54,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:54,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:00:54,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 13:00:54,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:54,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:00:54,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:54,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:00:54,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:00:54,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:00:54,999 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 4 states. [2018-11-23 13:00:55,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:55,396 INFO L93 Difference]: Finished difference Result 121 states and 155 transitions. [2018-11-23 13:00:55,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:00:55,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-11-23 13:00:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:55,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2018-11-23 13:00:55,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:55,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2018-11-23 13:00:55,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2018-11-23 13:00:55,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:55,640 INFO L225 Difference]: With dead ends: 121 [2018-11-23 13:00:55,640 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 13:00:55,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 13:00:55,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2018-11-23 13:00:55,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:55,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 56 states. [2018-11-23 13:00:55,667 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 56 states. [2018-11-23 13:00:55,667 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 56 states. [2018-11-23 13:00:55,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:55,672 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2018-11-23 13:00:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2018-11-23 13:00:55,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:55,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:55,676 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 74 states. [2018-11-23 13:00:55,677 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 74 states. [2018-11-23 13:00:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:55,687 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2018-11-23 13:00:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2018-11-23 13:00:55,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:55,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:55,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:55,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:55,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 13:00:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-23 13:00:55,697 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 34 [2018-11-23 13:00:55,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:55,697 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-23 13:00:55,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:00:55,697 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-23 13:00:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:00:55,701 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:55,701 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, 1, 1, 1, 1, 1] [2018-11-23 13:00:55,701 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:55,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:55,702 INFO L82 PathProgramCache]: Analyzing trace with hash 786055468, now seen corresponding path program 1 times [2018-11-23 13:00:55,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:55,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:55,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:55,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:55,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:55,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {1187#true} call ULTIMATE.init(); {1187#true} is VALID [2018-11-23 13:00:55,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {1187#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1187#true} is VALID [2018-11-23 13:00:55,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {1187#true} assume true; {1187#true} is VALID [2018-11-23 13:00:55,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1187#true} {1187#true} #212#return; {1187#true} is VALID [2018-11-23 13:00:55,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {1187#true} call #t~ret26 := main(); {1187#true} is VALID [2018-11-23 13:00:55,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {1187#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:00:55,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:00:55,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} #t~short18 := ~j~0 < 10; {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:00:55,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:00:55,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:00:55,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {1189#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1190#(<= 3 main_~min~0)} is VALID [2018-11-23 13:00:55,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {1190#(<= 3 main_~min~0)} assume !(~i~0 <= ~max~0); {1190#(<= 3 main_~min~0)} is VALID [2018-11-23 13:00:55,973 INFO L256 TraceCheckUtils]: 12: Hoare triple {1190#(<= 3 main_~min~0)} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {1187#true} is VALID [2018-11-23 13:00:55,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {1187#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {1191#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-23 13:00:55,979 INFO L256 TraceCheckUtils]: 14: Hoare triple {1191#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {1187#true} is VALID [2018-11-23 13:00:55,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {1187#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {1192#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:00:55,980 INFO L273 TraceCheckUtils]: 16: Hoare triple {1192#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {1192#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:00:55,980 INFO L256 TraceCheckUtils]: 17: Hoare triple {1192#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {1187#true} is VALID [2018-11-23 13:00:55,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {1187#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1193#(= sll_create_~len |sll_create_#in~len|)} is VALID [2018-11-23 13:00:55,981 INFO L273 TraceCheckUtils]: 19: Hoare triple {1193#(= sll_create_~len |sll_create_#in~len|)} assume !(~len > 0); {1194#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:55,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {1194#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1194#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:55,982 INFO L273 TraceCheckUtils]: 21: Hoare triple {1194#(<= |sll_create_#in~len| 0)} assume true; {1194#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:55,983 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1194#(<= |sll_create_#in~len| 0)} {1192#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #218#return; {1195#(<= |node_create_with_sublist_#in~sublist_length| 0)} is VALID [2018-11-23 13:00:55,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {1195#(<= |node_create_with_sublist_#in~sublist_length| 0)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {1195#(<= |node_create_with_sublist_#in~sublist_length| 0)} is VALID [2018-11-23 13:00:55,985 INFO L273 TraceCheckUtils]: 24: Hoare triple {1195#(<= |node_create_with_sublist_#in~sublist_length| 0)} assume true; {1195#(<= |node_create_with_sublist_#in~sublist_length| 0)} is VALID [2018-11-23 13:00:55,987 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1195#(<= |node_create_with_sublist_#in~sublist_length| 0)} {1191#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #208#return; {1196#(<= |sll_append_#in~sublist_length| 0)} is VALID [2018-11-23 13:00:55,988 INFO L273 TraceCheckUtils]: 26: Hoare triple {1196#(<= |sll_append_#in~sublist_length| 0)} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1196#(<= |sll_append_#in~sublist_length| 0)} is VALID [2018-11-23 13:00:55,988 INFO L273 TraceCheckUtils]: 27: Hoare triple {1196#(<= |sll_append_#in~sublist_length| 0)} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {1196#(<= |sll_append_#in~sublist_length| 0)} is VALID [2018-11-23 13:00:55,989 INFO L273 TraceCheckUtils]: 28: Hoare triple {1196#(<= |sll_append_#in~sublist_length| 0)} assume true; {1196#(<= |sll_append_#in~sublist_length| 0)} is VALID [2018-11-23 13:00:56,005 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1196#(<= |sll_append_#in~sublist_length| 0)} {1190#(<= 3 main_~min~0)} #202#return; {1188#false} is VALID [2018-11-23 13:00:56,006 INFO L273 TraceCheckUtils]: 30: Hoare triple {1188#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {1188#false} is VALID [2018-11-23 13:00:56,006 INFO L273 TraceCheckUtils]: 31: Hoare triple {1188#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {1188#false} is VALID [2018-11-23 13:00:56,006 INFO L273 TraceCheckUtils]: 32: Hoare triple {1188#false} assume ~i~0 > ~max~0; {1188#false} is VALID [2018-11-23 13:00:56,007 INFO L273 TraceCheckUtils]: 33: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2018-11-23 13:00:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:56,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:56,010 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:56,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:56,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:56,379 INFO L256 TraceCheckUtils]: 0: Hoare triple {1187#true} call ULTIMATE.init(); {1187#true} is VALID [2018-11-23 13:00:56,379 INFO L273 TraceCheckUtils]: 1: Hoare triple {1187#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1187#true} is VALID [2018-11-23 13:00:56,380 INFO L273 TraceCheckUtils]: 2: Hoare triple {1187#true} assume true; {1187#true} is VALID [2018-11-23 13:00:56,380 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1187#true} {1187#true} #212#return; {1187#true} is VALID [2018-11-23 13:00:56,381 INFO L256 TraceCheckUtils]: 4: Hoare triple {1187#true} call #t~ret26 := main(); {1187#true} is VALID [2018-11-23 13:00:56,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {1187#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:56,403 INFO L273 TraceCheckUtils]: 6: Hoare triple {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:56,418 INFO L273 TraceCheckUtils]: 7: Hoare triple {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} #t~short18 := ~j~0 < 10; {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:56,421 INFO L273 TraceCheckUtils]: 8: Hoare triple {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:56,421 INFO L273 TraceCheckUtils]: 9: Hoare triple {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:56,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {1215#(and (<= main_~i~0 3) (<= 5 main_~max~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1231#(and (<= main_~i~0 4) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:56,430 INFO L273 TraceCheckUtils]: 11: Hoare triple {1231#(and (<= main_~i~0 4) (<= 5 main_~max~0))} assume !(~i~0 <= ~max~0); {1188#false} is VALID [2018-11-23 13:00:56,430 INFO L256 TraceCheckUtils]: 12: Hoare triple {1188#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {1188#false} is VALID [2018-11-23 13:00:56,431 INFO L273 TraceCheckUtils]: 13: Hoare triple {1188#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {1188#false} is VALID [2018-11-23 13:00:56,431 INFO L256 TraceCheckUtils]: 14: Hoare triple {1188#false} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {1188#false} is VALID [2018-11-23 13:00:56,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {1188#false} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {1188#false} is VALID [2018-11-23 13:00:56,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {1188#false} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {1188#false} is VALID [2018-11-23 13:00:56,431 INFO L256 TraceCheckUtils]: 17: Hoare triple {1188#false} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {1188#false} is VALID [2018-11-23 13:00:56,432 INFO L273 TraceCheckUtils]: 18: Hoare triple {1188#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1188#false} is VALID [2018-11-23 13:00:56,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {1188#false} assume !(~len > 0); {1188#false} is VALID [2018-11-23 13:00:56,432 INFO L273 TraceCheckUtils]: 20: Hoare triple {1188#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1188#false} is VALID [2018-11-23 13:00:56,432 INFO L273 TraceCheckUtils]: 21: Hoare triple {1188#false} assume true; {1188#false} is VALID [2018-11-23 13:00:56,433 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1188#false} {1188#false} #218#return; {1188#false} is VALID [2018-11-23 13:00:56,433 INFO L273 TraceCheckUtils]: 23: Hoare triple {1188#false} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {1188#false} is VALID [2018-11-23 13:00:56,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {1188#false} assume true; {1188#false} is VALID [2018-11-23 13:00:56,433 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1188#false} {1188#false} #208#return; {1188#false} is VALID [2018-11-23 13:00:56,433 INFO L273 TraceCheckUtils]: 26: Hoare triple {1188#false} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1188#false} is VALID [2018-11-23 13:00:56,434 INFO L273 TraceCheckUtils]: 27: Hoare triple {1188#false} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {1188#false} is VALID [2018-11-23 13:00:56,434 INFO L273 TraceCheckUtils]: 28: Hoare triple {1188#false} assume true; {1188#false} is VALID [2018-11-23 13:00:56,434 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1188#false} {1188#false} #202#return; {1188#false} is VALID [2018-11-23 13:00:56,434 INFO L273 TraceCheckUtils]: 30: Hoare triple {1188#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {1188#false} is VALID [2018-11-23 13:00:56,435 INFO L273 TraceCheckUtils]: 31: Hoare triple {1188#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {1188#false} is VALID [2018-11-23 13:00:56,435 INFO L273 TraceCheckUtils]: 32: Hoare triple {1188#false} assume ~i~0 > ~max~0; {1188#false} is VALID [2018-11-23 13:00:56,435 INFO L273 TraceCheckUtils]: 33: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2018-11-23 13:00:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:56,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:56,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2018-11-23 13:00:56,458 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-23 13:00:56,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:56,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:00:56,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:56,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:00:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:00:56,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:00:56,547 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 12 states. [2018-11-23 13:00:58,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:58,494 INFO L93 Difference]: Finished difference Result 144 states and 185 transitions. [2018-11-23 13:00:58,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:00:58,495 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-23 13:00:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:58,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:00:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2018-11-23 13:00:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:00:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 177 transitions. [2018-11-23 13:00:58,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 177 transitions. [2018-11-23 13:00:58,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:58,863 INFO L225 Difference]: With dead ends: 144 [2018-11-23 13:00:58,863 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 13:00:58,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:00:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 13:00:58,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-11-23 13:00:58,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:58,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 91 states. [2018-11-23 13:00:58,960 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 91 states. [2018-11-23 13:00:58,961 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 91 states. [2018-11-23 13:00:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:58,967 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-11-23 13:00:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-11-23 13:00:58,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:58,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:58,969 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 95 states. [2018-11-23 13:00:58,969 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 95 states. [2018-11-23 13:00:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:58,974 INFO L93 Difference]: Finished difference Result 95 states and 121 transitions. [2018-11-23 13:00:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 121 transitions. [2018-11-23 13:00:58,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:58,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:58,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:58,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:58,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 13:00:58,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-11-23 13:00:58,980 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 34 [2018-11-23 13:00:58,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:58,981 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-11-23 13:00:58,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:00:58,981 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-11-23 13:00:58,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:00:58,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:58,983 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:58,983 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:58,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:58,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2023871361, now seen corresponding path program 1 times [2018-11-23 13:00:58,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:58,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:58,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:58,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:58,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:59,226 INFO L256 TraceCheckUtils]: 0: Hoare triple {1823#true} call ULTIMATE.init(); {1823#true} is VALID [2018-11-23 13:00:59,226 INFO L273 TraceCheckUtils]: 1: Hoare triple {1823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1823#true} is VALID [2018-11-23 13:00:59,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {1823#true} assume true; {1823#true} is VALID [2018-11-23 13:00:59,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1823#true} {1823#true} #212#return; {1823#true} is VALID [2018-11-23 13:00:59,227 INFO L256 TraceCheckUtils]: 4: Hoare triple {1823#true} call #t~ret26 := main(); {1823#true} is VALID [2018-11-23 13:00:59,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {1823#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} #t~short18 := ~j~0 < 10; {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {1825#(and (= main_~i~0 3) (<= 5 main_~max~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1826#(<= (+ main_~i~0 1) main_~max~0)} is VALID [2018-11-23 13:00:59,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {1826#(<= (+ main_~i~0 1) main_~max~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {1826#(<= (+ main_~i~0 1) main_~max~0)} is VALID [2018-11-23 13:00:59,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {1826#(<= (+ main_~i~0 1) main_~max~0)} #t~short18 := ~j~0 < 10; {1826#(<= (+ main_~i~0 1) main_~max~0)} is VALID [2018-11-23 13:00:59,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {1826#(<= (+ main_~i~0 1) main_~max~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {1826#(<= (+ main_~i~0 1) main_~max~0)} is VALID [2018-11-23 13:00:59,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {1826#(<= (+ main_~i~0 1) main_~max~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {1826#(<= (+ main_~i~0 1) main_~max~0)} is VALID [2018-11-23 13:00:59,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {1826#(<= (+ main_~i~0 1) main_~max~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1827#(<= main_~i~0 main_~max~0)} is VALID [2018-11-23 13:00:59,237 INFO L273 TraceCheckUtils]: 16: Hoare triple {1827#(<= main_~i~0 main_~max~0)} assume !(~i~0 <= ~max~0); {1824#false} is VALID [2018-11-23 13:00:59,237 INFO L256 TraceCheckUtils]: 17: Hoare triple {1824#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {1823#true} is VALID [2018-11-23 13:00:59,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {1823#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {1823#true} is VALID [2018-11-23 13:00:59,238 INFO L256 TraceCheckUtils]: 19: Hoare triple {1823#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {1823#true} is VALID [2018-11-23 13:00:59,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {1823#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {1823#true} is VALID [2018-11-23 13:00:59,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {1823#true} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {1823#true} is VALID [2018-11-23 13:00:59,239 INFO L256 TraceCheckUtils]: 22: Hoare triple {1823#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {1823#true} is VALID [2018-11-23 13:00:59,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {1823#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1823#true} is VALID [2018-11-23 13:00:59,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {1823#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1823#true} is VALID [2018-11-23 13:00:59,240 INFO L273 TraceCheckUtils]: 25: Hoare triple {1823#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1823#true} is VALID [2018-11-23 13:00:59,240 INFO L273 TraceCheckUtils]: 26: Hoare triple {1823#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; {1823#true} is VALID [2018-11-23 13:00:59,240 INFO L273 TraceCheckUtils]: 27: Hoare triple {1823#true} assume !(~len > 0); {1823#true} is VALID [2018-11-23 13:00:59,240 INFO L273 TraceCheckUtils]: 28: Hoare triple {1823#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1823#true} is VALID [2018-11-23 13:00:59,241 INFO L273 TraceCheckUtils]: 29: Hoare triple {1823#true} assume true; {1823#true} is VALID [2018-11-23 13:00:59,241 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1823#true} {1823#true} #218#return; {1823#true} is VALID [2018-11-23 13:00:59,241 INFO L273 TraceCheckUtils]: 31: Hoare triple {1823#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {1823#true} is VALID [2018-11-23 13:00:59,241 INFO L273 TraceCheckUtils]: 32: Hoare triple {1823#true} assume true; {1823#true} is VALID [2018-11-23 13:00:59,242 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1823#true} {1823#true} #208#return; {1823#true} is VALID [2018-11-23 13:00:59,242 INFO L273 TraceCheckUtils]: 34: Hoare triple {1823#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1823#true} is VALID [2018-11-23 13:00:59,242 INFO L273 TraceCheckUtils]: 35: Hoare triple {1823#true} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {1823#true} is VALID [2018-11-23 13:00:59,242 INFO L273 TraceCheckUtils]: 36: Hoare triple {1823#true} assume true; {1823#true} is VALID [2018-11-23 13:00:59,243 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1823#true} {1824#false} #202#return; {1824#false} is VALID [2018-11-23 13:00:59,264 INFO L273 TraceCheckUtils]: 38: Hoare triple {1824#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {1824#false} is VALID [2018-11-23 13:00:59,264 INFO L273 TraceCheckUtils]: 39: Hoare triple {1824#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {1824#false} is VALID [2018-11-23 13:00:59,265 INFO L273 TraceCheckUtils]: 40: Hoare triple {1824#false} assume ~i~0 > ~max~0; {1824#false} is VALID [2018-11-23 13:00:59,265 INFO L273 TraceCheckUtils]: 41: Hoare triple {1824#false} assume !false; {1824#false} is VALID [2018-11-23 13:00:59,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:59,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:59,267 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:59,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:59,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:59,648 INFO L256 TraceCheckUtils]: 0: Hoare triple {1823#true} call ULTIMATE.init(); {1823#true} is VALID [2018-11-23 13:00:59,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {1823#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1823#true} is VALID [2018-11-23 13:00:59,649 INFO L273 TraceCheckUtils]: 2: Hoare triple {1823#true} assume true; {1823#true} is VALID [2018-11-23 13:00:59,649 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1823#true} {1823#true} #212#return; {1823#true} is VALID [2018-11-23 13:00:59,649 INFO L256 TraceCheckUtils]: 4: Hoare triple {1823#true} call #t~ret26 := main(); {1823#true} is VALID [2018-11-23 13:00:59,650 INFO L273 TraceCheckUtils]: 5: Hoare triple {1823#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,651 INFO L273 TraceCheckUtils]: 6: Hoare triple {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} #t~short18 := ~j~0 < 10; {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {1846#(and (<= main_~i~0 3) (<= 5 main_~max~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} #t~short18 := ~j~0 < 10; {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {1862#(and (<= main_~i~0 4) (<= 5 main_~max~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {1878#(and (<= main_~i~0 5) (<= 5 main_~max~0))} is VALID [2018-11-23 13:00:59,664 INFO L273 TraceCheckUtils]: 16: Hoare triple {1878#(and (<= main_~i~0 5) (<= 5 main_~max~0))} assume !(~i~0 <= ~max~0); {1824#false} is VALID [2018-11-23 13:00:59,665 INFO L256 TraceCheckUtils]: 17: Hoare triple {1824#false} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {1824#false} is VALID [2018-11-23 13:00:59,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {1824#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {1824#false} is VALID [2018-11-23 13:00:59,665 INFO L256 TraceCheckUtils]: 19: Hoare triple {1824#false} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {1824#false} is VALID [2018-11-23 13:00:59,665 INFO L273 TraceCheckUtils]: 20: Hoare triple {1824#false} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {1824#false} is VALID [2018-11-23 13:00:59,665 INFO L273 TraceCheckUtils]: 21: Hoare triple {1824#false} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {1824#false} is VALID [2018-11-23 13:00:59,666 INFO L256 TraceCheckUtils]: 22: Hoare triple {1824#false} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {1824#false} is VALID [2018-11-23 13:00:59,666 INFO L273 TraceCheckUtils]: 23: Hoare triple {1824#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {1824#false} is VALID [2018-11-23 13:00:59,666 INFO L273 TraceCheckUtils]: 24: Hoare triple {1824#false} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {1824#false} is VALID [2018-11-23 13:00:59,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {1824#false} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {1824#false} is VALID [2018-11-23 13:00:59,666 INFO L273 TraceCheckUtils]: 26: Hoare triple {1824#false} 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; {1824#false} is VALID [2018-11-23 13:00:59,667 INFO L273 TraceCheckUtils]: 27: Hoare triple {1824#false} assume !(~len > 0); {1824#false} is VALID [2018-11-23 13:00:59,667 INFO L273 TraceCheckUtils]: 28: Hoare triple {1824#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1824#false} is VALID [2018-11-23 13:00:59,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {1824#false} assume true; {1824#false} is VALID [2018-11-23 13:00:59,667 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1824#false} {1824#false} #218#return; {1824#false} is VALID [2018-11-23 13:00:59,668 INFO L273 TraceCheckUtils]: 31: Hoare triple {1824#false} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {1824#false} is VALID [2018-11-23 13:00:59,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {1824#false} assume true; {1824#false} is VALID [2018-11-23 13:00:59,668 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {1824#false} {1824#false} #208#return; {1824#false} is VALID [2018-11-23 13:00:59,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {1824#false} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {1824#false} is VALID [2018-11-23 13:00:59,669 INFO L273 TraceCheckUtils]: 35: Hoare triple {1824#false} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {1824#false} is VALID [2018-11-23 13:00:59,669 INFO L273 TraceCheckUtils]: 36: Hoare triple {1824#false} assume true; {1824#false} is VALID [2018-11-23 13:00:59,669 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1824#false} {1824#false} #202#return; {1824#false} is VALID [2018-11-23 13:00:59,669 INFO L273 TraceCheckUtils]: 38: Hoare triple {1824#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {1824#false} is VALID [2018-11-23 13:00:59,669 INFO L273 TraceCheckUtils]: 39: Hoare triple {1824#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {1824#false} is VALID [2018-11-23 13:00:59,670 INFO L273 TraceCheckUtils]: 40: Hoare triple {1824#false} assume ~i~0 > ~max~0; {1824#false} is VALID [2018-11-23 13:00:59,670 INFO L273 TraceCheckUtils]: 41: Hoare triple {1824#false} assume !false; {1824#false} is VALID [2018-11-23 13:00:59,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:59,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:59,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 13:00:59,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-23 13:00:59,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:59,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:00:59,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:59,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:00:59,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:00:59,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:00:59,791 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 8 states. [2018-11-23 13:01:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:00,799 INFO L93 Difference]: Finished difference Result 190 states and 247 transitions. [2018-11-23 13:01:00,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:01:00,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-23 13:01:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:01:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2018-11-23 13:01:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:01:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2018-11-23 13:01:00,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 150 transitions. [2018-11-23 13:01:00,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:00,959 INFO L225 Difference]: With dead ends: 190 [2018-11-23 13:01:00,959 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 13:01:00,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:01:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 13:01:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 105. [2018-11-23 13:01:01,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:01,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 105 states. [2018-11-23 13:01:01,042 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 105 states. [2018-11-23 13:01:01,042 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 105 states. [2018-11-23 13:01:01,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:01,049 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2018-11-23 13:01:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2018-11-23 13:01:01,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:01,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:01,050 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 136 states. [2018-11-23 13:01:01,051 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 136 states. [2018-11-23 13:01:01,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:01,057 INFO L93 Difference]: Finished difference Result 136 states and 181 transitions. [2018-11-23 13:01:01,058 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 181 transitions. [2018-11-23 13:01:01,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:01,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:01,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:01,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:01,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 13:01:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-23 13:01:01,063 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 42 [2018-11-23 13:01:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:01,064 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-23 13:01:01,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:01:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-23 13:01:01,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 13:01:01,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:01,065 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:01,066 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:01,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:01,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1015778851, now seen corresponding path program 2 times [2018-11-23 13:01:01,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:01,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:01,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:01,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:01,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:01,190 INFO L256 TraceCheckUtils]: 0: Hoare triple {2631#true} call ULTIMATE.init(); {2631#true} is VALID [2018-11-23 13:01:01,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {2631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2631#true} is VALID [2018-11-23 13:01:01,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-23 13:01:01,191 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2631#true} {2631#true} #212#return; {2631#true} is VALID [2018-11-23 13:01:01,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {2631#true} call #t~ret26 := main(); {2631#true} is VALID [2018-11-23 13:01:01,194 INFO L273 TraceCheckUtils]: 5: Hoare triple {2631#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,198 INFO L273 TraceCheckUtils]: 6: Hoare triple {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} #t~short18 := ~j~0 < 10; {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,203 INFO L273 TraceCheckUtils]: 8: Hoare triple {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,205 INFO L273 TraceCheckUtils]: 9: Hoare triple {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,208 INFO L273 TraceCheckUtils]: 10: Hoare triple {2633#(and (= main_~i~0 3) (= main_~i~0 main_~min~0) (<= 5 main_~max~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} #t~short18 := ~j~0 < 10; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} #t~short18 := ~j~0 < 10; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} assume !(~i~0 <= ~max~0); {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,224 INFO L256 TraceCheckUtils]: 22: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {2631#true} is VALID [2018-11-23 13:01:01,224 INFO L273 TraceCheckUtils]: 23: Hoare triple {2631#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {2631#true} is VALID [2018-11-23 13:01:01,225 INFO L256 TraceCheckUtils]: 24: Hoare triple {2631#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {2631#true} is VALID [2018-11-23 13:01:01,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {2631#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {2631#true} is VALID [2018-11-23 13:01:01,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {2631#true} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {2631#true} is VALID [2018-11-23 13:01:01,225 INFO L256 TraceCheckUtils]: 27: Hoare triple {2631#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {2631#true} is VALID [2018-11-23 13:01:01,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {2631#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2631#true} is VALID [2018-11-23 13:01:01,225 INFO L273 TraceCheckUtils]: 29: Hoare triple {2631#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2631#true} is VALID [2018-11-23 13:01:01,226 INFO L273 TraceCheckUtils]: 30: Hoare triple {2631#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2631#true} is VALID [2018-11-23 13:01:01,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {2631#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; {2631#true} is VALID [2018-11-23 13:01:01,226 INFO L273 TraceCheckUtils]: 32: Hoare triple {2631#true} assume !(~len > 0); {2631#true} is VALID [2018-11-23 13:01:01,226 INFO L273 TraceCheckUtils]: 33: Hoare triple {2631#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2631#true} is VALID [2018-11-23 13:01:01,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-23 13:01:01,227 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2631#true} {2631#true} #218#return; {2631#true} is VALID [2018-11-23 13:01:01,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {2631#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {2631#true} is VALID [2018-11-23 13:01:01,227 INFO L273 TraceCheckUtils]: 37: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-23 13:01:01,228 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2631#true} {2631#true} #208#return; {2631#true} is VALID [2018-11-23 13:01:01,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {2631#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2631#true} is VALID [2018-11-23 13:01:01,228 INFO L273 TraceCheckUtils]: 40: Hoare triple {2631#true} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {2631#true} is VALID [2018-11-23 13:01:01,228 INFO L273 TraceCheckUtils]: 41: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-23 13:01:01,230 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2631#true} {2634#(<= (+ main_~min~0 2) main_~max~0)} #202#return; {2634#(<= (+ main_~min~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,230 INFO L273 TraceCheckUtils]: 43: Hoare triple {2634#(<= (+ main_~min~0 2) main_~max~0)} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {2635#(<= (+ main_~i~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,232 INFO L273 TraceCheckUtils]: 44: Hoare triple {2635#(<= (+ main_~i~0 2) main_~max~0)} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {2635#(<= (+ main_~i~0 2) main_~max~0)} is VALID [2018-11-23 13:01:01,232 INFO L273 TraceCheckUtils]: 45: Hoare triple {2635#(<= (+ main_~i~0 2) main_~max~0)} assume ~i~0 > ~max~0; {2632#false} is VALID [2018-11-23 13:01:01,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {2632#false} assume !false; {2632#false} is VALID [2018-11-23 13:01:01,236 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-23 13:01:01,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:01,236 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:01:01,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:01:01,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:01:01,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:01,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:01,773 INFO L256 TraceCheckUtils]: 0: Hoare triple {2631#true} call ULTIMATE.init(); {2631#true} is VALID [2018-11-23 13:01:01,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {2631#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2631#true} is VALID [2018-11-23 13:01:01,773 INFO L273 TraceCheckUtils]: 2: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-23 13:01:01,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2631#true} {2631#true} #212#return; {2631#true} is VALID [2018-11-23 13:01:01,774 INFO L256 TraceCheckUtils]: 4: Hoare triple {2631#true} call #t~ret26 := main(); {2631#true} is VALID [2018-11-23 13:01:01,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {2631#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} #t~short18 := ~j~0 < 10; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} #t~short18 := ~j~0 < 10; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,785 INFO L273 TraceCheckUtils]: 17: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} #t~short18 := ~j~0 < 10; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} assume !(~i~0 <= ~max~0); {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,789 INFO L256 TraceCheckUtils]: 22: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {2631#true} is VALID [2018-11-23 13:01:01,789 INFO L273 TraceCheckUtils]: 23: Hoare triple {2631#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {2631#true} is VALID [2018-11-23 13:01:01,789 INFO L256 TraceCheckUtils]: 24: Hoare triple {2631#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {2631#true} is VALID [2018-11-23 13:01:01,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {2631#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {2631#true} is VALID [2018-11-23 13:01:01,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {2631#true} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {2631#true} is VALID [2018-11-23 13:01:01,789 INFO L256 TraceCheckUtils]: 27: Hoare triple {2631#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {2631#true} is VALID [2018-11-23 13:01:01,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {2631#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {2631#true} is VALID [2018-11-23 13:01:01,790 INFO L273 TraceCheckUtils]: 29: Hoare triple {2631#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {2631#true} is VALID [2018-11-23 13:01:01,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {2631#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {2631#true} is VALID [2018-11-23 13:01:01,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {2631#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; {2631#true} is VALID [2018-11-23 13:01:01,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {2631#true} assume !(~len > 0); {2631#true} is VALID [2018-11-23 13:01:01,790 INFO L273 TraceCheckUtils]: 33: Hoare triple {2631#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2631#true} is VALID [2018-11-23 13:01:01,791 INFO L273 TraceCheckUtils]: 34: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-23 13:01:01,791 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2631#true} {2631#true} #218#return; {2631#true} is VALID [2018-11-23 13:01:01,791 INFO L273 TraceCheckUtils]: 36: Hoare triple {2631#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {2631#true} is VALID [2018-11-23 13:01:01,791 INFO L273 TraceCheckUtils]: 37: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-23 13:01:01,792 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2631#true} {2631#true} #208#return; {2631#true} is VALID [2018-11-23 13:01:01,792 INFO L273 TraceCheckUtils]: 39: Hoare triple {2631#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {2631#true} is VALID [2018-11-23 13:01:01,792 INFO L273 TraceCheckUtils]: 40: Hoare triple {2631#true} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {2631#true} is VALID [2018-11-23 13:01:01,792 INFO L273 TraceCheckUtils]: 41: Hoare triple {2631#true} assume true; {2631#true} is VALID [2018-11-23 13:01:01,793 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {2631#true} {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} #202#return; {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,793 INFO L273 TraceCheckUtils]: 43: Hoare triple {2654#(and (<= main_~min~0 3) (<= 5 main_~max~0))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {2769#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,794 INFO L273 TraceCheckUtils]: 44: Hoare triple {2769#(and (<= main_~i~0 3) (<= 5 main_~max~0))} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {2769#(and (<= main_~i~0 3) (<= 5 main_~max~0))} is VALID [2018-11-23 13:01:01,794 INFO L273 TraceCheckUtils]: 45: Hoare triple {2769#(and (<= main_~i~0 3) (<= 5 main_~max~0))} assume ~i~0 > ~max~0; {2632#false} is VALID [2018-11-23 13:01:01,795 INFO L273 TraceCheckUtils]: 46: Hoare triple {2632#false} assume !false; {2632#false} is VALID [2018-11-23 13:01:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 13:01:01,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:01:01,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-23 13:01:01,816 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 13:01:01,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:01,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:01:01,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:01,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:01:01,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:01:01,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:01:01,894 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 7 states. [2018-11-23 13:01:02,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:02,381 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2018-11-23 13:01:02,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:01:02,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 13:01:02,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:01:02,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 13:01:02,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:01:02,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 92 transitions. [2018-11-23 13:01:02,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 92 transitions. [2018-11-23 13:01:02,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:02,505 INFO L225 Difference]: With dead ends: 119 [2018-11-23 13:01:02,505 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 13:01:02,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:01:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 13:01:02,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 105. [2018-11-23 13:01:02,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:02,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 105 states. [2018-11-23 13:01:02,627 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 105 states. [2018-11-23 13:01:02,627 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 105 states. [2018-11-23 13:01:02,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:02,631 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2018-11-23 13:01:02,631 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2018-11-23 13:01:02,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:02,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:02,632 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 117 states. [2018-11-23 13:01:02,633 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 117 states. [2018-11-23 13:01:02,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:02,638 INFO L93 Difference]: Finished difference Result 117 states and 151 transitions. [2018-11-23 13:01:02,638 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 151 transitions. [2018-11-23 13:01:02,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:02,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:02,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:02,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 13:01:02,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2018-11-23 13:01:02,643 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 47 [2018-11-23 13:01:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:02,644 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2018-11-23 13:01:02,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:01:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2018-11-23 13:01:02,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 13:01:02,645 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:02,645 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:02,646 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:02,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:02,646 INFO L82 PathProgramCache]: Analyzing trace with hash 802661536, now seen corresponding path program 1 times [2018-11-23 13:01:02,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:02,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:02,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:02,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:02,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:02,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {3323#true} call ULTIMATE.init(); {3323#true} is VALID [2018-11-23 13:01:02,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {3323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3323#true} is VALID [2018-11-23 13:01:02,768 INFO L273 TraceCheckUtils]: 2: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 13:01:02,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3323#true} {3323#true} #212#return; {3323#true} is VALID [2018-11-23 13:01:02,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {3323#true} call #t~ret26 := main(); {3323#true} is VALID [2018-11-23 13:01:02,769 INFO L273 TraceCheckUtils]: 5: Hoare triple {3323#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {3323#true} is VALID [2018-11-23 13:01:02,770 INFO L273 TraceCheckUtils]: 6: Hoare triple {3323#true} assume !!(~i~0 <= ~max~0);~j~0 := 0; {3323#true} is VALID [2018-11-23 13:01:02,770 INFO L273 TraceCheckUtils]: 7: Hoare triple {3323#true} #t~short18 := ~j~0 < 10; {3323#true} is VALID [2018-11-23 13:01:02,770 INFO L273 TraceCheckUtils]: 8: Hoare triple {3323#true} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {3323#true} is VALID [2018-11-23 13:01:02,770 INFO L273 TraceCheckUtils]: 9: Hoare triple {3323#true} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {3323#true} is VALID [2018-11-23 13:01:02,771 INFO L273 TraceCheckUtils]: 10: Hoare triple {3323#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3323#true} is VALID [2018-11-23 13:01:02,771 INFO L273 TraceCheckUtils]: 11: Hoare triple {3323#true} assume !!(~i~0 <= ~max~0);~j~0 := 0; {3323#true} is VALID [2018-11-23 13:01:02,771 INFO L273 TraceCheckUtils]: 12: Hoare triple {3323#true} #t~short18 := ~j~0 < 10; {3323#true} is VALID [2018-11-23 13:01:02,771 INFO L273 TraceCheckUtils]: 13: Hoare triple {3323#true} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {3323#true} is VALID [2018-11-23 13:01:02,772 INFO L273 TraceCheckUtils]: 14: Hoare triple {3323#true} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {3323#true} is VALID [2018-11-23 13:01:02,772 INFO L273 TraceCheckUtils]: 15: Hoare triple {3323#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3323#true} is VALID [2018-11-23 13:01:02,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {3323#true} assume !!(~i~0 <= ~max~0);~j~0 := 0; {3323#true} is VALID [2018-11-23 13:01:02,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {3323#true} #t~short18 := ~j~0 < 10; {3323#true} is VALID [2018-11-23 13:01:02,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {3323#true} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {3323#true} is VALID [2018-11-23 13:01:02,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {3323#true} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {3323#true} is VALID [2018-11-23 13:01:02,773 INFO L273 TraceCheckUtils]: 20: Hoare triple {3323#true} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3323#true} is VALID [2018-11-23 13:01:02,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {3323#true} assume !(~i~0 <= ~max~0); {3323#true} is VALID [2018-11-23 13:01:02,774 INFO L256 TraceCheckUtils]: 22: Hoare triple {3323#true} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {3323#true} is VALID [2018-11-23 13:01:02,774 INFO L273 TraceCheckUtils]: 23: Hoare triple {3323#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {3323#true} is VALID [2018-11-23 13:01:02,774 INFO L256 TraceCheckUtils]: 24: Hoare triple {3323#true} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {3323#true} is VALID [2018-11-23 13:01:02,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {3323#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {3323#true} is VALID [2018-11-23 13:01:02,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {3323#true} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {3323#true} is VALID [2018-11-23 13:01:02,775 INFO L256 TraceCheckUtils]: 27: Hoare triple {3323#true} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {3323#true} is VALID [2018-11-23 13:01:02,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {3323#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {3323#true} is VALID [2018-11-23 13:01:02,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {3323#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3323#true} is VALID [2018-11-23 13:01:02,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {3323#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {3323#true} is VALID [2018-11-23 13:01:02,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {3323#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; {3323#true} is VALID [2018-11-23 13:01:02,776 INFO L273 TraceCheckUtils]: 32: Hoare triple {3323#true} assume !(~len > 0); {3323#true} is VALID [2018-11-23 13:01:02,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {3323#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3323#true} is VALID [2018-11-23 13:01:02,777 INFO L273 TraceCheckUtils]: 34: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 13:01:02,777 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3323#true} {3323#true} #218#return; {3323#true} is VALID [2018-11-23 13:01:02,777 INFO L273 TraceCheckUtils]: 36: Hoare triple {3323#true} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {3323#true} is VALID [2018-11-23 13:01:02,778 INFO L273 TraceCheckUtils]: 37: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 13:01:02,778 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3323#true} {3323#true} #208#return; {3323#true} is VALID [2018-11-23 13:01:02,778 INFO L273 TraceCheckUtils]: 39: Hoare triple {3323#true} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {3323#true} is VALID [2018-11-23 13:01:02,778 INFO L273 TraceCheckUtils]: 40: Hoare triple {3323#true} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {3323#true} is VALID [2018-11-23 13:01:02,779 INFO L273 TraceCheckUtils]: 41: Hoare triple {3323#true} assume true; {3323#true} is VALID [2018-11-23 13:01:02,779 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3323#true} {3323#true} #202#return; {3323#true} is VALID [2018-11-23 13:01:02,779 INFO L273 TraceCheckUtils]: 43: Hoare triple {3323#true} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {3323#true} is VALID [2018-11-23 13:01:02,795 INFO L273 TraceCheckUtils]: 44: Hoare triple {3323#true} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {3325#(or (not (= main_~ptr~0.base 0)) (not (= 0 main_~ptr~0.offset)))} is VALID [2018-11-23 13:01:02,807 INFO L273 TraceCheckUtils]: 45: Hoare triple {3325#(or (not (= main_~ptr~0.base 0)) (not (= 0 main_~ptr~0.offset)))} assume !(~i~0 > ~max~0); {3325#(or (not (= main_~ptr~0.base 0)) (not (= 0 main_~ptr~0.offset)))} is VALID [2018-11-23 13:01:02,820 INFO L273 TraceCheckUtils]: 46: Hoare triple {3325#(or (not (= main_~ptr~0.base 0)) (not (= 0 main_~ptr~0.offset)))} assume !(~ptr~0.base != 0 || ~ptr~0.offset != 0); {3324#false} is VALID [2018-11-23 13:01:02,820 INFO L273 TraceCheckUtils]: 47: Hoare triple {3324#false} #t~post20 := ~i~0;~i~0 := 1 + #t~post20;havoc #t~post20; {3324#false} is VALID [2018-11-23 13:01:02,821 INFO L273 TraceCheckUtils]: 48: Hoare triple {3324#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {3324#false} is VALID [2018-11-23 13:01:02,821 INFO L273 TraceCheckUtils]: 49: Hoare triple {3324#false} assume ~i~0 > ~max~0; {3324#false} is VALID [2018-11-23 13:01:02,821 INFO L273 TraceCheckUtils]: 50: Hoare triple {3324#false} assume !false; {3324#false} is VALID [2018-11-23 13:01:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 13:01:02,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:02,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:01:02,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 13:01:02,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:02,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:01:02,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:02,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:01:02,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:01:02,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:01:02,914 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand 3 states. [2018-11-23 13:01:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:03,324 INFO L93 Difference]: Finished difference Result 128 states and 164 transitions. [2018-11-23 13:01:03,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:01:03,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-11-23 13:01:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:01:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 13:01:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:01:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 13:01:03,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 13:01:03,423 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:03,427 INFO L225 Difference]: With dead ends: 128 [2018-11-23 13:01:03,427 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 13:01:03,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:01:03,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 13:01:03,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-23 13:01:03,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:03,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 106 states. [2018-11-23 13:01:03,579 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 106 states. [2018-11-23 13:01:03,579 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 106 states. [2018-11-23 13:01:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:03,584 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2018-11-23 13:01:03,584 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2018-11-23 13:01:03,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:03,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:03,585 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 109 states. [2018-11-23 13:01:03,585 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 109 states. [2018-11-23 13:01:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:03,590 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2018-11-23 13:01:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2018-11-23 13:01:03,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:03,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:03,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:03,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:03,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 13:01:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 136 transitions. [2018-11-23 13:01:03,595 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 136 transitions. Word has length 51 [2018-11-23 13:01:03,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:03,596 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 136 transitions. [2018-11-23 13:01:03,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:01:03,596 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 136 transitions. [2018-11-23 13:01:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 13:01:03,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:03,597 INFO L402 BasicCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:03,598 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:03,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:03,598 INFO L82 PathProgramCache]: Analyzing trace with hash -55796747, now seen corresponding path program 1 times [2018-11-23 13:01:03,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:03,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:03,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:03,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:04,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {3871#true} call ULTIMATE.init(); {3871#true} is VALID [2018-11-23 13:01:04,377 INFO L273 TraceCheckUtils]: 1: Hoare triple {3871#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3871#true} is VALID [2018-11-23 13:01:04,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {3871#true} assume true; {3871#true} is VALID [2018-11-23 13:01:04,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3871#true} {3871#true} #212#return; {3871#true} is VALID [2018-11-23 13:01:04,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {3871#true} call #t~ret26 := main(); {3871#true} is VALID [2018-11-23 13:01:04,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {3871#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:04,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:04,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} #t~short18 := ~j~0 < 10; {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:04,380 INFO L273 TraceCheckUtils]: 8: Hoare triple {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:04,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:04,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {3873#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {3874#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,383 INFO L273 TraceCheckUtils]: 12: Hoare triple {3874#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,383 INFO L273 TraceCheckUtils]: 13: Hoare triple {3874#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {3874#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {3874#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {3874#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {3874#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {3874#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {3874#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,387 INFO L273 TraceCheckUtils]: 20: Hoare triple {3874#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {3874#(<= 3 main_~min~0)} assume !(~i~0 <= ~max~0); {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,388 INFO L256 TraceCheckUtils]: 22: Hoare triple {3874#(<= 3 main_~min~0)} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {3871#true} is VALID [2018-11-23 13:01:04,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {3871#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {3875#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-23 13:01:04,388 INFO L256 TraceCheckUtils]: 24: Hoare triple {3875#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {3871#true} is VALID [2018-11-23 13:01:04,389 INFO L273 TraceCheckUtils]: 25: Hoare triple {3871#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {3876#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:01:04,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {3876#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {3876#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:01:04,390 INFO L256 TraceCheckUtils]: 27: Hoare triple {3876#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {3871#true} is VALID [2018-11-23 13:01:04,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {3871#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {3877#(= sll_create_~len |sll_create_#in~len|)} is VALID [2018-11-23 13:01:04,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {3877#(= sll_create_~len |sll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3877#(= sll_create_~len |sll_create_#in~len|)} is VALID [2018-11-23 13:01:04,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {3877#(= sll_create_~len |sll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {3877#(= sll_create_~len |sll_create_#in~len|)} is VALID [2018-11-23 13:01:04,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {3877#(= sll_create_~len |sll_create_#in~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; {3878#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:04,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {3878#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {3879#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:04,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {3879#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3879#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:04,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {3879#(<= |sll_create_#in~len| 1)} assume true; {3879#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:04,395 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3879#(<= |sll_create_#in~len| 1)} {3876#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #218#return; {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,396 INFO L273 TraceCheckUtils]: 36: Hoare triple {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,396 INFO L273 TraceCheckUtils]: 37: Hoare triple {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} assume true; {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,397 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} {3875#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #208#return; {3881#(<= |sll_append_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,398 INFO L273 TraceCheckUtils]: 39: Hoare triple {3881#(<= |sll_append_#in~sublist_length| 1)} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {3881#(<= |sll_append_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,398 INFO L273 TraceCheckUtils]: 40: Hoare triple {3881#(<= |sll_append_#in~sublist_length| 1)} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {3881#(<= |sll_append_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {3881#(<= |sll_append_#in~sublist_length| 1)} assume true; {3881#(<= |sll_append_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,400 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3881#(<= |sll_append_#in~sublist_length| 1)} {3874#(<= 3 main_~min~0)} #202#return; {3872#false} is VALID [2018-11-23 13:01:04,400 INFO L273 TraceCheckUtils]: 43: Hoare triple {3872#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {3872#false} is VALID [2018-11-23 13:01:04,401 INFO L273 TraceCheckUtils]: 44: Hoare triple {3872#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {3872#false} is VALID [2018-11-23 13:01:04,401 INFO L273 TraceCheckUtils]: 45: Hoare triple {3872#false} assume !(~i~0 > ~max~0); {3872#false} is VALID [2018-11-23 13:01:04,401 INFO L273 TraceCheckUtils]: 46: Hoare triple {3872#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {3872#false} is VALID [2018-11-23 13:01:04,401 INFO L256 TraceCheckUtils]: 47: Hoare triple {3872#false} call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); {3871#true} is VALID [2018-11-23 13:01:04,402 INFO L273 TraceCheckUtils]: 48: Hoare triple {3871#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {3871#true} is VALID [2018-11-23 13:01:04,402 INFO L273 TraceCheckUtils]: 49: Hoare triple {3871#true} assume !(~head.base != 0 || ~head.offset != 0); {3871#true} is VALID [2018-11-23 13:01:04,402 INFO L273 TraceCheckUtils]: 50: Hoare triple {3871#true} #res := ~len~0; {3871#true} is VALID [2018-11-23 13:01:04,402 INFO L273 TraceCheckUtils]: 51: Hoare triple {3871#true} assume true; {3871#true} is VALID [2018-11-23 13:01:04,402 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {3871#true} {3872#false} #204#return; {3872#false} is VALID [2018-11-23 13:01:04,403 INFO L273 TraceCheckUtils]: 53: Hoare triple {3872#false} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~count~0 := #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret22; {3872#false} is VALID [2018-11-23 13:01:04,403 INFO L273 TraceCheckUtils]: 54: Hoare triple {3872#false} assume !(~i~0 == ~count~0); {3872#false} is VALID [2018-11-23 13:01:04,403 INFO L273 TraceCheckUtils]: 55: Hoare triple {3872#false} assume !(3 == ~i~0 && 5 == ~count~0); {3872#false} is VALID [2018-11-23 13:01:04,403 INFO L273 TraceCheckUtils]: 56: Hoare triple {3872#false} assume !(1 + ~i~0 == ~count~0 && ~i~0 < ~max~0); {3872#false} is VALID [2018-11-23 13:01:04,403 INFO L273 TraceCheckUtils]: 57: Hoare triple {3872#false} assume !false; {3872#false} is VALID [2018-11-23 13:01:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:01:04,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:04,406 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:04,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:04,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:04,743 INFO L256 TraceCheckUtils]: 0: Hoare triple {3871#true} call ULTIMATE.init(); {3871#true} is VALID [2018-11-23 13:01:04,743 INFO L273 TraceCheckUtils]: 1: Hoare triple {3871#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3871#true} is VALID [2018-11-23 13:01:04,743 INFO L273 TraceCheckUtils]: 2: Hoare triple {3871#true} assume true; {3871#true} is VALID [2018-11-23 13:01:04,744 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3871#true} {3871#true} #212#return; {3871#true} is VALID [2018-11-23 13:01:04,744 INFO L256 TraceCheckUtils]: 4: Hoare triple {3871#true} call #t~ret26 := main(); {3871#true} is VALID [2018-11-23 13:01:04,745 INFO L273 TraceCheckUtils]: 5: Hoare triple {3871#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,745 INFO L273 TraceCheckUtils]: 6: Hoare triple {3874#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,746 INFO L273 TraceCheckUtils]: 7: Hoare triple {3874#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,746 INFO L273 TraceCheckUtils]: 8: Hoare triple {3874#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,746 INFO L273 TraceCheckUtils]: 9: Hoare triple {3874#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {3874#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,747 INFO L273 TraceCheckUtils]: 11: Hoare triple {3874#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,747 INFO L273 TraceCheckUtils]: 12: Hoare triple {3874#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,748 INFO L273 TraceCheckUtils]: 13: Hoare triple {3874#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,748 INFO L273 TraceCheckUtils]: 14: Hoare triple {3874#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,749 INFO L273 TraceCheckUtils]: 15: Hoare triple {3874#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,749 INFO L273 TraceCheckUtils]: 16: Hoare triple {3874#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,750 INFO L273 TraceCheckUtils]: 17: Hoare triple {3874#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {3874#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,751 INFO L273 TraceCheckUtils]: 19: Hoare triple {3874#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,751 INFO L273 TraceCheckUtils]: 20: Hoare triple {3874#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {3874#(<= 3 main_~min~0)} assume !(~i~0 <= ~max~0); {3874#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:04,752 INFO L256 TraceCheckUtils]: 22: Hoare triple {3874#(<= 3 main_~min~0)} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {3871#true} is VALID [2018-11-23 13:01:04,753 INFO L273 TraceCheckUtils]: 23: Hoare triple {3871#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {3954#(<= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-23 13:01:04,753 INFO L256 TraceCheckUtils]: 24: Hoare triple {3954#(<= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {3871#true} is VALID [2018-11-23 13:01:04,754 INFO L273 TraceCheckUtils]: 25: Hoare triple {3871#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {3961#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:01:04,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {3961#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {3961#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:01:04,755 INFO L256 TraceCheckUtils]: 27: Hoare triple {3961#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {3871#true} is VALID [2018-11-23 13:01:04,755 INFO L273 TraceCheckUtils]: 28: Hoare triple {3871#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {3971#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:01:04,756 INFO L273 TraceCheckUtils]: 29: Hoare triple {3971#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {3971#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:01:04,756 INFO L273 TraceCheckUtils]: 30: Hoare triple {3971#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {3971#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:01:04,757 INFO L273 TraceCheckUtils]: 31: Hoare triple {3971#(<= |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; {3878#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:04,758 INFO L273 TraceCheckUtils]: 32: Hoare triple {3878#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {3879#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:04,758 INFO L273 TraceCheckUtils]: 33: Hoare triple {3879#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3879#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:04,759 INFO L273 TraceCheckUtils]: 34: Hoare triple {3879#(<= |sll_create_#in~len| 1)} assume true; {3879#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:01:04,760 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {3879#(<= |sll_create_#in~len| 1)} {3961#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #218#return; {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,761 INFO L273 TraceCheckUtils]: 36: Hoare triple {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,761 INFO L273 TraceCheckUtils]: 37: Hoare triple {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} assume true; {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,762 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3880#(<= |node_create_with_sublist_#in~sublist_length| 1)} {3954#(<= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #208#return; {3881#(<= |sll_append_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,763 INFO L273 TraceCheckUtils]: 39: Hoare triple {3881#(<= |sll_append_#in~sublist_length| 1)} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {3881#(<= |sll_append_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,764 INFO L273 TraceCheckUtils]: 40: Hoare triple {3881#(<= |sll_append_#in~sublist_length| 1)} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {3881#(<= |sll_append_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,764 INFO L273 TraceCheckUtils]: 41: Hoare triple {3881#(<= |sll_append_#in~sublist_length| 1)} assume true; {3881#(<= |sll_append_#in~sublist_length| 1)} is VALID [2018-11-23 13:01:04,772 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3881#(<= |sll_append_#in~sublist_length| 1)} {3874#(<= 3 main_~min~0)} #202#return; {3872#false} is VALID [2018-11-23 13:01:04,772 INFO L273 TraceCheckUtils]: 43: Hoare triple {3872#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {3872#false} is VALID [2018-11-23 13:01:04,772 INFO L273 TraceCheckUtils]: 44: Hoare triple {3872#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {3872#false} is VALID [2018-11-23 13:01:04,772 INFO L273 TraceCheckUtils]: 45: Hoare triple {3872#false} assume !(~i~0 > ~max~0); {3872#false} is VALID [2018-11-23 13:01:04,772 INFO L273 TraceCheckUtils]: 46: Hoare triple {3872#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {3872#false} is VALID [2018-11-23 13:01:04,773 INFO L256 TraceCheckUtils]: 47: Hoare triple {3872#false} call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); {3872#false} is VALID [2018-11-23 13:01:04,773 INFO L273 TraceCheckUtils]: 48: Hoare triple {3872#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {3872#false} is VALID [2018-11-23 13:01:04,773 INFO L273 TraceCheckUtils]: 49: Hoare triple {3872#false} assume !(~head.base != 0 || ~head.offset != 0); {3872#false} is VALID [2018-11-23 13:01:04,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {3872#false} #res := ~len~0; {3872#false} is VALID [2018-11-23 13:01:04,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {3872#false} assume true; {3872#false} is VALID [2018-11-23 13:01:04,773 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {3872#false} {3872#false} #204#return; {3872#false} is VALID [2018-11-23 13:01:04,773 INFO L273 TraceCheckUtils]: 53: Hoare triple {3872#false} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~count~0 := #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret22; {3872#false} is VALID [2018-11-23 13:01:04,773 INFO L273 TraceCheckUtils]: 54: Hoare triple {3872#false} assume !(~i~0 == ~count~0); {3872#false} is VALID [2018-11-23 13:01:04,774 INFO L273 TraceCheckUtils]: 55: Hoare triple {3872#false} assume !(3 == ~i~0 && 5 == ~count~0); {3872#false} is VALID [2018-11-23 13:01:04,774 INFO L273 TraceCheckUtils]: 56: Hoare triple {3872#false} assume !(1 + ~i~0 == ~count~0 && ~i~0 < ~max~0); {3872#false} is VALID [2018-11-23 13:01:04,774 INFO L273 TraceCheckUtils]: 57: Hoare triple {3872#false} assume !false; {3872#false} is VALID [2018-11-23 13:01:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:01:04,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:04,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2018-11-23 13:01:04,796 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-11-23 13:01:04,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:04,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 13:01:04,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:04,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:01:04,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:01:04,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:01:04,863 INFO L87 Difference]: Start difference. First operand 106 states and 136 transitions. Second operand 14 states. [2018-11-23 13:01:06,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:06,074 INFO L93 Difference]: Finished difference Result 221 states and 289 transitions. [2018-11-23 13:01:06,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:01:06,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-11-23 13:01:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:01:06,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2018-11-23 13:01:06,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:01:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 162 transitions. [2018-11-23 13:01:06,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 162 transitions. [2018-11-23 13:01:06,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:06,294 INFO L225 Difference]: With dead ends: 221 [2018-11-23 13:01:06,294 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 13:01:06,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:01:06,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 13:01:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-11-23 13:01:06,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:06,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 122 states. [2018-11-23 13:01:06,668 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 122 states. [2018-11-23 13:01:06,669 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 122 states. [2018-11-23 13:01:06,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:06,674 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2018-11-23 13:01:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 160 transitions. [2018-11-23 13:01:06,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:06,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:06,675 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 124 states. [2018-11-23 13:01:06,675 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 124 states. [2018-11-23 13:01:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:06,680 INFO L93 Difference]: Finished difference Result 124 states and 160 transitions. [2018-11-23 13:01:06,680 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 160 transitions. [2018-11-23 13:01:06,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:06,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:06,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:06,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 13:01:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2018-11-23 13:01:06,687 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 58 [2018-11-23 13:01:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:06,687 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2018-11-23 13:01:06,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:01:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2018-11-23 13:01:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 13:01:06,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:06,689 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:06,689 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:06,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1175467674, now seen corresponding path program 2 times [2018-11-23 13:01:06,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:06,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:06,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:06,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:07,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {4778#true} call ULTIMATE.init(); {4778#true} is VALID [2018-11-23 13:01:07,334 INFO L273 TraceCheckUtils]: 1: Hoare triple {4778#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4778#true} is VALID [2018-11-23 13:01:07,334 INFO L273 TraceCheckUtils]: 2: Hoare triple {4778#true} assume true; {4778#true} is VALID [2018-11-23 13:01:07,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4778#true} {4778#true} #212#return; {4778#true} is VALID [2018-11-23 13:01:07,335 INFO L256 TraceCheckUtils]: 4: Hoare triple {4778#true} call #t~ret26 := main(); {4778#true} is VALID [2018-11-23 13:01:07,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {4778#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:07,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:07,351 INFO L273 TraceCheckUtils]: 7: Hoare triple {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} #t~short18 := ~j~0 < 10; {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:07,352 INFO L273 TraceCheckUtils]: 8: Hoare triple {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:07,352 INFO L273 TraceCheckUtils]: 9: Hoare triple {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} is VALID [2018-11-23 13:01:07,353 INFO L273 TraceCheckUtils]: 10: Hoare triple {4780#(and (= main_~i~0 3) (= main_~i~0 main_~min~0))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,353 INFO L273 TraceCheckUtils]: 11: Hoare triple {4781#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,353 INFO L273 TraceCheckUtils]: 12: Hoare triple {4781#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,354 INFO L273 TraceCheckUtils]: 13: Hoare triple {4781#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,354 INFO L273 TraceCheckUtils]: 14: Hoare triple {4781#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,354 INFO L273 TraceCheckUtils]: 15: Hoare triple {4781#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {4781#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {4781#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,356 INFO L273 TraceCheckUtils]: 18: Hoare triple {4781#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {4781#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,357 INFO L273 TraceCheckUtils]: 20: Hoare triple {4781#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {4781#(<= 3 main_~min~0)} assume !(~i~0 <= ~max~0); {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,358 INFO L256 TraceCheckUtils]: 22: Hoare triple {4781#(<= 3 main_~min~0)} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {4778#true} is VALID [2018-11-23 13:01:07,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {4778#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {4782#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-23 13:01:07,358 INFO L256 TraceCheckUtils]: 24: Hoare triple {4782#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {4778#true} is VALID [2018-11-23 13:01:07,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {4778#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {4783#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:01:07,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {4783#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {4783#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:01:07,360 INFO L256 TraceCheckUtils]: 27: Hoare triple {4783#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {4778#true} is VALID [2018-11-23 13:01:07,360 INFO L273 TraceCheckUtils]: 28: Hoare triple {4778#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {4784#(= sll_create_~len |sll_create_#in~len|)} is VALID [2018-11-23 13:01:07,361 INFO L273 TraceCheckUtils]: 29: Hoare triple {4784#(= sll_create_~len |sll_create_#in~len|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4784#(= sll_create_~len |sll_create_#in~len|)} is VALID [2018-11-23 13:01:07,361 INFO L273 TraceCheckUtils]: 30: Hoare triple {4784#(= sll_create_~len |sll_create_#in~len|)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4784#(= sll_create_~len |sll_create_#in~len|)} is VALID [2018-11-23 13:01:07,362 INFO L273 TraceCheckUtils]: 31: Hoare triple {4784#(= sll_create_~len |sll_create_#in~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; {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:07,363 INFO L273 TraceCheckUtils]: 32: Hoare triple {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:07,363 INFO L273 TraceCheckUtils]: 33: Hoare triple {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:07,364 INFO L273 TraceCheckUtils]: 34: Hoare triple {4785#(<= |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; {4786#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2018-11-23 13:01:07,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {4786#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {4787#(<= |sll_create_#in~len| 2)} is VALID [2018-11-23 13:01:07,366 INFO L273 TraceCheckUtils]: 36: Hoare triple {4787#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4787#(<= |sll_create_#in~len| 2)} is VALID [2018-11-23 13:01:07,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {4787#(<= |sll_create_#in~len| 2)} assume true; {4787#(<= |sll_create_#in~len| 2)} is VALID [2018-11-23 13:01:07,367 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4787#(<= |sll_create_#in~len| 2)} {4783#(= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #218#return; {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,368 INFO L273 TraceCheckUtils]: 39: Hoare triple {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,368 INFO L273 TraceCheckUtils]: 40: Hoare triple {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} assume true; {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,369 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} {4782#(= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #208#return; {4789#(<= |sll_append_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,370 INFO L273 TraceCheckUtils]: 42: Hoare triple {4789#(<= |sll_append_#in~sublist_length| 2)} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {4789#(<= |sll_append_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,370 INFO L273 TraceCheckUtils]: 43: Hoare triple {4789#(<= |sll_append_#in~sublist_length| 2)} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {4789#(<= |sll_append_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,371 INFO L273 TraceCheckUtils]: 44: Hoare triple {4789#(<= |sll_append_#in~sublist_length| 2)} assume true; {4789#(<= |sll_append_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,372 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4789#(<= |sll_append_#in~sublist_length| 2)} {4781#(<= 3 main_~min~0)} #202#return; {4779#false} is VALID [2018-11-23 13:01:07,372 INFO L273 TraceCheckUtils]: 46: Hoare triple {4779#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {4779#false} is VALID [2018-11-23 13:01:07,372 INFO L273 TraceCheckUtils]: 47: Hoare triple {4779#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {4779#false} is VALID [2018-11-23 13:01:07,373 INFO L273 TraceCheckUtils]: 48: Hoare triple {4779#false} assume !(~i~0 > ~max~0); {4779#false} is VALID [2018-11-23 13:01:07,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {4779#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {4779#false} is VALID [2018-11-23 13:01:07,373 INFO L256 TraceCheckUtils]: 50: Hoare triple {4779#false} call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); {4778#true} is VALID [2018-11-23 13:01:07,373 INFO L273 TraceCheckUtils]: 51: Hoare triple {4778#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {4778#true} is VALID [2018-11-23 13:01:07,374 INFO L273 TraceCheckUtils]: 52: Hoare triple {4778#true} assume !(~head.base != 0 || ~head.offset != 0); {4778#true} is VALID [2018-11-23 13:01:07,374 INFO L273 TraceCheckUtils]: 53: Hoare triple {4778#true} #res := ~len~0; {4778#true} is VALID [2018-11-23 13:01:07,374 INFO L273 TraceCheckUtils]: 54: Hoare triple {4778#true} assume true; {4778#true} is VALID [2018-11-23 13:01:07,374 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4778#true} {4779#false} #204#return; {4779#false} is VALID [2018-11-23 13:01:07,374 INFO L273 TraceCheckUtils]: 56: Hoare triple {4779#false} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~count~0 := #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret22; {4779#false} is VALID [2018-11-23 13:01:07,375 INFO L273 TraceCheckUtils]: 57: Hoare triple {4779#false} assume !(~i~0 == ~count~0); {4779#false} is VALID [2018-11-23 13:01:07,375 INFO L273 TraceCheckUtils]: 58: Hoare triple {4779#false} assume !(3 == ~i~0 && 5 == ~count~0); {4779#false} is VALID [2018-11-23 13:01:07,375 INFO L273 TraceCheckUtils]: 59: Hoare triple {4779#false} assume !(1 + ~i~0 == ~count~0 && ~i~0 < ~max~0); {4779#false} is VALID [2018-11-23 13:01:07,375 INFO L273 TraceCheckUtils]: 60: Hoare triple {4779#false} assume !false; {4779#false} is VALID [2018-11-23 13:01:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:01:07,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:07,379 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:07,388 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:01:07,428 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:01:07,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:01:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:07,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:07,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {4778#true} call ULTIMATE.init(); {4778#true} is VALID [2018-11-23 13:01:07,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {4778#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4778#true} is VALID [2018-11-23 13:01:07,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {4778#true} assume true; {4778#true} is VALID [2018-11-23 13:01:07,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4778#true} {4778#true} #212#return; {4778#true} is VALID [2018-11-23 13:01:07,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {4778#true} call #t~ret26 := main(); {4778#true} is VALID [2018-11-23 13:01:07,623 INFO L273 TraceCheckUtils]: 5: Hoare triple {4778#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,624 INFO L273 TraceCheckUtils]: 6: Hoare triple {4781#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {4781#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {4781#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {4781#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {4781#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {4781#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {4781#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {4781#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {4781#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {4781#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {4781#(<= 3 main_~min~0)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {4781#(<= 3 main_~min~0)} #t~short18 := ~j~0 < 10; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,628 INFO L273 TraceCheckUtils]: 18: Hoare triple {4781#(<= 3 main_~min~0)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,628 INFO L273 TraceCheckUtils]: 19: Hoare triple {4781#(<= 3 main_~min~0)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {4781#(<= 3 main_~min~0)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,629 INFO L273 TraceCheckUtils]: 21: Hoare triple {4781#(<= 3 main_~min~0)} assume !(~i~0 <= ~max~0); {4781#(<= 3 main_~min~0)} is VALID [2018-11-23 13:01:07,630 INFO L256 TraceCheckUtils]: 22: Hoare triple {4781#(<= 3 main_~min~0)} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {4778#true} is VALID [2018-11-23 13:01:07,630 INFO L273 TraceCheckUtils]: 23: Hoare triple {4778#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {4862#(<= |sll_append_#in~sublist_length| sll_append_~sublist_length)} is VALID [2018-11-23 13:01:07,630 INFO L256 TraceCheckUtils]: 24: Hoare triple {4862#(<= |sll_append_#in~sublist_length| sll_append_~sublist_length)} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {4778#true} is VALID [2018-11-23 13:01:07,631 INFO L273 TraceCheckUtils]: 25: Hoare triple {4778#true} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {4869#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:01:07,632 INFO L273 TraceCheckUtils]: 26: Hoare triple {4869#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {4869#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} is VALID [2018-11-23 13:01:07,632 INFO L256 TraceCheckUtils]: 27: Hoare triple {4869#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {4778#true} is VALID [2018-11-23 13:01:07,633 INFO L273 TraceCheckUtils]: 28: Hoare triple {4778#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {4879#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:01:07,633 INFO L273 TraceCheckUtils]: 29: Hoare triple {4879#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4879#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:01:07,634 INFO L273 TraceCheckUtils]: 30: Hoare triple {4879#(<= |sll_create_#in~len| sll_create_~len)} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4879#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:01:07,635 INFO L273 TraceCheckUtils]: 31: Hoare triple {4879#(<= |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; {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:07,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:07,636 INFO L273 TraceCheckUtils]: 33: Hoare triple {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {4785#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:01:07,637 INFO L273 TraceCheckUtils]: 34: Hoare triple {4785#(<= |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; {4786#(<= |sll_create_#in~len| (+ sll_create_~len 2))} is VALID [2018-11-23 13:01:07,637 INFO L273 TraceCheckUtils]: 35: Hoare triple {4786#(<= |sll_create_#in~len| (+ sll_create_~len 2))} assume !(~len > 0); {4787#(<= |sll_create_#in~len| 2)} is VALID [2018-11-23 13:01:07,638 INFO L273 TraceCheckUtils]: 36: Hoare triple {4787#(<= |sll_create_#in~len| 2)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4787#(<= |sll_create_#in~len| 2)} is VALID [2018-11-23 13:01:07,639 INFO L273 TraceCheckUtils]: 37: Hoare triple {4787#(<= |sll_create_#in~len| 2)} assume true; {4787#(<= |sll_create_#in~len| 2)} is VALID [2018-11-23 13:01:07,640 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4787#(<= |sll_create_#in~len| 2)} {4869#(<= |node_create_with_sublist_#in~sublist_length| node_create_with_sublist_~sublist_length)} #218#return; {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,640 INFO L273 TraceCheckUtils]: 39: Hoare triple {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,641 INFO L273 TraceCheckUtils]: 40: Hoare triple {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} assume true; {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,642 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {4788#(<= |node_create_with_sublist_#in~sublist_length| 2)} {4862#(<= |sll_append_#in~sublist_length| sll_append_~sublist_length)} #208#return; {4789#(<= |sll_append_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,642 INFO L273 TraceCheckUtils]: 42: Hoare triple {4789#(<= |sll_append_#in~sublist_length| 2)} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {4789#(<= |sll_append_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,643 INFO L273 TraceCheckUtils]: 43: Hoare triple {4789#(<= |sll_append_#in~sublist_length| 2)} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {4789#(<= |sll_append_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,643 INFO L273 TraceCheckUtils]: 44: Hoare triple {4789#(<= |sll_append_#in~sublist_length| 2)} assume true; {4789#(<= |sll_append_#in~sublist_length| 2)} is VALID [2018-11-23 13:01:07,644 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {4789#(<= |sll_append_#in~sublist_length| 2)} {4781#(<= 3 main_~min~0)} #202#return; {4779#false} is VALID [2018-11-23 13:01:07,645 INFO L273 TraceCheckUtils]: 46: Hoare triple {4779#false} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {4779#false} is VALID [2018-11-23 13:01:07,645 INFO L273 TraceCheckUtils]: 47: Hoare triple {4779#false} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {4779#false} is VALID [2018-11-23 13:01:07,645 INFO L273 TraceCheckUtils]: 48: Hoare triple {4779#false} assume !(~i~0 > ~max~0); {4779#false} is VALID [2018-11-23 13:01:07,645 INFO L273 TraceCheckUtils]: 49: Hoare triple {4779#false} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {4779#false} is VALID [2018-11-23 13:01:07,646 INFO L256 TraceCheckUtils]: 50: Hoare triple {4779#false} call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); {4779#false} is VALID [2018-11-23 13:01:07,646 INFO L273 TraceCheckUtils]: 51: Hoare triple {4779#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {4779#false} is VALID [2018-11-23 13:01:07,646 INFO L273 TraceCheckUtils]: 52: Hoare triple {4779#false} assume !(~head.base != 0 || ~head.offset != 0); {4779#false} is VALID [2018-11-23 13:01:07,646 INFO L273 TraceCheckUtils]: 53: Hoare triple {4779#false} #res := ~len~0; {4779#false} is VALID [2018-11-23 13:01:07,646 INFO L273 TraceCheckUtils]: 54: Hoare triple {4779#false} assume true; {4779#false} is VALID [2018-11-23 13:01:07,647 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {4779#false} {4779#false} #204#return; {4779#false} is VALID [2018-11-23 13:01:07,647 INFO L273 TraceCheckUtils]: 56: Hoare triple {4779#false} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~count~0 := #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret22; {4779#false} is VALID [2018-11-23 13:01:07,647 INFO L273 TraceCheckUtils]: 57: Hoare triple {4779#false} assume !(~i~0 == ~count~0); {4779#false} is VALID [2018-11-23 13:01:07,647 INFO L273 TraceCheckUtils]: 58: Hoare triple {4779#false} assume !(3 == ~i~0 && 5 == ~count~0); {4779#false} is VALID [2018-11-23 13:01:07,647 INFO L273 TraceCheckUtils]: 59: Hoare triple {4779#false} assume !(1 + ~i~0 == ~count~0 && ~i~0 < ~max~0); {4779#false} is VALID [2018-11-23 13:01:07,648 INFO L273 TraceCheckUtils]: 60: Hoare triple {4779#false} assume !false; {4779#false} is VALID [2018-11-23 13:01:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:01:07,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:07,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 15 [2018-11-23 13:01:07,671 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-11-23 13:01:07,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:07,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 13:01:07,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:07,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 13:01:07,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:01:07,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:01:07,737 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand 15 states. [2018-11-23 13:01:08,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:08,877 INFO L93 Difference]: Finished difference Result 253 states and 333 transitions. [2018-11-23 13:01:08,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:01:08,877 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2018-11-23 13:01:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:01:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 169 transitions. [2018-11-23 13:01:08,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:01:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 169 transitions. [2018-11-23 13:01:08,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 169 transitions. [2018-11-23 13:01:09,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:09,061 INFO L225 Difference]: With dead ends: 253 [2018-11-23 13:01:09,061 INFO L226 Difference]: Without dead ends: 140 [2018-11-23 13:01:09,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:01:09,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-11-23 13:01:09,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2018-11-23 13:01:09,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:09,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand 125 states. [2018-11-23 13:01:09,192 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand 125 states. [2018-11-23 13:01:09,192 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 125 states. [2018-11-23 13:01:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:09,198 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 13:01:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 13:01:09,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:09,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:09,199 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 140 states. [2018-11-23 13:01:09,199 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 140 states. [2018-11-23 13:01:09,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:09,205 INFO L93 Difference]: Finished difference Result 140 states and 182 transitions. [2018-11-23 13:01:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 182 transitions. [2018-11-23 13:01:09,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:09,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:09,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:09,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-23 13:01:09,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2018-11-23 13:01:09,211 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 61 [2018-11-23 13:01:09,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:09,212 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2018-11-23 13:01:09,212 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 13:01:09,212 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2018-11-23 13:01:09,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 13:01:09,213 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:09,213 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:09,213 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:09,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:09,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1718934101, now seen corresponding path program 3 times [2018-11-23 13:01:09,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:09,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:09,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:09,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:09,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:09,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {5769#true} call ULTIMATE.init(); {5769#true} is VALID [2018-11-23 13:01:09,772 INFO L273 TraceCheckUtils]: 1: Hoare triple {5769#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5769#true} is VALID [2018-11-23 13:01:09,772 INFO L273 TraceCheckUtils]: 2: Hoare triple {5769#true} assume true; {5769#true} is VALID [2018-11-23 13:01:09,772 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5769#true} {5769#true} #212#return; {5769#true} is VALID [2018-11-23 13:01:09,773 INFO L256 TraceCheckUtils]: 4: Hoare triple {5769#true} call #t~ret26 := main(); {5769#true} is VALID [2018-11-23 13:01:09,773 INFO L273 TraceCheckUtils]: 5: Hoare triple {5769#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,774 INFO L273 TraceCheckUtils]: 6: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,774 INFO L273 TraceCheckUtils]: 7: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} #t~short18 := ~j~0 < 10; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,775 INFO L273 TraceCheckUtils]: 8: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,776 INFO L273 TraceCheckUtils]: 10: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,777 INFO L273 TraceCheckUtils]: 12: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} #t~short18 := ~j~0 < 10; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume !!(~i~0 <= ~max~0);~j~0 := 0; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,779 INFO L273 TraceCheckUtils]: 17: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} #t~short18 := ~j~0 < 10; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,801 INFO L273 TraceCheckUtils]: 18: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,814 INFO L273 TraceCheckUtils]: 19: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,821 INFO L273 TraceCheckUtils]: 21: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} assume !(~i~0 <= ~max~0); {5771#(= (select |#valid| |main_~#head~1.base|) 1)} is VALID [2018-11-23 13:01:09,822 INFO L256 TraceCheckUtils]: 22: Hoare triple {5771#(= (select |#valid| |main_~#head~1.base|) 1)} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {5772#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:09,823 INFO L273 TraceCheckUtils]: 23: Hoare triple {5772#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {5773#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:01:09,823 INFO L256 TraceCheckUtils]: 24: Hoare triple {5773#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {5772#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:09,824 INFO L273 TraceCheckUtils]: 25: Hoare triple {5772#(= |#valid| |old(#valid)|)} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {5774#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)))} is VALID [2018-11-23 13:01:09,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {5774#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)))} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {5774#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)))} is VALID [2018-11-23 13:01:09,825 INFO L256 TraceCheckUtils]: 27: Hoare triple {5774#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {5769#true} is VALID [2018-11-23 13:01:09,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {5769#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {5769#true} is VALID [2018-11-23 13:01:09,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {5769#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5769#true} is VALID [2018-11-23 13:01:09,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {5769#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5769#true} is VALID [2018-11-23 13:01:09,825 INFO L273 TraceCheckUtils]: 31: Hoare triple {5769#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; {5769#true} is VALID [2018-11-23 13:01:09,826 INFO L273 TraceCheckUtils]: 32: Hoare triple {5769#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5769#true} is VALID [2018-11-23 13:01:09,826 INFO L273 TraceCheckUtils]: 33: Hoare triple {5769#true} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5769#true} is VALID [2018-11-23 13:01:09,826 INFO L273 TraceCheckUtils]: 34: Hoare triple {5769#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; {5769#true} is VALID [2018-11-23 13:01:09,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {5769#true} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {5775#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:01:09,848 INFO L273 TraceCheckUtils]: 36: Hoare triple {5775#(not (= 0 sll_create_~new_head~0.base))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {5775#(not (= 0 sll_create_~new_head~0.base))} is VALID [2018-11-23 13:01:09,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {5775#(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; {5776#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:09,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {5776#(not (= 0 sll_create_~head~0.base))} assume !(~len > 0); {5776#(not (= 0 sll_create_~head~0.base))} is VALID [2018-11-23 13:01:09,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {5776#(not (= 0 sll_create_~head~0.base))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5777#(not (= 0 |sll_create_#res.base|))} is VALID [2018-11-23 13:01:09,849 INFO L273 TraceCheckUtils]: 40: Hoare triple {5777#(not (= 0 |sll_create_#res.base|))} assume true; {5777#(not (= 0 |sll_create_#res.base|))} is VALID [2018-11-23 13:01:09,850 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {5777#(not (= 0 |sll_create_#res.base|))} {5774#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)))} #218#return; {5778#(and (= 0 node_create_with_sublist_~new_node~0.offset) (not (= 0 |node_create_with_sublist_#t~ret5.base|)) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)))} is VALID [2018-11-23 13:01:09,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {5778#(and (= 0 node_create_with_sublist_~new_node~0.offset) (not (= 0 |node_create_with_sublist_#t~ret5.base|)) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {5779#(and (= 0 |node_create_with_sublist_#res.offset|) (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4))) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} is VALID [2018-11-23 13:01:09,852 INFO L273 TraceCheckUtils]: 43: Hoare triple {5779#(and (= 0 |node_create_with_sublist_#res.offset|) (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4))) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} assume true; {5779#(and (= 0 |node_create_with_sublist_#res.offset|) (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4))) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} is VALID [2018-11-23 13:01:09,854 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {5779#(and (= 0 |node_create_with_sublist_#res.offset|) (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4))) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} {5773#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} #208#return; {5780#(and (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) |sll_append_#t~ret8.offset|)) (= 0 |sll_append_#t~ret8.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select |old(#valid)| |sll_append_#t~ret8.base|)) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:01:09,855 INFO L273 TraceCheckUtils]: 45: Hoare triple {5780#(and (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) |sll_append_#t~ret8.offset|)) (= 0 |sll_append_#t~ret8.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select |old(#valid)| |sll_append_#t~ret8.base|)) (= sll_append_~head.base |sll_append_#in~head.base|))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {5781#(and (or (= sll_append_~new_last~0.base sll_append_~head.base) (and (= sll_append_~head.offset |sll_append_#in~head.offset|) (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4))) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 sll_append_~new_last~0.offset))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (not (= sll_append_~new_last~0.base sll_append_~head.base))))} is VALID [2018-11-23 13:01:09,857 INFO L273 TraceCheckUtils]: 46: Hoare triple {5781#(and (or (= sll_append_~new_last~0.base sll_append_~head.base) (and (= sll_append_~head.offset |sll_append_#in~head.offset|) (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4))) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 sll_append_~new_last~0.offset))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (not (= sll_append_~new_last~0.base sll_append_~head.base))))} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {5782#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)))) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)))} is VALID [2018-11-23 13:01:09,857 INFO L273 TraceCheckUtils]: 47: Hoare triple {5782#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)))) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)))} assume true; {5782#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)))) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)))} is VALID [2018-11-23 13:01:09,859 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {5782#(or (and (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)))) (= 0 (select |old(#valid)| |sll_append_#in~head.base|)))} {5771#(= (select |#valid| |main_~#head~1.base|) 1)} #202#return; {5783#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)))} is VALID [2018-11-23 13:01:09,860 INFO L273 TraceCheckUtils]: 49: Hoare triple {5783#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {5784#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} is VALID [2018-11-23 13:01:09,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {5784#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {5784#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} is VALID [2018-11-23 13:01:09,861 INFO L273 TraceCheckUtils]: 51: Hoare triple {5784#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} assume !(~i~0 > ~max~0); {5784#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} is VALID [2018-11-23 13:01:09,862 INFO L273 TraceCheckUtils]: 52: Hoare triple {5784#(and (= main_~ptr~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {5785#(not (= 0 |main_#t~mem21.base|))} is VALID [2018-11-23 13:01:09,862 INFO L256 TraceCheckUtils]: 53: Hoare triple {5785#(not (= 0 |main_#t~mem21.base|))} call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); {5769#true} is VALID [2018-11-23 13:01:09,863 INFO L273 TraceCheckUtils]: 54: Hoare triple {5769#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {5786#(= |sll_length_#in~head.base| sll_length_~head.base)} is VALID [2018-11-23 13:01:09,864 INFO L273 TraceCheckUtils]: 55: Hoare triple {5786#(= |sll_length_#in~head.base| sll_length_~head.base)} assume !(~head.base != 0 || ~head.offset != 0); {5787#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-23 13:01:09,864 INFO L273 TraceCheckUtils]: 56: Hoare triple {5787#(= 0 |sll_length_#in~head.base|)} #res := ~len~0; {5787#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-23 13:01:09,865 INFO L273 TraceCheckUtils]: 57: Hoare triple {5787#(= 0 |sll_length_#in~head.base|)} assume true; {5787#(= 0 |sll_length_#in~head.base|)} is VALID [2018-11-23 13:01:09,866 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {5787#(= 0 |sll_length_#in~head.base|)} {5785#(not (= 0 |main_#t~mem21.base|))} #204#return; {5770#false} is VALID [2018-11-23 13:01:09,866 INFO L273 TraceCheckUtils]: 59: Hoare triple {5770#false} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~count~0 := #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret22; {5770#false} is VALID [2018-11-23 13:01:09,866 INFO L273 TraceCheckUtils]: 60: Hoare triple {5770#false} assume !(~i~0 == ~count~0); {5770#false} is VALID [2018-11-23 13:01:09,866 INFO L273 TraceCheckUtils]: 61: Hoare triple {5770#false} assume !(3 == ~i~0 && 5 == ~count~0); {5770#false} is VALID [2018-11-23 13:01:09,866 INFO L273 TraceCheckUtils]: 62: Hoare triple {5770#false} assume !(1 + ~i~0 == ~count~0 && ~i~0 < ~max~0); {5770#false} is VALID [2018-11-23 13:01:09,867 INFO L273 TraceCheckUtils]: 63: Hoare triple {5770#false} assume !false; {5770#false} is VALID [2018-11-23 13:01:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-23 13:01:09,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:01:09,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-11-23 13:01:09,874 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-11-23 13:01:09,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:09,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 13:01:09,933 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:09,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 13:01:09,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:01:09,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:01:09,934 INFO L87 Difference]: Start difference. First operand 125 states and 162 transitions. Second operand 19 states. [2018-11-23 13:01:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:16,124 INFO L93 Difference]: Finished difference Result 228 states and 332 transitions. [2018-11-23 13:01:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:01:16,124 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 64 [2018-11-23 13:01:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:01:16,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:01:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 177 transitions. [2018-11-23 13:01:16,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 13:01:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 177 transitions. [2018-11-23 13:01:16,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 177 transitions. [2018-11-23 13:01:16,377 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:16,383 INFO L225 Difference]: With dead ends: 228 [2018-11-23 13:01:16,383 INFO L226 Difference]: Without dead ends: 208 [2018-11-23 13:01:16,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=727, Unknown=0, NotChecked=0, Total=812 [2018-11-23 13:01:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-11-23 13:01:16,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 158. [2018-11-23 13:01:16,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:01:16,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand 158 states. [2018-11-23 13:01:16,858 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 158 states. [2018-11-23 13:01:16,858 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 158 states. [2018-11-23 13:01:16,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:16,868 INFO L93 Difference]: Finished difference Result 208 states and 306 transitions. [2018-11-23 13:01:16,868 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 306 transitions. [2018-11-23 13:01:16,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:16,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:16,870 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 208 states. [2018-11-23 13:01:16,870 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 208 states. [2018-11-23 13:01:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:01:16,880 INFO L93 Difference]: Finished difference Result 208 states and 306 transitions. [2018-11-23 13:01:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 306 transitions. [2018-11-23 13:01:16,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:01:16,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:01:16,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:01:16,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:01:16,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 13:01:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 212 transitions. [2018-11-23 13:01:16,889 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 212 transitions. Word has length 64 [2018-11-23 13:01:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:01:16,889 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 212 transitions. [2018-11-23 13:01:16,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 13:01:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 212 transitions. [2018-11-23 13:01:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-23 13:01:16,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:01:16,891 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:01:16,891 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:01:16,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:01:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash -2020733493, now seen corresponding path program 1 times [2018-11-23 13:01:16,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:01:16,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:01:16,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:16,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:01:16,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:01:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:18,627 INFO L256 TraceCheckUtils]: 0: Hoare triple {6755#true} call ULTIMATE.init(); {6755#true} is VALID [2018-11-23 13:01:18,627 INFO L273 TraceCheckUtils]: 1: Hoare triple {6755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6755#true} is VALID [2018-11-23 13:01:18,628 INFO L273 TraceCheckUtils]: 2: Hoare triple {6755#true} assume true; {6755#true} is VALID [2018-11-23 13:01:18,628 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6755#true} {6755#true} #212#return; {6755#true} is VALID [2018-11-23 13:01:18,628 INFO L256 TraceCheckUtils]: 4: Hoare triple {6755#true} call #t~ret26 := main(); {6755#true} is VALID [2018-11-23 13:01:18,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {6755#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~short18 := ~j~0 < 10; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~short18 := ~j~0 < 10; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,634 INFO L273 TraceCheckUtils]: 14: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,635 INFO L273 TraceCheckUtils]: 16: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~short18 := ~j~0 < 10; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,637 INFO L273 TraceCheckUtils]: 18: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,639 INFO L273 TraceCheckUtils]: 21: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !(~i~0 <= ~max~0); {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:18,640 INFO L256 TraceCheckUtils]: 22: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {6758#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:18,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {6758#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {6759#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:01:18,641 INFO L256 TraceCheckUtils]: 24: Hoare triple {6759#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {6758#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:18,642 INFO L273 TraceCheckUtils]: 25: Hoare triple {6758#(= |#valid| |old(#valid)|)} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {6760#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} is VALID [2018-11-23 13:01:18,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {6760#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {6760#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} is VALID [2018-11-23 13:01:18,644 INFO L256 TraceCheckUtils]: 27: Hoare triple {6760#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {6758#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:18,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {6758#(= |#valid| |old(#valid)|)} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {6758#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:18,646 INFO L273 TraceCheckUtils]: 29: Hoare triple {6758#(= |#valid| |old(#valid)|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6761#(and (or (= |#valid| |old(#valid)|) (= sll_create_~new_head~0.base (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:18,647 INFO L273 TraceCheckUtils]: 30: Hoare triple {6761#(and (or (= |#valid| |old(#valid)|) (= sll_create_~new_head~0.base (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6761#(and (or (= |#valid| |old(#valid)|) (= sll_create_~new_head~0.base (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:18,649 INFO L273 TraceCheckUtils]: 31: Hoare triple {6761#(and (or (= |#valid| |old(#valid)|) (= sll_create_~new_head~0.base (@diff |old(#valid)| |#valid|))) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} 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; {6762#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:01:18,652 INFO L273 TraceCheckUtils]: 32: Hoare triple {6762#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6763#(and (or (= |#valid| |old(#valid)|) (= sll_create_~new_head~0.base (@diff |old(#valid)| |#valid|)) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= sll_create_~new_head~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= (select |#valid| sll_create_~new_head~0.base) 1))} is VALID [2018-11-23 13:01:18,653 INFO L273 TraceCheckUtils]: 33: Hoare triple {6763#(and (or (= |#valid| |old(#valid)|) (= sll_create_~new_head~0.base (@diff |old(#valid)| |#valid|)) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= sll_create_~new_head~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= (select |#valid| sll_create_~new_head~0.base) 1))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6763#(and (or (= |#valid| |old(#valid)|) (= sll_create_~new_head~0.base (@diff |old(#valid)| |#valid|)) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= sll_create_~new_head~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= (select |#valid| sll_create_~new_head~0.base) 1))} is VALID [2018-11-23 13:01:18,656 INFO L273 TraceCheckUtils]: 34: Hoare triple {6763#(and (or (= |#valid| |old(#valid)|) (= sll_create_~new_head~0.base (@diff |old(#valid)| |#valid|)) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= sll_create_~new_head~0.base (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= (select |#valid| sll_create_~new_head~0.base) 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; {6764#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:01:18,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {6764#(and (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6765#(and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:01:18,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {6765#(and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (not (= 0 sll_create_~head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6765#(and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:01:18,660 INFO L273 TraceCheckUtils]: 37: Hoare triple {6765#(and (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (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; {6766#(and (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:01:18,661 INFO L273 TraceCheckUtils]: 38: Hoare triple {6766#(and (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} assume !(~len > 0); {6766#(and (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:01:18,661 INFO L273 TraceCheckUtils]: 39: Hoare triple {6766#(and (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6767#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0))) (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|))} is VALID [2018-11-23 13:01:18,662 INFO L273 TraceCheckUtils]: 40: Hoare triple {6767#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0))) (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|))} assume true; {6767#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0))) (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|))} is VALID [2018-11-23 13:01:18,664 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {6767#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0))) (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|))} {6760#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} #218#return; {6768#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= 0 |node_create_with_sublist_#t~ret5.offset|) (not (= 0 (select (select (store |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.base|) node_create_with_sublist_~new_node~0.offset 0)) |node_create_with_sublist_#t~ret5.base|) 0))))} is VALID [2018-11-23 13:01:18,666 INFO L273 TraceCheckUtils]: 42: Hoare triple {6768#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= 0 |node_create_with_sublist_#t~ret5.offset|) (not (= 0 (select (select (store |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.base|) node_create_with_sublist_~new_node~0.offset 0)) |node_create_with_sublist_#t~ret5.base|) 0))))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {6769#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 |node_create_with_sublist_#res.offset|) (not (= 0 |node_create_with_sublist_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) 4)) (not (= |node_create_with_sublist_#res.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} is VALID [2018-11-23 13:01:18,667 INFO L273 TraceCheckUtils]: 43: Hoare triple {6769#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 |node_create_with_sublist_#res.offset|) (not (= 0 |node_create_with_sublist_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) 4)) (not (= |node_create_with_sublist_#res.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} assume true; {6769#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 |node_create_with_sublist_#res.offset|) (not (= 0 |node_create_with_sublist_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) 4)) (not (= |node_create_with_sublist_#res.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} is VALID [2018-11-23 13:01:18,669 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6769#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 |node_create_with_sublist_#res.offset|) (not (= 0 |node_create_with_sublist_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) 4)) (not (= |node_create_with_sublist_#res.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4))) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} {6759#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} #208#return; {6770#(and (= 0 |sll_append_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) 4)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) |sll_append_#t~ret8.offset|)) (= 0 (select |old(#valid)| |sll_append_#t~ret8.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0))) (not (= sll_append_~head.base (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4))) (not (= |sll_append_#t~ret8.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)))) (and (= sll_append_~head.base (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) (not (= 0 |sll_append_#t~ret8.base|)))))} is VALID [2018-11-23 13:01:18,671 INFO L273 TraceCheckUtils]: 45: Hoare triple {6770#(and (= 0 |sll_append_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) 4)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) |sll_append_#t~ret8.offset|)) (= 0 (select |old(#valid)| |sll_append_#t~ret8.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0))) (not (= sll_append_~head.base (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4))) (not (= |sll_append_#t~ret8.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)))) (and (= sll_append_~head.base (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) (not (= 0 |sll_append_#t~ret8.base|)))))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {6771#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (or (= sll_append_~new_last~0.base sll_append_~head.base) (and (or (and (= sll_append_~head.base (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4)) (not (= 0 sll_append_~new_last~0.base))) (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4)) 0)))) (= 0 (select (select (store |#memory_$Pointer$.offset| sll_append_~head.base (store (select |#memory_$Pointer$.offset| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.offset)) sll_append_~new_last~0.base) 4)))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (not (= sll_append_~new_last~0.base sll_append_~head.base))) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 sll_append_~new_last~0.offset))} is VALID [2018-11-23 13:01:18,673 INFO L273 TraceCheckUtils]: 46: Hoare triple {6771#(and (= sll_append_~head.offset |sll_append_#in~head.offset|) (or (= sll_append_~new_last~0.base sll_append_~head.base) (and (or (and (= sll_append_~head.base (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4)) (not (= 0 sll_append_~new_last~0.base))) (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4)) 0)))) (= 0 (select (select (store |#memory_$Pointer$.offset| sll_append_~head.base (store (select |#memory_$Pointer$.offset| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.offset)) sll_append_~new_last~0.base) 4)))) (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (not (= sll_append_~new_last~0.base sll_append_~head.base))) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 sll_append_~new_last~0.offset))} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {6772#(and (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) |sll_append_#in~head.offset|)))))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 13:01:18,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {6772#(and (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) |sll_append_#in~head.offset|)))))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} assume true; {6772#(and (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) |sll_append_#in~head.offset|)))))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} is VALID [2018-11-23 13:01:18,676 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6772#(and (or (= 0 (select |old(#valid)| |sll_append_#in~head.base|)) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (or (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) |sll_append_#in~head.offset|)))))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)))} {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #202#return; {6773#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)))} is VALID [2018-11-23 13:01:18,677 INFO L273 TraceCheckUtils]: 49: Hoare triple {6773#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {6774#(and (= main_~ptr~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) 0))))} is VALID [2018-11-23 13:01:18,678 INFO L273 TraceCheckUtils]: 50: Hoare triple {6774#(and (= main_~ptr~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) 0))))} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {6774#(and (= main_~ptr~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) 0))))} is VALID [2018-11-23 13:01:18,679 INFO L273 TraceCheckUtils]: 51: Hoare triple {6774#(and (= main_~ptr~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) 0))))} assume !(~i~0 > ~max~0); {6774#(and (= main_~ptr~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) 0))))} is VALID [2018-11-23 13:01:18,680 INFO L273 TraceCheckUtils]: 52: Hoare triple {6774#(and (= main_~ptr~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) 0))))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {6775#(and (= 0 |main_#t~mem21.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0))))} is VALID [2018-11-23 13:01:18,681 INFO L256 TraceCheckUtils]: 53: Hoare triple {6775#(and (= 0 |main_#t~mem21.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0))))} call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); {6755#true} is VALID [2018-11-23 13:01:18,681 INFO L273 TraceCheckUtils]: 54: Hoare triple {6755#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {6776#(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:01:18,682 INFO L273 TraceCheckUtils]: 55: Hoare triple {6776#(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~post6 := ~len~0;~len~0 := 1 + #t~post6;havoc #t~post6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {6777#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) 0) sll_length_~head.base) (not (= 0 |sll_length_#in~head.offset|)))} is VALID [2018-11-23 13:01:18,692 INFO L273 TraceCheckUtils]: 56: Hoare triple {6777#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) 0) sll_length_~head.base) (not (= 0 |sll_length_#in~head.offset|)))} assume !(~head.base != 0 || ~head.offset != 0); {6778#(or (not (= 0 |sll_length_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) 0)))} is VALID [2018-11-23 13:01:18,693 INFO L273 TraceCheckUtils]: 57: Hoare triple {6778#(or (not (= 0 |sll_length_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) 0)))} #res := ~len~0; {6778#(or (not (= 0 |sll_length_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) 0)))} is VALID [2018-11-23 13:01:18,693 INFO L273 TraceCheckUtils]: 58: Hoare triple {6778#(or (not (= 0 |sll_length_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) 0)))} assume true; {6778#(or (not (= 0 |sll_length_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) 0)))} is VALID [2018-11-23 13:01:18,694 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6778#(or (not (= 0 |sll_length_#in~head.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) 0)))} {6775#(and (= 0 |main_#t~mem21.offset|) (not (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) 0))))} #204#return; {6756#false} is VALID [2018-11-23 13:01:18,694 INFO L273 TraceCheckUtils]: 60: Hoare triple {6756#false} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~count~0 := #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret22; {6756#false} is VALID [2018-11-23 13:01:18,694 INFO L273 TraceCheckUtils]: 61: Hoare triple {6756#false} assume !(~i~0 == ~count~0); {6756#false} is VALID [2018-11-23 13:01:18,694 INFO L273 TraceCheckUtils]: 62: Hoare triple {6756#false} assume !(3 == ~i~0 && 5 == ~count~0); {6756#false} is VALID [2018-11-23 13:01:18,694 INFO L273 TraceCheckUtils]: 63: Hoare triple {6756#false} assume !(1 + ~i~0 == ~count~0 && ~i~0 < ~max~0); {6756#false} is VALID [2018-11-23 13:01:18,694 INFO L273 TraceCheckUtils]: 64: Hoare triple {6756#false} assume !false; {6756#false} is VALID [2018-11-23 13:01:18,710 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:01:18,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:01:18,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:01:18,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:01:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:01:18,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:01:18,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 13:01:18,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:18,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:18,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 13:01:18,885 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:18,885 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_31|]. (and (= |#valid| (store |v_#valid_31| |main_~#head~1.base| 1)) (= |main_~#head~1.offset| 0)) [2018-11-23 13:01:18,885 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| |main_~#head~1.base|) 1) (= |main_~#head~1.offset| 0)) [2018-11-23 13:01:24,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:01:24,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:01:24,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:24,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:24,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:24,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:36 [2018-11-23 13:01:24,670 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:24,670 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_1, |sll_create_#t~malloc2.base|, |v_#memory_$Pointer$.base_32|, v_sll_create_~head~0.base_5]. (let ((.cse0 (store |old(#valid)| v_prenex_1 1))) (and (= (select (store .cse0 |sll_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= (select |old(#valid)| v_prenex_1) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_32| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_32| sll_create_~head~0.base) 0 v_sll_create_~head~0.base_5))) (= (select .cse0 |sll_create_#t~malloc2.base|) 0) (= 0 sll_create_~head~0.offset) (not (= 0 v_sll_create_~head~0.base_5)))) [2018-11-23 13:01:24,670 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_1, |sll_create_#t~malloc2.base|]. (let ((.cse0 (store |old(#valid)| v_prenex_1 1))) (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0) 0)) (= (select (store .cse0 |sll_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= (select |old(#valid)| v_prenex_1) 0) (= (select .cse0 |sll_create_#t~malloc2.base|) 0) (= 0 sll_create_~head~0.offset))) [2018-11-23 13:01:25,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 13:01:25,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2018-11-23 13:01:25,184 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:25,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 13:01:25,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:25,194 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:25,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:25,235 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:25,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:25,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 40 [2018-11-23 13:01:25,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2018-11-23 13:01:25,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:25,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-11-23 13:01:25,286 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:25,294 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:25,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:25,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:25,336 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:86, output treesize:89 [2018-11-23 13:01:27,387 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:27,388 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_1, |sll_create_#t~malloc2.base|, |v_node_create_with_sublist_#t~ret5.base_5|, |v_#memory_$Pointer$.base_33|, |v_#memory_$Pointer$.offset_32|]. (let ((.cse2 (store |old(#valid)| |node_create_with_sublist_#res.base| 1))) (let ((.cse0 (store .cse2 v_prenex_1 1)) (.cse1 (+ |node_create_with_sublist_#res.offset| 4))) (and (= 0 (select (store .cse0 |sll_create_#t~malloc2.base| 1) |v_node_create_with_sublist_#t~ret5.base_5|)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_33| |node_create_with_sublist_#res.base| (store (store (select |v_#memory_$Pointer$.base_33| |node_create_with_sublist_#res.base|) .cse1 |v_node_create_with_sublist_#t~ret5.base_5|) |node_create_with_sublist_#res.offset| 0))) (= (select .cse0 |sll_create_#t~malloc2.base|) 0) (= (select .cse2 v_prenex_1) 0) (= |node_create_with_sublist_#res.offset| 0) (= (store |v_#memory_$Pointer$.offset_32| |node_create_with_sublist_#res.base| (store (store (select |v_#memory_$Pointer$.offset_32| |node_create_with_sublist_#res.base|) .cse1 0) |node_create_with_sublist_#res.offset| 0)) |#memory_$Pointer$.offset|) (not (= |node_create_with_sublist_#res.base| 0)) (not (= (select (select |v_#memory_$Pointer$.base_33| |v_node_create_with_sublist_#t~ret5.base_5|) 0) 0)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|))))) [2018-11-23 13:01:27,388 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_1, |sll_create_#t~malloc2.base|]. (let ((.cse5 (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|)) (.cse1 (+ |node_create_with_sublist_#res.offset| 4)) (.cse3 (store |old(#valid)| |node_create_with_sublist_#res.base| 1))) (let ((.cse2 (store .cse3 v_prenex_1 1)) (.cse4 (select .cse5 .cse1)) (.cse0 (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|))) (and (= 0 (select .cse0 .cse1)) (= (select .cse2 |sll_create_#t~malloc2.base|) 0) (= (select .cse3 v_prenex_1) 0) (not (= 0 (select (select |#memory_$Pointer$.base| .cse4) 0))) (= |node_create_with_sublist_#res.offset| 0) (= 0 (select .cse5 |node_create_with_sublist_#res.offset|)) (= (select (store .cse2 |sll_create_#t~malloc2.base| 1) .cse4) 0) (not (= |node_create_with_sublist_#res.base| 0)) (= 0 (select .cse0 |node_create_with_sublist_#res.offset|)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|))))) [2018-11-23 13:01:27,742 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:27,744 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:27,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2018-11-23 13:01:27,799 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 72 [2018-11-23 13:01:27,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,819 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,857 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:01:27,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-23 13:01:27,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-23 13:01:27,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:27,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:27,910 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:111, output treesize:105 [2018-11-23 13:01:28,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:28,273 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:28,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 85 [2018-11-23 13:01:28,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-11-23 13:01:28,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:28,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:28,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 59 [2018-11-23 13:01:28,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-23 13:01:28,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-11-23 13:01:28,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 36 [2018-11-23 13:01:28,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 13:01:28,750 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:28,781 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:28,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-23 13:01:28,886 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:102, output treesize:307 [2018-11-23 13:01:30,894 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:30,895 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_35|, sll_append_~new_last~0.base, v_prenex_1, |v_#memory_$Pointer$.offset_34|, |sll_create_#t~malloc2.base|]. (let ((.cse1 (select |v_#memory_$Pointer$.base_35| sll_append_~new_last~0.base)) (.cse0 (store |old(#valid)| sll_append_~new_last~0.base 1))) (let ((.cse2 (select |v_#memory_$Pointer$.offset_34| sll_append_~new_last~0.base)) (.cse3 (store .cse0 v_prenex_1 1)) (.cse4 (select .cse1 4))) (and (= (select .cse0 v_prenex_1) 0) (= (select .cse1 0) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_35| |sll_append_#in~head.base| (store (select |v_#memory_$Pointer$.base_35| |sll_append_#in~head.base|) |sll_append_#in~head.offset| sll_append_~new_last~0.base))) (= (store |v_#memory_$Pointer$.offset_34| |sll_append_#in~head.base| (store (select |v_#memory_$Pointer$.offset_34| |sll_append_#in~head.base|) |sll_append_#in~head.offset| 0)) |#memory_$Pointer$.offset|) (= 0 (select .cse2 0)) (not (= sll_append_~new_last~0.base 0)) (= (select (store .cse3 |sll_create_#t~malloc2.base| 1) .cse4) 0) (= (select .cse2 4) 0) (= (select .cse3 |sll_create_#t~malloc2.base|) 0) (not (= 0 (select (select |v_#memory_$Pointer$.base_35| .cse4) 0))) (= 0 (select |old(#valid)| sll_append_~new_last~0.base))))) [2018-11-23 13:01:30,895 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_1, |sll_create_#t~malloc2.base|, v_prenex_2, v_prenex_6, v_prenex_5, v_prenex_4, v_prenex_3]. (let ((.cse9 (select |#memory_$Pointer$.base| |sll_append_#in~head.base|))) (let ((.cse17 (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|)) (.cse14 (select .cse9 |sll_append_#in~head.offset|))) (let ((.cse0 (= .cse14 |sll_append_#in~head.base|)) (.cse2 (= 0 (select .cse17 4))) (.cse3 (= (select |old(#valid)| |sll_append_#in~head.base|) 0)) (.cse4 (= 0 (select .cse17 0))) (.cse8 (not (= 0 |sll_append_#in~head.base|))) (.cse7 (store |old(#valid)| |sll_append_#in~head.base| 1)) (.cse1 (= (select .cse17 |sll_append_#in~head.offset|) 0))) (or (let ((.cse5 (store .cse7 v_prenex_6 1)) (.cse6 (select .cse9 4))) (and .cse0 .cse1 (= 0 |sll_append_#in~head.offset|) .cse2 .cse3 .cse4 (= (select (store .cse5 v_prenex_5 1) .cse6) 0) (= 0 (select .cse7 v_prenex_6)) (= (select .cse5 v_prenex_5) 0) .cse8 (not (= 0 (select (select |#memory_$Pointer$.base| .cse6) 0))))) (let ((.cse10 (store .cse7 v_prenex_1 1))) (and (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) .cse0 .cse1 (= (select .cse9 0) 0) .cse2 .cse3 .cse4 (= 0 (select .cse7 v_prenex_1)) (= (select .cse10 |sll_create_#t~malloc2.base|) 0) .cse8 (= 0 (select (store .cse10 |sll_create_#t~malloc2.base| 1) v_prenex_2)) (= 4 |sll_append_#in~head.offset|))) (let ((.cse16 (select |#memory_$Pointer$.base| .cse14)) (.cse15 (store |old(#valid)| .cse14 1))) (let ((.cse11 (store .cse15 v_prenex_4 1)) (.cse12 (select .cse16 4)) (.cse13 (select |#memory_$Pointer$.offset| .cse14))) (and (= (select .cse11 v_prenex_3) 0) (not (= 0 (select (select |#memory_$Pointer$.base| .cse12) 0))) .cse1 (= 0 (select .cse13 4)) (= 0 (select (store .cse11 v_prenex_3 1) .cse12)) (not (= 0 .cse14)) (= (select .cse15 v_prenex_4) 0) (= (select .cse13 0) 0) (= (select .cse16 0) 0) (= (select |old(#valid)| .cse14) 0)))))))) [2018-11-23 13:01:31,309 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-11-23 13:01:31,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 75 [2018-11-23 13:01:31,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,744 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,745 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 83 [2018-11-23 13:01:31,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,830 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:31,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 89 [2018-11-23 13:01:31,834 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:31,853 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:31,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:31,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:31,910 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 10 variables, input treesize:317, output treesize:80 [2018-11-23 13:01:33,893 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:33,893 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_24|, v_prenex_1, |sll_create_#t~malloc2.base|, v_prenex_2, v_prenex_7, v_prenex_6, v_prenex_5, v_prenex_8, v_prenex_4, v_prenex_3]. (let ((.cse7 (select |#memory_$Pointer$.base| |main_~#head~1.base|))) (let ((.cse16 (select .cse7 |main_~#head~1.offset|)) (.cse15 (select |#memory_$Pointer$.offset| |main_~#head~1.base|))) (let ((.cse1 (= (select .cse15 4) 0)) (.cse6 (= (select .cse15 0) 0)) (.cse2 (not (= |main_~#head~1.base| 0))) (.cse3 (= |main_~#head~1.base| .cse16)) (.cse5 (= 0 |main_~#head~1.offset|))) (or (let ((.cse8 (store |v_old(#valid)_AFTER_CALL_24| |main_~#head~1.base| 1))) (let ((.cse4 (store .cse8 v_prenex_1 1)) (.cse0 (select |v_old(#valid)_AFTER_CALL_24| |main_~#head~1.base|))) (and (= 0 .cse0) .cse1 .cse2 .cse3 (= |main_~#head~1.offset| 4) (= 0 (select (store .cse4 |sll_create_#t~malloc2.base| 1) v_prenex_2)) .cse5 (= (select .cse4 |sll_create_#t~malloc2.base|) 0) (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) .cse6 (= (select .cse7 0) 0) (= 0 (select .cse8 v_prenex_1)) (= 1 .cse0)))) (let ((.cse12 (store v_prenex_7 |main_~#head~1.base| 1))) (let ((.cse10 (select v_prenex_7 |main_~#head~1.base|)) (.cse9 (store .cse12 v_prenex_6 1)) (.cse11 (select .cse7 4))) (and .cse1 .cse6 (= 0 (select .cse9 v_prenex_5)) .cse2 .cse3 (= 0 .cse10) (= 1 .cse10) (not (= (select (select |#memory_$Pointer$.base| .cse11) 0) 0)) (= 0 (select .cse12 v_prenex_6)) (= |main_~#head~1.offset| 0) (= 0 (select (store .cse9 v_prenex_5 1) .cse11)) .cse5))) (let ((.cse17 (store v_prenex_8 .cse16 1)) (.cse19 (select |#memory_$Pointer$.base| .cse16))) (let ((.cse14 (select .cse19 4)) (.cse13 (store .cse17 v_prenex_4 1)) (.cse18 (select |#memory_$Pointer$.offset| .cse16))) (and (= 0 (select (store .cse13 v_prenex_3 1) .cse14)) (= (select .cse15 |main_~#head~1.offset|) 0) (not (= 0 .cse16)) (= 0 (select .cse17 v_prenex_4)) (= 0 (select v_prenex_8 .cse16)) (= (select .cse18 4) 0) (not (= (select (select |#memory_$Pointer$.base| .cse14) 0) 0)) (= 0 (select .cse13 v_prenex_3)) (= 0 (select .cse19 0)) (= 1 (select v_prenex_8 |main_~#head~1.base|)) (= (select .cse18 0) 0) .cse5))))))) [2018-11-23 13:01:33,893 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (let ((.cse3 (select |#memory_$Pointer$.base| .cse1))) (let ((.cse0 (select .cse3 4)) (.cse2 (select |#memory_$Pointer$.offset| .cse1))) (and (not (= |main_~#head~1.base| .cse0)) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|) 0) (not (= 0 .cse1)) (= (select .cse2 4) 0) (not (= (select (select |#memory_$Pointer$.base| .cse0) 0) 0)) (= 0 (select .cse3 0)) (= 0 |main_~#head~1.offset|) (= (select .cse2 0) 0))))) [2018-11-23 13:01:34,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 13:01:34,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 48 [2018-11-23 13:01:34,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 17 [2018-11-23 13:01:34,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:34,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-11-23 13:01:34,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:01:34,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:01:34,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:01:34,232 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:111, output treesize:62 [2018-11-23 13:01:34,237 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:01:34,237 WARN L384 uantifierElimination]: Input elimination task: ∃ [|main_~#head~1.base|, |#memory_$Pointer$.offset|]. (let ((.cse3 (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0)) (.cse1 (select |#memory_$Pointer$.base| .cse3))) (let ((.cse2 (select .cse1 4)) (.cse4 (+ .cse0 4)) (.cse5 (select |#memory_$Pointer$.offset| .cse3))) (and (= .cse0 0) (= (select .cse1 0) 0) (not (= .cse2 |main_~#head~1.base|)) (not (= .cse3 0)) (not (= (select (select |#memory_$Pointer$.base| .cse2) 0) 0)) (= |main_#t~mem21.base| (select .cse1 .cse4)) (= 0 (select .cse5 4)) (= (select .cse5 .cse4) |main_#t~mem21.offset|) (= (select .cse5 0) 0))))) [2018-11-23 13:01:34,237 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#head~1.base|]. (let ((.cse2 (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0))) (let ((.cse1 (select |#memory_$Pointer$.base| .cse2))) (let ((.cse0 (select .cse1 4))) (and (= .cse0 |main_#t~mem21.base|) (= (select .cse1 0) 0) (not (= .cse0 |main_~#head~1.base|)) (not (= .cse2 0)) (not (= (select (select |#memory_$Pointer$.base| .cse0) 0) 0)) (= |main_#t~mem21.offset| 0))))) [2018-11-23 13:01:34,674 INFO L256 TraceCheckUtils]: 0: Hoare triple {6755#true} call ULTIMATE.init(); {6755#true} is VALID [2018-11-23 13:01:34,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {6755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6755#true} is VALID [2018-11-23 13:01:34,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {6755#true} assume true; {6755#true} is VALID [2018-11-23 13:01:34,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6755#true} {6755#true} #212#return; {6755#true} is VALID [2018-11-23 13:01:34,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {6755#true} call #t~ret26 := main(); {6755#true} is VALID [2018-11-23 13:01:34,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {6755#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~short18 := ~j~0 < 10; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~short18 := ~j~0 < 10; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,681 INFO L273 TraceCheckUtils]: 13: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,681 INFO L273 TraceCheckUtils]: 14: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,720 INFO L273 TraceCheckUtils]: 17: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~short18 := ~j~0 < 10; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,721 INFO L273 TraceCheckUtils]: 19: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,721 INFO L273 TraceCheckUtils]: 20: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,738 INFO L273 TraceCheckUtils]: 21: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !(~i~0 <= ~max~0); {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:01:34,753 INFO L256 TraceCheckUtils]: 22: Hoare triple {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {6758#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:34,761 INFO L273 TraceCheckUtils]: 23: Hoare triple {6758#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {6759#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:01:34,775 INFO L256 TraceCheckUtils]: 24: Hoare triple {6759#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {6758#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:34,784 INFO L273 TraceCheckUtils]: 25: Hoare triple {6758#(= |#valid| |old(#valid)|)} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {6857#(and (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) 0) (= node_create_with_sublist_~new_node~0.offset 0) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1)))} is VALID [2018-11-23 13:01:34,794 INFO L273 TraceCheckUtils]: 26: Hoare triple {6857#(and (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) 0) (= node_create_with_sublist_~new_node~0.offset 0) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1)))} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {6861#(and (not (= node_create_with_sublist_~new_node~0.base 0)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) 0) (= node_create_with_sublist_~new_node~0.offset 0) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1)))} is VALID [2018-11-23 13:01:34,797 INFO L256 TraceCheckUtils]: 27: Hoare triple {6861#(and (not (= node_create_with_sublist_~new_node~0.base 0)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) 0) (= node_create_with_sublist_~new_node~0.offset 0) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1)))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {6758#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:34,797 INFO L273 TraceCheckUtils]: 28: Hoare triple {6758#(= |#valid| |old(#valid)|)} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {6758#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:01:34,798 INFO L273 TraceCheckUtils]: 29: Hoare triple {6758#(= |#valid| |old(#valid)|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6871#(exists ((|sll_create_#t~malloc2.base| Int)) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 13:01:34,798 INFO L273 TraceCheckUtils]: 30: Hoare triple {6871#(exists ((|sll_create_#t~malloc2.base| Int)) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) 0)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6871#(exists ((|sll_create_#t~malloc2.base| Int)) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 13:01:34,799 INFO L273 TraceCheckUtils]: 31: Hoare triple {6871#(exists ((|sll_create_#t~malloc2.base| Int)) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) 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; {6871#(exists ((|sll_create_#t~malloc2.base| Int)) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) 0)))} is VALID [2018-11-23 13:01:34,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {6871#(exists ((|sll_create_#t~malloc2.base| Int)) (and (= |#valid| (store |old(#valid)| |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) 0)))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6881#(and (= sll_create_~new_head~0.offset 0) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))))} is VALID [2018-11-23 13:01:34,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {6881#(and (= sll_create_~new_head~0.offset 0) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6885#(and (not (= 0 sll_create_~new_head~0.base)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))))} is VALID [2018-11-23 13:01:34,801 INFO L273 TraceCheckUtils]: 34: Hoare triple {6885#(and (not (= 0 sll_create_~new_head~0.base)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 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; {6889#(and (not (= sll_create_~head~0.base 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))))} is VALID [2018-11-23 13:01:34,803 INFO L273 TraceCheckUtils]: 35: Hoare triple {6889#(and (not (= sll_create_~head~0.base 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= |#valid| (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1)) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {6893#(and (not (= sll_create_~head~0.base 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) sll_create_~new_head~0.base) 0))) (= sll_create_~new_head~0.offset 0))} is VALID [2018-11-23 13:01:34,804 INFO L273 TraceCheckUtils]: 36: Hoare triple {6893#(and (not (= sll_create_~head~0.base 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) sll_create_~new_head~0.base) 0))) (= sll_create_~new_head~0.offset 0))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {6893#(and (not (= sll_create_~head~0.base 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) sll_create_~new_head~0.base) 0))) (= sll_create_~new_head~0.offset 0))} is VALID [2018-11-23 13:01:34,806 INFO L273 TraceCheckUtils]: 37: Hoare triple {6893#(and (not (= sll_create_~head~0.base 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) sll_create_~new_head~0.base) 0))) (= sll_create_~new_head~0.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; {6900#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0) 0)) (= 0 sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))))} is VALID [2018-11-23 13:01:34,807 INFO L273 TraceCheckUtils]: 38: Hoare triple {6900#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0) 0)) (= 0 sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))))} assume !(~len > 0); {6900#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0) 0)) (= 0 sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))))} is VALID [2018-11-23 13:01:34,809 INFO L273 TraceCheckUtils]: 39: Hoare triple {6900#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0) 0)) (= 0 sll_create_~head~0.offset) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) sll_create_~head~0.base) 0) (= (select |old(#valid)| v_prenex_1) 0) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6907#(and (= |sll_create_#res.offset| 0) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select |old(#valid)| v_prenex_1) 0) (= 0 (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) |sll_create_#res.base|)) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0) 0)))} is VALID [2018-11-23 13:01:34,810 INFO L273 TraceCheckUtils]: 40: Hoare triple {6907#(and (= |sll_create_#res.offset| 0) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select |old(#valid)| v_prenex_1) 0) (= 0 (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) |sll_create_#res.base|)) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0) 0)))} assume true; {6907#(and (= |sll_create_#res.offset| 0) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select |old(#valid)| v_prenex_1) 0) (= 0 (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) |sll_create_#res.base|)) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0) 0)))} is VALID [2018-11-23 13:01:34,813 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {6907#(and (= |sll_create_#res.offset| 0) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select |old(#valid)| v_prenex_1) 0) (= 0 (select (store (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base| 1) |sll_create_#res.base|)) (= (select (store |old(#valid)| v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))) (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0) 0)))} {6861#(and (not (= node_create_with_sublist_~new_node~0.base 0)) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) 0) (= node_create_with_sublist_~new_node~0.offset 0) (= |#valid| (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1)))} #218#return; {6914#(and (not (= node_create_with_sublist_~new_node~0.base 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1) v_prenex_1 1) |sll_create_#t~malloc2.base|)) (= 0 (select (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1) v_prenex_1)) (= 0 (select (store (store (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) |node_create_with_sublist_#t~ret5.base|)))) (= 0 |node_create_with_sublist_#t~ret5.offset|) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) 0) (= node_create_with_sublist_~new_node~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#t~ret5.base|) 0))))} is VALID [2018-11-23 13:01:34,816 INFO L273 TraceCheckUtils]: 42: Hoare triple {6914#(and (not (= node_create_with_sublist_~new_node~0.base 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1) v_prenex_1 1) |sll_create_#t~malloc2.base|)) (= 0 (select (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1) v_prenex_1)) (= 0 (select (store (store (store |old(#valid)| node_create_with_sublist_~new_node~0.base 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) |node_create_with_sublist_#t~ret5.base|)))) (= 0 |node_create_with_sublist_#t~ret5.offset|) (= (select |old(#valid)| node_create_with_sublist_~new_node~0.base) 0) (= node_create_with_sublist_~new_node~0.offset 0) (not (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#t~ret5.base|) 0))))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {6918#(and (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) 0))) (= |node_create_with_sublist_#res.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= (select (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1) 0) (= (select (store (store (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) 0))) (not (= |node_create_with_sublist_#res.base| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} is VALID [2018-11-23 13:01:34,818 INFO L273 TraceCheckUtils]: 43: Hoare triple {6918#(and (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) 0))) (= |node_create_with_sublist_#res.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= (select (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1) 0) (= (select (store (store (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) 0))) (not (= |node_create_with_sublist_#res.base| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} assume true; {6918#(and (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) 0))) (= |node_create_with_sublist_#res.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= (select (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1) 0) (= (select (store (store (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) 0))) (not (= |node_create_with_sublist_#res.base| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} is VALID [2018-11-23 13:01:34,822 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {6918#(and (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) 0))) (= |node_create_with_sublist_#res.offset| 0) (= 0 (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= (select (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1) 0) (= (select (store (store (store |old(#valid)| |node_create_with_sublist_#res.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) (+ |node_create_with_sublist_#res.offset| 4))) 0))) (not (= |node_create_with_sublist_#res.base| 0)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)) (= 0 (select |old(#valid)| |node_create_with_sublist_#res.base|)))} {6759#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} #208#return; {6925#(and (= 0 |sll_append_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |sll_append_#t~ret8.base| 1) v_prenex_1)) (= 0 (select (store (store |old(#valid)| |sll_append_#t~ret8.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|)) (= 0 (select (store (store (store |old(#valid)| |sll_append_#t~ret8.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4))))) (= 0 (select |old(#valid)| |sll_append_#t~ret8.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (not (= 0 |sll_append_#t~ret8.base|)) (= (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) 0) 0))} is VALID [2018-11-23 13:01:34,824 INFO L273 TraceCheckUtils]: 45: Hoare triple {6925#(and (= 0 |sll_append_#t~ret8.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0))) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 0)) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= 0 (select (store |old(#valid)| |sll_append_#t~ret8.base| 1) v_prenex_1)) (= 0 (select (store (store |old(#valid)| |sll_append_#t~ret8.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|)) (= 0 (select (store (store (store |old(#valid)| |sll_append_#t~ret8.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4))))) (= 0 (select |old(#valid)| |sll_append_#t~ret8.base|)) (= sll_append_~head.base |sll_append_#in~head.base|) (not (= 0 |sll_append_#t~ret8.base|)) (= (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) 0) 0))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {6929#(and (= (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) 4)) 0) 0)) (not (= sll_append_~new_last~0.base 0)) (= (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) 4) 0) (= sll_append_~new_last~0.offset 0) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) sll_append_~new_last~0.offset)) (= sll_append_~head.base |sll_append_#in~head.base|) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store |old(#valid)| sll_append_~new_last~0.base 1) v_prenex_1) 0) (= (select (store (store (store |old(#valid)| sll_append_~new_last~0.base 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) 4)) 0) (= (select (store (store |old(#valid)| sll_append_~new_last~0.base 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))) (= 0 (select |old(#valid)| sll_append_~new_last~0.base)))} is VALID [2018-11-23 13:01:34,834 INFO L273 TraceCheckUtils]: 46: Hoare triple {6929#(and (= (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) sll_append_~new_last~0.offset) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) 4)) 0) 0)) (not (= sll_append_~new_last~0.base 0)) (= (select (select |#memory_$Pointer$.offset| sll_append_~new_last~0.base) 4) 0) (= sll_append_~new_last~0.offset 0) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) sll_append_~new_last~0.offset)) (= sll_append_~head.base |sll_append_#in~head.base|) (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_1 Int)) (and (= (select (store |old(#valid)| sll_append_~new_last~0.base 1) v_prenex_1) 0) (= (select (store (store (store |old(#valid)| sll_append_~new_last~0.base 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) (select (select |#memory_$Pointer$.base| sll_append_~new_last~0.base) 4)) 0) (= (select (store (store |old(#valid)| sll_append_~new_last~0.base 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0))) (= 0 (select |old(#valid)| sll_append_~new_last~0.base)))} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {6933#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (= 0 (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4 1) v_prenex_3 1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4))) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4) 0) (= (select (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4 1) v_prenex_3) 0))) (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0) 0) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)) (and (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 |sll_append_#in~head.offset|) (= (select |old(#valid)| |sll_append_#in~head.base|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 0)) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (= 0 (select (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6)) (= (select (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6 1) v_prenex_5) 0) (= (select (store (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6 1) v_prenex_5 1) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 4)) 0))) (not (= 0 |sll_append_#in~head.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 4)) 0)))) (and (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) (= 0 (select (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1)) (= (select (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= 0 (select (store (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) v_prenex_2)))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 0) 0) (= (select |old(#valid)| |sll_append_#in~head.base|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 0)) (not (= 0 |sll_append_#in~head.base|)) (= 4 |sll_append_#in~head.offset|)))} is VALID [2018-11-23 13:01:34,835 INFO L273 TraceCheckUtils]: 47: Hoare triple {6933#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (= 0 (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4 1) v_prenex_3 1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4))) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4) 0) (= (select (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4 1) v_prenex_3) 0))) (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0) 0) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)) (and (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 |sll_append_#in~head.offset|) (= (select |old(#valid)| |sll_append_#in~head.base|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 0)) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (= 0 (select (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6)) (= (select (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6 1) v_prenex_5) 0) (= (select (store (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6 1) v_prenex_5 1) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 4)) 0))) (not (= 0 |sll_append_#in~head.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 4)) 0)))) (and (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) (= 0 (select (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1)) (= (select (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= 0 (select (store (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) v_prenex_2)))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 0) 0) (= (select |old(#valid)| |sll_append_#in~head.base|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 0)) (not (= 0 |sll_append_#in~head.base|)) (= 4 |sll_append_#in~head.offset|)))} assume true; {6933#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (= 0 (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4 1) v_prenex_3 1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4))) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4) 0) (= (select (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4 1) v_prenex_3) 0))) (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0) 0) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)) (and (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 |sll_append_#in~head.offset|) (= (select |old(#valid)| |sll_append_#in~head.base|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 0)) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (= 0 (select (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6)) (= (select (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6 1) v_prenex_5) 0) (= (select (store (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6 1) v_prenex_5 1) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 4)) 0))) (not (= 0 |sll_append_#in~head.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 4)) 0)))) (and (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) (= 0 (select (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1)) (= (select (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= 0 (select (store (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) v_prenex_2)))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 0) 0) (= (select |old(#valid)| |sll_append_#in~head.base|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 0)) (not (= 0 |sll_append_#in~head.base|)) (= 4 |sll_append_#in~head.offset|)))} is VALID [2018-11-23 13:01:34,838 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {6933#(or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0))) (exists ((v_prenex_4 Int) (v_prenex_3 Int)) (and (= 0 (select (store (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4 1) v_prenex_3 1) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4))) (= (select (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4) 0) (= (select (store (store |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 1) v_prenex_4 1) v_prenex_3) 0))) (= (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0) 0) (= (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 0)) (and (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= 0 |sll_append_#in~head.offset|) (= (select |old(#valid)| |sll_append_#in~head.base|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 0)) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (= 0 (select (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6)) (= (select (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6 1) v_prenex_5) 0) (= (select (store (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_6 1) v_prenex_5 1) (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 4)) 0))) (not (= 0 |sll_append_#in~head.base|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 4)) 0)))) (and (exists ((|sll_create_#t~malloc2.base| Int) (v_prenex_2 Int) (v_prenex_1 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| v_prenex_2) 0))) (= 0 (select (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1)) (= (select (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base|) 0) (= 0 (select (store (store (store |old(#valid)| |sll_append_#in~head.base| 1) v_prenex_1 1) |sll_create_#t~malloc2.base| 1) v_prenex_2)))) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|) |sll_append_#in~head.base|) (= (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) 0) 0) (= (select |old(#valid)| |sll_append_#in~head.base|) 0) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) 0)) (not (= 0 |sll_append_#in~head.base|)) (= 4 |sll_append_#in~head.offset|)))} {6757#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #202#return; {6940#(and (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|) 0) (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) 0) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 0)) (= 0 |main_~#head~1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 0) 0))} is VALID [2018-11-23 13:01:34,839 INFO L273 TraceCheckUtils]: 49: Hoare triple {6940#(and (not (= |main_~#head~1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4))) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|) 0) (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) 0) 0)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 0)) (= 0 |main_~#head~1.offset|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 0) 0))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {6944#(exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) main_~ptr~0.base) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) (= main_~ptr~0.offset (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0)))} is VALID [2018-11-23 13:01:34,840 INFO L273 TraceCheckUtils]: 50: Hoare triple {6944#(exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) main_~ptr~0.base) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) (= main_~ptr~0.offset (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0)))} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {6944#(exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) main_~ptr~0.base) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) (= main_~ptr~0.offset (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0)))} is VALID [2018-11-23 13:01:34,840 INFO L273 TraceCheckUtils]: 51: Hoare triple {6944#(exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) main_~ptr~0.base) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) (= main_~ptr~0.offset (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0)))} assume !(~i~0 > ~max~0); {6944#(exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) main_~ptr~0.base) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) (= main_~ptr~0.offset (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0)))} is VALID [2018-11-23 13:01:34,842 INFO L273 TraceCheckUtils]: 52: Hoare triple {6944#(exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) main_~ptr~0.base) (= (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) (= main_~ptr~0.offset (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0)))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {6954#(and (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_#t~mem21.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))) (= |main_#t~mem21.offset| 0))} is VALID [2018-11-23 13:01:34,843 INFO L256 TraceCheckUtils]: 53: Hoare triple {6954#(and (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_#t~mem21.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))) (= |main_#t~mem21.offset| 0))} call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); {6958#(exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0))))} is VALID [2018-11-23 13:01:34,844 INFO L273 TraceCheckUtils]: 54: Hoare triple {6958#(exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {6962#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} is VALID [2018-11-23 13:01:34,845 INFO L273 TraceCheckUtils]: 55: Hoare triple {6962#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= |sll_length_#in~head.base| sll_length_~head.base) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post6 := ~len~0;~len~0 := 1 + #t~post6;havoc #t~post6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {6966#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} is VALID [2018-11-23 13:01:34,846 INFO L273 TraceCheckUtils]: 56: Hoare triple {6966#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} assume !(~head.base != 0 || ~head.offset != 0); {6970#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} is VALID [2018-11-23 13:01:34,847 INFO L273 TraceCheckUtils]: 57: Hoare triple {6970#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} #res := ~len~0; {6970#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} is VALID [2018-11-23 13:01:34,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {6970#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} assume true; {6970#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} is VALID [2018-11-23 13:01:34,850 INFO L268 TraceCheckUtils]: 59: Hoare quadruple {6970#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) 0) (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))))} {6954#(and (exists ((|main_~#head~1.base| Int)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_#t~mem21.base|) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 0) 0) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4) |main_~#head~1.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) 0)) 4)) 0) 0)))) (= |main_#t~mem21.offset| 0))} #204#return; {6756#false} is VALID [2018-11-23 13:01:34,850 INFO L273 TraceCheckUtils]: 60: Hoare triple {6756#false} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~count~0 := #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret22; {6756#false} is VALID [2018-11-23 13:01:34,850 INFO L273 TraceCheckUtils]: 61: Hoare triple {6756#false} assume !(~i~0 == ~count~0); {6756#false} is VALID [2018-11-23 13:01:34,850 INFO L273 TraceCheckUtils]: 62: Hoare triple {6756#false} assume !(3 == ~i~0 && 5 == ~count~0); {6756#false} is VALID [2018-11-23 13:01:34,850 INFO L273 TraceCheckUtils]: 63: Hoare triple {6756#false} assume !(1 + ~i~0 == ~count~0 && ~i~0 < ~max~0); {6756#false} is VALID [2018-11-23 13:01:34,851 INFO L273 TraceCheckUtils]: 64: Hoare triple {6756#false} assume !false; {6756#false} is VALID [2018-11-23 13:01:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 12 refuted. 1 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:01:34,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:01:34,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26] total 45 [2018-11-23 13:01:34,907 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 65 [2018-11-23 13:01:34,908 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:01:34,908 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 13:01:35,147 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:01:35,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 13:01:35,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 13:01:35,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1851, Unknown=10, NotChecked=0, Total=1980 [2018-11-23 13:01:35,148 INFO L87 Difference]: Start difference. First operand 158 states and 212 transitions. Second operand 45 states. [2018-11-23 13:01:43,082 WARN L180 SmtUtils]: Spent 675.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2018-11-23 13:02:00,800 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification. DAG size of input: 66 DAG size of output: 46 [2018-11-23 13:03:04,891 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-11-23 13:04:03,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:03,506 INFO L93 Difference]: Finished difference Result 434 states and 686 transitions. [2018-11-23 13:04:03,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 13:04:03,507 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 65 [2018-11-23 13:04:03,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:03,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:04:03,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 345 transitions. [2018-11-23 13:04:03,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:04:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 345 transitions. [2018-11-23 13:04:03,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 345 transitions. [2018-11-23 13:04:04,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:04,209 INFO L225 Difference]: With dead ends: 434 [2018-11-23 13:04:04,209 INFO L226 Difference]: Without dead ends: 398 [2018-11-23 13:04:04,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=328, Invalid=5063, Unknown=11, NotChecked=0, Total=5402 [2018-11-23 13:04:04,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-11-23 13:04:05,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 298. [2018-11-23 13:04:05,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:05,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 398 states. Second operand 298 states. [2018-11-23 13:04:05,082 INFO L74 IsIncluded]: Start isIncluded. First operand 398 states. Second operand 298 states. [2018-11-23 13:04:05,082 INFO L87 Difference]: Start difference. First operand 398 states. Second operand 298 states. [2018-11-23 13:04:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:05,106 INFO L93 Difference]: Finished difference Result 398 states and 636 transitions. [2018-11-23 13:04:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 636 transitions. [2018-11-23 13:04:05,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:05,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:05,110 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states. Second operand 398 states. [2018-11-23 13:04:05,110 INFO L87 Difference]: Start difference. First operand 298 states. Second operand 398 states. [2018-11-23 13:04:05,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:05,131 INFO L93 Difference]: Finished difference Result 398 states and 636 transitions. [2018-11-23 13:04:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 636 transitions. [2018-11-23 13:04:05,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:05,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:05,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:05,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:05,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-23 13:04:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 433 transitions. [2018-11-23 13:04:05,146 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 433 transitions. Word has length 65 [2018-11-23 13:04:05,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:05,146 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 433 transitions. [2018-11-23 13:04:05,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 13:04:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 433 transitions. [2018-11-23 13:04:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 13:04:05,148 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:05,148 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:05,149 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:05,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:05,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1986311915, now seen corresponding path program 2 times [2018-11-23 13:04:05,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:05,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:05,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:05,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:05,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:05,664 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-11-23 13:04:07,215 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-11-23 13:04:08,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {8843#true} call ULTIMATE.init(); {8843#true} is VALID [2018-11-23 13:04:08,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {8843#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8843#true} is VALID [2018-11-23 13:04:08,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {8843#true} assume true; {8843#true} is VALID [2018-11-23 13:04:08,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8843#true} {8843#true} #212#return; {8843#true} is VALID [2018-11-23 13:04:08,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {8843#true} call #t~ret26 := main(); {8843#true} is VALID [2018-11-23 13:04:08,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {8843#true} ~min~0 := 3;~max~0 := 5;havoc ~i~0;havoc ~j~0;call ~#head~1.base, ~#head~1.offset := #Ultimate.alloc(4);call write~init~$Pointer$(0, 0, ~#head~1.base, ~#head~1.offset, 4);~i~0 := ~min~0; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,013 INFO L273 TraceCheckUtils]: 6: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~short18 := ~j~0 < 10; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,014 INFO L273 TraceCheckUtils]: 8: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,015 INFO L273 TraceCheckUtils]: 9: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,016 INFO L273 TraceCheckUtils]: 11: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~short18 := ~j~0 < 10; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !!(~i~0 <= ~max~0);~j~0 := 0; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,020 INFO L273 TraceCheckUtils]: 17: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~short18 := ~j~0 < 10; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume #t~short18;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;#t~short18 := 0 != #t~nondet17; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,022 INFO L273 TraceCheckUtils]: 19: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !#t~short18;havoc #t~short18;havoc #t~nondet17; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #t~post15 := ~i~0;~i~0 := 1 + #t~post15;havoc #t~post15; {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,023 INFO L273 TraceCheckUtils]: 21: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} assume !(~i~0 <= ~max~0); {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} is VALID [2018-11-23 13:04:08,024 INFO L256 TraceCheckUtils]: 22: Hoare triple {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} call sll_append(~#head~1.base, ~#head~1.offset, ~min~0); {8846#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:04:08,025 INFO L273 TraceCheckUtils]: 23: Hoare triple {8846#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~sublist_length := #in~sublist_length; {8847#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} is VALID [2018-11-23 13:04:08,026 INFO L256 TraceCheckUtils]: 24: Hoare triple {8847#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} call #t~ret8.base, #t~ret8.offset := node_create_with_sublist(~sublist_length); {8846#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:04:08,027 INFO L273 TraceCheckUtils]: 25: Hoare triple {8846#(= |#valid| |old(#valid)|)} ~sublist_length := #in~sublist_length;call #t~malloc4.base, #t~malloc4.offset := #Ultimate.alloc(8);~new_node~0.base, ~new_node~0.offset := #t~malloc4.base, #t~malloc4.offset; {8848#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} is VALID [2018-11-23 13:04:08,028 INFO L273 TraceCheckUtils]: 26: Hoare triple {8848#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} assume !(0 == ~new_node~0.base && 0 == ~new_node~0.offset); {8848#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} is VALID [2018-11-23 13:04:08,029 INFO L256 TraceCheckUtils]: 27: Hoare triple {8848#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} call #t~ret5.base, #t~ret5.offset := sll_create(~sublist_length); {8846#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:04:08,029 INFO L273 TraceCheckUtils]: 28: Hoare triple {8846#(= |#valid| |old(#valid)|)} ~len := #in~len;~head~0.base, ~head~0.offset := 0, 0; {8846#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 13:04:08,031 INFO L273 TraceCheckUtils]: 29: Hoare triple {8846#(= |#valid| |old(#valid)|)} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {8849#(and (not (= 0 sll_create_~new_head~0.base)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:04:08,032 INFO L273 TraceCheckUtils]: 30: Hoare triple {8849#(and (not (= 0 sll_create_~new_head~0.base)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {8849#(and (not (= 0 sll_create_~new_head~0.base)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:04:08,033 INFO L273 TraceCheckUtils]: 31: Hoare triple {8849#(and (not (= 0 sll_create_~new_head~0.base)) (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} 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; {8850#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} is VALID [2018-11-23 13:04:08,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {8850#(and (or (= |#valid| |old(#valid)|) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (not (= 0 sll_create_~head~0.base)) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|)))))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {8851#(and (not (= 0 sll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| sll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:04:08,038 INFO L273 TraceCheckUtils]: 33: Hoare triple {8851#(and (not (= 0 sll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| sll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|))) (not (= 0 sll_create_~head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {8851#(and (not (= 0 sll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| sll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|))) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:04:08,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {8851#(and (not (= 0 sll_create_~new_head~0.base)) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (= (select |#valid| sll_create_~new_head~0.base) 1) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|))) (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; {8852#(and (= (select |#valid| sll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 sll_create_~head~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:04:08,043 INFO L273 TraceCheckUtils]: 35: Hoare triple {8852#(and (= (select |#valid| sll_create_~head~0.base) 1) (= |#valid| (store (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|) (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (or (= 0 (select |old(#valid)| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|))) (= (select |#valid| (@diff (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))) |#valid|)) 1) (= |#valid| (store |old(#valid)| (@diff |old(#valid)| |#valid|) (select |#valid| (@diff |old(#valid)| |#valid|))))) (= 0 sll_create_~head~0.offset) (or (= (select |#valid| (@diff |old(#valid)| |#valid|)) 1) (= 0 (select |old(#valid)| (@diff |old(#valid)| |#valid|)))) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} assume !!(~len > 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~new_head~0.base, ~new_head~0.offset := #t~malloc2.base, #t~malloc2.offset; {8853#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:04:08,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {8853#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} assume !(0 == ~new_head~0.base && 0 == ~new_head~0.offset); {8853#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (not (= 0 sll_create_~head~0.base)))} is VALID [2018-11-23 13:04:08,044 INFO L273 TraceCheckUtils]: 37: Hoare triple {8853#(and (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select |old(#valid)| sll_create_~new_head~0.base)) (= 0 sll_create_~new_head~0.offset) (= 0 (select |old(#valid)| sll_create_~head~0.base)) (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; {8854#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:04:08,045 INFO L273 TraceCheckUtils]: 38: Hoare triple {8854#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} assume !(~len > 0); {8854#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} is VALID [2018-11-23 13:04:08,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {8854#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) sll_create_~head~0.offset))) (not (= 0 (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0))) (= 0 sll_create_~head~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) sll_create_~head~0.offset)) (= 0 (select |old(#valid)| sll_create_~head~0.base)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {8855#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0))) (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|))))} is VALID [2018-11-23 13:04:08,048 INFO L273 TraceCheckUtils]: 40: Hoare triple {8855#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0))) (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|))))} assume true; {8855#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0))) (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|))))} is VALID [2018-11-23 13:04:08,050 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {8855#(and (not (= 0 (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) 0))) (= 0 (select |old(#valid)| |sll_create_#res.base|)) (= 0 |sll_create_#res.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) |sll_create_#res.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|)) 0))) (= 0 (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) |sll_create_#res.offset|))))} {8848#(and (= 0 node_create_with_sublist_~new_node~0.offset) (= 0 (select |old(#valid)| node_create_with_sublist_~new_node~0.base)) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= (select |#valid| node_create_with_sublist_~new_node~0.base) 1))} #218#return; {8856#(and (= 0 node_create_with_sublist_~new_node~0.offset) (not (= 0 (select (select (store |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.base|) node_create_with_sublist_~new_node~0.offset 0)) (select (select (store |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.base|) node_create_with_sublist_~new_node~0.offset 0)) |node_create_with_sublist_#t~ret5.base|) |node_create_with_sublist_#t~ret5.offset|)) 0))) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= 0 |node_create_with_sublist_#t~ret5.offset|) (= 0 (select (select (store |#memory_$Pointer$.offset| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.offset| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.offset|) node_create_with_sublist_~new_node~0.offset 0)) |node_create_with_sublist_#t~ret5.base|) |node_create_with_sublist_#t~ret5.offset|)) (not (= 1 (select |old(#valid)| node_create_with_sublist_~new_node~0.base))) (not (= 0 (select (select (store |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.base|) node_create_with_sublist_~new_node~0.offset 0)) |node_create_with_sublist_#t~ret5.base|) 0))))} is VALID [2018-11-23 13:04:08,052 INFO L273 TraceCheckUtils]: 42: Hoare triple {8856#(and (= 0 node_create_with_sublist_~new_node~0.offset) (not (= 0 (select (select (store |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.base|) node_create_with_sublist_~new_node~0.offset 0)) (select (select (store |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.base|) node_create_with_sublist_~new_node~0.offset 0)) |node_create_with_sublist_#t~ret5.base|) |node_create_with_sublist_#t~ret5.offset|)) 0))) (not (= 0 node_create_with_sublist_~new_node~0.base)) (= 0 |node_create_with_sublist_#t~ret5.offset|) (= 0 (select (select (store |#memory_$Pointer$.offset| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.offset| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.offset|) node_create_with_sublist_~new_node~0.offset 0)) |node_create_with_sublist_#t~ret5.base|) |node_create_with_sublist_#t~ret5.offset|)) (not (= 1 (select |old(#valid)| node_create_with_sublist_~new_node~0.base))) (not (= 0 (select (select (store |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base (store (store (select |#memory_$Pointer$.base| node_create_with_sublist_~new_node~0.base) (+ node_create_with_sublist_~new_node~0.offset 4) |node_create_with_sublist_#t~ret5.base|) node_create_with_sublist_~new_node~0.offset 0)) |node_create_with_sublist_#t~ret5.base|) 0))))} call write~$Pointer$(#t~ret5.base, #t~ret5.offset, ~new_node~0.base, 4 + ~new_node~0.offset, 4);havoc #t~ret5.base, #t~ret5.offset;call write~$Pointer$(0, 0, ~new_node~0.base, ~new_node~0.offset, 4);#res.base, #res.offset := ~new_node~0.base, ~new_node~0.offset; {8857#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 |node_create_with_sublist_#res.offset|) (not (= 0 |node_create_with_sublist_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4) |node_create_with_sublist_#res.base|)) (not (= |node_create_with_sublist_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0)) (not (= 1 (select |old(#valid)| |node_create_with_sublist_#res.base|))) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)))} is VALID [2018-11-23 13:04:08,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {8857#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 |node_create_with_sublist_#res.offset|) (not (= 0 |node_create_with_sublist_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4) |node_create_with_sublist_#res.base|)) (not (= |node_create_with_sublist_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0)) (not (= 1 (select |old(#valid)| |node_create_with_sublist_#res.base|))) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)))} assume true; {8857#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 |node_create_with_sublist_#res.offset|) (not (= 0 |node_create_with_sublist_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4) |node_create_with_sublist_#res.base|)) (not (= |node_create_with_sublist_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0)) (not (= 1 (select |old(#valid)| |node_create_with_sublist_#res.base|))) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)))} is VALID [2018-11-23 13:04:08,055 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {8857#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 |node_create_with_sublist_#res.offset|) (not (= 0 |node_create_with_sublist_#res.base|)) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) 4)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0)) 0))) (not (= (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4) |node_create_with_sublist_#res.base|)) (not (= |node_create_with_sublist_#res.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |node_create_with_sublist_#res.base|) 4)) 0)) (not (= 1 (select |old(#valid)| |node_create_with_sublist_#res.base|))) (= 0 (select (select |#memory_$Pointer$.offset| |node_create_with_sublist_#res.base|) |node_create_with_sublist_#res.offset|)))} {8847#(and (= |#valid| |old(#valid)|) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|))} #208#return; {8858#(and (= 0 |sll_append_#t~ret8.offset|) (or (and (not (= sll_append_~head.base |sll_append_#t~ret8.base|)) (or (not (= 0 (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset))) (not (= 0 |sll_append_#in~head.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) 4)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) |sll_append_#t~ret8.offset|)) (= sll_append_~head.base |sll_append_#in~head.base|) (or (and (not (= sll_append_~head.base (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4) |sll_append_#t~ret8.base|)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0)) 0))) (not (= |sll_append_#t~ret8.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0)))) (and (= sll_append_~head.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0)) (not (= 0 |sll_append_#t~ret8.base|))))) (and (not (= sll_append_~head.base |sll_append_#t~ret8.base|)) (or (not (= 0 (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset))) (not (= 0 |sll_append_#in~head.offset|))))) (not (= 1 (select |old(#valid)| |sll_append_#t~ret8.base|))))} is VALID [2018-11-23 13:04:08,058 INFO L273 TraceCheckUtils]: 45: Hoare triple {8858#(and (= 0 |sll_append_#t~ret8.offset|) (or (and (not (= sll_append_~head.base |sll_append_#t~ret8.base|)) (or (not (= 0 (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset))) (not (= 0 |sll_append_#in~head.offset|)))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) 4)) (= sll_append_~head.offset |sll_append_#in~head.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#t~ret8.base|) |sll_append_#t~ret8.offset|)) (= sll_append_~head.base |sll_append_#in~head.base|) (or (and (not (= sll_append_~head.base (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4))) (not (= (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4) |sll_append_#t~ret8.base|)) (or (and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0)) 0))) (not (= |sll_append_#t~ret8.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0)))) (and (= sll_append_~head.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#t~ret8.base|) 4)) 0)) (not (= 0 |sll_append_#t~ret8.base|))))) (and (not (= sll_append_~head.base |sll_append_#t~ret8.base|)) (or (not (= 0 (select (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset))) (not (= 0 |sll_append_#in~head.offset|))))) (not (= 1 (select |old(#valid)| |sll_append_#t~ret8.base|))))} ~new_last~0.base, ~new_last~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call write~$Pointer$(0, 0, ~new_last~0.base, ~new_last~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4);~temp~0.base, ~temp~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset; {8859#(and (or (= sll_append_~new_last~0.base sll_append_~head.base) (and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 sll_append_~new_last~0.offset) (or (not (= 0 sll_append_~temp~0.base)) (and (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4)) 0)) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| sll_append_~head.base (store (select |#memory_$Pointer$.offset| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4)) 0))) (not (= 0 |sll_append_#in~head.offset|))) (= 0 (select (select (store |#memory_$Pointer$.offset| sll_append_~head.base (store (select |#memory_$Pointer$.offset| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.offset)) sll_append_~new_last~0.base) 4)))) (or (not (= sll_append_~new_last~0.base sll_append_~head.base)) (not (= 1 (select |old(#valid)| |sll_append_#in~head.base|)))))} is VALID [2018-11-23 13:04:08,060 INFO L273 TraceCheckUtils]: 46: Hoare triple {8859#(and (or (= sll_append_~new_last~0.base sll_append_~head.base) (and (= sll_append_~head.offset |sll_append_#in~head.offset|) (= sll_append_~head.base |sll_append_#in~head.base|) (= 0 sll_append_~new_last~0.offset) (or (not (= 0 sll_append_~temp~0.base)) (and (not (= 0 (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4)) 0)) 0))) (= 0 (select (select (store |#memory_$Pointer$.offset| sll_append_~head.base (store (select |#memory_$Pointer$.offset| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_append_~head.base (store (select |#memory_$Pointer$.base| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.base)) sll_append_~new_last~0.base) 4)) 0))) (not (= 0 |sll_append_#in~head.offset|))) (= 0 (select (select (store |#memory_$Pointer$.offset| sll_append_~head.base (store (select |#memory_$Pointer$.offset| sll_append_~head.base) sll_append_~head.offset sll_append_~new_last~0.offset)) sll_append_~new_last~0.base) 4)))) (or (not (= sll_append_~new_last~0.base sll_append_~head.base)) (not (= 1 (select |old(#valid)| |sll_append_#in~head.base|)))))} assume !(0 != ~temp~0.base || 0 != ~temp~0.offset);call write~$Pointer$(~new_last~0.base, ~new_last~0.offset, ~head.base, ~head.offset, 4); {8860#(or (not (= 1 (select |old(#valid)| |sll_append_#in~head.base|))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0)) |sll_append_#in~head.offset|)))) (not (= 0 |sll_append_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))} is VALID [2018-11-23 13:04:08,061 INFO L273 TraceCheckUtils]: 47: Hoare triple {8860#(or (not (= 1 (select |old(#valid)| |sll_append_#in~head.base|))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0)) |sll_append_#in~head.offset|)))) (not (= 0 |sll_append_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))} assume true; {8860#(or (not (= 1 (select |old(#valid)| |sll_append_#in~head.base|))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0)) |sll_append_#in~head.offset|)))) (not (= 0 |sll_append_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))} is VALID [2018-11-23 13:04:08,063 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {8860#(or (not (= 1 (select |old(#valid)| |sll_append_#in~head.base|))) (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) (or (and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_append_#in~head.base|) |sll_append_#in~head.offset|)) 4)) 0)) |sll_append_#in~head.offset|)))) (not (= 0 |sll_append_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |sll_append_#in~head.base|) |sll_append_#in~head.offset|))))} {8845#(and (= (select |#valid| |main_~#head~1.base|) 1) (= 0 |main_~#head~1.offset|))} #202#return; {8861#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) 0)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)))} is VALID [2018-11-23 13:04:08,065 INFO L273 TraceCheckUtils]: 49: Hoare triple {8861#(and (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) 0)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#head~1.base|) |main_~#head~1.offset|)) 4)) 0)) 0))) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#head~1.base|) |main_~#head~1.offset|)))} call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~#head~1.base, ~#head~1.offset, 4);~ptr~0.base, ~ptr~0.offset := #t~mem19.base, #t~mem19.offset;havoc #t~mem19.base, #t~mem19.offset;~i~0 := ~min~0; {8862#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) (= main_~ptr~0.offset 0))} is VALID [2018-11-23 13:04:08,066 INFO L273 TraceCheckUtils]: 50: Hoare triple {8862#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) (= main_~ptr~0.offset 0))} assume !!(0 != ~ptr~0.base || 0 != ~ptr~0.offset); {8862#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) (= main_~ptr~0.offset 0))} is VALID [2018-11-23 13:04:08,067 INFO L273 TraceCheckUtils]: 51: Hoare triple {8862#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) (= main_~ptr~0.offset 0))} assume !(~i~0 > ~max~0); {8862#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) (= main_~ptr~0.offset 0))} is VALID [2018-11-23 13:04:08,068 INFO L273 TraceCheckUtils]: 52: Hoare triple {8862#(and (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) 0))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~ptr~0.base) (+ main_~ptr~0.offset 4))) (select (select |#memory_$Pointer$.offset| main_~ptr~0.base) (+ main_~ptr~0.offset 4)))) (= main_~ptr~0.offset 0))} assume !!(~ptr~0.base != 0 || ~ptr~0.offset != 0);call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~ptr~0.base, 4 + ~ptr~0.offset, 4); {8863#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|)) 0))))} is VALID [2018-11-23 13:04:08,068 INFO L256 TraceCheckUtils]: 53: Hoare triple {8863#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|)) 0))))} call #t~ret22 := sll_length(#t~mem21.base, #t~mem21.offset); {8843#true} is VALID [2018-11-23 13:04:08,068 INFO L273 TraceCheckUtils]: 54: Hoare triple {8843#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0; {8864#(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:04:08,069 INFO L273 TraceCheckUtils]: 55: Hoare triple {8864#(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~post6 := ~len~0;~len~0 := 1 + #t~post6;havoc #t~post6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {8865#(and (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= sll_length_~head.base (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-23 13:04:08,071 INFO L273 TraceCheckUtils]: 56: Hoare triple {8865#(and (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (= sll_length_~head.base (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume !!(~head.base != 0 || ~head.offset != 0);#t~post6 := ~len~0;~len~0 := 1 + #t~post6;havoc #t~post6;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4);~head.base, ~head.offset := #t~mem7.base, #t~mem7.offset;havoc #t~mem7.base, #t~mem7.offset; {8866#(or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) 0) sll_length_~head.base) (not (= 0 (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))))} is VALID [2018-11-23 13:04:08,071 INFO L273 TraceCheckUtils]: 57: Hoare triple {8866#(or (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) 0) sll_length_~head.base) (not (= 0 (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))))} assume !(~head.base != 0 || ~head.offset != 0); {8867#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) 0)))} is VALID [2018-11-23 13:04:08,072 INFO L273 TraceCheckUtils]: 58: Hoare triple {8867#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) 0)))} #res := ~len~0; {8867#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) 0)))} is VALID [2018-11-23 13:04:08,072 INFO L273 TraceCheckUtils]: 59: Hoare triple {8867#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) 0)))} assume true; {8867#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) 0)))} is VALID [2018-11-23 13:04:08,074 INFO L268 TraceCheckUtils]: 60: Hoare quadruple {8867#(or (not (= 0 (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) 0)))} {8863#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem21.base|) |main_#t~mem21.offset|)) (not (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem21.base|) |main_#t~mem21.offset|)) 0))))} #204#return; {8844#false} is VALID [2018-11-23 13:04:08,074 INFO L273 TraceCheckUtils]: 61: Hoare triple {8844#false} assume -2147483648 <= #t~ret22 && #t~ret22 <= 2147483647;~count~0 := #t~ret22;havoc #t~mem21.base, #t~mem21.offset;havoc #t~ret22; {8844#false} is VALID [2018-11-23 13:04:08,074 INFO L273 TraceCheckUtils]: 62: Hoare triple {8844#false} assume !(~i~0 == ~count~0); {8844#false} is VALID [2018-11-23 13:04:08,075 INFO L273 TraceCheckUtils]: 63: Hoare triple {8844#false} assume !(3 == ~i~0 && 5 == ~count~0); {8844#false} is VALID [2018-11-23 13:04:08,075 INFO L273 TraceCheckUtils]: 64: Hoare triple {8844#false} assume !(1 + ~i~0 == ~count~0 && ~i~0 < ~max~0); {8844#false} is VALID [2018-11-23 13:04:08,075 INFO L273 TraceCheckUtils]: 65: Hoare triple {8844#false} assume !false; {8844#false} is VALID [2018-11-23 13:04:08,095 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 13:04:08,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:08,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:04:08,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:08,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:08,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:08,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:08,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:08,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 13:04:08,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:08,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:08,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2018-11-23 13:04:08,247 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:08,247 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_36|]. (and (not (= |main_~#head~1.base| 0)) (= |main_~#head~1.offset| 0) (= |#valid| (store |v_#valid_36| |main_~#head~1.base| 1))) [2018-11-23 13:04:08,248 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= |main_~#head~1.base| 0)) (= (select |#valid| |main_~#head~1.base|) 1) (= |main_~#head~1.offset| 0)) [2018-11-23 13:04:15,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 13:04:15,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 13:04:15,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:04:15,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:04:15,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:04:15,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:38 [2018-11-23 13:04:15,957 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 13:04:15,958 WARN L384 uantifierElimination]: Input elimination task: ∃ [|sll_create_#t~malloc2.base|, v_sll_create_~head~0.base_6, |v_#memory_$Pointer$.base_36|]. (let ((.cse0 (store |old(#valid)| |sll_create_#t~malloc2.base| 1))) (and (not (= sll_create_~head~0.base 0)) (not (= 0 v_sll_create_~head~0.base_6)) (= |#valid| (store .cse0 sll_create_~head~0.base 1)) (= (select .cse0 sll_create_~head~0.base) 0) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_36| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_36| sll_create_~head~0.base) 0 v_sll_create_~head~0.base_6))) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) 0) (= 0 sll_create_~head~0.offset))) [2018-11-23 13:04:15,958 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|sll_create_#t~malloc2.base|]. (let ((.cse0 (store |old(#valid)| |sll_create_#t~malloc2.base| 1))) (and (not (= sll_create_~head~0.base 0)) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) 0) 0)) (= |#valid| (store .cse0 sll_create_~head~0.base 1)) (= (select .cse0 sll_create_~head~0.base) 0) (= (select |old(#valid)| |sll_create_#t~malloc2.base|) 0) (= 0 sll_create_~head~0.offset)))