java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:18:54,033 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:18:54,035 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:18:54,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:18:54,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:18:54,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:18:54,051 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:18:54,052 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:18:54,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:18:54,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:18:54,056 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:18:54,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:18:54,057 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:18:54,058 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:18:54,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:18:54,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:18:54,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:18:54,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:18:54,065 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:18:54,067 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:18:54,068 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:18:54,069 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:18:54,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:18:54,072 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:18:54,072 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:18:54,073 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:18:54,074 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:18:54,075 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:18:54,076 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:18:54,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:18:54,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:18:54,078 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:18:54,078 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:18:54,078 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:18:54,079 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:18:54,080 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:18:54,080 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:18:54,096 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:18:54,096 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:18:54,097 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:18:54,097 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:18:54,098 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:18:54,098 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:18:54,098 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:18:54,098 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:18:54,099 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:18:54,099 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:18:54,099 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:18:54,099 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:18:54,099 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:18:54,100 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:18:54,100 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:18:54,100 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:18:54,100 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:18:54,100 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:18:54,100 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:18:54,101 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:18:54,101 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:18:54,101 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:18:54,101 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:18:54,101 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:18:54,102 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:18:54,102 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:18:54,102 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:18:54,102 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:18:54,102 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:18:54,103 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:18:54,103 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:18:54,103 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:18:54,103 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:18:54,147 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:18:54,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:18:54,171 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:18:54,172 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:18:54,173 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:18:54,174 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:18:54,253 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ad74ec7/740eb067c71440469b9d9e204bd5871a/FLAGaf30af4d5 [2018-11-23 11:18:54,745 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:18:54,746 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:18:54,759 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ad74ec7/740eb067c71440469b9d9e204bd5871a/FLAGaf30af4d5 [2018-11-23 11:18:55,030 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94ad74ec7/740eb067c71440469b9d9e204bd5871a [2018-11-23 11:18:55,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:18:55,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:18:55,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:18:55,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:18:55,056 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:18:55,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f2cfef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55, skipping insertion in model container [2018-11-23 11:18:55,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:18:55,143 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:18:55,609 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:18:55,633 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:18:55,694 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:18:55,875 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:18:55,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55 WrapperNode [2018-11-23 11:18:55,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:18:55,877 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:18:55,877 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:18:55,877 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:18:55,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,908 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:18:55,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:18:55,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:18:55,918 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:18:55,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,961 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... [2018-11-23 11:18:55,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:18:55,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:18:55,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:18:55,984 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:18:55,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:18:56,037 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-23 11:18:56,038 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-23 11:18:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 11:18:56,038 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 11:18:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:18:56,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:18:56,039 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-23 11:18:56,039 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-23 11:18:56,039 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:18:56,039 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:18:56,039 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 11:18:56,040 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 11:18:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:18:56,040 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:18:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:18:56,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:18:56,040 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:18:56,041 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:18:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:18:56,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:18:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:18:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:18:56,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:18:56,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:18:57,086 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:18:57,086 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:18:57,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:18:57 BoogieIcfgContainer [2018-11-23 11:18:57,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:18:57,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:18:57,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:18:57,091 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:18:57,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:18:55" (1/3) ... [2018-11-23 11:18:57,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e62e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:18:57, skipping insertion in model container [2018-11-23 11:18:57,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:18:55" (2/3) ... [2018-11-23 11:18:57,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e62e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:18:57, skipping insertion in model container [2018-11-23 11:18:57,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:18:57" (3/3) ... [2018-11-23 11:18:57,095 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:18:57,103 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:18:57,111 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:18:57,127 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:18:57,158 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:18:57,159 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:18:57,159 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:18:57,159 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:18:57,159 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:18:57,159 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:18:57,159 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:18:57,159 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:18:57,160 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:18:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-23 11:18:57,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:18:57,185 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:18:57,187 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] [2018-11-23 11:18:57,189 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:18:57,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:18:57,195 INFO L82 PathProgramCache]: Analyzing trace with hash 197480979, now seen corresponding path program 1 times [2018-11-23 11:18:57,200 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:18:57,201 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:18:57,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:18:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:57,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:18:57,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-23 11:18:57,589 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {57#true} is VALID [2018-11-23 11:18:57,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-23 11:18:57,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #135#return; {57#true} is VALID [2018-11-23 11:18:57,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret15 := main(); {57#true} is VALID [2018-11-23 11:18:57,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} ~len~0 := 2bv32;~data~0 := 1bv32; {77#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:18:57,610 INFO L256 TraceCheckUtils]: 6: Hoare triple {77#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {57#true} is VALID [2018-11-23 11:18:57,611 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {84#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:18:57,612 INFO L273 TraceCheckUtils]: 8: Hoare triple {84#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:18:57,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:18:57,631 INFO L273 TraceCheckUtils]: 10: Hoare triple {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:18:57,638 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {88#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {77#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {58#false} is VALID [2018-11-23 11:18:57,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {58#false} is VALID [2018-11-23 11:18:57,639 INFO L273 TraceCheckUtils]: 13: Hoare triple {58#false} assume !~bvslt32(~i~0, ~len~0); {58#false} is VALID [2018-11-23 11:18:57,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {58#false} ~i~0 := 0bv32; {58#false} is VALID [2018-11-23 11:18:57,640 INFO L273 TraceCheckUtils]: 15: Hoare triple {58#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {58#false} is VALID [2018-11-23 11:18:57,640 INFO L256 TraceCheckUtils]: 16: Hoare triple {58#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {58#false} is VALID [2018-11-23 11:18:57,640 INFO L273 TraceCheckUtils]: 17: Hoare triple {58#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {58#false} is VALID [2018-11-23 11:18:57,641 INFO L273 TraceCheckUtils]: 18: Hoare triple {58#false} assume !~bvsgt32(~index, 0bv32); {58#false} is VALID [2018-11-23 11:18:57,641 INFO L273 TraceCheckUtils]: 19: Hoare triple {58#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {58#false} is VALID [2018-11-23 11:18:57,642 INFO L273 TraceCheckUtils]: 20: Hoare triple {58#false} assume true; {58#false} is VALID [2018-11-23 11:18:57,642 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {58#false} {58#false} #129#return; {58#false} is VALID [2018-11-23 11:18:57,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {58#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {58#false} is VALID [2018-11-23 11:18:57,643 INFO L273 TraceCheckUtils]: 23: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-23 11:18:57,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:18:57,649 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:18:57,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:18:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:18:57,664 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:18:57,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:18:57,674 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:18:57,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:18:57,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:18:57,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:18:57,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:18:57,767 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-11-23 11:18:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:59,218 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-11-23 11:18:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:18:59,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-23 11:18:59,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:18:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:18:59,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-23 11:18:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:18:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2018-11-23 11:18:59,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 124 transitions. [2018-11-23 11:18:59,606 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 11:18:59,619 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:18:59,620 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:18:59,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:18:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:18:59,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 11:18:59,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:18:59,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 11:18:59,701 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 11:18:59,701 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 11:18:59,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:59,708 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-23 11:18:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-23 11:18:59,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:59,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:59,710 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 11:18:59,710 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 11:18:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:18:59,715 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-11-23 11:18:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-11-23 11:18:59,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:18:59,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:18:59,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:18:59,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:18:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:18:59,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-11-23 11:18:59,727 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 24 [2018-11-23 11:18:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:18:59,727 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-11-23 11:18:59,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:18:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:18:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:18:59,729 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:18:59,729 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] [2018-11-23 11:18:59,730 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:18:59,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:18:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2132511215, now seen corresponding path program 1 times [2018-11-23 11:18:59,731 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:18:59,731 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:18:59,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:18:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:18:59,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:18:59,997 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 11:18:59,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 11:18:59,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:18:59,998 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #135#return; {419#true} is VALID [2018-11-23 11:18:59,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret15 := main(); {419#true} is VALID [2018-11-23 11:18:59,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} ~len~0 := 2bv32;~data~0 := 1bv32; {439#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:00,000 INFO L256 TraceCheckUtils]: 6: Hoare triple {439#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {419#true} is VALID [2018-11-23 11:19:00,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {419#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {446#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:19:00,001 INFO L273 TraceCheckUtils]: 8: Hoare triple {446#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {446#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:19:00,001 INFO L256 TraceCheckUtils]: 9: Hoare triple {446#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {419#true} is VALID [2018-11-23 11:19:00,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {419#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {419#true} is VALID [2018-11-23 11:19:00,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {419#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {419#true} is VALID [2018-11-23 11:19:00,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {419#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {419#true} is VALID [2018-11-23 11:19:00,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:19:00,006 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {419#true} {446#(= |sll_create_#in~len| sll_create_~len)} #133#return; {446#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:19:00,008 INFO L273 TraceCheckUtils]: 15: Hoare triple {446#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {446#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:19:00,008 INFO L273 TraceCheckUtils]: 16: Hoare triple {446#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {474#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:19:00,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {474#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,014 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {439#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {420#false} is VALID [2018-11-23 11:19:00,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {420#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {420#false} is VALID [2018-11-23 11:19:00,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {420#false} assume !~bvslt32(~i~0, ~len~0); {420#false} is VALID [2018-11-23 11:19:00,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 11:19:00,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {420#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {420#false} is VALID [2018-11-23 11:19:00,016 INFO L256 TraceCheckUtils]: 25: Hoare triple {420#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {420#false} is VALID [2018-11-23 11:19:00,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {420#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {420#false} is VALID [2018-11-23 11:19:00,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {420#false} assume !~bvsgt32(~index, 0bv32); {420#false} is VALID [2018-11-23 11:19:00,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {420#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {420#false} is VALID [2018-11-23 11:19:00,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {420#false} assume true; {420#false} is VALID [2018-11-23 11:19:00,017 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {420#false} {420#false} #129#return; {420#false} is VALID [2018-11-23 11:19:00,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {420#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {420#false} is VALID [2018-11-23 11:19:00,018 INFO L273 TraceCheckUtils]: 32: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 11:19:00,021 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 11:19:00,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:00,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {420#false} assume !false; {420#false} is VALID [2018-11-23 11:19:00,412 INFO L273 TraceCheckUtils]: 31: Hoare triple {420#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {420#false} is VALID [2018-11-23 11:19:00,412 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {419#true} {420#false} #129#return; {420#false} is VALID [2018-11-23 11:19:00,413 INFO L273 TraceCheckUtils]: 29: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:19:00,413 INFO L273 TraceCheckUtils]: 28: Hoare triple {419#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {419#true} is VALID [2018-11-23 11:19:00,413 INFO L273 TraceCheckUtils]: 27: Hoare triple {419#true} assume !~bvsgt32(~index, 0bv32); {419#true} is VALID [2018-11-23 11:19:00,413 INFO L273 TraceCheckUtils]: 26: Hoare triple {419#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {419#true} is VALID [2018-11-23 11:19:00,414 INFO L256 TraceCheckUtils]: 25: Hoare triple {420#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {419#true} is VALID [2018-11-23 11:19:00,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {420#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {420#false} is VALID [2018-11-23 11:19:00,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {420#false} ~i~0 := 0bv32; {420#false} is VALID [2018-11-23 11:19:00,415 INFO L273 TraceCheckUtils]: 22: Hoare triple {420#false} assume !~bvslt32(~i~0, ~len~0); {420#false} is VALID [2018-11-23 11:19:00,415 INFO L273 TraceCheckUtils]: 21: Hoare triple {420#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {420#false} is VALID [2018-11-23 11:19:00,417 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {560#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #125#return; {420#false} is VALID [2018-11-23 11:19:00,418 INFO L273 TraceCheckUtils]: 19: Hoare triple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,420 INFO L273 TraceCheckUtils]: 18: Hoare triple {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,420 INFO L273 TraceCheckUtils]: 17: Hoare triple {573#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {478#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {573#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:19:00,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,426 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {419#true} {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #133#return; {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:19:00,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {419#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {419#true} is VALID [2018-11-23 11:19:00,427 INFO L273 TraceCheckUtils]: 11: Hoare triple {419#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {419#true} is VALID [2018-11-23 11:19:00,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {419#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {419#true} is VALID [2018-11-23 11:19:00,428 INFO L256 TraceCheckUtils]: 9: Hoare triple {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {419#true} is VALID [2018-11-23 11:19:00,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32); {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,435 INFO L273 TraceCheckUtils]: 7: Hoare triple {419#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {577#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:00,436 INFO L256 TraceCheckUtils]: 6: Hoare triple {560#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {419#true} is VALID [2018-11-23 11:19:00,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {419#true} ~len~0 := 2bv32;~data~0 := 1bv32; {560#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:00,440 INFO L256 TraceCheckUtils]: 4: Hoare triple {419#true} call #t~ret15 := main(); {419#true} is VALID [2018-11-23 11:19:00,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {419#true} {419#true} #135#return; {419#true} is VALID [2018-11-23 11:19:00,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {419#true} assume true; {419#true} is VALID [2018-11-23 11:19:00,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {419#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {419#true} is VALID [2018-11-23 11:19:00,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {419#true} call ULTIMATE.init(); {419#true} is VALID [2018-11-23 11:19:00,445 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 11:19:00,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:19:00,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:19:00,452 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:19:00,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:00,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:19:00,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:00,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:19:00,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:19:00,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:19:00,589 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 9 states. [2018-11-23 11:19:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:01,740 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 11:19:01,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:19:01,741 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:19:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:19:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-23 11:19:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:19:01,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 83 transitions. [2018-11-23 11:19:01,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 83 transitions. [2018-11-23 11:19:01,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:01,952 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:19:01,952 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:19:01,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:19:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:19:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 11:19:02,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:02,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2018-11-23 11:19:02,057 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2018-11-23 11:19:02,057 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2018-11-23 11:19:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:02,063 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:19:02,063 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:19:02,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:02,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:02,064 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2018-11-23 11:19:02,064 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2018-11-23 11:19:02,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:02,074 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2018-11-23 11:19:02,075 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2018-11-23 11:19:02,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:02,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:02,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:02,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:19:02,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-23 11:19:02,087 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 33 [2018-11-23 11:19:02,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:02,087 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-23 11:19:02,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:19:02,088 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 11:19:02,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:19:02,089 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:02,090 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2018-11-23 11:19:02,091 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:02,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:02,091 INFO L82 PathProgramCache]: Analyzing trace with hash -906301485, now seen corresponding path program 2 times [2018-11-23 11:19:02,092 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:02,092 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:19:02,111 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:19:02,164 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:19:02,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:19:02,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:02,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:02,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {898#true} call ULTIMATE.init(); {898#true} is VALID [2018-11-23 11:19:02,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {898#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {898#true} is VALID [2018-11-23 11:19:02,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:19:02,321 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {898#true} {898#true} #135#return; {898#true} is VALID [2018-11-23 11:19:02,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {898#true} call #t~ret15 := main(); {898#true} is VALID [2018-11-23 11:19:02,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {898#true} ~len~0 := 2bv32;~data~0 := 1bv32; {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:02,322 INFO L256 TraceCheckUtils]: 6: Hoare triple {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {898#true} is VALID [2018-11-23 11:19:02,322 INFO L273 TraceCheckUtils]: 7: Hoare triple {898#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {898#true} is VALID [2018-11-23 11:19:02,323 INFO L273 TraceCheckUtils]: 8: Hoare triple {898#true} assume !!~bvsgt32(~len, 0bv32); {898#true} is VALID [2018-11-23 11:19:02,323 INFO L256 TraceCheckUtils]: 9: Hoare triple {898#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {898#true} is VALID [2018-11-23 11:19:02,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {898#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {898#true} is VALID [2018-11-23 11:19:02,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {898#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {898#true} is VALID [2018-11-23 11:19:02,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {898#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {898#true} is VALID [2018-11-23 11:19:02,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:19:02,324 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {898#true} {898#true} #133#return; {898#true} is VALID [2018-11-23 11:19:02,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {898#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {898#true} is VALID [2018-11-23 11:19:02,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {898#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {898#true} is VALID [2018-11-23 11:19:02,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {898#true} assume !!~bvsgt32(~len, 0bv32); {898#true} is VALID [2018-11-23 11:19:02,326 INFO L256 TraceCheckUtils]: 18: Hoare triple {898#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {898#true} is VALID [2018-11-23 11:19:02,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {898#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {898#true} is VALID [2018-11-23 11:19:02,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {898#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {898#true} is VALID [2018-11-23 11:19:02,327 INFO L273 TraceCheckUtils]: 21: Hoare triple {898#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {898#true} is VALID [2018-11-23 11:19:02,327 INFO L273 TraceCheckUtils]: 22: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:19:02,327 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {898#true} {898#true} #133#return; {898#true} is VALID [2018-11-23 11:19:02,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {898#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {898#true} is VALID [2018-11-23 11:19:02,328 INFO L273 TraceCheckUtils]: 25: Hoare triple {898#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {898#true} is VALID [2018-11-23 11:19:02,328 INFO L273 TraceCheckUtils]: 26: Hoare triple {898#true} assume !~bvsgt32(~len, 0bv32); {898#true} is VALID [2018-11-23 11:19:02,328 INFO L273 TraceCheckUtils]: 27: Hoare triple {898#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {898#true} is VALID [2018-11-23 11:19:02,329 INFO L273 TraceCheckUtils]: 28: Hoare triple {898#true} assume true; {898#true} is VALID [2018-11-23 11:19:02,331 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {898#true} {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:02,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {918#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {994#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:02,350 INFO L273 TraceCheckUtils]: 31: Hoare triple {994#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {899#false} is VALID [2018-11-23 11:19:02,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {899#false} ~i~0 := 0bv32; {899#false} is VALID [2018-11-23 11:19:02,350 INFO L273 TraceCheckUtils]: 33: Hoare triple {899#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {899#false} is VALID [2018-11-23 11:19:02,351 INFO L256 TraceCheckUtils]: 34: Hoare triple {899#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {899#false} is VALID [2018-11-23 11:19:02,351 INFO L273 TraceCheckUtils]: 35: Hoare triple {899#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {899#false} is VALID [2018-11-23 11:19:02,351 INFO L273 TraceCheckUtils]: 36: Hoare triple {899#false} assume !~bvsgt32(~index, 0bv32); {899#false} is VALID [2018-11-23 11:19:02,352 INFO L273 TraceCheckUtils]: 37: Hoare triple {899#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {899#false} is VALID [2018-11-23 11:19:02,352 INFO L273 TraceCheckUtils]: 38: Hoare triple {899#false} assume true; {899#false} is VALID [2018-11-23 11:19:02,352 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {899#false} {899#false} #129#return; {899#false} is VALID [2018-11-23 11:19:02,353 INFO L273 TraceCheckUtils]: 40: Hoare triple {899#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {899#false} is VALID [2018-11-23 11:19:02,353 INFO L273 TraceCheckUtils]: 41: Hoare triple {899#false} assume !false; {899#false} is VALID [2018-11-23 11:19:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:19:02,356 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:02,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:02,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:19:02,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 11:19:02,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:02,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:19:02,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:02,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:19:02,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:19:02,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:19:02,489 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 4 states. [2018-11-23 11:19:02,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:02,858 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-11-23 11:19:02,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:19:02,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-11-23 11:19:02,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:02,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:02,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 11:19:02,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:02,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 11:19:02,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 11:19:02,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:02,991 INFO L225 Difference]: With dead ends: 67 [2018-11-23 11:19:02,991 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:19:02,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:19:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:19:03,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-11-23 11:19:03,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:03,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 47 states. [2018-11-23 11:19:03,055 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 47 states. [2018-11-23 11:19:03,055 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 47 states. [2018-11-23 11:19:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:03,059 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 11:19:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 11:19:03,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:03,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:03,061 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 55 states. [2018-11-23 11:19:03,061 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 55 states. [2018-11-23 11:19:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:03,066 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-23 11:19:03,066 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-23 11:19:03,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:03,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:03,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:03,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:03,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:19:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-11-23 11:19:03,071 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2018-11-23 11:19:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:03,071 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-11-23 11:19:03,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:19:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 11:19:03,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 11:19:03,073 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:03,073 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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 11:19:03,074 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:03,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:03,074 INFO L82 PathProgramCache]: Analyzing trace with hash -743230615, now seen corresponding path program 1 times [2018-11-23 11:19:03,075 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:03,075 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:19:03,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:19:03,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:03,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:03,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {1304#true} call ULTIMATE.init(); {1304#true} is VALID [2018-11-23 11:19:03,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {1304#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1304#true} is VALID [2018-11-23 11:19:03,499 INFO L273 TraceCheckUtils]: 2: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1304#true} {1304#true} #135#return; {1304#true} is VALID [2018-11-23 11:19:03,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {1304#true} call #t~ret15 := main(); {1304#true} is VALID [2018-11-23 11:19:03,503 INFO L273 TraceCheckUtils]: 5: Hoare triple {1304#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1324#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:03,503 INFO L256 TraceCheckUtils]: 6: Hoare triple {1324#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1304#true} is VALID [2018-11-23 11:19:03,503 INFO L273 TraceCheckUtils]: 7: Hoare triple {1304#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1304#true} is VALID [2018-11-23 11:19:03,503 INFO L273 TraceCheckUtils]: 8: Hoare triple {1304#true} assume !!~bvsgt32(~len, 0bv32); {1304#true} is VALID [2018-11-23 11:19:03,504 INFO L256 TraceCheckUtils]: 9: Hoare triple {1304#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1304#true} is VALID [2018-11-23 11:19:03,504 INFO L273 TraceCheckUtils]: 10: Hoare triple {1304#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1304#true} is VALID [2018-11-23 11:19:03,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {1304#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1304#true} is VALID [2018-11-23 11:19:03,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {1304#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,505 INFO L273 TraceCheckUtils]: 13: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,505 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1304#true} {1304#true} #133#return; {1304#true} is VALID [2018-11-23 11:19:03,505 INFO L273 TraceCheckUtils]: 15: Hoare triple {1304#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {1304#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1304#true} is VALID [2018-11-23 11:19:03,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {1304#true} assume !!~bvsgt32(~len, 0bv32); {1304#true} is VALID [2018-11-23 11:19:03,506 INFO L256 TraceCheckUtils]: 18: Hoare triple {1304#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1304#true} is VALID [2018-11-23 11:19:03,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {1304#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1304#true} is VALID [2018-11-23 11:19:03,506 INFO L273 TraceCheckUtils]: 20: Hoare triple {1304#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1304#true} is VALID [2018-11-23 11:19:03,506 INFO L273 TraceCheckUtils]: 21: Hoare triple {1304#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,506 INFO L273 TraceCheckUtils]: 22: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,507 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1304#true} {1304#true} #133#return; {1304#true} is VALID [2018-11-23 11:19:03,507 INFO L273 TraceCheckUtils]: 24: Hoare triple {1304#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,507 INFO L273 TraceCheckUtils]: 25: Hoare triple {1304#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1304#true} is VALID [2018-11-23 11:19:03,507 INFO L273 TraceCheckUtils]: 26: Hoare triple {1304#true} assume !~bvsgt32(~len, 0bv32); {1304#true} is VALID [2018-11-23 11:19:03,507 INFO L273 TraceCheckUtils]: 27: Hoare triple {1304#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,508 INFO L273 TraceCheckUtils]: 28: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,509 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1304#true} {1324#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {1324#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:03,510 INFO L273 TraceCheckUtils]: 30: Hoare triple {1324#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1400#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:03,510 INFO L273 TraceCheckUtils]: 31: Hoare triple {1400#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1400#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:03,511 INFO L256 TraceCheckUtils]: 32: Hoare triple {1400#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1304#true} is VALID [2018-11-23 11:19:03,511 INFO L273 TraceCheckUtils]: 33: Hoare triple {1304#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1304#true} is VALID [2018-11-23 11:19:03,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {1304#true} assume !~bvsgt32(~index, 0bv32); {1304#true} is VALID [2018-11-23 11:19:03,511 INFO L273 TraceCheckUtils]: 35: Hoare triple {1304#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1304#true} is VALID [2018-11-23 11:19:03,511 INFO L273 TraceCheckUtils]: 36: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,518 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1304#true} {1400#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #127#return; {1400#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:03,519 INFO L273 TraceCheckUtils]: 38: Hoare triple {1400#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1425#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:03,519 INFO L273 TraceCheckUtils]: 39: Hoare triple {1425#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {1305#false} is VALID [2018-11-23 11:19:03,519 INFO L273 TraceCheckUtils]: 40: Hoare triple {1305#false} ~i~0 := 0bv32; {1305#false} is VALID [2018-11-23 11:19:03,520 INFO L273 TraceCheckUtils]: 41: Hoare triple {1305#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1305#false} is VALID [2018-11-23 11:19:03,520 INFO L256 TraceCheckUtils]: 42: Hoare triple {1305#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1305#false} is VALID [2018-11-23 11:19:03,520 INFO L273 TraceCheckUtils]: 43: Hoare triple {1305#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1305#false} is VALID [2018-11-23 11:19:03,520 INFO L273 TraceCheckUtils]: 44: Hoare triple {1305#false} assume !~bvsgt32(~index, 0bv32); {1305#false} is VALID [2018-11-23 11:19:03,521 INFO L273 TraceCheckUtils]: 45: Hoare triple {1305#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1305#false} is VALID [2018-11-23 11:19:03,521 INFO L273 TraceCheckUtils]: 46: Hoare triple {1305#false} assume true; {1305#false} is VALID [2018-11-23 11:19:03,521 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {1305#false} {1305#false} #129#return; {1305#false} is VALID [2018-11-23 11:19:03,521 INFO L273 TraceCheckUtils]: 48: Hoare triple {1305#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1305#false} is VALID [2018-11-23 11:19:03,521 INFO L273 TraceCheckUtils]: 49: Hoare triple {1305#false} assume !false; {1305#false} is VALID [2018-11-23 11:19:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:19:03,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:03,708 INFO L273 TraceCheckUtils]: 49: Hoare triple {1305#false} assume !false; {1305#false} is VALID [2018-11-23 11:19:03,709 INFO L273 TraceCheckUtils]: 48: Hoare triple {1305#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1305#false} is VALID [2018-11-23 11:19:03,709 INFO L268 TraceCheckUtils]: 47: Hoare quadruple {1304#true} {1305#false} #129#return; {1305#false} is VALID [2018-11-23 11:19:03,710 INFO L273 TraceCheckUtils]: 46: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,710 INFO L273 TraceCheckUtils]: 45: Hoare triple {1304#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1304#true} is VALID [2018-11-23 11:19:03,711 INFO L273 TraceCheckUtils]: 44: Hoare triple {1304#true} assume !~bvsgt32(~index, 0bv32); {1304#true} is VALID [2018-11-23 11:19:03,711 INFO L273 TraceCheckUtils]: 43: Hoare triple {1304#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1304#true} is VALID [2018-11-23 11:19:03,711 INFO L256 TraceCheckUtils]: 42: Hoare triple {1305#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1304#true} is VALID [2018-11-23 11:19:03,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {1305#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1305#false} is VALID [2018-11-23 11:19:03,712 INFO L273 TraceCheckUtils]: 40: Hoare triple {1305#false} ~i~0 := 0bv32; {1305#false} is VALID [2018-11-23 11:19:03,715 INFO L273 TraceCheckUtils]: 39: Hoare triple {1489#(bvslt main_~i~0 main_~len~0)} assume !~bvslt32(~i~0, ~len~0); {1305#false} is VALID [2018-11-23 11:19:03,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {1493#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1489#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-23 11:19:03,717 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1304#true} {1493#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #127#return; {1493#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:19:03,717 INFO L273 TraceCheckUtils]: 36: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,718 INFO L273 TraceCheckUtils]: 35: Hoare triple {1304#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1304#true} is VALID [2018-11-23 11:19:03,718 INFO L273 TraceCheckUtils]: 34: Hoare triple {1304#true} assume !~bvsgt32(~index, 0bv32); {1304#true} is VALID [2018-11-23 11:19:03,718 INFO L273 TraceCheckUtils]: 33: Hoare triple {1304#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1304#true} is VALID [2018-11-23 11:19:03,718 INFO L256 TraceCheckUtils]: 32: Hoare triple {1493#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1304#true} is VALID [2018-11-23 11:19:03,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {1493#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1493#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:19:03,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {1518#(bvslt (_ bv1 32) main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {1493#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:19:03,720 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1304#true} {1518#(bvslt (_ bv1 32) main_~len~0)} #125#return; {1518#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:19:03,721 INFO L273 TraceCheckUtils]: 28: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,721 INFO L273 TraceCheckUtils]: 27: Hoare triple {1304#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,721 INFO L273 TraceCheckUtils]: 26: Hoare triple {1304#true} assume !~bvsgt32(~len, 0bv32); {1304#true} is VALID [2018-11-23 11:19:03,722 INFO L273 TraceCheckUtils]: 25: Hoare triple {1304#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1304#true} is VALID [2018-11-23 11:19:03,722 INFO L273 TraceCheckUtils]: 24: Hoare triple {1304#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,723 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1304#true} {1304#true} #133#return; {1304#true} is VALID [2018-11-23 11:19:03,723 INFO L273 TraceCheckUtils]: 22: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,723 INFO L273 TraceCheckUtils]: 21: Hoare triple {1304#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,724 INFO L273 TraceCheckUtils]: 20: Hoare triple {1304#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1304#true} is VALID [2018-11-23 11:19:03,724 INFO L273 TraceCheckUtils]: 19: Hoare triple {1304#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1304#true} is VALID [2018-11-23 11:19:03,724 INFO L256 TraceCheckUtils]: 18: Hoare triple {1304#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1304#true} is VALID [2018-11-23 11:19:03,724 INFO L273 TraceCheckUtils]: 17: Hoare triple {1304#true} assume !!~bvsgt32(~len, 0bv32); {1304#true} is VALID [2018-11-23 11:19:03,725 INFO L273 TraceCheckUtils]: 16: Hoare triple {1304#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1304#true} is VALID [2018-11-23 11:19:03,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {1304#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,725 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1304#true} {1304#true} #133#return; {1304#true} is VALID [2018-11-23 11:19:03,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,726 INFO L273 TraceCheckUtils]: 12: Hoare triple {1304#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1304#true} is VALID [2018-11-23 11:19:03,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {1304#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1304#true} is VALID [2018-11-23 11:19:03,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {1304#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1304#true} is VALID [2018-11-23 11:19:03,727 INFO L256 TraceCheckUtils]: 9: Hoare triple {1304#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1304#true} is VALID [2018-11-23 11:19:03,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {1304#true} assume !!~bvsgt32(~len, 0bv32); {1304#true} is VALID [2018-11-23 11:19:03,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {1304#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1304#true} is VALID [2018-11-23 11:19:03,727 INFO L256 TraceCheckUtils]: 6: Hoare triple {1518#(bvslt (_ bv1 32) main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1304#true} is VALID [2018-11-23 11:19:03,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {1304#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1518#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:19:03,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {1304#true} call #t~ret15 := main(); {1304#true} is VALID [2018-11-23 11:19:03,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1304#true} {1304#true} #135#return; {1304#true} is VALID [2018-11-23 11:19:03,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:19:03,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {1304#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1304#true} is VALID [2018-11-23 11:19:03,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {1304#true} call ULTIMATE.init(); {1304#true} is VALID [2018-11-23 11:19:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 11:19:03,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:19:03,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:19:03,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-23 11:19:03,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:03,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:19:03,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:03,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:19:03,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:19:03,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:19:03,818 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 8 states. [2018-11-23 11:19:04,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:04,861 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-23 11:19:04,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:19:04,861 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-11-23 11:19:04,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:04,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:19:04,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 11:19:04,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:19:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 11:19:04,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 11:19:05,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:05,062 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:19:05,063 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 11:19:05,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:19:05,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 11:19:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 50. [2018-11-23 11:19:05,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:05,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 50 states. [2018-11-23 11:19:05,201 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 50 states. [2018-11-23 11:19:05,201 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 50 states. [2018-11-23 11:19:05,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:05,206 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 11:19:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-23 11:19:05,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:05,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:05,208 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 64 states. [2018-11-23 11:19:05,208 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 64 states. [2018-11-23 11:19:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:05,212 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 11:19:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-23 11:19:05,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:05,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:05,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:05,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:19:05,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-11-23 11:19:05,217 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 50 [2018-11-23 11:19:05,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:05,217 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-11-23 11:19:05,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:19:05,218 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-11-23 11:19:05,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:19:05,219 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:05,220 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 11:19:05,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:05,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:05,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1855029503, now seen corresponding path program 2 times [2018-11-23 11:19:05,221 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:05,221 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:19:05,240 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:19:05,388 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:19:05,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:19:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:05,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:05,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {1927#true} call ULTIMATE.init(); {1927#true} is VALID [2018-11-23 11:19:05,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {1927#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1927#true} is VALID [2018-11-23 11:19:05,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:05,634 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1927#true} {1927#true} #135#return; {1927#true} is VALID [2018-11-23 11:19:05,634 INFO L256 TraceCheckUtils]: 4: Hoare triple {1927#true} call #t~ret15 := main(); {1927#true} is VALID [2018-11-23 11:19:05,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {1927#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1927#true} is VALID [2018-11-23 11:19:05,635 INFO L256 TraceCheckUtils]: 6: Hoare triple {1927#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1927#true} is VALID [2018-11-23 11:19:05,635 INFO L273 TraceCheckUtils]: 7: Hoare triple {1927#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1927#true} is VALID [2018-11-23 11:19:05,635 INFO L273 TraceCheckUtils]: 8: Hoare triple {1927#true} assume !!~bvsgt32(~len, 0bv32); {1927#true} is VALID [2018-11-23 11:19:05,635 INFO L256 TraceCheckUtils]: 9: Hoare triple {1927#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1927#true} is VALID [2018-11-23 11:19:05,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {1927#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1927#true} is VALID [2018-11-23 11:19:05,636 INFO L273 TraceCheckUtils]: 11: Hoare triple {1927#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1927#true} is VALID [2018-11-23 11:19:05,636 INFO L273 TraceCheckUtils]: 12: Hoare triple {1927#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1927#true} is VALID [2018-11-23 11:19:05,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:05,637 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1927#true} {1927#true} #133#return; {1927#true} is VALID [2018-11-23 11:19:05,637 INFO L273 TraceCheckUtils]: 15: Hoare triple {1927#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1927#true} is VALID [2018-11-23 11:19:05,637 INFO L273 TraceCheckUtils]: 16: Hoare triple {1927#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1927#true} is VALID [2018-11-23 11:19:05,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {1927#true} assume !!~bvsgt32(~len, 0bv32); {1927#true} is VALID [2018-11-23 11:19:05,638 INFO L256 TraceCheckUtils]: 18: Hoare triple {1927#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1927#true} is VALID [2018-11-23 11:19:05,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {1927#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1927#true} is VALID [2018-11-23 11:19:05,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {1927#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1927#true} is VALID [2018-11-23 11:19:05,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {1927#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1927#true} is VALID [2018-11-23 11:19:05,639 INFO L273 TraceCheckUtils]: 22: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:05,639 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1927#true} {1927#true} #133#return; {1927#true} is VALID [2018-11-23 11:19:05,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {1927#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1927#true} is VALID [2018-11-23 11:19:05,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {1927#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1927#true} is VALID [2018-11-23 11:19:05,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {1927#true} assume !~bvsgt32(~len, 0bv32); {1927#true} is VALID [2018-11-23 11:19:05,640 INFO L273 TraceCheckUtils]: 27: Hoare triple {1927#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1927#true} is VALID [2018-11-23 11:19:05,640 INFO L273 TraceCheckUtils]: 28: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:05,641 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1927#true} {1927#true} #125#return; {1927#true} is VALID [2018-11-23 11:19:05,653 INFO L273 TraceCheckUtils]: 30: Hoare triple {1927#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2022#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:19:05,670 INFO L273 TraceCheckUtils]: 31: Hoare triple {2022#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2022#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:19:05,670 INFO L256 TraceCheckUtils]: 32: Hoare triple {2022#(= main_~i~0 (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1927#true} is VALID [2018-11-23 11:19:05,671 INFO L273 TraceCheckUtils]: 33: Hoare triple {1927#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1927#true} is VALID [2018-11-23 11:19:05,671 INFO L273 TraceCheckUtils]: 34: Hoare triple {1927#true} assume !~bvsgt32(~index, 0bv32); {1927#true} is VALID [2018-11-23 11:19:05,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {1927#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1927#true} is VALID [2018-11-23 11:19:05,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:05,684 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1927#true} {2022#(= main_~i~0 (_ bv0 32))} #127#return; {2022#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:19:05,685 INFO L273 TraceCheckUtils]: 38: Hoare triple {2022#(= main_~i~0 (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2047#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:05,690 INFO L273 TraceCheckUtils]: 39: Hoare triple {2047#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2047#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:05,690 INFO L256 TraceCheckUtils]: 40: Hoare triple {2047#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1927#true} is VALID [2018-11-23 11:19:05,691 INFO L273 TraceCheckUtils]: 41: Hoare triple {1927#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2057#(= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-23 11:19:05,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {2057#(= |sll_update_at_#in~index| sll_update_at_~index)} assume !~bvsgt32(~index, 0bv32); {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:19:05,711 INFO L273 TraceCheckUtils]: 43: Hoare triple {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:19:05,714 INFO L273 TraceCheckUtils]: 44: Hoare triple {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} assume true; {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:19:05,730 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} {2047#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #127#return; {1928#false} is VALID [2018-11-23 11:19:05,730 INFO L273 TraceCheckUtils]: 46: Hoare triple {1928#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1928#false} is VALID [2018-11-23 11:19:05,731 INFO L273 TraceCheckUtils]: 47: Hoare triple {1928#false} assume !~bvslt32(~i~0, ~len~0); {1928#false} is VALID [2018-11-23 11:19:05,731 INFO L273 TraceCheckUtils]: 48: Hoare triple {1928#false} ~i~0 := 0bv32; {1928#false} is VALID [2018-11-23 11:19:05,731 INFO L273 TraceCheckUtils]: 49: Hoare triple {1928#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1928#false} is VALID [2018-11-23 11:19:05,731 INFO L256 TraceCheckUtils]: 50: Hoare triple {1928#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1928#false} is VALID [2018-11-23 11:19:05,731 INFO L273 TraceCheckUtils]: 51: Hoare triple {1928#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1928#false} is VALID [2018-11-23 11:19:05,732 INFO L273 TraceCheckUtils]: 52: Hoare triple {1928#false} assume !~bvsgt32(~index, 0bv32); {1928#false} is VALID [2018-11-23 11:19:05,732 INFO L273 TraceCheckUtils]: 53: Hoare triple {1928#false} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1928#false} is VALID [2018-11-23 11:19:05,732 INFO L273 TraceCheckUtils]: 54: Hoare triple {1928#false} assume true; {1928#false} is VALID [2018-11-23 11:19:05,732 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1928#false} {1928#false} #129#return; {1928#false} is VALID [2018-11-23 11:19:05,733 INFO L273 TraceCheckUtils]: 56: Hoare triple {1928#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1928#false} is VALID [2018-11-23 11:19:05,733 INFO L273 TraceCheckUtils]: 57: Hoare triple {1928#false} assume !false; {1928#false} is VALID [2018-11-23 11:19:05,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:19:05,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:05,976 INFO L273 TraceCheckUtils]: 57: Hoare triple {1928#false} assume !false; {1928#false} is VALID [2018-11-23 11:19:05,977 INFO L273 TraceCheckUtils]: 56: Hoare triple {1928#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1928#false} is VALID [2018-11-23 11:19:05,977 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1927#true} {1928#false} #129#return; {1928#false} is VALID [2018-11-23 11:19:05,978 INFO L273 TraceCheckUtils]: 54: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:05,978 INFO L273 TraceCheckUtils]: 53: Hoare triple {1927#true} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {1927#true} is VALID [2018-11-23 11:19:05,978 INFO L273 TraceCheckUtils]: 52: Hoare triple {1927#true} assume !~bvsgt32(~index, 0bv32); {1927#true} is VALID [2018-11-23 11:19:05,978 INFO L273 TraceCheckUtils]: 51: Hoare triple {1927#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1927#true} is VALID [2018-11-23 11:19:05,978 INFO L256 TraceCheckUtils]: 50: Hoare triple {1928#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1927#true} is VALID [2018-11-23 11:19:05,979 INFO L273 TraceCheckUtils]: 49: Hoare triple {1928#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1928#false} is VALID [2018-11-23 11:19:05,979 INFO L273 TraceCheckUtils]: 48: Hoare triple {1928#false} ~i~0 := 0bv32; {1928#false} is VALID [2018-11-23 11:19:05,979 INFO L273 TraceCheckUtils]: 47: Hoare triple {1928#false} assume !~bvslt32(~i~0, ~len~0); {1928#false} is VALID [2018-11-23 11:19:05,979 INFO L273 TraceCheckUtils]: 46: Hoare triple {1928#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1928#false} is VALID [2018-11-23 11:19:05,980 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} {2143#(bvsgt main_~i~0 (_ bv0 32))} #127#return; {1928#false} is VALID [2018-11-23 11:19:05,981 INFO L273 TraceCheckUtils]: 44: Hoare triple {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} assume true; {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:19:05,981 INFO L273 TraceCheckUtils]: 43: Hoare triple {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:19:05,982 INFO L273 TraceCheckUtils]: 42: Hoare triple {2156#(or (not (bvsgt |sll_update_at_#in~index| (_ bv0 32))) (bvsgt sll_update_at_~index (_ bv0 32)))} assume !~bvsgt32(~index, 0bv32); {2061#(not (bvsgt |sll_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:19:05,982 INFO L273 TraceCheckUtils]: 41: Hoare triple {1927#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2156#(or (not (bvsgt |sll_update_at_#in~index| (_ bv0 32))) (bvsgt sll_update_at_~index (_ bv0 32)))} is VALID [2018-11-23 11:19:05,982 INFO L256 TraceCheckUtils]: 40: Hoare triple {2143#(bvsgt main_~i~0 (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1927#true} is VALID [2018-11-23 11:19:05,983 INFO L273 TraceCheckUtils]: 39: Hoare triple {2143#(bvsgt main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2143#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:19:05,984 INFO L273 TraceCheckUtils]: 38: Hoare triple {2166#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2143#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:19:05,986 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1927#true} {2166#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #127#return; {2166#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:05,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:05,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {1927#true} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {1927#true} is VALID [2018-11-23 11:19:05,987 INFO L273 TraceCheckUtils]: 34: Hoare triple {1927#true} assume !~bvsgt32(~index, 0bv32); {1927#true} is VALID [2018-11-23 11:19:05,988 INFO L273 TraceCheckUtils]: 33: Hoare triple {1927#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1927#true} is VALID [2018-11-23 11:19:05,988 INFO L256 TraceCheckUtils]: 32: Hoare triple {2166#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1927#true} is VALID [2018-11-23 11:19:05,989 INFO L273 TraceCheckUtils]: 31: Hoare triple {2166#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2166#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:05,999 INFO L273 TraceCheckUtils]: 30: Hoare triple {1927#true} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2166#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:06,000 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1927#true} {1927#true} #125#return; {1927#true} is VALID [2018-11-23 11:19:06,000 INFO L273 TraceCheckUtils]: 28: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:06,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {1927#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1927#true} is VALID [2018-11-23 11:19:06,000 INFO L273 TraceCheckUtils]: 26: Hoare triple {1927#true} assume !~bvsgt32(~len, 0bv32); {1927#true} is VALID [2018-11-23 11:19:06,000 INFO L273 TraceCheckUtils]: 25: Hoare triple {1927#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1927#true} is VALID [2018-11-23 11:19:06,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {1927#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1927#true} is VALID [2018-11-23 11:19:06,001 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1927#true} {1927#true} #133#return; {1927#true} is VALID [2018-11-23 11:19:06,001 INFO L273 TraceCheckUtils]: 22: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:06,001 INFO L273 TraceCheckUtils]: 21: Hoare triple {1927#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1927#true} is VALID [2018-11-23 11:19:06,001 INFO L273 TraceCheckUtils]: 20: Hoare triple {1927#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1927#true} is VALID [2018-11-23 11:19:06,001 INFO L273 TraceCheckUtils]: 19: Hoare triple {1927#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1927#true} is VALID [2018-11-23 11:19:06,001 INFO L256 TraceCheckUtils]: 18: Hoare triple {1927#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1927#true} is VALID [2018-11-23 11:19:06,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {1927#true} assume !!~bvsgt32(~len, 0bv32); {1927#true} is VALID [2018-11-23 11:19:06,002 INFO L273 TraceCheckUtils]: 16: Hoare triple {1927#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1927#true} is VALID [2018-11-23 11:19:06,002 INFO L273 TraceCheckUtils]: 15: Hoare triple {1927#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1927#true} is VALID [2018-11-23 11:19:06,002 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1927#true} {1927#true} #133#return; {1927#true} is VALID [2018-11-23 11:19:06,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:06,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {1927#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1927#true} is VALID [2018-11-23 11:19:06,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {1927#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1927#true} is VALID [2018-11-23 11:19:06,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {1927#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1927#true} is VALID [2018-11-23 11:19:06,003 INFO L256 TraceCheckUtils]: 9: Hoare triple {1927#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1927#true} is VALID [2018-11-23 11:19:06,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {1927#true} assume !!~bvsgt32(~len, 0bv32); {1927#true} is VALID [2018-11-23 11:19:06,003 INFO L273 TraceCheckUtils]: 7: Hoare triple {1927#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1927#true} is VALID [2018-11-23 11:19:06,003 INFO L256 TraceCheckUtils]: 6: Hoare triple {1927#true} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1927#true} is VALID [2018-11-23 11:19:06,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {1927#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1927#true} is VALID [2018-11-23 11:19:06,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {1927#true} call #t~ret15 := main(); {1927#true} is VALID [2018-11-23 11:19:06,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1927#true} {1927#true} #135#return; {1927#true} is VALID [2018-11-23 11:19:06,004 INFO L273 TraceCheckUtils]: 2: Hoare triple {1927#true} assume true; {1927#true} is VALID [2018-11-23 11:19:06,004 INFO L273 TraceCheckUtils]: 1: Hoare triple {1927#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1927#true} is VALID [2018-11-23 11:19:06,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {1927#true} call ULTIMATE.init(); {1927#true} is VALID [2018-11-23 11:19:06,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:19:06,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:19:06,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:19:06,009 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-23 11:19:06,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:06,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:19:06,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:06,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:19:06,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:19:06,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:19:06,137 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-11-23 11:19:07,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:07,422 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2018-11-23 11:19:07,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:19:07,422 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-11-23 11:19:07,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:19:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2018-11-23 11:19:07,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:19:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2018-11-23 11:19:07,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2018-11-23 11:19:07,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:07,642 INFO L225 Difference]: With dead ends: 95 [2018-11-23 11:19:07,643 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:19:07,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:19:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:19:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-11-23 11:19:07,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:07,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 56 states. [2018-11-23 11:19:07,697 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 56 states. [2018-11-23 11:19:07,697 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 56 states. [2018-11-23 11:19:07,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:07,700 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 11:19:07,700 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2018-11-23 11:19:07,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:07,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:07,701 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 73 states. [2018-11-23 11:19:07,701 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 73 states. [2018-11-23 11:19:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:07,705 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-11-23 11:19:07,705 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2018-11-23 11:19:07,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:07,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:07,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:07,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 11:19:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-11-23 11:19:07,709 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 58 [2018-11-23 11:19:07,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:07,709 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-11-23 11:19:07,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:19:07,710 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-11-23 11:19:07,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 11:19:07,711 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:07,711 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 11:19:07,711 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:07,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:07,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2081241532, now seen corresponding path program 1 times [2018-11-23 11:19:07,712 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:07,712 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:19:07,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:19:07,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:07,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:08,040 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 11:19:08,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:19:08,062 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:08,062 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_70|]. (= |#valid| (store |v_#valid_70| node_create_~temp~0.base (_ bv1 1))) [2018-11-23 11:19:08,062 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:19:08,299 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:08,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:08,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:19:08,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,311 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-11-23 11:19:08,314 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:08,315 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#valid)_AFTER_CALL_39|]. (and (= (_ bv0 1) (select |v_old(#valid)_AFTER_CALL_39| |sll_create_#t~ret4.base|)) (= (bvadd (select |v_old(#valid)_AFTER_CALL_39| sll_create_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) |sll_create_#t~ret4.offset|)) [2018-11-23 11:19:08,315 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|)) [2018-11-23 11:19:08,376 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 11:19:08,383 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 11:19:08,384 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 11:19:08,413 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:08,413 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_82|, v_sll_create_~head~0.base_21]. (and (not (= sll_create_~head~0.base v_sll_create_~head~0.base_21)) (= (store |v_#memory_$Pointer$.base_82| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_82| sll_create_~head~0.base) (_ bv4 32) v_sll_create_~head~0.base_21)) |#memory_$Pointer$.base|) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:19:08,413 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:19:08,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:19:08,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:19:08,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 11:19:08,941 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 24 treesize of output 19 [2018-11-23 11:19:08,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:08,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-23 11:19:08,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:08,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-11-23 11:19:11,353 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (bvadd |c_sll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) sll_update_at_~head.offset sll_update_at_~data))) |c_#memory_int|)) is different from true [2018-11-23 11:19:11,388 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:11,401 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-23 11:19:11,411 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 14 treesize of output 13 [2018-11-23 11:19:11,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:11,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:11,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-23 11:19:11,463 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:19:11,465 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 11:19:11,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:11,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:11,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:11,499 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:16 [2018-11-23 11:19:11,511 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:11,512 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_39|, |v_#memory_int_BEFORE_CALL_2|, sll_update_at_~head.offset, sll_update_at_~data]. (let ((.cse1 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_39| main_~s~0.base))) (and (= (let ((.cse0 (select .cse1 (bvadd main_~s~0.offset (_ bv4 32))))) (store |v_#memory_int_BEFORE_CALL_2| .cse0 (store (select |v_#memory_int_BEFORE_CALL_2| .cse0) sll_update_at_~head.offset sll_update_at_~data))) |#memory_int|) (= main_~len~0 (select (select |v_#memory_int_BEFORE_CALL_2| main_~s~0.base) main_~s~0.offset)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select .cse1 (_ bv4 32)) main_~s~0.base)))) [2018-11-23 11:19:11,512 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) [2018-11-23 11:19:14,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 11:19:14,114 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 20 treesize of output 11 [2018-11-23 11:19:14,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:14,144 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 18 treesize of output 9 [2018-11-23 11:19:14,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:14,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:14,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:14,233 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-23 11:19:14,238 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:14,238 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~s~0.base, v_main_~s~0.base_BEFORE_CALL_3]. (let ((.cse0 (select (select |#memory_int| main_~s~0.base) (_ bv0 32)))) (and (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2 32) .cse0) (= main_~expected~0 .cse0) (= |main_#t~ret14| .cse0))) [2018-11-23 11:19:14,238 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~ret14| main_~expected~0) (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32))) [2018-11-23 11:19:14,294 INFO L256 TraceCheckUtils]: 0: Hoare triple {2657#true} call ULTIMATE.init(); {2657#true} is VALID [2018-11-23 11:19:14,295 INFO L273 TraceCheckUtils]: 1: Hoare triple {2657#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2657#true} is VALID [2018-11-23 11:19:14,295 INFO L273 TraceCheckUtils]: 2: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-23 11:19:14,296 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2657#true} {2657#true} #135#return; {2657#true} is VALID [2018-11-23 11:19:14,296 INFO L256 TraceCheckUtils]: 4: Hoare triple {2657#true} call #t~ret15 := main(); {2657#true} is VALID [2018-11-23 11:19:14,297 INFO L273 TraceCheckUtils]: 5: Hoare triple {2657#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2677#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:14,297 INFO L256 TraceCheckUtils]: 6: Hoare triple {2677#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2657#true} is VALID [2018-11-23 11:19:14,297 INFO L273 TraceCheckUtils]: 7: Hoare triple {2657#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2657#true} is VALID [2018-11-23 11:19:14,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {2657#true} assume !!~bvsgt32(~len, 0bv32); {2657#true} is VALID [2018-11-23 11:19:14,298 INFO L256 TraceCheckUtils]: 9: Hoare triple {2657#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2657#true} is VALID [2018-11-23 11:19:14,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {2657#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2693#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:14,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {2693#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2693#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:14,300 INFO L273 TraceCheckUtils]: 12: Hoare triple {2693#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2700#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:19:14,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {2700#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {2700#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:19:14,303 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2700#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {2657#true} #133#return; {2707#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:14,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {2707#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:14,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:14,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32); {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:14,308 INFO L256 TraceCheckUtils]: 18: Hoare triple {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2721#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:19:14,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {2721#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2725#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:19:14,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {2725#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2725#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:19:14,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {2725#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2732#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:14,313 INFO L273 TraceCheckUtils]: 22: Hoare triple {2732#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2732#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:14,315 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2732#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #133#return; {2739#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} is VALID [2018-11-23 11:19:14,318 INFO L273 TraceCheckUtils]: 24: Hoare triple {2739#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:14,319 INFO L273 TraceCheckUtils]: 25: Hoare triple {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:14,320 INFO L273 TraceCheckUtils]: 26: Hoare triple {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} assume !~bvsgt32(~len, 0bv32); {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:14,321 INFO L273 TraceCheckUtils]: 27: Hoare triple {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2753#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:14,322 INFO L273 TraceCheckUtils]: 28: Hoare triple {2753#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {2753#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:14,326 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2753#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} {2677#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {2760#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:14,327 INFO L273 TraceCheckUtils]: 30: Hoare triple {2760#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2764#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:14,328 INFO L273 TraceCheckUtils]: 31: Hoare triple {2764#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2768#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:14,329 INFO L256 TraceCheckUtils]: 32: Hoare triple {2768#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2772#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:19:14,330 INFO L273 TraceCheckUtils]: 33: Hoare triple {2772#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2776#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:14,334 INFO L273 TraceCheckUtils]: 34: Hoare triple {2776#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !~bvsgt32(~index, 0bv32); {2776#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:14,343 INFO L273 TraceCheckUtils]: 35: Hoare triple {2776#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2783#(and (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))))} is VALID [2018-11-23 11:19:14,345 INFO L273 TraceCheckUtils]: 36: Hoare triple {2783#(and (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))))} assume true; {2783#(and (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))))} is VALID [2018-11-23 11:19:14,348 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2783#(and (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))))} {2768#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #127#return; {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:14,349 INFO L273 TraceCheckUtils]: 38: Hoare triple {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:14,350 INFO L273 TraceCheckUtils]: 39: Hoare triple {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:14,351 INFO L256 TraceCheckUtils]: 40: Hoare triple {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2800#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:14,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {2800#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2804#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:14,355 INFO L273 TraceCheckUtils]: 42: Hoare triple {2804#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !!~bvsgt32(~index, 0bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;#t~post10 := ~index;~index := ~bvsub32(#t~post10, 1bv32);havoc #t~post10; {2808#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base))} is VALID [2018-11-23 11:19:14,356 INFO L273 TraceCheckUtils]: 43: Hoare triple {2808#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2808#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base))} is VALID [2018-11-23 11:19:14,358 INFO L273 TraceCheckUtils]: 44: Hoare triple {2808#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2815#(exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:19:14,358 INFO L273 TraceCheckUtils]: 45: Hoare triple {2815#(exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)) |#memory_int|))} assume true; {2815#(exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:19:14,362 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2815#(exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)) |#memory_int|))} {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #127#return; {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:14,363 INFO L273 TraceCheckUtils]: 47: Hoare triple {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:14,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !~bvslt32(~i~0, ~len~0); {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:14,365 INFO L273 TraceCheckUtils]: 49: Hoare triple {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} ~i~0 := 0bv32; {2832#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:14,366 INFO L273 TraceCheckUtils]: 50: Hoare triple {2832#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2836#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:14,368 INFO L256 TraceCheckUtils]: 51: Hoare triple {2836#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2840#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:14,369 INFO L273 TraceCheckUtils]: 52: Hoare triple {2840#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2844#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-23 11:19:14,370 INFO L273 TraceCheckUtils]: 53: Hoare triple {2844#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} assume !~bvsgt32(~index, 0bv32); {2844#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-23 11:19:14,371 INFO L273 TraceCheckUtils]: 54: Hoare triple {2844#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2851#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} is VALID [2018-11-23 11:19:14,371 INFO L273 TraceCheckUtils]: 55: Hoare triple {2851#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} assume true; {2851#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} is VALID [2018-11-23 11:19:14,373 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {2851#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} {2836#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #129#return; {2858#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} is VALID [2018-11-23 11:19:14,374 INFO L273 TraceCheckUtils]: 57: Hoare triple {2858#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2658#false} is VALID [2018-11-23 11:19:14,374 INFO L273 TraceCheckUtils]: 58: Hoare triple {2658#false} assume !false; {2658#false} is VALID [2018-11-23 11:19:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 11:19:14,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:17,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:19:17,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP 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 11:19:17,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:17,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:17,701 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 11:19:17,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:19:17,714 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:17,715 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_72|]. (= |#valid| (store |v_#valid_72| node_create_~temp~0.base (_ bv1 1))) [2018-11-23 11:19:17,715 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:19:17,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:17,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:17,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:19:17,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-11-23 11:19:17,829 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:17,829 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_4|]. (and (= (select |v_#valid_BEFORE_CALL_4| |sll_create_#t~ret4.base|) (_ bv0 1)) (= (select |v_#valid_BEFORE_CALL_4| sll_create_~head~0.base) (_ bv1 1)) (= (_ bv0 32) |sll_create_#t~ret4.offset|)) [2018-11-23 11:19:17,830 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|)) [2018-11-23 11:19:17,847 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 11:19:17,852 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 11:19:17,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,873 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 11:19:17,882 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:17,882 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_92|, v_sll_create_~head~0.base_22]. (and (not (= sll_create_~head~0.base v_sll_create_~head~0.base_22)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_92| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_92| sll_create_~head~0.base) (_ bv4 32) v_sll_create_~head~0.base_22))) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:19:17,882 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:19:17,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:19:17,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:19:17,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:17,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-11-23 11:19:18,008 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 24 treesize of output 19 [2018-11-23 11:19:18,018 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:18,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 13 [2018-11-23 11:19:18,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-11-23 11:19:18,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:18,145 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-11-23 11:19:18,151 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 14 treesize of output 13 [2018-11-23 11:19:18,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-11-23 11:19:18,217 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:19:18,218 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 11:19:18,221 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:18,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:18,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:18,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:16 [2018-11-23 11:19:18,268 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:18,269 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_45|, |v_old(#memory_int)_AFTER_CALL_45|, sll_update_at_~head.offset, sll_update_at_~data]. (let ((.cse0 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_45| main_~s~0.base))) (and (not (= main_~s~0.base (select .cse0 (_ bv4 32)))) (= (let ((.cse1 (select .cse0 (bvadd main_~s~0.offset (_ bv4 32))))) (store |v_old(#memory_int)_AFTER_CALL_45| .cse1 (store (select |v_old(#memory_int)_AFTER_CALL_45| .cse1) sll_update_at_~head.offset sll_update_at_~data))) |#memory_int|) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |v_old(#memory_int)_AFTER_CALL_45| main_~s~0.base) main_~s~0.offset)))) [2018-11-23 11:19:18,269 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset))) [2018-11-23 11:19:20,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-11-23 11:19:20,443 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 20 treesize of output 11 [2018-11-23 11:19:20,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:20,475 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 18 treesize of output 9 [2018-11-23 11:19:20,477 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:20,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:20,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:20,498 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-11-23 11:19:20,502 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:20,503 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~s~0.base, v_main_~s~0.base_BEFORE_CALL_3]. (let ((.cse0 (select (select |#memory_int| main_~s~0.base) (_ bv0 32)))) (and (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2 32) .cse0) (= main_~expected~0 .cse0) (= |main_#t~ret14| .cse0))) [2018-11-23 11:19:20,503 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~ret14| main_~expected~0) (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32))) [2018-11-23 11:19:20,504 INFO L256 TraceCheckUtils]: 0: Hoare triple {2657#true} call ULTIMATE.init(); {2657#true} is VALID [2018-11-23 11:19:20,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {2657#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2657#true} is VALID [2018-11-23 11:19:20,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {2657#true} assume true; {2657#true} is VALID [2018-11-23 11:19:20,504 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2657#true} {2657#true} #135#return; {2657#true} is VALID [2018-11-23 11:19:20,504 INFO L256 TraceCheckUtils]: 4: Hoare triple {2657#true} call #t~ret15 := main(); {2657#true} is VALID [2018-11-23 11:19:20,505 INFO L273 TraceCheckUtils]: 5: Hoare triple {2657#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2677#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:20,505 INFO L256 TraceCheckUtils]: 6: Hoare triple {2677#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {2657#true} is VALID [2018-11-23 11:19:20,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {2657#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2657#true} is VALID [2018-11-23 11:19:20,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {2657#true} assume !!~bvsgt32(~len, 0bv32); {2657#true} is VALID [2018-11-23 11:19:20,506 INFO L256 TraceCheckUtils]: 9: Hoare triple {2657#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2657#true} is VALID [2018-11-23 11:19:20,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {2657#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2693#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:20,507 INFO L273 TraceCheckUtils]: 11: Hoare triple {2693#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2693#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:20,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {2693#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2700#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:19:20,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {2700#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {2700#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:19:20,510 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2700#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {2657#true} #133#return; {2707#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:19:20,513 INFO L273 TraceCheckUtils]: 15: Hoare triple {2707#(= (bvadd (select |#valid| |sll_create_#t~ret4.base|) (_ bv1 1)) (_ bv0 1))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:20,514 INFO L273 TraceCheckUtils]: 16: Hoare triple {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:20,514 INFO L273 TraceCheckUtils]: 17: Hoare triple {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} assume !!~bvsgt32(~len, 0bv32); {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} is VALID [2018-11-23 11:19:20,515 INFO L256 TraceCheckUtils]: 18: Hoare triple {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2721#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:19:20,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {2721#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {2725#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:19:20,517 INFO L273 TraceCheckUtils]: 20: Hoare triple {2725#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2725#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:19:20,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {2725#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2732#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:20,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {2732#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2732#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:20,523 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {2732#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2711#(= (_ bv1 1) (select |#valid| sll_create_~head~0.base))} #133#return; {2739#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} is VALID [2018-11-23 11:19:20,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {2739#(and (not (= sll_create_~head~0.base |sll_create_#t~ret4.base|)) (= (_ bv0 32) |sll_create_#t~ret4.offset|))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:20,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:20,527 INFO L273 TraceCheckUtils]: 26: Hoare triple {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} assume !~bvsgt32(~len, 0bv32); {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:19:20,549 INFO L273 TraceCheckUtils]: 27: Hoare triple {2743#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2753#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:20,558 INFO L273 TraceCheckUtils]: 28: Hoare triple {2753#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {2753#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:19:20,572 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2753#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv4 32)) |sll_create_#res.base|)) (= |sll_create_#res.offset| (_ bv0 32)))} {2677#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #125#return; {2760#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:20,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {2760#(and (not (= |main_#t~ret11.base| (select (select |#memory_$Pointer$.base| |main_#t~ret11.base|) (_ bv4 32)))) (= |main_#t~ret11.offset| (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := 0bv32; {2764#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:20,600 INFO L273 TraceCheckUtils]: 31: Hoare triple {2764#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2768#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:20,605 INFO L256 TraceCheckUtils]: 32: Hoare triple {2768#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2772#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:19:20,606 INFO L273 TraceCheckUtils]: 33: Hoare triple {2772#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2776#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:20,606 INFO L273 TraceCheckUtils]: 34: Hoare triple {2776#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !~bvsgt32(~index, 0bv32); {2776#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:20,608 INFO L273 TraceCheckUtils]: 35: Hoare triple {2776#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= sll_update_at_~data |sll_update_at_#in~data|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2783#(and (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))))} is VALID [2018-11-23 11:19:20,608 INFO L273 TraceCheckUtils]: 36: Hoare triple {2783#(and (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))))} assume true; {2783#(and (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))))} is VALID [2018-11-23 11:19:20,612 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {2783#(and (= (select (select |#memory_int| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|) |sll_update_at_#in~data|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset| (select (select |#memory_$Pointer$.base| |sll_update_at_#in~head.base|) |sll_update_at_#in~head.offset|)))))} {2768#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #127#return; {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:20,613 INFO L273 TraceCheckUtils]: 38: Hoare triple {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:20,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:20,615 INFO L256 TraceCheckUtils]: 40: Hoare triple {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2800#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:20,616 INFO L273 TraceCheckUtils]: 41: Hoare triple {2800#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2804#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:19:20,619 INFO L273 TraceCheckUtils]: 42: Hoare triple {2804#(and (= sll_update_at_~head.base |sll_update_at_#in~head.base|) (= |old(#memory_int)| |#memory_int|) (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !!~bvsgt32(~index, 0bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);~head.base, ~head.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;#t~post10 := ~index;~index := ~bvsub32(#t~post10, 1bv32);havoc #t~post10; {2808#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base))} is VALID [2018-11-23 11:19:20,621 INFO L273 TraceCheckUtils]: 43: Hoare triple {2808#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2808#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base))} is VALID [2018-11-23 11:19:20,623 INFO L273 TraceCheckUtils]: 44: Hoare triple {2808#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) sll_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~head.offset, 4bv32); {2815#(exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:19:20,624 INFO L273 TraceCheckUtils]: 45: Hoare triple {2815#(exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)) |#memory_int|))} assume true; {2815#(exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:19:20,627 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {2815#(exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32))) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) sll_update_at_~head.offset sll_update_at_~data)) |#memory_int|))} {2790#(and (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base)) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #127#return; {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:20,628 INFO L273 TraceCheckUtils]: 47: Hoare triple {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:20,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !~bvslt32(~i~0, ~len~0); {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:20,629 INFO L273 TraceCheckUtils]: 49: Hoare triple {2822#(and (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} ~i~0 := 0bv32; {2832#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:20,631 INFO L273 TraceCheckUtils]: 50: Hoare triple {2832#(and (= main_~s~0.offset (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {2836#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} is VALID [2018-11-23 11:19:20,633 INFO L256 TraceCheckUtils]: 51: Hoare triple {2836#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2840#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:20,634 INFO L273 TraceCheckUtils]: 52: Hoare triple {2840#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2844#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-23 11:19:20,635 INFO L273 TraceCheckUtils]: 53: Hoare triple {2844#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} assume !~bvsgt32(~index, 0bv32); {2844#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} is VALID [2018-11-23 11:19:20,636 INFO L273 TraceCheckUtils]: 54: Hoare triple {2844#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|))} call #t~mem8 := read~intINTTYPE4(~head.base, ~head.offset, 4bv32);#res := #t~mem8;havoc #t~mem8; {2851#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} is VALID [2018-11-23 11:19:20,637 INFO L273 TraceCheckUtils]: 55: Hoare triple {2851#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} assume true; {2851#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} is VALID [2018-11-23 11:19:20,640 INFO L268 TraceCheckUtils]: 56: Hoare quadruple {2851#(and (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32))) (= (select (select |#memory_int| |sll_get_data_at_#in~head.base|) |sll_get_data_at_#in~head.offset|) |sll_get_data_at_#res|))} {2836#(and (= (bvadd (select (select |#memory_int| main_~s~0.base) main_~s~0.offset) (_ bv4294967294 32)) (_ bv0 32)) (= main_~s~0.offset (_ bv0 32)) (= main_~expected~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))} #129#return; {2858#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} is VALID [2018-11-23 11:19:20,641 INFO L273 TraceCheckUtils]: 57: Hoare triple {2858#(and (= (bvadd |main_#t~ret14| (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret14| main_~expected~0))} assume ~expected~0 != #t~ret14;havoc #t~ret14; {2658#false} is VALID [2018-11-23 11:19:20,642 INFO L273 TraceCheckUtils]: 58: Hoare triple {2658#false} assume !false; {2658#false} is VALID [2018-11-23 11:19:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 11:19:20,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:23,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:19:23,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 11:19:23,483 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-11-23 11:19:23,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:23,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:19:23,625 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 11:19:23,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:19:23,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:19:23,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1232, Unknown=3, NotChecked=70, Total=1406 [2018-11-23 11:19:23,627 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 31 states. [2018-11-23 11:21:40,005 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20