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/sll2c_update_all_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:15:47,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:15:47,554 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:15:47,566 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:15:47,567 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:15:47,568 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:15:47,569 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:15:47,571 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:15:47,573 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:15:47,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:15:47,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:15:47,575 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:15:47,576 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:15:47,577 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:15:47,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:15:47,579 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:15:47,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:15:47,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:15:47,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:15:47,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:15:47,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:15:47,588 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:15:47,591 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:15:47,591 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:15:47,591 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:15:47,593 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:15:47,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:15:47,595 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:15:47,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:15:47,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:15:47,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:15:47,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:15:47,599 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:15:47,599 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:15:47,604 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:15:47,605 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:15:47,605 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:15:47,634 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:15:47,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:15:47,636 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:15:47,636 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:15:47,636 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:15:47,637 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:15:47,637 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:15:47,637 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:15:47,637 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:15:47,637 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:15:47,638 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:15:47,638 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:15:47,638 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:15:47,638 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:15:47,638 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:15:47,639 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:15:47,639 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:15:47,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:15:47,639 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:15:47,639 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:15:47,640 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:15:47,640 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:15:47,640 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:15:47,640 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:15:47,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:15:47,641 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:15:47,641 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:15:47,641 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:15:47,641 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:15:47,641 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:15:47,642 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:15:47,642 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:15:47,642 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:15:47,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:15:47,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:15:47,727 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:15:47,729 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:15:47,730 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:15:47,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:47,800 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac1d8fa3/3932cde4f30a4469831600c6184f2290/FLAG840d031f8 [2018-11-23 11:15:48,278 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:15:48,279 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:48,299 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac1d8fa3/3932cde4f30a4469831600c6184f2290/FLAG840d031f8 [2018-11-23 11:15:48,565 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ac1d8fa3/3932cde4f30a4469831600c6184f2290 [2018-11-23 11:15:48,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:15:48,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:15:48,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:48,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:15:48,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:15:48,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:48,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ffb5a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:48, skipping insertion in model container [2018-11-23 11:15:48,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:15:48" (1/1) ... [2018-11-23 11:15:48,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:15:48,647 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:15:49,116 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:49,137 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:15:49,322 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:15:49,396 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:15:49,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49 WrapperNode [2018-11-23 11:15:49,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:15:49,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:49,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:15:49,398 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:15:49,407 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:15:49" (1/1) ... [2018-11-23 11:15:49,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,437 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:15:49,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:15:49,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:15:49,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:15:49,446 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (1/1) ... [2018-11-23 11:15:49,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:15:49,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:15:49,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:15:49,507 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:15:49,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (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:15:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:15:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:15:49,576 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:15:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:15:49,577 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:15:49,577 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:15:49,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:15:49,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:15:49,578 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:15:49,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:15:49,578 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-11-23 11:15:49,579 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-11-23 11:15:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:15:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:15:49,579 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-23 11:15:49,580 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-23 11:15:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:15:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:15:49,580 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-23 11:15:49,581 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-23 11:15:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-11-23 11:15:49,581 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-11-23 11:15:49,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:15:49,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:15:50,757 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:15:50,758 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:15:50,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:50 BoogieIcfgContainer [2018-11-23 11:15:50,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:15:50,760 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:15:50,760 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:15:50,763 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:15:50,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:15:48" (1/3) ... [2018-11-23 11:15:50,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710d23af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:50, skipping insertion in model container [2018-11-23 11:15:50,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:15:49" (2/3) ... [2018-11-23 11:15:50,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710d23af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:15:50, skipping insertion in model container [2018-11-23 11:15:50,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:15:50" (3/3) ... [2018-11-23 11:15:50,770 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:15:50,783 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:15:50,794 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:15:50,810 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:15:50,841 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:15:50,842 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:15:50,842 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:15:50,843 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:15:50,843 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:15:50,843 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:15:50,843 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:15:50,843 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:15:50,843 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:15:50,861 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-11-23 11:15:50,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 11:15:50,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:50,871 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] [2018-11-23 11:15:50,874 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:50,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:50,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1745188395, now seen corresponding path program 1 times [2018-11-23 11:15:50,886 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:50,887 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:15:50,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:51,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:51,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {60#true} is VALID [2018-11-23 11:15:51,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {60#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {60#true} is VALID [2018-11-23 11:15:51,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-23 11:15:51,460 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #145#return; {60#true} is VALID [2018-11-23 11:15:51,460 INFO L256 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret17 := main(); {60#true} is VALID [2018-11-23 11:15:51,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {60#true} ~len~0 := 2bv32;~data~0 := 1bv32; {80#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:51,474 INFO L256 TraceCheckUtils]: 6: Hoare triple {80#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {60#true} is VALID [2018-11-23 11:15:51,479 INFO L273 TraceCheckUtils]: 7: Hoare triple {60#true} ~len := #in~len;~data := #in~data; {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-23 11:15:51,480 INFO L256 TraceCheckUtils]: 8: Hoare triple {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {60#true} is VALID [2018-11-23 11:15:51,480 INFO L273 TraceCheckUtils]: 9: Hoare triple {60#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; {60#true} is VALID [2018-11-23 11:15:51,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {60#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {60#true} is VALID [2018-11-23 11:15:51,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {60#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {60#true} is VALID [2018-11-23 11:15:51,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {60#true} assume true; {60#true} is VALID [2018-11-23 11:15:51,499 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {60#true} {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} #141#return; {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-23 11:15:51,505 INFO L273 TraceCheckUtils]: 14: Hoare triple {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-23 11:15:51,507 INFO L273 TraceCheckUtils]: 15: Hoare triple {87#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:15:51,510 INFO L273 TraceCheckUtils]: 16: Hoare triple {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:15:51,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} assume true; {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-23 11:15:51,537 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {112#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} {80#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {61#false} is VALID [2018-11-23 11:15:51,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {61#false} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {61#false} is VALID [2018-11-23 11:15:51,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {61#false} assume !~bvslt32(~i~0, ~len~0); {61#false} is VALID [2018-11-23 11:15:51,539 INFO L273 TraceCheckUtils]: 21: Hoare triple {61#false} ~i~0 := 0bv32; {61#false} is VALID [2018-11-23 11:15:51,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {61#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {61#false} is VALID [2018-11-23 11:15:51,539 INFO L256 TraceCheckUtils]: 23: Hoare triple {61#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {61#false} is VALID [2018-11-23 11:15:51,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {61#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {61#false} is VALID [2018-11-23 11:15:51,540 INFO L273 TraceCheckUtils]: 25: Hoare triple {61#false} assume !~bvsgt32(~index, 0bv32); {61#false} is VALID [2018-11-23 11:15:51,540 INFO L273 TraceCheckUtils]: 26: Hoare triple {61#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {61#false} is VALID [2018-11-23 11:15:51,541 INFO L273 TraceCheckUtils]: 27: Hoare triple {61#false} assume true; {61#false} is VALID [2018-11-23 11:15:51,541 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {61#false} {61#false} #137#return; {61#false} is VALID [2018-11-23 11:15:51,541 INFO L273 TraceCheckUtils]: 29: Hoare triple {61#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {61#false} is VALID [2018-11-23 11:15:51,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {61#false} assume !false; {61#false} is VALID [2018-11-23 11:15:51,550 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:15:51,550 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:51,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:51,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:15:51,562 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:15:51,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:51,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:15:51,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:51,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:15:51,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:15:51,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:15:51,852 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 5 states. [2018-11-23 11:15:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:53,321 INFO L93 Difference]: Finished difference Result 99 states and 131 transitions. [2018-11-23 11:15:53,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:15:53,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-23 11:15:53,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-23 11:15:53,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:15:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2018-11-23 11:15:53,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2018-11-23 11:15:53,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:53,697 INFO L225 Difference]: With dead ends: 99 [2018-11-23 11:15:53,698 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:15:53,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:15:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:15:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-11-23 11:15:53,771 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:53,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 43 states. [2018-11-23 11:15:53,772 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 43 states. [2018-11-23 11:15:53,772 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 43 states. [2018-11-23 11:15:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:53,778 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:15:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:15:53,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:53,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:53,780 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 45 states. [2018-11-23 11:15:53,780 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 45 states. [2018-11-23 11:15:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:53,786 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-23 11:15:53,786 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-23 11:15:53,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:53,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:53,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:53,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:15:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-23 11:15:53,794 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 31 [2018-11-23 11:15:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:53,794 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-23 11:15:53,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:15:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-23 11:15:53,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:15:53,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:53,797 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-11-23 11:15:53,797 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:53,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:53,798 INFO L82 PathProgramCache]: Analyzing trace with hash -378425709, now seen corresponding path program 1 times [2018-11-23 11:15:53,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:53,799 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:15:53,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:53,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:54,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2018-11-23 11:15:54,048 INFO L273 TraceCheckUtils]: 1: Hoare triple {450#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {450#true} is VALID [2018-11-23 11:15:54,048 INFO L273 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 11:15:54,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #145#return; {450#true} is VALID [2018-11-23 11:15:54,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret17 := main(); {450#true} is VALID [2018-11-23 11:15:54,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {450#true} ~len~0 := 2bv32;~data~0 := 1bv32; {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:54,049 INFO L256 TraceCheckUtils]: 6: Hoare triple {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {450#true} is VALID [2018-11-23 11:15:54,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {450#true} ~len := #in~len;~data := #in~data; {450#true} is VALID [2018-11-23 11:15:54,050 INFO L256 TraceCheckUtils]: 8: Hoare triple {450#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {450#true} is VALID [2018-11-23 11:15:54,050 INFO L273 TraceCheckUtils]: 9: Hoare triple {450#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; {450#true} is VALID [2018-11-23 11:15:54,051 INFO L273 TraceCheckUtils]: 10: Hoare triple {450#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {450#true} is VALID [2018-11-23 11:15:54,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {450#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {450#true} is VALID [2018-11-23 11:15:54,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 11:15:54,052 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {450#true} {450#true} #141#return; {450#true} is VALID [2018-11-23 11:15:54,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {450#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {450#true} is VALID [2018-11-23 11:15:54,052 INFO L273 TraceCheckUtils]: 15: Hoare triple {450#true} assume !!~bvsgt32(~len, 1bv32); {450#true} is VALID [2018-11-23 11:15:54,052 INFO L256 TraceCheckUtils]: 16: Hoare triple {450#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {450#true} is VALID [2018-11-23 11:15:54,053 INFO L273 TraceCheckUtils]: 17: Hoare triple {450#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; {450#true} is VALID [2018-11-23 11:15:54,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {450#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {450#true} is VALID [2018-11-23 11:15:54,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {450#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {450#true} is VALID [2018-11-23 11:15:54,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 11:15:54,054 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {450#true} {450#true} #143#return; {450#true} is VALID [2018-11-23 11:15:54,054 INFO L273 TraceCheckUtils]: 22: Hoare triple {450#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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {450#true} is VALID [2018-11-23 11:15:54,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {450#true} assume !~bvsgt32(~len, 1bv32); {450#true} is VALID [2018-11-23 11:15:54,055 INFO L273 TraceCheckUtils]: 24: Hoare triple {450#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {450#true} is VALID [2018-11-23 11:15:54,055 INFO L273 TraceCheckUtils]: 25: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 11:15:54,065 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {450#true} {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:54,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {470#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {537#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:54,070 INFO L273 TraceCheckUtils]: 28: Hoare triple {537#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {451#false} is VALID [2018-11-23 11:15:54,070 INFO L273 TraceCheckUtils]: 29: Hoare triple {451#false} ~i~0 := 0bv32; {451#false} is VALID [2018-11-23 11:15:54,071 INFO L273 TraceCheckUtils]: 30: Hoare triple {451#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {451#false} is VALID [2018-11-23 11:15:54,071 INFO L256 TraceCheckUtils]: 31: Hoare triple {451#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {451#false} is VALID [2018-11-23 11:15:54,072 INFO L273 TraceCheckUtils]: 32: Hoare triple {451#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {451#false} is VALID [2018-11-23 11:15:54,072 INFO L273 TraceCheckUtils]: 33: Hoare triple {451#false} assume !~bvsgt32(~index, 0bv32); {451#false} is VALID [2018-11-23 11:15:54,072 INFO L273 TraceCheckUtils]: 34: Hoare triple {451#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {451#false} is VALID [2018-11-23 11:15:54,072 INFO L273 TraceCheckUtils]: 35: Hoare triple {451#false} assume true; {451#false} is VALID [2018-11-23 11:15:54,073 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {451#false} {451#false} #137#return; {451#false} is VALID [2018-11-23 11:15:54,073 INFO L273 TraceCheckUtils]: 37: Hoare triple {451#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {451#false} is VALID [2018-11-23 11:15:54,073 INFO L273 TraceCheckUtils]: 38: Hoare triple {451#false} assume !false; {451#false} is VALID [2018-11-23 11:15:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:15:54,077 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:15:54,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:15:54,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:15:54,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 11:15:54,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:54,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:15:54,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:54,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:15:54,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:15:54,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:15:54,164 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-23 11:15:54,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:54,547 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-11-23 11:15:54,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:15:54,548 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-11-23 11:15:54,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-23 11:15:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:15:54,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2018-11-23 11:15:54,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 72 transitions. [2018-11-23 11:15:54,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:54,692 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:15:54,692 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 11:15:54,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 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:15:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 11:15:54,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-11-23 11:15:54,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:54,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 44 states. [2018-11-23 11:15:54,731 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 44 states. [2018-11-23 11:15:54,731 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 44 states. [2018-11-23 11:15:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:54,736 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 11:15:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 11:15:54,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:54,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:54,738 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 52 states. [2018-11-23 11:15:54,738 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 52 states. [2018-11-23 11:15:54,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:54,743 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2018-11-23 11:15:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-11-23 11:15:54,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:54,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:54,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:54,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:15:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-11-23 11:15:54,748 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2018-11-23 11:15:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:54,749 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-11-23 11:15:54,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:15:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-23 11:15:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:15:54,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:54,751 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:54,751 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:54,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash -439772951, now seen corresponding path program 1 times [2018-11-23 11:15:54,752 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:54,752 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:15:54,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:15:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:54,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:55,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2018-11-23 11:15:55,031 INFO L273 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {833#true} is VALID [2018-11-23 11:15:55,031 INFO L273 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #145#return; {833#true} is VALID [2018-11-23 11:15:55,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret17 := main(); {833#true} is VALID [2018-11-23 11:15:55,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {833#true} ~len~0 := 2bv32;~data~0 := 1bv32; {853#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:55,039 INFO L256 TraceCheckUtils]: 6: Hoare triple {853#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {833#true} is VALID [2018-11-23 11:15:55,040 INFO L273 TraceCheckUtils]: 7: Hoare triple {833#true} ~len := #in~len;~data := #in~data; {833#true} is VALID [2018-11-23 11:15:55,040 INFO L256 TraceCheckUtils]: 8: Hoare triple {833#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {833#true} is VALID [2018-11-23 11:15:55,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {833#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; {833#true} is VALID [2018-11-23 11:15:55,040 INFO L273 TraceCheckUtils]: 10: Hoare triple {833#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {833#true} is VALID [2018-11-23 11:15:55,041 INFO L273 TraceCheckUtils]: 11: Hoare triple {833#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {833#true} is VALID [2018-11-23 11:15:55,041 INFO L273 TraceCheckUtils]: 12: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,041 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {833#true} {833#true} #141#return; {833#true} is VALID [2018-11-23 11:15:55,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {833#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {833#true} is VALID [2018-11-23 11:15:55,042 INFO L273 TraceCheckUtils]: 15: Hoare triple {833#true} assume !!~bvsgt32(~len, 1bv32); {833#true} is VALID [2018-11-23 11:15:55,042 INFO L256 TraceCheckUtils]: 16: Hoare triple {833#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {833#true} is VALID [2018-11-23 11:15:55,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {833#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; {833#true} is VALID [2018-11-23 11:15:55,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {833#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {833#true} is VALID [2018-11-23 11:15:55,043 INFO L273 TraceCheckUtils]: 19: Hoare triple {833#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {833#true} is VALID [2018-11-23 11:15:55,043 INFO L273 TraceCheckUtils]: 20: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,043 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {833#true} {833#true} #143#return; {833#true} is VALID [2018-11-23 11:15:55,044 INFO L273 TraceCheckUtils]: 22: Hoare triple {833#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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {833#true} is VALID [2018-11-23 11:15:55,044 INFO L273 TraceCheckUtils]: 23: Hoare triple {833#true} assume !~bvsgt32(~len, 1bv32); {833#true} is VALID [2018-11-23 11:15:55,044 INFO L273 TraceCheckUtils]: 24: Hoare triple {833#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {833#true} is VALID [2018-11-23 11:15:55,044 INFO L273 TraceCheckUtils]: 25: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,046 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {833#true} {853#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {853#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:55,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {853#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {920#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {920#(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); {920#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,047 INFO L256 TraceCheckUtils]: 29: Hoare triple {920#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {833#true} is VALID [2018-11-23 11:15:55,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {833#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {833#true} is VALID [2018-11-23 11:15:55,048 INFO L273 TraceCheckUtils]: 31: Hoare triple {833#true} assume !~bvsgt32(~index, 0bv32); {833#true} is VALID [2018-11-23 11:15:55,049 INFO L273 TraceCheckUtils]: 32: Hoare triple {833#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {833#true} is VALID [2018-11-23 11:15:55,049 INFO L273 TraceCheckUtils]: 33: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,055 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {833#true} {920#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #135#return; {920#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,057 INFO L273 TraceCheckUtils]: 35: Hoare triple {920#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {945#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:15:55,059 INFO L273 TraceCheckUtils]: 36: Hoare triple {945#(and (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {834#false} is VALID [2018-11-23 11:15:55,059 INFO L273 TraceCheckUtils]: 37: Hoare triple {834#false} ~i~0 := 0bv32; {834#false} is VALID [2018-11-23 11:15:55,059 INFO L273 TraceCheckUtils]: 38: Hoare triple {834#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {834#false} is VALID [2018-11-23 11:15:55,059 INFO L256 TraceCheckUtils]: 39: Hoare triple {834#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {834#false} is VALID [2018-11-23 11:15:55,060 INFO L273 TraceCheckUtils]: 40: Hoare triple {834#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {834#false} is VALID [2018-11-23 11:15:55,060 INFO L273 TraceCheckUtils]: 41: Hoare triple {834#false} assume !~bvsgt32(~index, 0bv32); {834#false} is VALID [2018-11-23 11:15:55,060 INFO L273 TraceCheckUtils]: 42: Hoare triple {834#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {834#false} is VALID [2018-11-23 11:15:55,061 INFO L273 TraceCheckUtils]: 43: Hoare triple {834#false} assume true; {834#false} is VALID [2018-11-23 11:15:55,061 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {834#false} {834#false} #137#return; {834#false} is VALID [2018-11-23 11:15:55,062 INFO L273 TraceCheckUtils]: 45: Hoare triple {834#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {834#false} is VALID [2018-11-23 11:15:55,062 INFO L273 TraceCheckUtils]: 46: Hoare triple {834#false} assume !false; {834#false} is VALID [2018-11-23 11:15:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:15:55,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:55,347 INFO L273 TraceCheckUtils]: 46: Hoare triple {834#false} assume !false; {834#false} is VALID [2018-11-23 11:15:55,348 INFO L273 TraceCheckUtils]: 45: Hoare triple {834#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {834#false} is VALID [2018-11-23 11:15:55,348 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {833#true} {834#false} #137#return; {834#false} is VALID [2018-11-23 11:15:55,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,349 INFO L273 TraceCheckUtils]: 42: Hoare triple {833#true} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {833#true} is VALID [2018-11-23 11:15:55,349 INFO L273 TraceCheckUtils]: 41: Hoare triple {833#true} assume !~bvsgt32(~index, 0bv32); {833#true} is VALID [2018-11-23 11:15:55,349 INFO L273 TraceCheckUtils]: 40: Hoare triple {833#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {833#true} is VALID [2018-11-23 11:15:55,350 INFO L256 TraceCheckUtils]: 39: Hoare triple {834#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {833#true} is VALID [2018-11-23 11:15:55,350 INFO L273 TraceCheckUtils]: 38: Hoare triple {834#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {834#false} is VALID [2018-11-23 11:15:55,350 INFO L273 TraceCheckUtils]: 37: Hoare triple {834#false} ~i~0 := 0bv32; {834#false} is VALID [2018-11-23 11:15:55,365 INFO L273 TraceCheckUtils]: 36: Hoare triple {1009#(bvslt main_~i~0 main_~len~0)} assume !~bvslt32(~i~0, ~len~0); {834#false} is VALID [2018-11-23 11:15:55,369 INFO L273 TraceCheckUtils]: 35: Hoare triple {1013#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1009#(bvslt main_~i~0 main_~len~0)} is VALID [2018-11-23 11:15:55,374 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {833#true} {1013#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} #135#return; {1013#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:15:55,374 INFO L273 TraceCheckUtils]: 33: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,374 INFO L273 TraceCheckUtils]: 32: Hoare triple {833#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {833#true} is VALID [2018-11-23 11:15:55,375 INFO L273 TraceCheckUtils]: 31: Hoare triple {833#true} assume !~bvsgt32(~index, 0bv32); {833#true} is VALID [2018-11-23 11:15:55,375 INFO L273 TraceCheckUtils]: 30: Hoare triple {833#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {833#true} is VALID [2018-11-23 11:15:55,375 INFO L256 TraceCheckUtils]: 29: Hoare triple {1013#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {833#true} is VALID [2018-11-23 11:15:55,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {1013#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1013#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:15:55,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {1038#(bvslt (_ bv1 32) main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {1013#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~len~0)} is VALID [2018-11-23 11:15:55,379 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {833#true} {1038#(bvslt (_ bv1 32) main_~len~0)} #133#return; {1038#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:15:55,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {833#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {833#true} is VALID [2018-11-23 11:15:55,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {833#true} assume !~bvsgt32(~len, 1bv32); {833#true} is VALID [2018-11-23 11:15:55,380 INFO L273 TraceCheckUtils]: 22: Hoare triple {833#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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {833#true} is VALID [2018-11-23 11:15:55,380 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {833#true} {833#true} #143#return; {833#true} is VALID [2018-11-23 11:15:55,380 INFO L273 TraceCheckUtils]: 20: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {833#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {833#true} is VALID [2018-11-23 11:15:55,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {833#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {833#true} is VALID [2018-11-23 11:15:55,381 INFO L273 TraceCheckUtils]: 17: Hoare triple {833#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; {833#true} is VALID [2018-11-23 11:15:55,381 INFO L256 TraceCheckUtils]: 16: Hoare triple {833#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {833#true} is VALID [2018-11-23 11:15:55,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {833#true} assume !!~bvsgt32(~len, 1bv32); {833#true} is VALID [2018-11-23 11:15:55,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {833#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {833#true} is VALID [2018-11-23 11:15:55,382 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {833#true} {833#true} #141#return; {833#true} is VALID [2018-11-23 11:15:55,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,383 INFO L273 TraceCheckUtils]: 11: Hoare triple {833#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {833#true} is VALID [2018-11-23 11:15:55,383 INFO L273 TraceCheckUtils]: 10: Hoare triple {833#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {833#true} is VALID [2018-11-23 11:15:55,383 INFO L273 TraceCheckUtils]: 9: Hoare triple {833#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; {833#true} is VALID [2018-11-23 11:15:55,383 INFO L256 TraceCheckUtils]: 8: Hoare triple {833#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {833#true} is VALID [2018-11-23 11:15:55,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {833#true} ~len := #in~len;~data := #in~data; {833#true} is VALID [2018-11-23 11:15:55,384 INFO L256 TraceCheckUtils]: 6: Hoare triple {1038#(bvslt (_ bv1 32) main_~len~0)} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {833#true} is VALID [2018-11-23 11:15:55,385 INFO L273 TraceCheckUtils]: 5: Hoare triple {833#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1038#(bvslt (_ bv1 32) main_~len~0)} is VALID [2018-11-23 11:15:55,385 INFO L256 TraceCheckUtils]: 4: Hoare triple {833#true} call #t~ret17 := main(); {833#true} is VALID [2018-11-23 11:15:55,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {833#true} {833#true} #145#return; {833#true} is VALID [2018-11-23 11:15:55,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {833#true} assume true; {833#true} is VALID [2018-11-23 11:15:55,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {833#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {833#true} is VALID [2018-11-23 11:15:55,386 INFO L256 TraceCheckUtils]: 0: Hoare triple {833#true} call ULTIMATE.init(); {833#true} is VALID [2018-11-23 11:15:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:15:55,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:55,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:15:55,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 11:15:55,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:55,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:15:55,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:55,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:15:55,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:15:55,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:15:55,508 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 8 states. [2018-11-23 11:15:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:56,604 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2018-11-23 11:15:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:15:56,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-11-23 11:15:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:56,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:15:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-23 11:15:56,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:15:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-23 11:15:56,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2018-11-23 11:15:56,769 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:15:56,773 INFO L225 Difference]: With dead ends: 73 [2018-11-23 11:15:56,773 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:15:56,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:15:56,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:15:56,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2018-11-23 11:15:56,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:56,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 47 states. [2018-11-23 11:15:56,841 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 47 states. [2018-11-23 11:15:56,841 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 47 states. [2018-11-23 11:15:56,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:56,846 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 11:15:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 11:15:56,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:56,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:56,848 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 61 states. [2018-11-23 11:15:56,848 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 61 states. [2018-11-23 11:15:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:56,853 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2018-11-23 11:15:56,853 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 11:15:56,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:56,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:56,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:56,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:15:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-11-23 11:15:56,858 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 47 [2018-11-23 11:15:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:56,859 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-11-23 11:15:56,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:15:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-23 11:15:56,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 11:15:56,861 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:56,861 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:56,861 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:56,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:56,862 INFO L82 PathProgramCache]: Analyzing trace with hash -141243073, now seen corresponding path program 2 times [2018-11-23 11:15:56,862 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:56,862 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:15:56,893 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:15:57,056 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:15:57,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:15:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:57,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:57,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {1424#true} call ULTIMATE.init(); {1424#true} is VALID [2018-11-23 11:15:57,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {1424#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1424#true} is VALID [2018-11-23 11:15:57,268 INFO L273 TraceCheckUtils]: 2: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1424#true} {1424#true} #145#return; {1424#true} is VALID [2018-11-23 11:15:57,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {1424#true} call #t~ret17 := main(); {1424#true} is VALID [2018-11-23 11:15:57,269 INFO L273 TraceCheckUtils]: 5: Hoare triple {1424#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1424#true} is VALID [2018-11-23 11:15:57,269 INFO L256 TraceCheckUtils]: 6: Hoare triple {1424#true} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1424#true} is VALID [2018-11-23 11:15:57,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {1424#true} ~len := #in~len;~data := #in~data; {1424#true} is VALID [2018-11-23 11:15:57,270 INFO L256 TraceCheckUtils]: 8: Hoare triple {1424#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1424#true} is VALID [2018-11-23 11:15:57,270 INFO L273 TraceCheckUtils]: 9: Hoare triple {1424#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; {1424#true} is VALID [2018-11-23 11:15:57,270 INFO L273 TraceCheckUtils]: 10: Hoare triple {1424#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1424#true} is VALID [2018-11-23 11:15:57,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {1424#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1424#true} is VALID [2018-11-23 11:15:57,270 INFO L273 TraceCheckUtils]: 12: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,270 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1424#true} {1424#true} #141#return; {1424#true} is VALID [2018-11-23 11:15:57,271 INFO L273 TraceCheckUtils]: 14: Hoare triple {1424#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1424#true} is VALID [2018-11-23 11:15:57,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {1424#true} assume !!~bvsgt32(~len, 1bv32); {1424#true} is VALID [2018-11-23 11:15:57,271 INFO L256 TraceCheckUtils]: 16: Hoare triple {1424#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1424#true} is VALID [2018-11-23 11:15:57,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {1424#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; {1424#true} is VALID [2018-11-23 11:15:57,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {1424#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1424#true} is VALID [2018-11-23 11:15:57,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {1424#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1424#true} is VALID [2018-11-23 11:15:57,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,272 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1424#true} {1424#true} #143#return; {1424#true} is VALID [2018-11-23 11:15:57,272 INFO L273 TraceCheckUtils]: 22: Hoare triple {1424#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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1424#true} is VALID [2018-11-23 11:15:57,272 INFO L273 TraceCheckUtils]: 23: Hoare triple {1424#true} assume !~bvsgt32(~len, 1bv32); {1424#true} is VALID [2018-11-23 11:15:57,272 INFO L273 TraceCheckUtils]: 24: Hoare triple {1424#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1424#true} is VALID [2018-11-23 11:15:57,273 INFO L273 TraceCheckUtils]: 25: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,273 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1424#true} {1424#true} #133#return; {1424#true} is VALID [2018-11-23 11:15:57,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {1424#true} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {1510#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:57,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {1510#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1510#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:57,275 INFO L256 TraceCheckUtils]: 29: Hoare triple {1510#(= main_~i~0 (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1424#true} is VALID [2018-11-23 11:15:57,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {1424#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1424#true} is VALID [2018-11-23 11:15:57,275 INFO L273 TraceCheckUtils]: 31: Hoare triple {1424#true} assume !~bvsgt32(~index, 0bv32); {1424#true} is VALID [2018-11-23 11:15:57,275 INFO L273 TraceCheckUtils]: 32: Hoare triple {1424#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1424#true} is VALID [2018-11-23 11:15:57,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,281 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1424#true} {1510#(= main_~i~0 (_ bv0 32))} #135#return; {1510#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:57,283 INFO L273 TraceCheckUtils]: 35: Hoare triple {1510#(= main_~i~0 (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1535#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:57,283 INFO L273 TraceCheckUtils]: 36: Hoare triple {1535#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1535#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:57,283 INFO L256 TraceCheckUtils]: 37: Hoare triple {1535#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1424#true} is VALID [2018-11-23 11:15:57,285 INFO L273 TraceCheckUtils]: 38: Hoare triple {1424#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1545#(= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)} is VALID [2018-11-23 11:15:57,286 INFO L273 TraceCheckUtils]: 39: Hoare triple {1545#(= sll_circular_update_at_~index |sll_circular_update_at_#in~index|)} assume !~bvsgt32(~index, 0bv32); {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:57,287 INFO L273 TraceCheckUtils]: 40: Hoare triple {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:57,287 INFO L273 TraceCheckUtils]: 41: Hoare triple {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} assume true; {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:57,289 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} {1535#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #135#return; {1425#false} is VALID [2018-11-23 11:15:57,289 INFO L273 TraceCheckUtils]: 43: Hoare triple {1425#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1425#false} is VALID [2018-11-23 11:15:57,289 INFO L273 TraceCheckUtils]: 44: Hoare triple {1425#false} assume !~bvslt32(~i~0, ~len~0); {1425#false} is VALID [2018-11-23 11:15:57,289 INFO L273 TraceCheckUtils]: 45: Hoare triple {1425#false} ~i~0 := 0bv32; {1425#false} is VALID [2018-11-23 11:15:57,290 INFO L273 TraceCheckUtils]: 46: Hoare triple {1425#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1425#false} is VALID [2018-11-23 11:15:57,290 INFO L256 TraceCheckUtils]: 47: Hoare triple {1425#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1425#false} is VALID [2018-11-23 11:15:57,290 INFO L273 TraceCheckUtils]: 48: Hoare triple {1425#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1425#false} is VALID [2018-11-23 11:15:57,290 INFO L273 TraceCheckUtils]: 49: Hoare triple {1425#false} assume !~bvsgt32(~index, 0bv32); {1425#false} is VALID [2018-11-23 11:15:57,291 INFO L273 TraceCheckUtils]: 50: Hoare triple {1425#false} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1425#false} is VALID [2018-11-23 11:15:57,291 INFO L273 TraceCheckUtils]: 51: Hoare triple {1425#false} assume true; {1425#false} is VALID [2018-11-23 11:15:57,291 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1425#false} {1425#false} #137#return; {1425#false} is VALID [2018-11-23 11:15:57,292 INFO L273 TraceCheckUtils]: 53: Hoare triple {1425#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1425#false} is VALID [2018-11-23 11:15:57,292 INFO L273 TraceCheckUtils]: 54: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2018-11-23 11:15:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 11:15:57,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:15:57,666 INFO L273 TraceCheckUtils]: 54: Hoare triple {1425#false} assume !false; {1425#false} is VALID [2018-11-23 11:15:57,667 INFO L273 TraceCheckUtils]: 53: Hoare triple {1425#false} assume ~expected~0 != #t~ret16;havoc #t~ret16; {1425#false} is VALID [2018-11-23 11:15:57,667 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {1424#true} {1425#false} #137#return; {1425#false} is VALID [2018-11-23 11:15:57,667 INFO L273 TraceCheckUtils]: 51: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,668 INFO L273 TraceCheckUtils]: 50: Hoare triple {1424#true} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {1424#true} is VALID [2018-11-23 11:15:57,668 INFO L273 TraceCheckUtils]: 49: Hoare triple {1424#true} assume !~bvsgt32(~index, 0bv32); {1424#true} is VALID [2018-11-23 11:15:57,668 INFO L273 TraceCheckUtils]: 48: Hoare triple {1424#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1424#true} is VALID [2018-11-23 11:15:57,668 INFO L256 TraceCheckUtils]: 47: Hoare triple {1425#false} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1424#true} is VALID [2018-11-23 11:15:57,668 INFO L273 TraceCheckUtils]: 46: Hoare triple {1425#false} assume !!~bvslt32(~i~0, ~len~0);~expected~0 := ~bvadd32(~i~0, ~len~0); {1425#false} is VALID [2018-11-23 11:15:57,669 INFO L273 TraceCheckUtils]: 45: Hoare triple {1425#false} ~i~0 := 0bv32; {1425#false} is VALID [2018-11-23 11:15:57,669 INFO L273 TraceCheckUtils]: 44: Hoare triple {1425#false} assume !~bvslt32(~i~0, ~len~0); {1425#false} is VALID [2018-11-23 11:15:57,669 INFO L273 TraceCheckUtils]: 43: Hoare triple {1425#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1425#false} is VALID [2018-11-23 11:15:57,671 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} {1631#(bvsgt main_~i~0 (_ bv0 32))} #135#return; {1425#false} is VALID [2018-11-23 11:15:57,673 INFO L273 TraceCheckUtils]: 41: Hoare triple {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} assume true; {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:57,675 INFO L273 TraceCheckUtils]: 40: Hoare triple {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:57,676 INFO L273 TraceCheckUtils]: 39: Hoare triple {1644#(or (not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32))) (bvsgt sll_circular_update_at_~index (_ bv0 32)))} assume !~bvsgt32(~index, 0bv32); {1549#(not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)))} is VALID [2018-11-23 11:15:57,677 INFO L273 TraceCheckUtils]: 38: Hoare triple {1424#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1644#(or (not (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32))) (bvsgt sll_circular_update_at_~index (_ bv0 32)))} is VALID [2018-11-23 11:15:57,677 INFO L256 TraceCheckUtils]: 37: Hoare triple {1631#(bvsgt main_~i~0 (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1424#true} is VALID [2018-11-23 11:15:57,677 INFO L273 TraceCheckUtils]: 36: Hoare triple {1631#(bvsgt main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1631#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:57,679 INFO L273 TraceCheckUtils]: 35: Hoare triple {1654#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1631#(bvsgt main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:15:57,680 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1424#true} {1654#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #135#return; {1654#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:57,680 INFO L273 TraceCheckUtils]: 33: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,681 INFO L273 TraceCheckUtils]: 32: Hoare triple {1424#true} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {1424#true} is VALID [2018-11-23 11:15:57,681 INFO L273 TraceCheckUtils]: 31: Hoare triple {1424#true} assume !~bvsgt32(~index, 0bv32); {1424#true} is VALID [2018-11-23 11:15:57,682 INFO L273 TraceCheckUtils]: 30: Hoare triple {1424#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1424#true} is VALID [2018-11-23 11:15:57,682 INFO L256 TraceCheckUtils]: 29: Hoare triple {1654#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1424#true} is VALID [2018-11-23 11:15:57,684 INFO L273 TraceCheckUtils]: 28: Hoare triple {1654#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {1654#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:57,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {1424#true} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {1654#(bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:15:57,685 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1424#true} {1424#true} #133#return; {1424#true} is VALID [2018-11-23 11:15:57,685 INFO L273 TraceCheckUtils]: 25: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,686 INFO L273 TraceCheckUtils]: 24: Hoare triple {1424#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {1424#true} is VALID [2018-11-23 11:15:57,686 INFO L273 TraceCheckUtils]: 23: Hoare triple {1424#true} assume !~bvsgt32(~len, 1bv32); {1424#true} is VALID [2018-11-23 11:15:57,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {1424#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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {1424#true} is VALID [2018-11-23 11:15:57,686 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {1424#true} {1424#true} #143#return; {1424#true} is VALID [2018-11-23 11:15:57,687 INFO L273 TraceCheckUtils]: 20: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,687 INFO L273 TraceCheckUtils]: 19: Hoare triple {1424#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1424#true} is VALID [2018-11-23 11:15:57,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {1424#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1424#true} is VALID [2018-11-23 11:15:57,688 INFO L273 TraceCheckUtils]: 17: Hoare triple {1424#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; {1424#true} is VALID [2018-11-23 11:15:57,688 INFO L256 TraceCheckUtils]: 16: Hoare triple {1424#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1424#true} is VALID [2018-11-23 11:15:57,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {1424#true} assume !!~bvsgt32(~len, 1bv32); {1424#true} is VALID [2018-11-23 11:15:57,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {1424#true} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {1424#true} is VALID [2018-11-23 11:15:57,689 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {1424#true} {1424#true} #141#return; {1424#true} is VALID [2018-11-23 11:15:57,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,689 INFO L273 TraceCheckUtils]: 11: Hoare triple {1424#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1424#true} is VALID [2018-11-23 11:15:57,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {1424#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1424#true} is VALID [2018-11-23 11:15:57,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {1424#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; {1424#true} is VALID [2018-11-23 11:15:57,690 INFO L256 TraceCheckUtils]: 8: Hoare triple {1424#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {1424#true} is VALID [2018-11-23 11:15:57,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {1424#true} ~len := #in~len;~data := #in~data; {1424#true} is VALID [2018-11-23 11:15:57,691 INFO L256 TraceCheckUtils]: 6: Hoare triple {1424#true} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {1424#true} is VALID [2018-11-23 11:15:57,691 INFO L273 TraceCheckUtils]: 5: Hoare triple {1424#true} ~len~0 := 2bv32;~data~0 := 1bv32; {1424#true} is VALID [2018-11-23 11:15:57,691 INFO L256 TraceCheckUtils]: 4: Hoare triple {1424#true} call #t~ret17 := main(); {1424#true} is VALID [2018-11-23 11:15:57,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1424#true} {1424#true} #145#return; {1424#true} is VALID [2018-11-23 11:15:57,692 INFO L273 TraceCheckUtils]: 2: Hoare triple {1424#true} assume true; {1424#true} is VALID [2018-11-23 11:15:57,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {1424#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1424#true} is VALID [2018-11-23 11:15:57,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {1424#true} call ULTIMATE.init(); {1424#true} is VALID [2018-11-23 11:15:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:15:57,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:15:57,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:15:57,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-23 11:15:57,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:15:57,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:15:57,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:57,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:15:57,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:15:57,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:15:57,828 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 9 states. [2018-11-23 11:15:59,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:59,219 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2018-11-23 11:15:59,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:15:59,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-11-23 11:15:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:15:59,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2018-11-23 11:15:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:15:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 106 transitions. [2018-11-23 11:15:59,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 106 transitions. [2018-11-23 11:15:59,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:15:59,444 INFO L225 Difference]: With dead ends: 92 [2018-11-23 11:15:59,444 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 11:15:59,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:15:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 11:15:59,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-11-23 11:15:59,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:15:59,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 53 states. [2018-11-23 11:15:59,518 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 53 states. [2018-11-23 11:15:59,518 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 53 states. [2018-11-23 11:15:59,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:59,522 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-23 11:15:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-23 11:15:59,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:59,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:59,523 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 70 states. [2018-11-23 11:15:59,523 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 70 states. [2018-11-23 11:15:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:15:59,527 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2018-11-23 11:15:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-23 11:15:59,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:15:59,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:15:59,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:15:59,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:15:59,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:15:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-23 11:15:59,531 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 55 [2018-11-23 11:15:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:15:59,532 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-23 11:15:59,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:15:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-23 11:15:59,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:15:59,533 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:15:59,534 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:15:59,534 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:15:59,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:15:59,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1817276165, now seen corresponding path program 1 times [2018-11-23 11:15:59,535 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:15:59,535 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:15:59,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:15:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:15:59,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:15:59,837 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:15:59,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:15:59,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:15:59,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:15:59,848 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:15:59,848 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_60|]. (= |#valid| (store |v_#valid_60| node_create_~temp~0.base (_ bv1 1))) [2018-11-23 11:15:59,849 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:16:00,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:00,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:00,080 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:16:00,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 11:16:00,094 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:00,095 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_2|]. (and (= (select |v_#valid_BEFORE_CALL_2| |sll_circular_create_#t~ret4.base|) (_ bv0 1)) (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_2| sll_circular_create_~head~0.base) (_ bv1 1))) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)) [2018-11-23 11:16:00,095 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|))) [2018-11-23 11:16:00,155 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:16:00,162 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:16:00,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-23 11:16:00,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 11:16:00,259 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 12 treesize of output 11 [2018-11-23 11:16:00,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:00,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-23 11:16:00,309 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:00,309 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_75|, sll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_75| |sll_circular_create_#res.base|) (_ bv0 32)))) (and (not (= |sll_circular_create_#res.base| .cse0)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_75| .cse0 (store (select |v_#memory_$Pointer$.base_75| .cse0) sll_circular_create_~last~0.offset |sll_circular_create_#res.base|))))) [2018-11-23 11:16:00,310 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [sll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)))) (and (= (_ bv0 32) |sll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| .cse0) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|) (not (= .cse0 |sll_circular_create_#res.base|)))) [2018-11-23 11:16:00,982 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 13 treesize of output 10 [2018-11-23 11:16:00,989 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 10 treesize of output 9 [2018-11-23 11:16:00,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:00,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:01,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:01,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 11:16:01,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-23 11:16:01,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:01,184 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 32 treesize of output 26 [2018-11-23 11:16:01,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:01,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:01,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:01,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2018-11-23 11:16:03,553 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2018-11-23 11:16:03,595 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:03,609 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:16:03,616 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:16:03,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:03,636 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:03,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 11:16:03,695 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:16:03,699 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:16:03,721 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 5 treesize of output 1 [2018-11-23 11:16:03,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:03,736 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:03,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:03,762 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:18 [2018-11-23 11:16:03,776 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:03,776 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_34|, |v_old(#memory_int)_AFTER_CALL_34|, sll_circular_update_at_~head.offset, sll_circular_update_at_~data, sll_circular_create_~last~0.offset]. (let ((.cse2 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| main_~s~0.base))) (let ((.cse0 (select .cse2 (_ bv0 32)))) (and (= main_~s~0.offset (_ bv0 32)) (not (= main_~s~0.base .cse0)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_34| .cse0) sll_circular_create_~last~0.offset) main_~s~0.base) (= (let ((.cse1 (select .cse2 main_~s~0.offset))) (store |v_old(#memory_int)_AFTER_CALL_34| .cse1 (store (select |v_old(#memory_int)_AFTER_CALL_34| .cse1) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data))) |#memory_int|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= main_~len~0 (select (select |v_old(#memory_int)_AFTER_CALL_34| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))))))) [2018-11-23 11:16:03,776 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-11-23 11:16:06,366 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 29 treesize of output 29 [2018-11-23 11:16:06,375 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 16 treesize of output 7 [2018-11-23 11:16:06,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:06,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:06,401 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:16:06,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:16:06,419 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:06,420 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) (_ bv4 32)))) (and (= main_~expected~0 .cse0) (= |main_#t~ret16| .cse0) (= (_ bv2 32) .cse0) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))))) [2018-11-23 11:16:06,420 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~ret16| main_~expected~0) (= |main_#t~ret16| (_ bv2 32))) [2018-11-23 11:16:06,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {2122#true} call ULTIMATE.init(); {2122#true} is VALID [2018-11-23 11:16:06,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {2122#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2122#true} is VALID [2018-11-23 11:16:06,475 INFO L273 TraceCheckUtils]: 2: Hoare triple {2122#true} assume true; {2122#true} is VALID [2018-11-23 11:16:06,475 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2122#true} {2122#true} #145#return; {2122#true} is VALID [2018-11-23 11:16:06,475 INFO L256 TraceCheckUtils]: 4: Hoare triple {2122#true} call #t~ret17 := main(); {2122#true} is VALID [2018-11-23 11:16:06,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {2122#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2142#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:16:06,476 INFO L256 TraceCheckUtils]: 6: Hoare triple {2142#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {2122#true} is VALID [2018-11-23 11:16:06,477 INFO L273 TraceCheckUtils]: 7: Hoare triple {2122#true} ~len := #in~len;~data := #in~data; {2122#true} is VALID [2018-11-23 11:16:06,477 INFO L256 TraceCheckUtils]: 8: Hoare triple {2122#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2122#true} is VALID [2018-11-23 11:16:06,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {2122#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; {2155#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:16:06,484 INFO L273 TraceCheckUtils]: 10: Hoare triple {2155#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2155#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:16:06,485 INFO L273 TraceCheckUtils]: 11: Hoare triple {2155#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2162#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:16:06,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {2162#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {2162#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:16:06,486 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2162#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {2122#true} #141#return; {2169#(= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:16:06,487 INFO L273 TraceCheckUtils]: 14: Hoare triple {2169#(= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:06,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!~bvsgt32(~len, 1bv32); {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:06,489 INFO L256 TraceCheckUtils]: 16: Hoare triple {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2180#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:06,490 INFO L273 TraceCheckUtils]: 17: Hoare triple {2180#(= |#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; {2184#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:06,490 INFO L273 TraceCheckUtils]: 18: Hoare triple {2184#(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); {2184#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:06,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {2184#(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, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2191#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:06,493 INFO L273 TraceCheckUtils]: 20: Hoare triple {2191#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2191#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:06,495 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2191#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} #143#return; {2198#(and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} is VALID [2018-11-23 11:16:06,498 INFO L273 TraceCheckUtils]: 22: Hoare triple {2198#(and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} ~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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2202#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:16:06,499 INFO L273 TraceCheckUtils]: 23: Hoare triple {2202#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {2202#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:16:06,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {2202#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2209#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} is VALID [2018-11-23 11:16:06,511 INFO L273 TraceCheckUtils]: 25: Hoare triple {2209#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} assume true; {2209#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} is VALID [2018-11-23 11:16:06,522 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2209#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} {2142#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {2216#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32)) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:06,524 INFO L273 TraceCheckUtils]: 27: Hoare triple {2216#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32)) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {2220#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:06,525 INFO L273 TraceCheckUtils]: 28: Hoare triple {2220#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2224#(and (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:06,526 INFO L256 TraceCheckUtils]: 29: Hoare triple {2224#(and (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2228#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:16:06,527 INFO L273 TraceCheckUtils]: 30: Hoare triple {2228#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2232#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:06,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {2232#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !~bvsgt32(~index, 0bv32); {2232#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:06,543 INFO L273 TraceCheckUtils]: 32: Hoare triple {2232#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2239#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))) (= (select (select |#memory_int| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-23 11:16:06,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {2239#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))) (= (select (select |#memory_int| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))) |sll_circular_update_at_#in~data|))} assume true; {2239#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))) (= (select (select |#memory_int| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-23 11:16:06,548 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2239#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))) (= (select (select |#memory_int| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))) |sll_circular_update_at_#in~data|))} {2224#(and (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #135#return; {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:06,550 INFO L273 TraceCheckUtils]: 35: Hoare triple {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:06,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:06,554 INFO L256 TraceCheckUtils]: 37: Hoare triple {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2256#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:06,555 INFO L273 TraceCheckUtils]: 38: Hoare triple {2256#(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; {2260#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:06,556 INFO L273 TraceCheckUtils]: 39: Hoare triple {2260#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2264#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-23 11:16:06,559 INFO L273 TraceCheckUtils]: 40: Hoare triple {2264#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2264#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-23 11:16:06,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {2264#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2271#(exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:16:06,563 INFO L273 TraceCheckUtils]: 42: Hoare triple {2271#(exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|))} assume true; {2271#(exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:16:06,565 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2271#(exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|))} {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #135#return; {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:06,566 INFO L273 TraceCheckUtils]: 44: Hoare triple {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:06,567 INFO L273 TraceCheckUtils]: 45: Hoare triple {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:06,568 INFO L273 TraceCheckUtils]: 46: Hoare triple {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~i~0 := 0bv32; {2288#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= 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:16:06,569 INFO L273 TraceCheckUtils]: 47: Hoare triple {2288#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= 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);~expected~0 := ~bvadd32(~i~0, ~len~0); {2292#(and (= (_ bv2 32) (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~expected~0))} is VALID [2018-11-23 11:16:06,572 INFO L256 TraceCheckUtils]: 48: Hoare triple {2292#(and (= (_ bv2 32) (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~expected~0))} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2296#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))))} is VALID [2018-11-23 11:16:06,573 INFO L273 TraceCheckUtils]: 49: Hoare triple {2296#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2300#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} is VALID [2018-11-23 11:16:06,574 INFO L273 TraceCheckUtils]: 50: Hoare triple {2300#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} assume !~bvsgt32(~index, 0bv32); {2300#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} is VALID [2018-11-23 11:16:06,575 INFO L273 TraceCheckUtils]: 51: Hoare triple {2300#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {2307#(and (= |sll_circular_get_data_at_#res| (select (select |#memory_int| |sll_circular_get_data_at_#in~head.base|) (bvadd |sll_circular_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} is VALID [2018-11-23 11:16:06,576 INFO L273 TraceCheckUtils]: 52: Hoare triple {2307#(and (= |sll_circular_get_data_at_#res| (select (select |#memory_int| |sll_circular_get_data_at_#in~head.base|) (bvadd |sll_circular_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} assume true; {2307#(and (= |sll_circular_get_data_at_#res| (select (select |#memory_int| |sll_circular_get_data_at_#in~head.base|) (bvadd |sll_circular_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} is VALID [2018-11-23 11:16:06,595 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {2307#(and (= |sll_circular_get_data_at_#res| (select (select |#memory_int| |sll_circular_get_data_at_#in~head.base|) (bvadd |sll_circular_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} {2292#(and (= (_ bv2 32) (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~expected~0))} #137#return; {2314#(and (= |main_#t~ret16| main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:06,606 INFO L273 TraceCheckUtils]: 54: Hoare triple {2314#(and (= |main_#t~ret16| main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967294 32)) (_ bv0 32)))} assume ~expected~0 != #t~ret16;havoc #t~ret16; {2123#false} is VALID [2018-11-23 11:16:06,606 INFO L273 TraceCheckUtils]: 55: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2018-11-23 11:16:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 11:16:06,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:16:11,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:16:11,996 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 11:16:12,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:16:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:12,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:16:12,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:16:12,237 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:16:12,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-23 11:16:12,245 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:12,246 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_62|]. (= |#valid| (store |v_#valid_62| node_create_~temp~0.base (_ bv1 1))) [2018-11-23 11:16:12,246 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (select |#valid| node_create_~temp~0.base) (_ bv1 1)) [2018-11-23 11:16:12,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:12,298 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:12,299 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:16:12,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-11-23 11:16:12,316 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:12,316 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_4|]. (and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (select |v_#valid_BEFORE_CALL_4| |sll_circular_create_#t~ret4.base|) (_ bv0 1)) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_4| sll_circular_create_~head~0.base) (_ bv1 1)))) [2018-11-23 11:16:12,316 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|))) [2018-11-23 11:16:12,331 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:16:12,390 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:16:12,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,395 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-11-23 11:16:12,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-11-23 11:16:12,462 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 12 treesize of output 11 [2018-11-23 11:16:12,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,486 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:12,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-23 11:16:12,498 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:12,499 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_86|, sll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_86| |sll_circular_create_#res.base|) (_ bv0 32)))) (and (not (= .cse0 |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_86| .cse0 (store (select |v_#memory_$Pointer$.base_86| .cse0) sll_circular_create_~last~0.offset |sll_circular_create_#res.base|))))) [2018-11-23 11:16:12,499 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [sll_circular_create_~last~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)))) (and (= (_ bv0 32) |sll_circular_create_#res.offset|) (= (select (select |#memory_$Pointer$.base| .cse0) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|) (not (= .cse0 |sll_circular_create_#res.base|)))) [2018-11-23 11:16:12,610 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 13 treesize of output 10 [2018-11-23 11:16:12,621 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 10 treesize of output 9 [2018-11-23 11:16:12,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-23 11:16:12,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-23 11:16:12,757 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:16:12,761 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 32 treesize of output 26 [2018-11-23 11:16:12,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:12,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2018-11-23 11:16:12,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-11-23 11:16:12,936 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 5 treesize of output 1 [2018-11-23 11:16:12,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:12,974 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 24 treesize of output 21 [2018-11-23 11:16:12,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:12,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:16:13,042 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 23 treesize of output 24 [2018-11-23 11:16:13,050 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 10 treesize of output 9 [2018-11-23 11:16:13,051 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:13,070 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:13,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:13,097 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:18 [2018-11-23 11:16:13,114 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:13,114 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_old(#memory_$Pointer$.base)_AFTER_CALL_40|, |v_old(#memory_int)_AFTER_CALL_40|, sll_circular_update_at_~head.offset, sll_circular_update_at_~data, sll_circular_create_~last~0.offset]. (let ((.cse2 (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| main_~s~0.base))) (let ((.cse0 (select .cse2 (_ bv0 32)))) (and (= main_~len~0 (select (select |v_old(#memory_int)_AFTER_CALL_40| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (not (= .cse0 main_~s~0.base)) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_40| .cse0) sll_circular_create_~last~0.offset) main_~s~0.base) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= (let ((.cse1 (select .cse2 main_~s~0.offset))) (store |v_old(#memory_int)_AFTER_CALL_40| .cse1 (store (select |v_old(#memory_int)_AFTER_CALL_40| .cse1) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data))) |#memory_int|)))) [2018-11-23 11:16:13,114 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) [2018-11-23 11:16:15,296 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 29 treesize of output 29 [2018-11-23 11:16:15,305 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:16:15,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:15,334 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 16 treesize of output 7 [2018-11-23 11:16:15,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:16:15,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:16:15,353 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:16:15,353 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:16:15,359 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:16:15,359 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) (_ bv4 32)))) (and (= main_~expected~0 .cse0) (= |main_#t~ret16| .cse0) (= (_ bv2 32) .cse0) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))))) [2018-11-23 11:16:15,359 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~ret16| main_~expected~0) (= |main_#t~ret16| (_ bv2 32))) [2018-11-23 11:16:15,367 INFO L256 TraceCheckUtils]: 0: Hoare triple {2122#true} call ULTIMATE.init(); {2122#true} is VALID [2018-11-23 11:16:15,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {2122#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2122#true} is VALID [2018-11-23 11:16:15,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {2122#true} assume true; {2122#true} is VALID [2018-11-23 11:16:15,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2122#true} {2122#true} #145#return; {2122#true} is VALID [2018-11-23 11:16:15,368 INFO L256 TraceCheckUtils]: 4: Hoare triple {2122#true} call #t~ret17 := main(); {2122#true} is VALID [2018-11-23 11:16:15,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {2122#true} ~len~0 := 2bv32;~data~0 := 1bv32; {2142#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:16:15,368 INFO L256 TraceCheckUtils]: 6: Hoare triple {2142#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret13.base, #t~ret13.offset := sll_circular_create(~len~0, ~data~0); {2122#true} is VALID [2018-11-23 11:16:15,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {2122#true} ~len := #in~len;~data := #in~data; {2122#true} is VALID [2018-11-23 11:16:15,369 INFO L256 TraceCheckUtils]: 8: Hoare triple {2122#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {2122#true} is VALID [2018-11-23 11:16:15,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {2122#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; {2155#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:16:15,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {2155#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {2155#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:16:15,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {2155#(= (bvadd (select |#valid| node_create_~temp~0.base) (_ bv1 1)) (_ bv0 1))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2162#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:16:15,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {2162#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} assume true; {2162#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} is VALID [2018-11-23 11:16:15,372 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {2162#(= (_ bv1 1) (select |#valid| |node_create_#res.base|))} {2122#true} #141#return; {2169#(= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1))} is VALID [2018-11-23 11:16:15,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {2169#(= (bvadd (select |#valid| |sll_circular_create_#t~ret3.base|) (_ bv1 1)) (_ bv0 1))} ~head~0.base, ~head~0.offset := #t~ret3.base, #t~ret3.offset;havoc #t~ret3.base, #t~ret3.offset;~last~0.base, ~last~0.offset := ~head~0.base, ~head~0.offset; {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:15,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!~bvsgt32(~len, 1bv32); {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:16:15,375 INFO L256 TraceCheckUtils]: 16: Hoare triple {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {2180#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:16:15,376 INFO L273 TraceCheckUtils]: 17: Hoare triple {2180#(= |#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; {2184#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:15,377 INFO L273 TraceCheckUtils]: 18: Hoare triple {2184#(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); {2184#(and (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:16:15,379 INFO L273 TraceCheckUtils]: 19: Hoare triple {2184#(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, ~temp~0.offset, 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {2191#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:15,380 INFO L273 TraceCheckUtils]: 20: Hoare triple {2191#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {2191#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:15,382 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {2191#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#res.offset| (_ bv0 32)))} {2173#(and (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))} #143#return; {2198#(and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} is VALID [2018-11-23 11:16:15,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {2198#(and (= |sll_circular_create_#t~ret4.offset| (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (not (= sll_circular_create_~head~0.base |sll_circular_create_#t~ret4.base|)))} ~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, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset;#t~post5 := ~len;~len := ~bvsub32(#t~post5, 1bv32);havoc #t~post5; {2202#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:16:15,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {2202#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} assume !~bvsgt32(~len, 1bv32); {2202#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} is VALID [2018-11-23 11:16:15,388 INFO L273 TraceCheckUtils]: 24: Hoare triple {2202#(and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) (= sll_circular_create_~head~0.offset (_ bv0 32)) (not (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~last~0.base, ~last~0.offset, 4bv32);#res.base, #res.offset := ~head~0.base, ~head~0.offset; {2209#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} is VALID [2018-11-23 11:16:15,392 INFO L273 TraceCheckUtils]: 25: Hoare triple {2209#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} assume true; {2209#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} is VALID [2018-11-23 11:16:15,394 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2209#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |sll_circular_create_#res.base|)) (= (_ bv0 32) |sll_circular_create_#res.offset|) (not (= (select (select |#memory_$Pointer$.base| |sll_circular_create_#res.base|) (_ bv0 32)) |sll_circular_create_#res.base|)))} {2142#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #133#return; {2216#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32)) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} is VALID [2018-11-23 11:16:15,395 INFO L273 TraceCheckUtils]: 27: Hoare triple {2216#(and (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32))) sll_circular_create_~last~0.offset) |main_#t~ret13.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret13.base|) (_ bv0 32)) |main_#t~ret13.base|)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret13.offset| (_ bv0 32)))} ~s~0.base, ~s~0.offset := #t~ret13.base, #t~ret13.offset;havoc #t~ret13.base, #t~ret13.offset;~i~0 := 0bv32;~i~0 := 0bv32; {2220#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:15,396 INFO L273 TraceCheckUtils]: 28: Hoare triple {2220#(and (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2224#(and (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:15,398 INFO L256 TraceCheckUtils]: 29: Hoare triple {2224#(and (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2228#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-23 11:16:15,398 INFO L273 TraceCheckUtils]: 30: Hoare triple {2228#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {2232#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:15,399 INFO L273 TraceCheckUtils]: 31: Hoare triple {2232#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !~bvsgt32(~index, 0bv32); {2232#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:15,415 INFO L273 TraceCheckUtils]: 32: Hoare triple {2232#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2239#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))) (= (select (select |#memory_int| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-23 11:16:15,416 INFO L273 TraceCheckUtils]: 33: Hoare triple {2239#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))) (= (select (select |#memory_int| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))) |sll_circular_update_at_#in~data|))} assume true; {2239#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))) (= (select (select |#memory_int| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))) |sll_circular_update_at_#in~data|))} is VALID [2018-11-23 11:16:15,422 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2239#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)) (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32)))))) (= (select (select |#memory_int| |sll_circular_update_at_#in~head.base|) (bvadd |sll_circular_update_at_#in~head.offset| (_ bv4 32))) |sll_circular_update_at_#in~data|))} {2224#(and (= main_~len~0 main_~new_data~0) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #135#return; {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:15,423 INFO L273 TraceCheckUtils]: 35: Hoare triple {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:15,423 INFO L273 TraceCheckUtils]: 36: Hoare triple {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} assume !!~bvslt32(~i~0, ~len~0);~new_data~0 := ~bvadd32(~i~0, ~len~0); {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} is VALID [2018-11-23 11:16:15,425 INFO L256 TraceCheckUtils]: 37: Hoare triple {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} call sll_circular_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {2256#(and (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:15,425 INFO L273 TraceCheckUtils]: 38: Hoare triple {2256#(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; {2260#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-23 11:16:15,426 INFO L273 TraceCheckUtils]: 39: Hoare triple {2260#(and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= |old(#memory_int)| |#memory_int|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !!~bvsgt32(~index, 0bv32);call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset;#t~post12 := ~index;~index := ~bvsub32(#t~post12, 1bv32);havoc #t~post12; {2264#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-23 11:16:15,426 INFO L273 TraceCheckUtils]: 40: Hoare triple {2264#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} assume !~bvsgt32(~index, 0bv32); {2264#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} is VALID [2018-11-23 11:16:15,429 INFO L273 TraceCheckUtils]: 41: Hoare triple {2264#(and (= |old(#memory_int)| |#memory_int|) (= (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base))} call write~intINTTYPE4(~data, ~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32); {2271#(exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:16:15,430 INFO L273 TraceCheckUtils]: 42: Hoare triple {2271#(exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|))} assume true; {2271#(exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|))} is VALID [2018-11-23 11:16:15,434 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {2271#(exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (store |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) (store (select |old(#memory_int)| (select (select |old(#memory_$Pointer$.base)| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|)) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data)) |#memory_int|))} {2246#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))} #135#return; {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:15,435 INFO L273 TraceCheckUtils]: 44: Hoare triple {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:15,441 INFO L273 TraceCheckUtils]: 45: Hoare triple {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~len~0); {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:15,442 INFO L273 TraceCheckUtils]: 46: Hoare triple {2278#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))} ~i~0 := 0bv32; {2288#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= 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:16:15,443 INFO L273 TraceCheckUtils]: 47: Hoare triple {2288#(and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= 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);~expected~0 := ~bvadd32(~i~0, ~len~0); {2292#(and (= (_ bv2 32) (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~expected~0))} is VALID [2018-11-23 11:16:15,444 INFO L256 TraceCheckUtils]: 48: Hoare triple {2292#(and (= (_ bv2 32) (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~expected~0))} call #t~ret16 := sll_circular_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {2296#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))))} is VALID [2018-11-23 11:16:15,445 INFO L273 TraceCheckUtils]: 49: Hoare triple {2296#(exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {2300#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} is VALID [2018-11-23 11:16:15,446 INFO L273 TraceCheckUtils]: 50: Hoare triple {2300#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} assume !~bvsgt32(~index, 0bv32); {2300#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} is VALID [2018-11-23 11:16:15,447 INFO L273 TraceCheckUtils]: 51: Hoare triple {2300#(and (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} call #t~mem10 := read~intINTTYPE4(~head.base, ~bvadd32(4bv32, ~head.offset), 4bv32);#res := #t~mem10;havoc #t~mem10; {2307#(and (= |sll_circular_get_data_at_#res| (select (select |#memory_int| |sll_circular_get_data_at_#in~head.base|) (bvadd |sll_circular_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} is VALID [2018-11-23 11:16:15,449 INFO L273 TraceCheckUtils]: 52: Hoare triple {2307#(and (= |sll_circular_get_data_at_#res| (select (select |#memory_int| |sll_circular_get_data_at_#in~head.base|) (bvadd |sll_circular_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} assume true; {2307#(and (= |sll_circular_get_data_at_#res| (select (select |#memory_int| |sll_circular_get_data_at_#in~head.base|) (bvadd |sll_circular_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} is VALID [2018-11-23 11:16:15,456 INFO L268 TraceCheckUtils]: 53: Hoare quadruple {2307#(and (= |sll_circular_get_data_at_#res| (select (select |#memory_int| |sll_circular_get_data_at_#in~head.base|) (bvadd |sll_circular_get_data_at_#in~head.offset| (_ bv4 32)))) (exists ((v_main_~s~0.base_BEFORE_CALL_3 (_ BitVec 32))) (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_3) (_ bv4 32)))))} {2292#(and (= (_ bv2 32) (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (= main_~s~0.offset (_ bv0 32)) (= (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))) main_~expected~0))} #137#return; {2314#(and (= |main_#t~ret16| main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:16:15,458 INFO L273 TraceCheckUtils]: 54: Hoare triple {2314#(and (= |main_#t~ret16| main_~expected~0) (= (bvadd |main_#t~ret16| (_ bv4294967294 32)) (_ bv0 32)))} assume ~expected~0 != #t~ret16;havoc #t~ret16; {2123#false} is VALID [2018-11-23 11:16:15,459 INFO L273 TraceCheckUtils]: 55: Hoare triple {2123#false} assume !false; {2123#false} is VALID [2018-11-23 11:16:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-23 11:16:15,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:16:18,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:16:18,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 11:16:18,507 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-11-23 11:16:18,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:16:18,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:16:18,685 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:16:18,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:16:18,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:16:18,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1232, Unknown=3, NotChecked=70, Total=1406 [2018-11-23 11:16:18,687 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 31 states. [2018-11-23 11:18:29,453 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20