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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf -i ../../../trunk/examples/svcomp/list-simple/sll2c_prepend_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:21:55,411 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:21:55,413 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:21:55,430 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:21:55,431 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:21:55,432 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:21:55,433 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:21:55,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:21:55,437 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:21:55,438 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:21:55,439 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:21:55,439 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:21:55,440 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:21:55,441 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:21:55,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:21:55,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:21:55,444 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:21:55,446 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:21:55,448 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:21:55,450 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:21:55,451 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:21:55,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:21:55,458 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:21:55,459 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:21:55,459 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:21:55,460 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:21:55,464 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:21:55,465 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:21:55,466 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:21:55,468 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:21:55,468 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:21:55,469 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:21:55,469 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:21:55,469 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:21:55,470 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:21:55,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:21:55,474 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:21:55,503 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:21:55,503 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:21:55,504 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:21:55,505 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:21:55,505 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:21:55,505 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:21:55,506 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:21:55,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:21:55,506 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:21:55,506 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:21:55,506 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:21:55,509 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:21:55,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:21:55,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:21:55,510 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:21:55,510 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:21:55,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:21:55,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:21:55,511 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:21:55,511 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:21:55,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:21:55,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:21:55,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:21:55,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:21:55,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:21:55,512 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:21:55,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:21:55,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:21:55,514 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:21:55,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:21:55,514 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:21:55,514 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:21:55,515 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:21:55,582 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:21:55,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:21:55,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:21:55,606 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:21:55,606 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:21:55,607 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2c_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:21:55,677 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0761cb50e/cb37c9ed9f024578ab83a9e38f090644/FLAG7c7f2e49c [2018-11-14 18:21:56,221 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:21:56,222 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2c_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:21:56,240 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0761cb50e/cb37c9ed9f024578ab83a9e38f090644/FLAG7c7f2e49c [2018-11-14 18:21:56,255 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0761cb50e/cb37c9ed9f024578ab83a9e38f090644 [2018-11-14 18:21:56,268 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:21:56,269 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:21:56,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:21:56,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:21:56,274 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:21:56,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:21:56" (1/1) ... [2018-11-14 18:21:56,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bf2df30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:56, skipping insertion in model container [2018-11-14 18:21:56,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:21:56" (1/1) ... [2018-11-14 18:21:56,290 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:21:56,349 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:21:56,760 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:21:56,784 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:21:56,884 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:21:57,042 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:21:57,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57 WrapperNode [2018-11-14 18:21:57,043 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:21:57,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:21:57,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:21:57,044 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:21:57,059 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57" (1/1) ... [2018-11-14 18:21:57,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57" (1/1) ... [2018-11-14 18:21:57,083 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57" (1/1) ... [2018-11-14 18:21:57,084 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57" (1/1) ... [2018-11-14 18:21:57,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57" (1/1) ... [2018-11-14 18:21:57,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57" (1/1) ... [2018-11-14 18:21:57,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57" (1/1) ... [2018-11-14 18:21:57,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:21:57,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:21:57,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:21:57,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:21:57,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57" (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-14 18:21:57,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:21:57,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:21:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 18:21:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 18:21:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 18:21:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-14 18:21:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-11-14 18:21:57,201 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-11-14 18:21:57,202 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_prepend [2018-11-14 18:21:57,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:21:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:21:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 18:21:57,202 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 18:21:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 18:21:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 18:21:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 18:21:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 18:21:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 18:21:57,203 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 18:21:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 18:21:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 18:21:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 18:21:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 18:21:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 18:21:57,204 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 18:21:57,205 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 18:21:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 18:21:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 18:21:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 18:21:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 18:21:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 18:21:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 18:21:57,206 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 18:21:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 18:21:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 18:21:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 18:21:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 18:21:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 18:21:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 18:21:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 18:21:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 18:21:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 18:21:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 18:21:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 18:21:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 18:21:57,208 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 18:21:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 18:21:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 18:21:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 18:21:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 18:21:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 18:21:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 18:21:57,209 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 18:21:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 18:21:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 18:21:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 18:21:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 18:21:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 18:21:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 18:21:57,210 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 18:21:57,211 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 18:21:57,211 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 18:21:57,211 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 18:21:57,211 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 18:21:57,211 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 18:21:57,211 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 18:21:57,211 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 18:21:57,211 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 18:21:57,212 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 18:21:57,212 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 18:21:57,212 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 18:21:57,212 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 18:21:57,212 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 18:21:57,212 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 18:21:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 18:21:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 18:21:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 18:21:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 18:21:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 18:21:57,213 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 18:21:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 18:21:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 18:21:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 18:21:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 18:21:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 18:21:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 18:21:57,214 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 18:21:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 18:21:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 18:21:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 18:21:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 18:21:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 18:21:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 18:21:57,215 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 18:21:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 18:21:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 18:21:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 18:21:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 18:21:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 18:21:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 18:21:57,216 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 18:21:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 18:21:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 18:21:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 18:21:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 18:21:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 18:21:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 18:21:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-14 18:21:57,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:21:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 18:21:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:21:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-11-14 18:21:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-11-14 18:21:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 18:21:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:21:57,218 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_prepend [2018-11-14 18:21:57,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:21:57,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:21:57,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:21:57,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:21:57,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:21:58,435 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:21:58,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:21:58 BoogieIcfgContainer [2018-11-14 18:21:58,436 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:21:58,437 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:21:58,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:21:58,440 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:21:58,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:21:56" (1/3) ... [2018-11-14 18:21:58,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f24afc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:21:58, skipping insertion in model container [2018-11-14 18:21:58,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:21:57" (2/3) ... [2018-11-14 18:21:58,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f24afc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:21:58, skipping insertion in model container [2018-11-14 18:21:58,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:21:58" (3/3) ... [2018-11-14 18:21:58,444 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-14 18:21:58,454 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:21:58,468 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:21:58,488 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:21:58,529 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:21:58,530 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:21:58,530 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:21:58,531 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:21:58,531 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:21:58,531 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:21:58,531 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:21:58,531 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:21:58,531 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:21:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-11-14 18:21:58,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 18:21:58,559 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:21:58,560 INFO L375 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] [2018-11-14 18:21:58,562 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:21:58,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:21:58,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1540445648, now seen corresponding path program 1 times [2018-11-14 18:21:58,574 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:21:58,575 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-14 18:21:58,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:21:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:21:58,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:21:59,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {61#true} call ULTIMATE.init(); {61#true} is VALID [2018-11-14 18:21:59,522 INFO L273 TraceCheckUtils]: 1: Hoare triple {61#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {61#true} is VALID [2018-11-14 18:21:59,523 INFO L273 TraceCheckUtils]: 2: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-14 18:21:59,524 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {61#true} {61#true} #139#return; {61#true} is VALID [2018-11-14 18:21:59,525 INFO L256 TraceCheckUtils]: 4: Hoare triple {61#true} call #t~ret22 := main(); {61#true} is VALID [2018-11-14 18:21:59,525 INFO L273 TraceCheckUtils]: 5: Hoare triple {61#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {61#true} is VALID [2018-11-14 18:21:59,526 INFO L256 TraceCheckUtils]: 6: Hoare triple {61#true} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {61#true} is VALID [2018-11-14 18:21:59,527 INFO L273 TraceCheckUtils]: 7: Hoare triple {61#true} ~len := #in~len;~data := #in~data; {61#true} is VALID [2018-11-14 18:21:59,527 INFO L256 TraceCheckUtils]: 8: Hoare triple {61#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {61#true} is VALID [2018-11-14 18:21:59,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {61#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; {61#true} is VALID [2018-11-14 18:21:59,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {61#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {61#true} is VALID [2018-11-14 18:21:59,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {61#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; {61#true} is VALID [2018-11-14 18:21:59,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {61#true} assume true; {61#true} is VALID [2018-11-14 18:21:59,529 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {61#true} {61#true} #133#return; {61#true} is VALID [2018-11-14 18:21:59,529 INFO L273 TraceCheckUtils]: 14: Hoare triple {61#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; {61#true} is VALID [2018-11-14 18:21:59,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {61#true} assume !true; {62#false} is VALID [2018-11-14 18:21:59,533 INFO L273 TraceCheckUtils]: 16: Hoare triple {62#false} 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; {62#false} is VALID [2018-11-14 18:21:59,534 INFO L273 TraceCheckUtils]: 17: Hoare triple {62#false} assume true; {62#false} is VALID [2018-11-14 18:21:59,534 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {62#false} {61#true} #127#return; {62#false} is VALID [2018-11-14 18:21:59,534 INFO L273 TraceCheckUtils]: 19: Hoare triple {62#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset; {62#false} is VALID [2018-11-14 18:21:59,535 INFO L256 TraceCheckUtils]: 20: Hoare triple {62#false} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {62#false} is VALID [2018-11-14 18:21:59,535 INFO L273 TraceCheckUtils]: 21: Hoare triple {62#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {62#false} is VALID [2018-11-14 18:21:59,535 INFO L256 TraceCheckUtils]: 22: Hoare triple {62#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {62#false} is VALID [2018-11-14 18:21:59,535 INFO L273 TraceCheckUtils]: 23: Hoare triple {62#false} ~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; {62#false} is VALID [2018-11-14 18:21:59,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {62#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {62#false} is VALID [2018-11-14 18:21:59,536 INFO L273 TraceCheckUtils]: 25: Hoare triple {62#false} 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; {62#false} is VALID [2018-11-14 18:21:59,536 INFO L273 TraceCheckUtils]: 26: Hoare triple {62#false} assume true; {62#false} is VALID [2018-11-14 18:21:59,537 INFO L268 TraceCheckUtils]: 27: Hoare quadruple {62#false} {62#false} #137#return; {62#false} is VALID [2018-11-14 18:21:59,537 INFO L273 TraceCheckUtils]: 28: Hoare triple {62#false} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {62#false} is VALID [2018-11-14 18:21:59,537 INFO L273 TraceCheckUtils]: 29: Hoare triple {62#false} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {62#false} is VALID [2018-11-14 18:21:59,537 INFO L273 TraceCheckUtils]: 30: Hoare triple {62#false} assume true; {62#false} is VALID [2018-11-14 18:21:59,538 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {62#false} {62#false} #129#return; {62#false} is VALID [2018-11-14 18:21:59,538 INFO L273 TraceCheckUtils]: 32: Hoare triple {62#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {62#false} is VALID [2018-11-14 18:21:59,538 INFO L273 TraceCheckUtils]: 33: Hoare triple {62#false} assume !true; {62#false} is VALID [2018-11-14 18:21:59,539 INFO L273 TraceCheckUtils]: 34: Hoare triple {62#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {62#false} is VALID [2018-11-14 18:21:59,539 INFO L273 TraceCheckUtils]: 35: Hoare triple {62#false} assume !false; {62#false} is VALID [2018-11-14 18:21:59,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:21:59,547 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:21:59,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:21:59,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:21:59,566 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 18:21:59,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:21:59,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:21:59,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:21:59,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:21:59,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:21:59,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:21:59,800 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 2 states. [2018-11-14 18:22:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:00,114 INFO L93 Difference]: Finished difference Result 102 states and 126 transitions. [2018-11-14 18:22:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:22:00,115 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-14 18:22:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:22:00,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:22:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 126 transitions. [2018-11-14 18:22:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:22:00,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 126 transitions. [2018-11-14 18:22:00,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 126 transitions. [2018-11-14 18:22:00,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:00,559 INFO L225 Difference]: With dead ends: 102 [2018-11-14 18:22:00,560 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:22:00,566 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:22:00,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:22:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 18:22:00,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:22:00,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 18:22:00,643 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:22:00,643 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:22:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:00,649 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 18:22:00,650 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 18:22:00,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:00,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:00,651 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:22:00,651 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:22:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:00,657 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-11-14 18:22:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 18:22:00,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:00,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:00,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:22:00,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:22:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:22:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-11-14 18:22:00,665 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 36 [2018-11-14 18:22:00,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:22:00,665 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-11-14 18:22:00,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:22:00,666 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-11-14 18:22:00,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:22:00,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:22:00,668 INFO L375 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] [2018-11-14 18:22:00,668 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:22:00,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:22:00,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1551083095, now seen corresponding path program 1 times [2018-11-14 18:22:00,669 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:22:00,670 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-14 18:22:00,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:22:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:00,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:22:01,151 INFO L256 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {447#true} is VALID [2018-11-14 18:22:01,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {447#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {447#true} is VALID [2018-11-14 18:22:01,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2018-11-14 18:22:01,153 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #139#return; {447#true} is VALID [2018-11-14 18:22:01,153 INFO L256 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret22 := main(); {447#true} is VALID [2018-11-14 18:22:01,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {447#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {467#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 18:22:01,161 INFO L256 TraceCheckUtils]: 6: Hoare triple {467#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {447#true} is VALID [2018-11-14 18:22:01,162 INFO L273 TraceCheckUtils]: 7: Hoare triple {447#true} ~len := #in~len;~data := #in~data; {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 18:22:01,162 INFO L256 TraceCheckUtils]: 8: Hoare triple {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} call #t~ret3.base, #t~ret3.offset := node_create(~data); {447#true} is VALID [2018-11-14 18:22:01,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {447#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; {447#true} is VALID [2018-11-14 18:22:01,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {447#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {447#true} is VALID [2018-11-14 18:22:01,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {447#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; {447#true} is VALID [2018-11-14 18:22:01,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {447#true} assume true; {447#true} is VALID [2018-11-14 18:22:01,165 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {447#true} {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} #133#return; {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 18:22:01,170 INFO L273 TraceCheckUtils]: 14: Hoare triple {474#(= |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; {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 18:22:01,170 INFO L273 TraceCheckUtils]: 15: Hoare triple {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume true; {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} is VALID [2018-11-14 18:22:01,174 INFO L273 TraceCheckUtils]: 16: Hoare triple {474#(= |sll_circular_create_#in~len| sll_circular_create_~len)} assume !~bvsgt32(~len, 1bv32); {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 18:22:01,174 INFO L273 TraceCheckUtils]: 17: Hoare triple {502#(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; {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 18:22:01,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} assume true; {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} is VALID [2018-11-14 18:22:01,178 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {502#(not (bvsgt |sll_circular_create_#in~len| (_ bv1 32)))} {467#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #127#return; {448#false} is VALID [2018-11-14 18:22:01,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {448#false} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset; {448#false} is VALID [2018-11-14 18:22:01,178 INFO L256 TraceCheckUtils]: 21: Hoare triple {448#false} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {448#false} is VALID [2018-11-14 18:22:01,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {448#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {448#false} is VALID [2018-11-14 18:22:01,179 INFO L256 TraceCheckUtils]: 23: Hoare triple {448#false} call #t~ret8.base, #t~ret8.offset := node_create(~data); {448#false} is VALID [2018-11-14 18:22:01,179 INFO L273 TraceCheckUtils]: 24: Hoare triple {448#false} ~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; {448#false} is VALID [2018-11-14 18:22:01,179 INFO L273 TraceCheckUtils]: 25: Hoare triple {448#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {448#false} is VALID [2018-11-14 18:22:01,180 INFO L273 TraceCheckUtils]: 26: Hoare triple {448#false} 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; {448#false} is VALID [2018-11-14 18:22:01,180 INFO L273 TraceCheckUtils]: 27: Hoare triple {448#false} assume true; {448#false} is VALID [2018-11-14 18:22:01,180 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {448#false} {448#false} #137#return; {448#false} is VALID [2018-11-14 18:22:01,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {448#false} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {448#false} is VALID [2018-11-14 18:22:01,181 INFO L273 TraceCheckUtils]: 30: Hoare triple {448#false} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {448#false} is VALID [2018-11-14 18:22:01,181 INFO L273 TraceCheckUtils]: 31: Hoare triple {448#false} assume true; {448#false} is VALID [2018-11-14 18:22:01,182 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {448#false} {448#false} #129#return; {448#false} is VALID [2018-11-14 18:22:01,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {448#false} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {448#false} is VALID [2018-11-14 18:22:01,182 INFO L273 TraceCheckUtils]: 34: Hoare triple {448#false} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {448#false} is VALID [2018-11-14 18:22:01,183 INFO L273 TraceCheckUtils]: 35: Hoare triple {448#false} assume ~data~0 != #t~mem18;havoc #t~mem18; {448#false} is VALID [2018-11-14 18:22:01,183 INFO L273 TraceCheckUtils]: 36: Hoare triple {448#false} assume !false; {448#false} is VALID [2018-11-14 18:22:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:22:01,185 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:22:01,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:22:01,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:22:01,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 18:22:01,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:22:01,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:22:01,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:01,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:22:01,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:22:01,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:22:01,289 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2018-11-14 18:22:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:02,100 INFO L93 Difference]: Finished difference Result 74 states and 85 transitions. [2018-11-14 18:22:02,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:22:02,100 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-11-14 18:22:02,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:22:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:22:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 18:22:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:22:02,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2018-11-14 18:22:02,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 85 transitions. [2018-11-14 18:22:02,289 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:22:02,293 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:22:02,293 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 18:22:02,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 33 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-14 18:22:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 18:22:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-11-14 18:22:02,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:22:02,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 44 states. [2018-11-14 18:22:02,324 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 44 states. [2018-11-14 18:22:02,324 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 44 states. [2018-11-14 18:22:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:02,328 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-14 18:22:02,328 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-14 18:22:02,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:02,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:02,329 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 46 states. [2018-11-14 18:22:02,329 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 46 states. [2018-11-14 18:22:02,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:22:02,333 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-14 18:22:02,334 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-14 18:22:02,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:22:02,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:22:02,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:22:02,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:22:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:22:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-11-14 18:22:02,339 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 37 [2018-11-14 18:22:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:22:02,339 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-11-14 18:22:02,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:22:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-14 18:22:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 18:22:02,341 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:22:02,341 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:22:02,341 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:22:02,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:22:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash 395311091, now seen corresponding path program 1 times [2018-11-14 18:22:02,343 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:22:02,343 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-14 18:22:02,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:22:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:22:02,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:22:02,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:22:02,815 INFO L477 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-14 18:22:02,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:02,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:02,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:02,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-14 18:22:02,853 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:03,178 INFO L477 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-14 18:22:03,190 INFO L477 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-14 18:22:03,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:03,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:03,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:03,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 18:22:03,696 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:22:03,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:22:03,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:03,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-14 18:22:04,013 INFO L477 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 20 treesize of output 19 [2018-11-14 18:22:04,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:04,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:04,336 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:04,497 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-14 18:22:04,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:96 [2018-11-14 18:22:06,598 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:07,291 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-14 18:22:07,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:22:07,305 INFO L477 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 68 treesize of output 51 [2018-11-14 18:22:07,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 15 [2018-11-14 18:22:07,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:07,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-14 18:22:07,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 14 treesize of output 11 [2018-11-14 18:22:07,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:07,434 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:22:07,435 INFO L477 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 19 treesize of output 19 [2018-11-14 18:22:07,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-14 18:22:07,449 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:07,456 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:07,461 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:07,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:07,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:07,496 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:112, output treesize:30 [2018-11-14 18:22:09,850 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:10,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:22:10,038 INFO L477 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 11 treesize of output 3 [2018-11-14 18:22:10,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:10,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:10,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:22:10,081 INFO L477 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 11 treesize of output 3 [2018-11-14 18:22:10,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:10,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:10,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:10,104 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-11-14 18:22:10,114 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:10,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:22:10,264 INFO L477 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 11 treesize of output 3 [2018-11-14 18:22:10,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:10,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:10,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:10,276 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-14 18:22:10,280 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:10,345 INFO L256 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2018-11-14 18:22:10,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {816#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {816#true} is VALID [2018-11-14 18:22:10,346 INFO L273 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 18:22:10,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #139#return; {816#true} is VALID [2018-11-14 18:22:10,347 INFO L256 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret22 := main(); {816#true} is VALID [2018-11-14 18:22:10,348 INFO L273 TraceCheckUtils]: 5: Hoare triple {816#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:10,349 INFO L256 TraceCheckUtils]: 6: Hoare triple {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {816#true} is VALID [2018-11-14 18:22:10,349 INFO L273 TraceCheckUtils]: 7: Hoare triple {816#true} ~len := #in~len;~data := #in~data; {816#true} is VALID [2018-11-14 18:22:10,349 INFO L256 TraceCheckUtils]: 8: Hoare triple {816#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {816#true} is VALID [2018-11-14 18:22:10,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {816#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; {816#true} is VALID [2018-11-14 18:22:10,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {816#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {816#true} is VALID [2018-11-14 18:22:10,350 INFO L273 TraceCheckUtils]: 11: Hoare triple {816#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; {816#true} is VALID [2018-11-14 18:22:10,350 INFO L273 TraceCheckUtils]: 12: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 18:22:10,350 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {816#true} {816#true} #133#return; {816#true} is VALID [2018-11-14 18:22:10,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {816#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; {816#true} is VALID [2018-11-14 18:22:10,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 18:22:10,351 INFO L273 TraceCheckUtils]: 16: Hoare triple {816#true} assume !!~bvsgt32(~len, 1bv32); {816#true} is VALID [2018-11-14 18:22:10,351 INFO L256 TraceCheckUtils]: 17: Hoare triple {816#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {816#true} is VALID [2018-11-14 18:22:10,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {816#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; {876#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 18:22:10,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {876#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {876#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 18:22:10,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#(not (= (_ bv0 32) 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; {883#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 18:22:10,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {883#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {883#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 18:22:10,356 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {883#(not (= (_ bv0 32) |node_create_#res.base|))} {816#true} #135#return; {890#(not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|))} is VALID [2018-11-14 18:22:10,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {890#(not (= (_ bv0 32) |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; {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:22:10,358 INFO L273 TraceCheckUtils]: 24: Hoare triple {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume true; {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:22:10,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 1bv32); {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:22:10,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {894#(not (= sll_circular_create_~head~0.base (_ bv0 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; {904#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-14 18:22:10,361 INFO L273 TraceCheckUtils]: 27: Hoare triple {904#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} assume true; {904#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-14 18:22:10,363 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {904#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} {836#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #127#return; {911#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:10,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {911#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset; {915#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-14 18:22:10,373 INFO L256 TraceCheckUtils]: 30: Hoare triple {915#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {919#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 18:22:10,373 INFO L273 TraceCheckUtils]: 31: Hoare triple {919#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {923#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 18:22:10,374 INFO L256 TraceCheckUtils]: 32: Hoare triple {923#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {919#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 18:22:10,395 INFO L273 TraceCheckUtils]: 33: Hoare triple {919#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~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; {930#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:22:10,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {930#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {930#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:22:10,409 INFO L273 TraceCheckUtils]: 35: Hoare triple {930#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.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; {937#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:22:10,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {937#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {937#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:22:10,413 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {937#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} {923#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} #137#return; {944#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 18:22:10,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {944#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {948#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 18:22:10,421 INFO L273 TraceCheckUtils]: 39: Hoare triple {948#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {952#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-14 18:22:10,433 INFO L273 TraceCheckUtils]: 40: Hoare triple {952#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} assume true; {952#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-14 18:22:10,446 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {952#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} {915#(and (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #129#return; {959#(and (= main_~data~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 18:22:10,450 INFO L273 TraceCheckUtils]: 42: Hoare triple {959#(and (= main_~data~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {963#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv4 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:22:10,451 INFO L273 TraceCheckUtils]: 43: Hoare triple {963#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv4 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {967#(and (= |main_#t~mem18| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 18:22:10,452 INFO L273 TraceCheckUtils]: 44: Hoare triple {967#(and (= |main_#t~mem18| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem18;havoc #t~mem18; {817#false} is VALID [2018-11-14 18:22:10,452 INFO L273 TraceCheckUtils]: 45: Hoare triple {817#false} assume !false; {817#false} is VALID [2018-11-14 18:22:10,466 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 18:22:10,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:22:11,034 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 18:22:11,136 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 18:22:12,466 WARN L179 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 71 [2018-11-14 18:22:13,528 WARN L179 SmtUtils]: Spent 986.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-14 18:22:14,827 WARN L179 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 54 [2018-11-14 18:22:15,945 WARN L179 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 52 [2018-11-14 18:22:19,606 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-14 18:22:19,729 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:19,730 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 3 variables, input treesize:122, output treesize:1 [2018-11-14 18:22:22,124 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-11-14 18:22:22,530 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 18:22:22,543 INFO L477 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 9 treesize of output 8 [2018-11-14 18:22:22,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:22,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-14 18:22:22,673 INFO L477 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 6 treesize of output 1 [2018-11-14 18:22:22,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:22,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:22,746 INFO L477 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 50 treesize of output 54 [2018-11-14 18:22:22,766 INFO L477 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 49 treesize of output 43 [2018-11-14 18:22:22,770 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:22,870 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-14 18:22:22,878 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:22:23,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2018-11-14 18:22:23,014 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:22:23,153 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 18:22:23,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-14 18:22:23,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-14 18:22:23,683 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:70, output treesize:235 [2018-11-14 18:22:23,821 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:22:32,489 WARN L179 SmtUtils]: Spent 8.34 s on a formula simplification that was a NOOP. DAG size: 56 [2018-11-14 18:22:43,296 WARN L179 SmtUtils]: Spent 8.33 s on a formula simplification that was a NOOP. DAG size: 56 [2018-11-14 18:22:43,574 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 18:22:43,685 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 18:22:46,966 WARN L179 SmtUtils]: Spent 2.84 s on a formula simplification that was a NOOP. DAG size: 152 [2018-11-14 18:22:46,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 33 [2018-11-14 18:22:47,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:22:47,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:47,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:47,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 155 treesize of output 93 [2018-11-14 18:22:47,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:22:47,059 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:47,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:47,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 33 [2018-11-14 18:22:47,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:22:47,125 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:47,150 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:50,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 155 treesize of output 93 [2018-11-14 18:22:50,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:22:50,348 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:50,393 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:50,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 33 [2018-11-14 18:22:50,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:22:50,414 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:50,438 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:53,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 33 [2018-11-14 18:22:53,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:22:53,586 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:53,611 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:53,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 155 treesize of output 93 [2018-11-14 18:22:53,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:22:53,643 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:53,708 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:56,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 33 [2018-11-14 18:22:56,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:22:56,059 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:56,082 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:56,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 155 treesize of output 93 [2018-11-14 18:22:56,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:22:56,106 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:56,145 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:22:58,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 147 treesize of output 85 [2018-11-14 18:22:58,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-11-14 18:22:58,389 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-14 18:22:58,418 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:00,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 5 dim-2 vars, End of recursive call: 14 dim-0 vars, and 14 xjuncts. [2018-11-14 18:23:00,080 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 14 variables, input treesize:493, output treesize:635 [2018-11-14 18:23:02,481 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:23:04,070 WARN L179 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 44 [2018-11-14 18:23:04,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:23:04,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:23:04,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:23:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:23:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:23:04,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:23:04,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 18:23:04,467 INFO L477 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-14 18:23:04,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:04,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:04,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:04,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-14 18:23:04,531 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:23:04,661 INFO L477 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-14 18:23:04,666 INFO L477 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-14 18:23:04,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:04,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:04,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:04,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-14 18:23:04,887 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 18:23:04,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-14 18:23:04,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:05,224 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-11-14 18:23:05,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-11-14 18:23:05,311 INFO L477 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 20 treesize of output 19 [2018-11-14 18:23:05,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:05,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:05,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:06,005 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-14 18:23:06,006 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:96 [2018-11-14 18:23:08,122 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:23:08,404 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2018-11-14 18:23:08,413 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:23:08,414 INFO L477 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 68 treesize of output 51 [2018-11-14 18:23:08,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 15 [2018-11-14 18:23:08,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:08,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-11-14 18:23:08,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 14 treesize of output 11 [2018-11-14 18:23:08,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:08,493 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:23:08,494 INFO L477 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 19 treesize of output 19 [2018-11-14 18:23:08,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-14 18:23:08,506 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:08,514 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:08,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:08,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:08,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:08,545 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:107, output treesize:25 [2018-11-14 18:23:10,643 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:23:10,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:23:10,805 INFO L477 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 11 treesize of output 3 [2018-11-14 18:23:10,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:10,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:10,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:23:10,839 INFO L477 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 11 treesize of output 3 [2018-11-14 18:23:10,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:10,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:10,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:10,855 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:11 [2018-11-14 18:23:10,863 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:23:10,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-14 18:23:11,029 INFO L477 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 11 treesize of output 3 [2018-11-14 18:23:11,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:11,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:11,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:11,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 18:23:11,042 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:23:11,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2018-11-14 18:23:11,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {816#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {816#true} is VALID [2018-11-14 18:23:11,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 18:23:11,047 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #139#return; {816#true} is VALID [2018-11-14 18:23:11,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret22 := main(); {816#true} is VALID [2018-11-14 18:23:11,063 INFO L273 TraceCheckUtils]: 5: Hoare triple {816#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32);call write~$Pointer$(0bv32, 0bv32, ~#s~0.base, ~#s~0.offset, 4bv32); {1026#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-14 18:23:11,063 INFO L256 TraceCheckUtils]: 6: Hoare triple {1026#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret15.base, #t~ret15.offset := sll_circular_create(~len~0, ~data~0); {816#true} is VALID [2018-11-14 18:23:11,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {816#true} ~len := #in~len;~data := #in~data; {816#true} is VALID [2018-11-14 18:23:11,064 INFO L256 TraceCheckUtils]: 8: Hoare triple {816#true} call #t~ret3.base, #t~ret3.offset := node_create(~data); {816#true} is VALID [2018-11-14 18:23:11,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {816#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; {816#true} is VALID [2018-11-14 18:23:11,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {816#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {816#true} is VALID [2018-11-14 18:23:11,064 INFO L273 TraceCheckUtils]: 11: Hoare triple {816#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; {816#true} is VALID [2018-11-14 18:23:11,064 INFO L273 TraceCheckUtils]: 12: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 18:23:11,065 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {816#true} {816#true} #133#return; {816#true} is VALID [2018-11-14 18:23:11,065 INFO L273 TraceCheckUtils]: 14: Hoare triple {816#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; {816#true} is VALID [2018-11-14 18:23:11,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {816#true} assume true; {816#true} is VALID [2018-11-14 18:23:11,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {816#true} assume !!~bvsgt32(~len, 1bv32); {816#true} is VALID [2018-11-14 18:23:11,066 INFO L256 TraceCheckUtils]: 17: Hoare triple {816#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {816#true} is VALID [2018-11-14 18:23:11,067 INFO L273 TraceCheckUtils]: 18: Hoare triple {816#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; {876#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 18:23:11,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {876#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {876#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-14 18:23:11,068 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#(not (= (_ bv0 32) 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; {883#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 18:23:11,069 INFO L273 TraceCheckUtils]: 21: Hoare triple {883#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {883#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-14 18:23:11,070 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {883#(not (= (_ bv0 32) |node_create_#res.base|))} {816#true} #135#return; {890#(not (= (_ bv0 32) |sll_circular_create_#t~ret4.base|))} is VALID [2018-11-14 18:23:11,071 INFO L273 TraceCheckUtils]: 23: Hoare triple {890#(not (= (_ bv0 32) |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; {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:23:11,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume true; {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:23:11,072 INFO L273 TraceCheckUtils]: 25: Hoare triple {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(~len, 1bv32); {894#(not (= sll_circular_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-14 18:23:11,073 INFO L273 TraceCheckUtils]: 26: Hoare triple {894#(not (= sll_circular_create_~head~0.base (_ bv0 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; {904#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-14 18:23:11,073 INFO L273 TraceCheckUtils]: 27: Hoare triple {904#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} assume true; {904#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} is VALID [2018-11-14 18:23:11,074 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {904#(not (= (_ bv0 32) |sll_circular_create_#res.base|))} {1026#(= |main_~#s~0.offset| (_ bv0 32))} #127#return; {1096#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)))} is VALID [2018-11-14 18:23:11,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {1096#(and (not (= (_ bv0 32) |main_#t~ret15.base|)) (= |main_~#s~0.offset| (_ bv0 32)))} call write~$Pointer$(#t~ret15.base, #t~ret15.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret15.base, #t~ret15.offset; {1100#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-14 18:23:11,077 INFO L256 TraceCheckUtils]: 30: Hoare triple {1100#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call sll_circular_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {919#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 18:23:11,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {919#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {923#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 18:23:11,079 INFO L256 TraceCheckUtils]: 32: Hoare triple {923#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} call #t~ret8.base, #t~ret8.offset := node_create(~data); {919#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} is VALID [2018-11-14 18:23:11,080 INFO L273 TraceCheckUtils]: 33: Hoare triple {919#(= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)} ~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; {930#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:23:11,081 INFO L273 TraceCheckUtils]: 34: Hoare triple {930#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {930#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2018-11-14 18:23:11,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {930#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.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; {937#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:23:11,085 INFO L273 TraceCheckUtils]: 36: Hoare triple {937#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {937#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-14 18:23:11,088 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {937#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| |node_create_#res.base| (store (select |old(#memory_$Pointer$.base)| |node_create_#res.base|) |node_create_#res.offset| (_ bv0 32)))) (= (select (select |#memory_int| |node_create_#res.base|) (bvadd |node_create_#res.offset| (_ bv4 32))) |node_create_#in~data|) (= |node_create_#res.offset| (_ bv0 32)))} {923#(and (= |sll_circular_prepend_#in~data| sll_circular_prepend_~data) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} #137#return; {944#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 18:23:11,089 INFO L273 TraceCheckUtils]: 38: Hoare triple {944#(and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| |sll_circular_prepend_#t~ret8.base|) (bvadd |sll_circular_prepend_#t~ret8.offset| (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) |sll_circular_prepend_#t~ret8.offset|) (= (store |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base| (store (select |old(#memory_$Pointer$.base)| |sll_circular_prepend_#t~ret8.base|) |sll_circular_prepend_#t~ret8.offset| (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} ~new_head~1.base, ~new_head~1.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32); {948#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} is VALID [2018-11-14 18:23:11,096 INFO L273 TraceCheckUtils]: 39: Hoare triple {948#(and (= (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) sll_circular_prepend_~new_head~1.offset (_ bv0 32))) |#memory_$Pointer$.base|) (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (bvadd sll_circular_prepend_~new_head~1.offset (_ bv4 32)))) (= sll_circular_prepend_~head.base |sll_circular_prepend_#in~head.base|) (= (_ bv0 32) sll_circular_prepend_~new_head~1.offset) (= (select (select |#memory_$Pointer$.base| sll_circular_prepend_~head.base) sll_circular_prepend_~head.offset) |sll_circular_prepend_#t~mem9.base|) (= |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~head.offset))} assume 0bv32 == #t~mem9.base && 0bv32 == #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32);call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~new_head~1.base, ~new_head~1.offset, 4bv32); {952#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-14 18:23:11,097 INFO L273 TraceCheckUtils]: 40: Hoare triple {952#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} assume true; {952#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} is VALID [2018-11-14 18:23:11,100 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {952#(and (exists ((sll_circular_prepend_~new_head~1.base (_ BitVec 32))) (and (= |sll_circular_prepend_#in~data| (select (select |#memory_int| sll_circular_prepend_~new_head~1.base) (_ bv4 32))) (= (store (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base (store (select (store (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base| (store (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset| sll_circular_prepend_~new_head~1.base)) sll_circular_prepend_~new_head~1.base) (_ bv0 32) sll_circular_prepend_~new_head~1.base)) |#memory_$Pointer$.base|) (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base (store (select |old(#memory_$Pointer$.base)| sll_circular_prepend_~new_head~1.base) (_ bv0 32) (_ bv0 32))) |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_prepend_~new_head~1.base) (_ bv0 32))))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_circular_prepend_#in~head.base|) |sll_circular_prepend_#in~head.offset|)))} {1100#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} #129#return; {1137#(and (= main_~data~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-14 18:23:11,101 INFO L273 TraceCheckUtils]: 42: Hoare triple {1137#(and (= main_~data~0 (select (select |#memory_int| |main_~#s~0.base|) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (= |main_~#s~0.offset| (_ bv0 32)) (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem16.base, #t~mem16.offset;havoc #t~mem16.base, #t~mem16.offset;~count~0 := 0bv32; {1141#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv4 32))) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-14 18:23:11,102 INFO L273 TraceCheckUtils]: 43: Hoare triple {1141#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv4 32))) (= main_~ptr~0.offset (_ bv0 32)))} assume true;call #t~mem18 := read~intINTTYPE4(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32); {977#(= |main_#t~mem18| main_~data~0)} is VALID [2018-11-14 18:23:11,105 INFO L273 TraceCheckUtils]: 44: Hoare triple {977#(= |main_#t~mem18| main_~data~0)} assume ~data~0 != #t~mem18;havoc #t~mem18; {817#false} is VALID [2018-11-14 18:23:11,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {817#false} assume !false; {817#false} is VALID [2018-11-14 18:23:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-14 18:23:11,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:23:11,380 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 18:23:13,392 WARN L179 SmtUtils]: Spent 1.92 s on a formula simplification that was a NOOP. DAG size: 69 [2018-11-14 18:23:14,118 WARN L179 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-14 18:23:15,266 WARN L179 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 54 [2018-11-14 18:23:16,484 WARN L179 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 52 [2018-11-14 18:23:21,081 WARN L833 TransFormulaUtils]: predicate-based correctness check returned UNKNOWN, hence correctness of interprocedural sequential composition was not checked. [2018-11-14 18:23:21,162 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:21,163 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 4 variables, input treesize:122, output treesize:1 [2018-11-14 18:23:23,904 INFO L477 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 59 [2018-11-14 18:23:24,152 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 18:23:24,162 INFO L477 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 9 treesize of output 8 [2018-11-14 18:23:24,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:24,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-14 18:23:24,283 INFO L477 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 6 treesize of output 1 [2018-11-14 18:23:24,284 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:24,303 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:24,364 INFO L477 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 50 treesize of output 54 [2018-11-14 18:23:24,380 INFO L477 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 49 treesize of output 43 [2018-11-14 18:23:24,383 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:24,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2018-11-14 18:23:24,524 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 18:23:24,620 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2018-11-14 18:23:24,655 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-14 18:23:24,808 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 18:23:24,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-14 18:23:25,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-14 18:23:25,216 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 1 variables, input treesize:70, output treesize:235 [2018-11-14 18:23:25,500 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:23:28,102 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-11-14 18:23:32,258 WARN L179 SmtUtils]: Spent 3.80 s on a formula simplification that was a NOOP. DAG size: 152 [2018-11-14 18:23:32,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 147 treesize of output 85 [2018-11-14 18:23:32,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-11-14 18:23:32,333 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:32,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:32,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 25 [2018-11-14 18:23:32,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2018-11-14 18:23:32,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:32,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:36,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 33 [2018-11-14 18:23:36,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:23:36,979 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:37,003 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:37,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 155 treesize of output 93 [2018-11-14 18:23:37,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:23:37,029 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:37,064 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:40,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 33 [2018-11-14 18:23:40,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:23:40,713 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:40,733 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:23:40,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 155 treesize of output 93 [2018-11-14 18:23:40,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 7 treesize of output 3 [2018-11-14 18:23:40,754 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-14 18:23:40,780 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts.