java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:17:32,398 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:17:32,400 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:17:32,419 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:17:32,419 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:17:32,420 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:17:32,424 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:17:32,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:17:32,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:17:32,435 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:17:32,437 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:17:32,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:17:32,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:17:32,442 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:17:32,443 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:17:32,444 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:17:32,445 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:17:32,447 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:17:32,449 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:17:32,450 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:17:32,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:17:32,453 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:17:32,455 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:17:32,456 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:17:32,456 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:17:32,457 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:17:32,458 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:17:32,459 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:17:32,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:17:32,461 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:17:32,461 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:17:32,462 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:17:32,462 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:17:32,462 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:17:32,463 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:17:32,464 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:17:32,464 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:17:32,480 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:17:32,480 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:17:32,481 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:17:32,481 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:17:32,481 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:17:32,482 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:17:32,482 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:17:32,482 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:17:32,482 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:17:32,483 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:17:32,483 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:17:32,483 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:17:32,483 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:17:32,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:17:32,483 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:17:32,484 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:17:32,484 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:17:32,484 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:17:32,484 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:17:32,484 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:17:32,485 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:17:32,485 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:17:32,485 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:17:32,485 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:17:32,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:17:32,486 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:17:32,486 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:17:32,486 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:17:32,486 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:17:32,486 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:17:32,486 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:17:32,487 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:17:32,487 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:17:32,535 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:17:32,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:17:32,557 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:17:32,559 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:17:32,559 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:17:32,560 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:17:32,625 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c74e3ac/323293dd0d66412b8f0b7742ae128dee/FLAG072ac508d [2018-11-23 11:17:33,160 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:17:33,161 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:17:33,175 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c74e3ac/323293dd0d66412b8f0b7742ae128dee/FLAG072ac508d [2018-11-23 11:17:33,431 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83c74e3ac/323293dd0d66412b8f0b7742ae128dee [2018-11-23 11:17:33,443 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:17:33,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:17:33,446 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:17:33,446 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:17:33,452 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:17:33,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:17:33" (1/1) ... [2018-11-23 11:17:33,457 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1309787a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:33, skipping insertion in model container [2018-11-23 11:17:33,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:17:33" (1/1) ... [2018-11-23 11:17:33,468 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:17:33,539 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:17:33,968 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:17:33,990 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:17:34,141 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:17:34,207 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:17:34,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34 WrapperNode [2018-11-23 11:17:34,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:17:34,209 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:17:34,209 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:17:34,210 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:17:34,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... [2018-11-23 11:17:34,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... [2018-11-23 11:17:34,264 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:17:34,265 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:17:34,265 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:17:34,265 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:17:34,276 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... [2018-11-23 11:17:34,276 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... [2018-11-23 11:17:34,281 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... [2018-11-23 11:17:34,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... [2018-11-23 11:17:34,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... [2018-11-23 11:17:34,308 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... [2018-11-23 11:17:34,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... [2018-11-23 11:17:34,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:17:34,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:17:34,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:17:34,317 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:17:34,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:17:34,382 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 11:17:34,383 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 11:17:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:17:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:17:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:17:34,383 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:17:34,383 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 11:17:34,384 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 11:17:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 11:17:34,384 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 11:17:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:17:34,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:17:34,384 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:17:34,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:17:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:17:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:17:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2018-11-23 11:17:34,385 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2018-11-23 11:17:34,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:17:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:17:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:17:34,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:17:34,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:17:35,394 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:17:35,395 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:17:35,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:17:35 BoogieIcfgContainer [2018-11-23 11:17:35,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:17:35,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:17:35,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:17:35,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:17:35,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:17:33" (1/3) ... [2018-11-23 11:17:35,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61372f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:17:35, skipping insertion in model container [2018-11-23 11:17:35,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:17:34" (2/3) ... [2018-11-23 11:17:35,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61372f70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:17:35, skipping insertion in model container [2018-11-23 11:17:35,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:17:35" (3/3) ... [2018-11-23 11:17:35,404 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:17:35,413 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:17:35,421 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:17:35,436 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:17:35,469 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:17:35,470 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:17:35,470 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:17:35,471 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:17:35,471 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:17:35,471 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:17:35,471 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:17:35,471 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:17:35,472 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:17:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-23 11:17:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:17:35,498 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:35,499 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:17:35,502 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:35,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash -703504676, now seen corresponding path program 1 times [2018-11-23 11:17:35,514 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:35,514 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:17:35,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:17:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:35,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:35,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {49#true} call ULTIMATE.init(); {49#true} is VALID [2018-11-23 11:17:35,815 INFO L273 TraceCheckUtils]: 1: Hoare triple {49#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {49#true} is VALID [2018-11-23 11:17:35,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {49#true} assume true; {49#true} is VALID [2018-11-23 11:17:35,816 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {49#true} {49#true} #99#return; {49#true} is VALID [2018-11-23 11:17:35,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {49#true} call #t~ret14 := main(); {49#true} is VALID [2018-11-23 11:17:35,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {49#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {49#true} is VALID [2018-11-23 11:17:35,817 INFO L256 TraceCheckUtils]: 6: Hoare triple {49#true} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {49#true} is VALID [2018-11-23 11:17:35,818 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {49#true} is VALID [2018-11-23 11:17:35,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#true} assume !true; {50#false} is VALID [2018-11-23 11:17:35,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {50#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {50#false} is VALID [2018-11-23 11:17:35,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {50#false} assume true; {50#false} is VALID [2018-11-23 11:17:35,832 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {50#false} {49#true} #89#return; {50#false} is VALID [2018-11-23 11:17:35,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {50#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {50#false} is VALID [2018-11-23 11:17:35,833 INFO L256 TraceCheckUtils]: 13: Hoare triple {50#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {50#false} is VALID [2018-11-23 11:17:35,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {50#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {50#false} is VALID [2018-11-23 11:17:35,834 INFO L256 TraceCheckUtils]: 15: Hoare triple {50#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {50#false} is VALID [2018-11-23 11:17:35,834 INFO L273 TraceCheckUtils]: 16: Hoare triple {50#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; {50#false} is VALID [2018-11-23 11:17:35,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {50#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {50#false} is VALID [2018-11-23 11:17:35,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {50#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {50#false} is VALID [2018-11-23 11:17:35,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {50#false} assume true; {50#false} is VALID [2018-11-23 11:17:35,836 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {50#false} {50#false} #95#return; {50#false} is VALID [2018-11-23 11:17:35,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {50#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {50#false} is VALID [2018-11-23 11:17:35,837 INFO L273 TraceCheckUtils]: 22: Hoare triple {50#false} assume true; {50#false} is VALID [2018-11-23 11:17:35,837 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {50#false} {50#false} #91#return; {50#false} is VALID [2018-11-23 11:17:35,837 INFO L273 TraceCheckUtils]: 24: Hoare triple {50#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {50#false} is VALID [2018-11-23 11:17:35,838 INFO L273 TraceCheckUtils]: 25: Hoare triple {50#false} assume !true; {50#false} is VALID [2018-11-23 11:17:35,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {50#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {50#false} is VALID [2018-11-23 11:17:35,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {50#false} assume !false; {50#false} is VALID [2018-11-23 11:17:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:17:35,846 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:17:35,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:17:35,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:17:35,864 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-23 11:17:35,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:35,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:17:36,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:36,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:17:36,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:17:36,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:17:36,109 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-11-23 11:17:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:36,496 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-11-23 11:17:36,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:17:36,496 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2018-11-23 11:17:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:36,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:17:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2018-11-23 11:17:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:17:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 96 transitions. [2018-11-23 11:17:36,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 96 transitions. [2018-11-23 11:17:37,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:37,401 INFO L225 Difference]: With dead ends: 80 [2018-11-23 11:17:37,401 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:17:37,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:17:37,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:17:37,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:17:37,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:37,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:17:37,614 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:17:37,614 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:17:37,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:37,620 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 11:17:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 11:17:37,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:37,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:37,622 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:17:37,622 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:17:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:37,627 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 11:17:37,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 11:17:37,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:37,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:37,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:37,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:17:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2018-11-23 11:17:37,635 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 28 [2018-11-23 11:17:37,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:37,635 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2018-11-23 11:17:37,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:17:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2018-11-23 11:17:37,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:17:37,637 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:37,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:17:37,638 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:37,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:37,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1727886821, now seen corresponding path program 1 times [2018-11-23 11:17:37,640 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:37,640 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:17:37,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:17:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:37,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:37,910 INFO L256 TraceCheckUtils]: 0: Hoare triple {359#true} call ULTIMATE.init(); {359#true} is VALID [2018-11-23 11:17:37,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {359#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {359#true} is VALID [2018-11-23 11:17:37,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {359#true} assume true; {359#true} is VALID [2018-11-23 11:17:37,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {359#true} {359#true} #99#return; {359#true} is VALID [2018-11-23 11:17:37,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {359#true} call #t~ret14 := main(); {359#true} is VALID [2018-11-23 11:17:37,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {359#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {379#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:37,912 INFO L256 TraceCheckUtils]: 6: Hoare triple {379#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {359#true} is VALID [2018-11-23 11:17:37,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {359#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {386#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:37,930 INFO L273 TraceCheckUtils]: 8: Hoare triple {386#(= |sll_create_#in~len| sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {390#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:17:37,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {390#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {390#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:17:37,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {390#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {390#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:17:37,933 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {390#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {379#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #89#return; {360#false} is VALID [2018-11-23 11:17:37,933 INFO L273 TraceCheckUtils]: 12: Hoare triple {360#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {360#false} is VALID [2018-11-23 11:17:37,933 INFO L256 TraceCheckUtils]: 13: Hoare triple {360#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {360#false} is VALID [2018-11-23 11:17:37,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {360#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {360#false} is VALID [2018-11-23 11:17:37,934 INFO L256 TraceCheckUtils]: 15: Hoare triple {360#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {360#false} is VALID [2018-11-23 11:17:37,934 INFO L273 TraceCheckUtils]: 16: Hoare triple {360#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; {360#false} is VALID [2018-11-23 11:17:37,935 INFO L273 TraceCheckUtils]: 17: Hoare triple {360#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {360#false} is VALID [2018-11-23 11:17:37,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {360#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {360#false} is VALID [2018-11-23 11:17:37,935 INFO L273 TraceCheckUtils]: 19: Hoare triple {360#false} assume true; {360#false} is VALID [2018-11-23 11:17:37,936 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {360#false} {360#false} #95#return; {360#false} is VALID [2018-11-23 11:17:37,936 INFO L273 TraceCheckUtils]: 21: Hoare triple {360#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {360#false} is VALID [2018-11-23 11:17:37,936 INFO L273 TraceCheckUtils]: 22: Hoare triple {360#false} assume true; {360#false} is VALID [2018-11-23 11:17:37,937 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {360#false} {360#false} #91#return; {360#false} is VALID [2018-11-23 11:17:37,937 INFO L273 TraceCheckUtils]: 24: Hoare triple {360#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {360#false} is VALID [2018-11-23 11:17:37,937 INFO L273 TraceCheckUtils]: 25: Hoare triple {360#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {360#false} is VALID [2018-11-23 11:17:37,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {360#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {360#false} is VALID [2018-11-23 11:17:37,938 INFO L273 TraceCheckUtils]: 27: Hoare triple {360#false} assume !false; {360#false} is VALID [2018-11-23 11:17:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:17:37,940 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:17:37,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:17:37,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:17:37,945 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 11:17:37,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:37,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:17:38,046 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:38,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:17:38,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:17:38,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:17:38,048 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 5 states. [2018-11-23 11:17:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:38,829 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-11-23 11:17:38,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:17:38,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-23 11:17:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:17:38,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 11:17:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:17:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2018-11-23 11:17:38,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2018-11-23 11:17:38,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:38,966 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:17:38,966 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:17:38,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:17:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:17:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-23 11:17:38,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:38,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2018-11-23 11:17:38,986 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2018-11-23 11:17:38,986 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2018-11-23 11:17:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:38,990 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 11:17:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 11:17:38,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:38,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:38,992 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2018-11-23 11:17:38,992 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2018-11-23 11:17:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:38,998 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 11:17:38,998 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 11:17:38,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:38,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:38,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:39,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:39,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:17:39,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 11:17:39,002 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 28 [2018-11-23 11:17:39,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:39,003 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 11:17:39,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:17:39,003 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 11:17:39,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:17:39,005 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:39,005 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:17:39,005 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:39,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1366633180, now seen corresponding path program 1 times [2018-11-23 11:17:39,006 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:39,006 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:17:39,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:17:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:39,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:39,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {652#true} call ULTIMATE.init(); {652#true} is VALID [2018-11-23 11:17:39,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {652#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {652#true} is VALID [2018-11-23 11:17:39,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {652#true} assume true; {652#true} is VALID [2018-11-23 11:17:39,295 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {652#true} {652#true} #99#return; {652#true} is VALID [2018-11-23 11:17:39,295 INFO L256 TraceCheckUtils]: 4: Hoare triple {652#true} call #t~ret14 := main(); {652#true} is VALID [2018-11-23 11:17:39,296 INFO L273 TraceCheckUtils]: 5: Hoare triple {652#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {672#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:39,297 INFO L256 TraceCheckUtils]: 6: Hoare triple {672#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {652#true} is VALID [2018-11-23 11:17:39,303 INFO L273 TraceCheckUtils]: 7: Hoare triple {652#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {679#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:39,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {679#(= |sll_create_#in~len| sll_create_~len)} assume !!~bvsgt32(~len, 0bv32); {679#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:39,304 INFO L256 TraceCheckUtils]: 9: Hoare triple {679#(= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {652#true} is VALID [2018-11-23 11:17:39,305 INFO L273 TraceCheckUtils]: 10: Hoare triple {652#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; {652#true} is VALID [2018-11-23 11:17:39,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {652#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {652#true} is VALID [2018-11-23 11:17:39,305 INFO L273 TraceCheckUtils]: 12: Hoare triple {652#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {652#true} is VALID [2018-11-23 11:17:39,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {652#true} assume true; {652#true} is VALID [2018-11-23 11:17:39,307 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {652#true} {679#(= |sll_create_#in~len| sll_create_~len)} #97#return; {679#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:39,308 INFO L273 TraceCheckUtils]: 15: Hoare triple {679#(= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {679#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:17:39,308 INFO L273 TraceCheckUtils]: 16: Hoare triple {679#(= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {707#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:17:39,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {707#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !~bvsgt32(~len, 0bv32); {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,329 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {672#(= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #89#return; {653#false} is VALID [2018-11-23 11:17:39,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {653#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {653#false} is VALID [2018-11-23 11:17:39,330 INFO L256 TraceCheckUtils]: 22: Hoare triple {653#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {653#false} is VALID [2018-11-23 11:17:39,330 INFO L273 TraceCheckUtils]: 23: Hoare triple {653#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {653#false} is VALID [2018-11-23 11:17:39,330 INFO L256 TraceCheckUtils]: 24: Hoare triple {653#false} call #t~ret6.base, #t~ret6.offset := node_create(~data); {653#false} is VALID [2018-11-23 11:17:39,330 INFO L273 TraceCheckUtils]: 25: Hoare triple {653#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; {653#false} is VALID [2018-11-23 11:17:39,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {653#false} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {653#false} is VALID [2018-11-23 11:17:39,331 INFO L273 TraceCheckUtils]: 27: Hoare triple {653#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {653#false} is VALID [2018-11-23 11:17:39,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {653#false} assume true; {653#false} is VALID [2018-11-23 11:17:39,331 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {653#false} {653#false} #95#return; {653#false} is VALID [2018-11-23 11:17:39,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {653#false} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {653#false} is VALID [2018-11-23 11:17:39,332 INFO L273 TraceCheckUtils]: 31: Hoare triple {653#false} assume true; {653#false} is VALID [2018-11-23 11:17:39,332 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {653#false} {653#false} #91#return; {653#false} is VALID [2018-11-23 11:17:39,332 INFO L273 TraceCheckUtils]: 33: Hoare triple {653#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {653#false} is VALID [2018-11-23 11:17:39,333 INFO L273 TraceCheckUtils]: 34: Hoare triple {653#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {653#false} is VALID [2018-11-23 11:17:39,333 INFO L273 TraceCheckUtils]: 35: Hoare triple {653#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {653#false} is VALID [2018-11-23 11:17:39,333 INFO L273 TraceCheckUtils]: 36: Hoare triple {653#false} assume !false; {653#false} is VALID [2018-11-23 11:17:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:17:39,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:17:39,774 INFO L273 TraceCheckUtils]: 36: Hoare triple {653#false} assume !false; {653#false} is VALID [2018-11-23 11:17:39,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {653#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {653#false} is VALID [2018-11-23 11:17:39,775 INFO L273 TraceCheckUtils]: 34: Hoare triple {653#false} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {653#false} is VALID [2018-11-23 11:17:39,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {653#false} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {653#false} is VALID [2018-11-23 11:17:39,775 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {652#true} {653#false} #91#return; {653#false} is VALID [2018-11-23 11:17:39,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {652#true} assume true; {652#true} is VALID [2018-11-23 11:17:39,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {652#true} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {652#true} is VALID [2018-11-23 11:17:39,777 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {652#true} {652#true} #95#return; {652#true} is VALID [2018-11-23 11:17:39,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {652#true} assume true; {652#true} is VALID [2018-11-23 11:17:39,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {652#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {652#true} is VALID [2018-11-23 11:17:39,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {652#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {652#true} is VALID [2018-11-23 11:17:39,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {652#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; {652#true} is VALID [2018-11-23 11:17:39,779 INFO L256 TraceCheckUtils]: 24: Hoare triple {652#true} call #t~ret6.base, #t~ret6.offset := node_create(~data); {652#true} is VALID [2018-11-23 11:17:39,780 INFO L273 TraceCheckUtils]: 23: Hoare triple {652#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {652#true} is VALID [2018-11-23 11:17:39,780 INFO L256 TraceCheckUtils]: 22: Hoare triple {653#false} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {652#true} is VALID [2018-11-23 11:17:39,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {653#false} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {653#false} is VALID [2018-11-23 11:17:39,793 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {817#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} #89#return; {653#false} is VALID [2018-11-23 11:17:39,806 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {830#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !~bvsgt32(~len, 0bv32); {711#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,821 INFO L273 TraceCheckUtils]: 16: Hoare triple {834#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {830#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:17:39,823 INFO L273 TraceCheckUtils]: 15: Hoare triple {834#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {834#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,824 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {652#true} {834#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #97#return; {834#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {652#true} assume true; {652#true} is VALID [2018-11-23 11:17:39,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {652#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {652#true} is VALID [2018-11-23 11:17:39,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {652#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {652#true} is VALID [2018-11-23 11:17:39,825 INFO L273 TraceCheckUtils]: 10: Hoare triple {652#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; {652#true} is VALID [2018-11-23 11:17:39,826 INFO L256 TraceCheckUtils]: 9: Hoare triple {834#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {652#true} is VALID [2018-11-23 11:17:39,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {834#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsgt32(~len, 0bv32); {834#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {652#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {834#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:17:39,843 INFO L256 TraceCheckUtils]: 6: Hoare triple {817#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {652#true} is VALID [2018-11-23 11:17:39,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {652#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {817#(bvsgt (bvadd main_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:17:39,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {652#true} call #t~ret14 := main(); {652#true} is VALID [2018-11-23 11:17:39,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {652#true} {652#true} #99#return; {652#true} is VALID [2018-11-23 11:17:39,850 INFO L273 TraceCheckUtils]: 2: Hoare triple {652#true} assume true; {652#true} is VALID [2018-11-23 11:17:39,850 INFO L273 TraceCheckUtils]: 1: Hoare triple {652#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {652#true} is VALID [2018-11-23 11:17:39,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {652#true} call ULTIMATE.init(); {652#true} is VALID [2018-11-23 11:17:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:17:39,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:17:39,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:17:39,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:17:39,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:39,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:17:39,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:39,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:17:39,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:17:39,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:17:39,999 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 9 states. [2018-11-23 11:17:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:41,244 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-23 11:17:41,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:17:41,244 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:17:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:17:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2018-11-23 11:17:41,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:17:41,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 69 transitions. [2018-11-23 11:17:41,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 69 transitions. [2018-11-23 11:17:41,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:41,434 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:17:41,434 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:17:41,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:17:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:17:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-23 11:17:41,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:41,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-23 11:17:41,481 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-23 11:17:41,481 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-23 11:17:41,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:41,485 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:17:41,486 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:17:41,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:41,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:41,487 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-23 11:17:41,487 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-23 11:17:41,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:41,490 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:17:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:17:41,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:41,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:41,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:41,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:17:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-23 11:17:41,495 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 37 [2018-11-23 11:17:41,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:41,496 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-23 11:17:41,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:17:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 11:17:41,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:17:41,497 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:41,498 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:17:41,498 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:41,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:41,498 INFO L82 PathProgramCache]: Analyzing trace with hash 190108475, now seen corresponding path program 2 times [2018-11-23 11:17:41,499 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:41,499 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:17:41,516 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:17:41,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:17:41,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:17:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:41,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:41,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 41 [2018-11-23 11:17:41,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 11:17:41,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:42,229 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2018-11-23 11:17:42,257 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:42,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 36 [2018-11-23 11:17:42,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 42 [2018-11-23 11:17:42,677 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 11:17:42,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 21 treesize of output 24 [2018-11-23 11:17:42,905 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:43,093 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-23 11:17:43,101 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-23 11:17:43,144 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:17:43,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-11-23 11:17:43,498 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2018-11-23 11:17:43,505 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-23 11:17:43,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 7 [2018-11-23 11:17:43,591 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:43,608 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:43,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:43,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:43,639 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:44, output treesize:8 [2018-11-23 11:17:43,665 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:43,665 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_48|, sll_prepend_~new_head~1.base, sll_prepend_~new_head~1.offset]. (and (= |#memory_$Pointer$.base| (let ((.cse0 (store |v_#memory_$Pointer$.base_48| sll_prepend_~new_head~1.base (store (select |v_#memory_$Pointer$.base_48| sll_prepend_~new_head~1.base) (bvadd sll_prepend_~new_head~1.offset (_ bv4 32)) (select (select |v_#memory_$Pointer$.base_48| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))))) (store .cse0 |sll_prepend_#in~head.base| (store (select .cse0 |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (not (= (_ bv0 32) sll_prepend_~new_head~1.base))) [2018-11-23 11:17:43,665 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (_ bv0 32))) [2018-11-23 11:17:43,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:17:43,874 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 11:17:43,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:43,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:43,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:43,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-11-23 11:17:43,915 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:43,915 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))) (and (= .cse0 main_~ptr~0.base) (not (= (_ bv0 32) .cse0)))) [2018-11-23 11:17:43,916 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= (_ bv0 32) main_~ptr~0.base)) [2018-11-23 11:17:43,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {1109#true} call ULTIMATE.init(); {1109#true} is VALID [2018-11-23 11:17:43,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {1109#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1109#true} is VALID [2018-11-23 11:17:43,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 11:17:43,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1109#true} {1109#true} #99#return; {1109#true} is VALID [2018-11-23 11:17:43,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {1109#true} call #t~ret14 := main(); {1109#true} is VALID [2018-11-23 11:17:43,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {1109#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1129#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:17:43,934 INFO L256 TraceCheckUtils]: 6: Hoare triple {1129#(= |main_~#s~0.offset| (_ bv0 32))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1109#true} is VALID [2018-11-23 11:17:43,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {1109#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1109#true} is VALID [2018-11-23 11:17:43,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#true} assume !!~bvsgt32(~len, 0bv32); {1109#true} is VALID [2018-11-23 11:17:43,935 INFO L256 TraceCheckUtils]: 9: Hoare triple {1109#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1109#true} is VALID [2018-11-23 11:17:43,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {1109#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; {1109#true} is VALID [2018-11-23 11:17:43,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {1109#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1109#true} is VALID [2018-11-23 11:17:43,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {1109#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1109#true} is VALID [2018-11-23 11:17:43,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 11:17:43,936 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1109#true} {1109#true} #97#return; {1109#true} is VALID [2018-11-23 11:17:43,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {1109#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1109#true} is VALID [2018-11-23 11:17:43,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {1109#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1109#true} is VALID [2018-11-23 11:17:43,937 INFO L273 TraceCheckUtils]: 17: Hoare triple {1109#true} assume !!~bvsgt32(~len, 0bv32); {1109#true} is VALID [2018-11-23 11:17:43,937 INFO L256 TraceCheckUtils]: 18: Hoare triple {1109#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1109#true} is VALID [2018-11-23 11:17:43,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {1109#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; {1109#true} is VALID [2018-11-23 11:17:43,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {1109#true} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1109#true} is VALID [2018-11-23 11:17:43,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {1109#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1109#true} is VALID [2018-11-23 11:17:43,938 INFO L273 TraceCheckUtils]: 22: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 11:17:43,938 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1109#true} {1109#true} #97#return; {1109#true} is VALID [2018-11-23 11:17:43,939 INFO L273 TraceCheckUtils]: 24: Hoare triple {1109#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1109#true} is VALID [2018-11-23 11:17:43,939 INFO L273 TraceCheckUtils]: 25: Hoare triple {1109#true} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1109#true} is VALID [2018-11-23 11:17:43,939 INFO L273 TraceCheckUtils]: 26: Hoare triple {1109#true} assume !~bvsgt32(~len, 0bv32); {1109#true} is VALID [2018-11-23 11:17:43,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {1109#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1109#true} is VALID [2018-11-23 11:17:43,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 11:17:43,941 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1109#true} {1129#(= |main_~#s~0.offset| (_ bv0 32))} #89#return; {1129#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:17:43,941 INFO L273 TraceCheckUtils]: 30: Hoare triple {1129#(= |main_~#s~0.offset| (_ bv0 32))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {1129#(= |main_~#s~0.offset| (_ bv0 32))} is VALID [2018-11-23 11:17:43,941 INFO L256 TraceCheckUtils]: 31: Hoare triple {1129#(= |main_~#s~0.offset| (_ bv0 32))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1109#true} is VALID [2018-11-23 11:17:43,942 INFO L273 TraceCheckUtils]: 32: Hoare triple {1109#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1211#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-23 11:17:43,942 INFO L256 TraceCheckUtils]: 33: Hoare triple {1211#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1109#true} is VALID [2018-11-23 11:17:43,943 INFO L273 TraceCheckUtils]: 34: Hoare triple {1109#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; {1218#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-23 11:17:43,961 INFO L273 TraceCheckUtils]: 35: Hoare triple {1218#(not (= (_ bv0 32) node_create_~temp~0.base))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1218#(not (= (_ bv0 32) node_create_~temp~0.base))} is VALID [2018-11-23 11:17:43,963 INFO L273 TraceCheckUtils]: 36: Hoare triple {1218#(not (= (_ bv0 32) node_create_~temp~0.base))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1225#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-23 11:17:43,969 INFO L273 TraceCheckUtils]: 37: Hoare triple {1225#(not (= (_ bv0 32) |node_create_#res.base|))} assume true; {1225#(not (= (_ bv0 32) |node_create_#res.base|))} is VALID [2018-11-23 11:17:43,971 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1225#(not (= (_ bv0 32) |node_create_#res.base|))} {1211#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} #95#return; {1232#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (not (= (_ bv0 32) |sll_prepend_#t~ret6.base|)))} is VALID [2018-11-23 11:17:43,974 INFO L273 TraceCheckUtils]: 39: Hoare triple {1232#(and (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|) (not (= (_ bv0 32) |sll_prepend_#t~ret6.base|)))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1236#(not (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-23 11:17:43,974 INFO L273 TraceCheckUtils]: 40: Hoare triple {1236#(not (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (_ bv0 32)))} assume true; {1236#(not (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-23 11:17:43,976 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1236#(not (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) (_ bv0 32)))} {1129#(= |main_~#s~0.offset| (_ bv0 32))} #91#return; {1243#(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-23 11:17:43,990 INFO L273 TraceCheckUtils]: 42: Hoare triple {1243#(and (= |main_~#s~0.offset| (_ bv0 32)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {1247#(not (= (_ bv0 32) main_~ptr~0.base))} is VALID [2018-11-23 11:17:43,990 INFO L273 TraceCheckUtils]: 43: Hoare triple {1247#(not (= (_ bv0 32) main_~ptr~0.base))} assume !(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32); {1110#false} is VALID [2018-11-23 11:17:43,991 INFO L273 TraceCheckUtils]: 44: Hoare triple {1110#false} assume ~count~0 != ~bvadd32(1bv32, ~len~0); {1110#false} is VALID [2018-11-23 11:17:43,991 INFO L273 TraceCheckUtils]: 45: Hoare triple {1110#false} assume !false; {1110#false} is VALID [2018-11-23 11:17:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:17:43,995 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:17:43,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:17:43,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 11:17:43,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-11-23 11:17:43,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:17:43,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:17:44,088 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-23 11:17:44,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:17:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:17:44,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:17:44,089 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand 10 states. [2018-11-23 11:17:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:45,522 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-11-23 11:17:45,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:17:45,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-11-23 11:17:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:17:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:17:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2018-11-23 11:17:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:17:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2018-11-23 11:17:45,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2018-11-23 11:17:45,599 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:17:45,602 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:17:45,602 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:17:45,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:17:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:17:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2018-11-23 11:17:45,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:17:45,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 39 states. [2018-11-23 11:17:45,653 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 39 states. [2018-11-23 11:17:45,653 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 39 states. [2018-11-23 11:17:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:45,656 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 11:17:45,656 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:17:45,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:45,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:45,657 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 42 states. [2018-11-23 11:17:45,657 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 42 states. [2018-11-23 11:17:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:17:45,660 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-11-23 11:17:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-11-23 11:17:45,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:17:45,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:17:45,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:17:45,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:17:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:17:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 11:17:45,664 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 46 [2018-11-23 11:17:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:17:45,665 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 11:17:45,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:17:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:17:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:17:45,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:17:45,667 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:17:45,667 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:17:45,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:17:45,668 INFO L82 PathProgramCache]: Analyzing trace with hash 190110149, now seen corresponding path program 1 times [2018-11-23 11:17:45,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:17:45,668 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:17:45,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:17:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:17:45,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:17:46,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:17:46,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:46,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:46,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-11-23 11:17:46,030 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:46,031 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_52|]. (and (= main_~data~0 (_ bv1 32)) (= |#valid| (store |v_#valid_52| |main_~#s~0.base| (_ bv1 1))) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:17:46,031 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~data~0 (_ bv1 32)) (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32))) [2018-11-23 11:17:47,378 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1))))) is different from true [2018-11-23 11:17:49,514 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |c_sll_create_#t~ret4.base| (_ bv1 1))))) is different from true [2018-11-23 11:17:50,628 WARN L854 $PredicateComparison]: unable to prove that (exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |c_#valid| (store (store |c_old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1))))) is different from true [2018-11-23 11:17:50,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:50,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:17:50,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 29 [2018-11-23 11:17:50,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 11:17:50,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:50,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:50,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:17:50,865 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:28 [2018-11-23 11:17:50,874 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:17:50,875 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_BEFORE_CALL_6|, |node_create_#t~malloc2.base|, sll_create_~new_head~0.base]. (and (= (store (store |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)) |#valid|) (= |main_~#s~0.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_BEFORE_CALL_6| |main_~#s~0.base|) (_ bv1 1))) (= (select |v_#valid_BEFORE_CALL_6| |node_create_#t~malloc2.base|) (_ bv0 1)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:17:50,875 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|node_create_#t~malloc2.base|, sll_create_~new_head~0.base]. (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (= (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:17:51,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:17:51,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:17:51,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:51,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:51,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:51,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 11:17:51,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:17:51,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:17:51,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-11-23 11:17:51,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2018-11-23 11:17:51,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:52,353 INFO L303 Elim1Store]: Index analysis took 264 ms [2018-11-23 11:17:52,393 INFO L478 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 30 treesize of output 40 [2018-11-23 11:17:52,508 INFO L478 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 0 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 26 [2018-11-23 11:17:52,513 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-23 11:17:53,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2018-11-23 11:17:53,715 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:54,314 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:17:54,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:17:55,487 INFO L303 Elim1Store]: Index analysis took 191 ms [2018-11-23 11:17:55,528 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-23 11:17:55,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 11:17:55,561 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:56,202 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-11-23 11:17:56,211 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:57,006 INFO L303 Elim1Store]: Index analysis took 104 ms [2018-11-23 11:17:57,030 INFO L478 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 26 treesize of output 34 [2018-11-23 11:17:57,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 23 treesize of output 26 [2018-11-23 11:17:57,084 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:57,315 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-23 11:17:57,324 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-23 11:17:57,473 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:17:58,224 INFO L478 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 23 treesize of output 33 [2018-11-23 11:17:58,274 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-23 11:17:58,279 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 11:17:58,525 INFO L478 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 18 treesize of output 7 [2018-11-23 11:17:58,527 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:58,580 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:58,635 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:58,942 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 39 [2018-11-23 11:17:58,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-11-23 11:17:58,954 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,193 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 29 [2018-11-23 11:17:59,198 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,409 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2018-11-23 11:17:59,451 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 22 [2018-11-23 11:17:59,461 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-11-23 11:17:59,481 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,659 INFO L478 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 26 treesize of output 34 [2018-11-23 11:17:59,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 23 treesize of output 26 [2018-11-23 11:17:59,694 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:17:59,793 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-23 11:17:59,798 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-11-23 11:17:59,841 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:17:59,969 INFO L478 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 23 treesize of output 33 [2018-11-23 11:18:00,009 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 25 [2018-11-23 11:18:00,013 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-23 11:18:00,164 INFO L478 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 18 treesize of output 7 [2018-11-23 11:18:00,190 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:00,277 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:00,300 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:00,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:18:00,416 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 5 variables, input treesize:113, output treesize:82 [2018-11-23 11:18:06,283 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:06,284 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_49|, sll_prepend_~new_head~1.base, |v_#memory_int_48|, |v_#memory_int_47|, |v_#memory_$Pointer$.offset_48|]. (let ((.cse0 (select |v_#memory_int_48| sll_prepend_~new_head~1.base))) (and (= (select .cse0 (_ bv0 32)) |sll_prepend_#in~data|) (= |#memory_$Pointer$.base| (let ((.cse1 (store |v_#memory_$Pointer$.base_49| sll_prepend_~new_head~1.base (store (select |v_#memory_$Pointer$.base_49| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select |v_#memory_$Pointer$.base_49| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))))) (store .cse1 |sll_prepend_#in~head.base| (store (select .cse1 |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))) (= (select |old(#valid)| sll_prepend_~new_head~1.base) (_ bv0 1)) (= (store |v_#memory_int_48| sll_prepend_~new_head~1.base (store .cse0 (_ bv4 32) (select (select |v_#memory_int_47| sll_prepend_~new_head~1.base) (_ bv4 32)))) |v_#memory_int_47|) (= (let ((.cse2 (store |v_#memory_$Pointer$.offset_48| sll_prepend_~new_head~1.base (store (select |v_#memory_$Pointer$.offset_48| sll_prepend_~new_head~1.base) (_ bv4 32) (select (select |v_#memory_$Pointer$.offset_48| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))))) (store .cse2 |sll_prepend_#in~head.base| (store (select .cse2 |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| (_ bv0 32)))) |#memory_$Pointer$.offset|) (= |#memory_int| (store |v_#memory_int_47| |sll_prepend_#in~head.base| (store (select |v_#memory_int_47| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset| (select (select |#memory_int| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)))))) [2018-11-23 11:18:06,284 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (let ((.cse2 (= (_ bv0 1) (select |old(#valid)| |sll_prepend_#in~head.base|))) (.cse1 (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (.cse3 (= .cse0 |sll_prepend_#in~head.base|))) (or (and (= (_ bv0 1) (select |old(#valid)| .cse0)) .cse1 (= |sll_prepend_#in~data| (select (select |#memory_int| .cse0) (_ bv0 32)))) (and .cse2 .cse1 .cse3 (= (_ bv0 32) |sll_prepend_#in~head.offset|)) (and .cse2 .cse1 (= (_ bv4 32) |sll_prepend_#in~head.offset|) .cse3 (= |sll_prepend_#in~data| (select (select |#memory_int| |sll_prepend_#in~head.base|) (_ bv0 32))))))) [2018-11-23 11:18:06,474 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 11:18:06,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,542 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:06,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:06,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:06,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-11-23 11:18:06,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:93, output treesize:35 [2018-11-23 11:18:06,604 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:06,604 WARN L384 uantifierElimination]: Input elimination task: ∃ [v_prenex_14, v_prenex_15, |v_old(#valid)_AFTER_CALL_33|, |node_create_#t~malloc2.base|]. (let ((.cse1 (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32))) (.cse2 (= |main_~#s~0.offset| (_ bv0 32))) (.cse4 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse3 (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))) (or (let ((.cse0 (select |v_old(#valid)_AFTER_CALL_33| |main_~#s~0.base|))) (and (= (_ bv1 1) .cse0) .cse1 .cse2 (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)) (= (_ bv0 1) .cse0) .cse3 (= (select |v_old(#valid)_AFTER_CALL_33| |node_create_#t~malloc2.base|) (_ bv1 1)) (= |main_~#s~0.base| .cse4))) (and (= (select v_prenex_14 .cse4) (_ bv0 1)) (= (_ bv1 1) (select v_prenex_14 |main_~#s~0.base|)) .cse1 .cse2 (= (select (select |#memory_int| .cse4) (_ bv0 32)) main_~data~0) (= (select v_prenex_14 v_prenex_15) (_ bv1 1)) .cse3 (not (= v_prenex_15 |main_~#s~0.base|))))) [2018-11-23 11:18:06,604 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| .cse0) (_ bv0 32)) main_~data~0) (not (= |main_~#s~0.base| .cse0)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:18:06,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:18:06,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:18:06,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:18:06,730 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 11:18:06,732 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,740 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,755 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-23 11:18:06,755 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:16 [2018-11-23 11:18:06,762 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:06,762 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) (_ bv0 32)))) (and (= .cse0 main_~ptr~0.base) (= (_ bv0 32) .cse1) (= main_~data~0 (select (select |#memory_int| .cse0) (_ bv0 32))) (= main_~ptr~0.offset .cse1) (not (= |main_~#s~0.base| .cse0)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:18:06,762 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32))) [2018-11-23 11:18:06,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:18:06,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:18:06,833 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,835 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:06,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-23 11:18:06,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:9 [2018-11-23 11:18:06,847 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:06,847 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~ptr~0.base]. (let ((.cse0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32)))) (and (= |main_#t~mem11| .cse0) (= main_~data~0 .cse0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:18:06,848 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |main_#t~mem11| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:18:06,882 INFO L256 TraceCheckUtils]: 0: Hoare triple {1468#true} call ULTIMATE.init(); {1468#true} is VALID [2018-11-23 11:18:06,882 INFO L273 TraceCheckUtils]: 1: Hoare triple {1468#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1468#true} is VALID [2018-11-23 11:18:06,882 INFO L273 TraceCheckUtils]: 2: Hoare triple {1468#true} assume true; {1468#true} is VALID [2018-11-23 11:18:06,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1468#true} {1468#true} #99#return; {1468#true} is VALID [2018-11-23 11:18:06,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {1468#true} call #t~ret14 := main(); {1468#true} is VALID [2018-11-23 11:18:06,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {1468#true} ~len~0 := 2bv32;~data~0 := 1bv32;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1488#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:06,885 INFO L256 TraceCheckUtils]: 6: Hoare triple {1488#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call #t~ret8.base, #t~ret8.offset := sll_create(~len~0, ~data~0); {1492#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:06,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {1492#(= |#valid| |old(#valid)|)} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1492#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:06,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {1492#(= |#valid| |old(#valid)|)} assume !!~bvsgt32(~len, 0bv32); {1492#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:06,887 INFO L256 TraceCheckUtils]: 9: Hoare triple {1492#(= |#valid| |old(#valid)|)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1492#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:06,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {1492#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,889 INFO L273 TraceCheckUtils]: 11: Hoare triple {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume true; {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,892 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} {1492#(= |#valid| |old(#valid)|)} #97#return; {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,893 INFO L273 TraceCheckUtils]: 15: Hoare triple {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} assume !!~bvsgt32(~len, 0bv32); {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,900 INFO L256 TraceCheckUtils]: 18: Hoare triple {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1492#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:06,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {1492#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1533#(= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|)} is VALID [2018-11-23 11:18:06,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {1533#(= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|)} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1533#(= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|)} is VALID [2018-11-23 11:18:06,902 INFO L273 TraceCheckUtils]: 21: Hoare triple {1533#(= (store |old(#valid)| node_create_~temp~0.base (_ bv1 1)) |#valid|)} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1540#(= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|)} is VALID [2018-11-23 11:18:06,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {1540#(= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|)} assume true; {1540#(= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|)} is VALID [2018-11-23 11:18:06,911 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1540#(= (store |old(#valid)| |node_create_#res.base| (_ bv1 1)) |#valid|)} {1505#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)))))} #97#return; {1547#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,913 INFO L273 TraceCheckUtils]: 24: Hoare triple {1547#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) |sll_create_#t~ret4.base| (_ bv1 1)))))} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~bvadd32(4bv32, ~new_head~0.offset), 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,913 INFO L273 TraceCheckUtils]: 25: Hoare triple {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} #t~post3 := ~len;~len := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,914 INFO L273 TraceCheckUtils]: 26: Hoare triple {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} assume !~bvsgt32(~len, 0bv32); {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,914 INFO L273 TraceCheckUtils]: 27: Hoare triple {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,915 INFO L273 TraceCheckUtils]: 28: Hoare triple {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} assume true; {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} is VALID [2018-11-23 11:18:06,921 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1551#(exists ((|node_create_#t~malloc2.base| (_ BitVec 32)) (sll_create_~new_head~0.base (_ BitVec 32))) (and (= (select |old(#valid)| |node_create_#t~malloc2.base|) (_ bv0 1)) (= |#valid| (store (store |old(#valid)| |node_create_#t~malloc2.base| (_ bv1 1)) sll_create_~new_head~0.base (_ bv1 1)))))} {1488#(and (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #89#return; {1567#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:06,923 INFO L273 TraceCheckUtils]: 30: Hoare triple {1567#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~init~$Pointer$(#t~ret8.base, #t~ret8.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret8.base, #t~ret8.offset; {1567#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:06,923 INFO L256 TraceCheckUtils]: 31: Hoare triple {1567#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} call sll_prepend(~#s~0.base, ~#s~0.offset, ~data~0); {1492#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:06,924 INFO L273 TraceCheckUtils]: 32: Hoare triple {1492#(= |#valid| |old(#valid)|)} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data; {1577#(and (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#in~data| sll_prepend_~data) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-23 11:18:06,925 INFO L256 TraceCheckUtils]: 33: Hoare triple {1577#(and (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#in~data| sll_prepend_~data) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} call #t~ret6.base, #t~ret6.offset := node_create(~data); {1492#(= |#valid| |old(#valid)|)} is VALID [2018-11-23 11:18:06,926 INFO L273 TraceCheckUtils]: 34: Hoare triple {1492#(= |#valid| |old(#valid)|)} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1584#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:18:06,927 INFO L273 TraceCheckUtils]: 35: Hoare triple {1584#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} assume !(0bv32 == ~temp~0.base && 0bv32 == ~temp~0.offset); {1584#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} is VALID [2018-11-23 11:18:06,929 INFO L273 TraceCheckUtils]: 36: Hoare triple {1584#(and (= node_create_~data |node_create_#in~data|) (= node_create_~temp~0.offset (_ bv0 32)) (= (_ bv0 1) (select |old(#valid)| node_create_~temp~0.base)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0.base, ~bvadd32(4bv32, ~temp~0.offset), 4bv32);call write~intINTTYPE4(~data, ~temp~0.base, ~temp~0.offset, 4bv32);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1591#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:06,930 INFO L273 TraceCheckUtils]: 37: Hoare triple {1591#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} assume true; {1591#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:18:06,933 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1591#(and (= (_ bv0 1) (select |old(#valid)| |node_create_#res.base|)) (= |node_create_#in~data| (select (select |#memory_int| |node_create_#res.base|) |node_create_#res.offset|)) (= |node_create_#res.offset| (_ bv0 32)))} {1577#(and (= |#valid| |old(#valid)|) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#in~data| sll_prepend_~data) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} #95#return; {1598#(and (= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) (_ bv0 32)) |sll_prepend_#in~data|) (= (_ bv0 1) (select |old(#valid)| |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} is VALID [2018-11-23 11:18:06,938 INFO L273 TraceCheckUtils]: 39: Hoare triple {1598#(and (= (select (select |#memory_int| |sll_prepend_#t~ret6.base|) (_ bv0 32)) |sll_prepend_#in~data|) (= (_ bv0 1) (select |old(#valid)| |sll_prepend_#t~ret6.base|)) (= sll_prepend_~head.base |sll_prepend_#in~head.base|) (= |sll_prepend_#t~ret6.offset| (_ bv0 32)) (= sll_prepend_~head.offset |sll_prepend_#in~head.offset|))} ~new_head~1.base, ~new_head~1.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);call write~$Pointer$(#t~mem7.base, #t~mem7.offset, ~new_head~1.base, ~bvadd32(4bv32, ~new_head~1.offset), 4bv32);havoc #t~mem7.base, #t~mem7.offset;call write~$Pointer$(~new_head~1.base, ~new_head~1.offset, ~head.base, ~head.offset, 4bv32); {1602#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv0 1) (select |old(#valid)| |sll_prepend_#in~head.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= (_ bv0 32) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-23 11:18:06,939 INFO L273 TraceCheckUtils]: 40: Hoare triple {1602#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv0 1) (select |old(#valid)| |sll_prepend_#in~head.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= (_ bv0 32) |sll_prepend_#in~head.offset|)))} assume true; {1602#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv0 1) (select |old(#valid)| |sll_prepend_#in~head.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= (_ bv0 32) |sll_prepend_#in~head.offset|)))} is VALID [2018-11-23 11:18:06,941 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {1602#(or (and (= (_ bv0 1) (select |old(#valid)| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= |sll_prepend_#in~data| (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (_ bv0 32)))) (and (= (_ bv0 1) (select |old(#valid)| |sll_prepend_#in~head.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|)) (= (select (select |#memory_$Pointer$.base| |sll_prepend_#in~head.base|) |sll_prepend_#in~head.offset|) |sll_prepend_#in~head.base|) (= (_ bv0 32) |sll_prepend_#in~head.offset|)))} {1567#(and (exists ((|node_create_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |node_create_#t~malloc2.base|)) (not (= |node_create_#t~malloc2.base| |main_~#s~0.base|)))) (= (bvadd (select |#valid| |main_~#s~0.base|) (_ bv1 1)) (_ bv0 1)) (= |main_~#s~0.offset| (_ bv0 32)) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} #91#return; {1609#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} is VALID [2018-11-23 11:18:06,942 INFO L273 TraceCheckUtils]: 42: Hoare triple {1609#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= |main_~#s~0.offset| (_ bv0 32)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_~#s~0.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32);~ptr~0.base, ~ptr~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;~count~0 := 0bv32; {1613#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:18:06,943 INFO L273 TraceCheckUtils]: 43: Hoare triple {1613#(and (= main_~data~0 (select (select |#memory_int| main_~ptr~0.base) (_ bv0 32))) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)) (= main_~ptr~0.offset (_ bv0 32)))} assume !!(~ptr~0.base != 0bv32 || ~ptr~0.offset != 0bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~ptr~0.base, ~bvadd32(4bv32, ~ptr~0.offset), 4bv32);~temp~2.base, ~temp~2.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~ptr~0.base, ~ptr~0.offset, 4bv32); {1617#(and (= |main_#t~mem11| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:18:06,944 INFO L273 TraceCheckUtils]: 44: Hoare triple {1617#(and (= |main_#t~mem11| main_~data~0) (= (bvadd main_~data~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~data~0 != #t~mem11;havoc #t~mem11; {1469#false} is VALID [2018-11-23 11:18:06,944 INFO L273 TraceCheckUtils]: 45: Hoare triple {1469#false} assume !false; {1469#false} is VALID [2018-11-23 11:18:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 14 not checked. [2018-11-23 11:18:06,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:18:10,247 WARN L180 SmtUtils]: Spent 2.86 s on a formula simplification that was a NOOP. DAG size: 84 [2018-11-23 11:18:10,969 WARN L180 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 11:18:12,268 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 68 [2018-11-23 11:18:13,426 WARN L180 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 11:18:14,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-11-23 11:18:14,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-11-23 11:18:14,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2018-11-23 11:18:14,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:14,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:14,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:14,200 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:14,205 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:14,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:14,231 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:18:14,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-11-23 11:18:14,240 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:18:14,241 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 11:18:14,243 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:14,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2018-11-23 11:18:14,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:18:14,275 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:14,278 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:14,289 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:14,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:14,306 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:49, output treesize:11 [2018-11-23 11:18:14,367 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:18:14,368 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_65|, |v_#memory_int_63|, v_sll_prepend_~new_head~1.base_7, |v_#memory_int_64|]. (or (not (= (_ bv0 1) (select |#valid| v_sll_prepend_~new_head~1.base_7))) (not (= (store |v_#memory_int_63| |main_~#s~0.base| (store (select |v_#memory_int_63| |main_~#s~0.base|) |main_~#s~0.offset| (select (select |v_#memory_int_65| |main_~#s~0.base|) |main_~#s~0.offset|))) |v_#memory_int_65|)) (not (= |v_#memory_int_63| (store |v_#memory_int_64| v_sll_prepend_~new_head~1.base_7 (store (store (select |v_#memory_int_64| v_sll_prepend_~new_head~1.base_7) (_ bv0 32) main_~data~0) (_ bv4 32) (select (select |v_#memory_int_63| v_sll_prepend_~new_head~1.base_7) (_ bv4 32)))))) (= main_~data~0 (select (select |v_#memory_int_65| v_sll_prepend_~new_head~1.base_7) (_ bv0 32)))) [2018-11-23 11:18:14,368 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (or (not (= (select |#valid| |main_~#s~0.base|) (_ bv0 1))) (not (= |main_~#s~0.offset| (_ bv0 32)))) [2018-11-23 11:18:16,599 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:16,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:16,740 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:16,860 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:17,268 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:17,359 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:17,378 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-23 11:18:17,454 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:17,972 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 125 [2018-11-23 11:18:18,886 WARN L180 SmtUtils]: Spent 672.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-11-23 11:18:18,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 105 [2018-11-23 11:18:18,907 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:18,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-11-23 11:18:18,920 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:18,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 177 [2018-11-23 11:18:18,933 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:18,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 105 [2018-11-23 11:18:18,945 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:20,615 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 110 [2018-11-23 11:18:20,627 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:20,641 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 111 [2018-11-23 11:18:20,650 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:20,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 110 [2018-11-23 11:18:20,683 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:22,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 103 [2018-11-23 11:18:22,088 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-11-23 11:18:22,089 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:22,130 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:22,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 108 [2018-11-23 11:18:22,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 97 [2018-11-23 11:18:22,266 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:22,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 102 [2018-11-23 11:18:22,644 INFO L267 ElimStorePlain]: Start of recursive call 22: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:18:23,067 INFO L478 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 93 treesize of output 91 [2018-11-23 11:18:23,072 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:23,463 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 11:18:23,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 103 [2018-11-23 11:18:23,503 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-11-23 11:18:23,504 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:23,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-11-23 11:18:23,573 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:23,624 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:25,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 107 [2018-11-23 11:18:25,720 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2018-11-23 11:18:25,725 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:25,921 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:18:26,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 115 [2018-11-23 11:18:26,066 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 95 [2018-11-23 11:18:26,070 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:26,468 INFO L478 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 95 treesize of output 93 [2018-11-23 11:18:26,473 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:26,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-11-23 11:18:26,860 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:27,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 101 [2018-11-23 11:18:27,908 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:18:28,583 INFO L478 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 92 treesize of output 90 [2018-11-23 11:18:28,587 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:29,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 102 [2018-11-23 11:18:29,187 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:18:30,023 INFO L478 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 92 treesize of output 90 [2018-11-23 11:18:30,028 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:30,503 INFO L267 ElimStorePlain]: Start of recursive call 29: 8 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-23 11:18:30,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 107 [2018-11-23 11:18:30,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 92 [2018-11-23 11:18:30,606 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:30,986 INFO L478 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 99 treesize of output 99 [2018-11-23 11:18:31,026 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:18:31,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 87 [2018-11-23 11:18:31,602 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:31,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2018-11-23 11:18:31,856 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:32,135 INFO L267 ElimStorePlain]: Start of recursive call 37: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 11:18:39,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 113 [2018-11-23 11:18:42,365 WARN L180 SmtUtils]: Spent 2.69 s on a formula simplification that was a NOOP. DAG size: 78 [2018-11-23 11:18:42,432 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2018-11-23 11:18:42,436 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:42,560 INFO L303 Elim1Store]: Index analysis took 122 ms [2018-11-23 11:18:42,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 181 [2018-11-23 11:18:42,677 INFO L267 ElimStorePlain]: Start of recursive call 44: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-23 11:18:42,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 101 [2018-11-23 11:18:42,820 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:18:44,776 INFO L478 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 94 treesize of output 92 [2018-11-23 11:18:44,781 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:44,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 93 [2018-11-23 11:18:44,829 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:47,289 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2018-11-23 11:18:47,293 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 11:18:49,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 87 [2018-11-23 11:18:49,546 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:54,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2018-11-23 11:18:54,004 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:18:58,825 INFO L267 ElimStorePlain]: Start of recursive call 42: 5 dim-1 vars, End of recursive call: 12 dim-0 vars, and 11 xjuncts. [2018-11-23 11:18:59,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 121 [2018-11-23 11:19:01,597 WARN L180 SmtUtils]: Spent 2.48 s on a formula simplification that was a NOOP. DAG size: 107 [2018-11-23 11:19:01,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-11-23 11:19:01,712 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:03,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 95 [2018-11-23 11:19:03,912 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:03,969 INFO L478 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 98 treesize of output 96 [2018-11-23 11:19:03,974 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:06,099 INFO L478 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 92 treesize of output 90 [2018-11-23 11:19:06,110 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:08,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 101 [2018-11-23 11:19:08,755 INFO L267 ElimStorePlain]: Start of recursive call 56: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:19:11,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 101 [2018-11-23 11:19:11,635 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:19:14,958 INFO L478 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 95 treesize of output 93 [2018-11-23 11:19:14,981 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:17,632 INFO L478 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 92 treesize of output 90 [2018-11-23 11:19:17,637 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:21,813 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-11-23 11:19:21,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 98 [2018-11-23 11:19:21,906 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:19:26,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 101 [2018-11-23 11:19:26,229 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:19:31,776 INFO L267 ElimStorePlain]: Start of recursive call 51: 9 dim-1 vars, End of recursive call: 13 dim-0 vars, and 13 xjuncts. [2018-11-23 11:20:13,478 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 38 dim-0 vars, and 38 xjuncts. [2018-11-23 11:20:13,732 INFO L478 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 123 [2018-11-23 11:20:14,594 WARN L180 SmtUtils]: Spent 826.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-23 11:20:14,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 175 [2018-11-23 11:20:14,613 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:14,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-11-23 11:20:14,626 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:14,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-11-23 11:20:14,641 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:14,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 104 [2018-11-23 11:20:14,653 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:16,264 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 109 [2018-11-23 11:20:16,270 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:16,286 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 108 [2018-11-23 11:20:16,293 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:16,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 108 [2018-11-23 11:20:16,326 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:17,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 101 [2018-11-23 11:20:17,789 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-11-23 11:20:17,790 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:17,839 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:17,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 106 [2018-11-23 11:20:17,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 100 [2018-11-23 11:20:18,002 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:18,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 95 [2018-11-23 11:20:18,608 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:19,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 89 [2018-11-23 11:20:19,058 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:19,446 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-11-23 11:20:19,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 101 [2018-11-23 11:20:19,491 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2018-11-23 11:20:19,492 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:19,557 INFO L478 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 77 treesize of output 75 [2018-11-23 11:20:19,561 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:19,620 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:22,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 113 [2018-11-23 11:20:22,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 101 [2018-11-23 11:20:22,545 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:23,069 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 91 [2018-11-23 11:20:23,072 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:23,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 100 [2018-11-23 11:20:23,804 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:24,681 INFO L478 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 90 treesize of output 88 [2018-11-23 11:20:24,702 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:26,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 88 [2018-11-23 11:20:26,229 INFO L267 ElimStorePlain]: Start of recursive call 84: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:27,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 99 [2018-11-23 11:20:27,575 INFO L267 ElimStorePlain]: Start of recursive call 85: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:28,334 INFO L267 ElimStorePlain]: Start of recursive call 79: 8 dim-1 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-23 11:20:28,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 105 [2018-11-23 11:20:28,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 90 [2018-11-23 11:20:28,408 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,791 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 91 [2018-11-23 11:20:28,797 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,881 INFO L267 ElimStorePlain]: Start of recursive call 86: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 105 [2018-11-23 11:20:28,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 90 [2018-11-23 11:20:28,992 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:29,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 87 [2018-11-23 11:20:29,189 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:29,341 INFO L478 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 87 treesize of output 85 [2018-11-23 11:20:29,344 INFO L267 ElimStorePlain]: Start of recursive call 92: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:29,652 INFO L478 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 90 treesize of output 88 [2018-11-23 11:20:29,655 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:29,803 INFO L267 ElimStorePlain]: Start of recursive call 89: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:35,161 INFO L303 Elim1Store]: Index analysis took 109 ms [2018-11-23 11:20:35,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 119 [2018-11-23 11:20:36,444 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 105 [2018-11-23 11:20:36,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 94 [2018-11-23 11:20:36,479 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:38,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 88 [2018-11-23 11:20:38,385 INFO L267 ElimStorePlain]: Start of recursive call 96: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:39,990 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-11-23 11:20:40,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 99 [2018-11-23 11:20:40,099 INFO L267 ElimStorePlain]: Start of recursive call 97: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:42,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 96 [2018-11-23 11:20:42,550 INFO L267 ElimStorePlain]: Start of recursive call 98: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:44,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 99 [2018-11-23 11:20:44,467 INFO L267 ElimStorePlain]: Start of recursive call 99: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:47,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 88 [2018-11-23 11:20:47,753 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:49,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 93 [2018-11-23 11:20:49,564 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:49,575 INFO L478 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 96 treesize of output 94 [2018-11-23 11:20:49,579 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:51,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2018-11-23 11:20:51,105 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:55,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 99 [2018-11-23 11:20:55,270 INFO L267 ElimStorePlain]: Start of recursive call 104: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:57,727 INFO L267 ElimStorePlain]: Start of recursive call 94: 9 dim-1 vars, End of recursive call: 13 dim-0 vars, and 13 xjuncts. [2018-11-23 11:20:57,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 111 [2018-11-23 11:21:00,721 WARN L180 SmtUtils]: Spent 2.79 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 11:21:00,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 99 [2018-11-23 11:21:00,913 INFO L267 ElimStorePlain]: Start of recursive call 106: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:21:00,961 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 92 [2018-11-23 11:21:00,965 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:01,093 INFO L303 Elim1Store]: Index analysis took 123 ms [2018-11-23 11:21:01,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 179 [2018-11-23 11:21:01,203 INFO L267 ElimStorePlain]: Start of recursive call 108: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-23 11:21:02,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 90 [2018-11-23 11:21:02,624 INFO L267 ElimStorePlain]: Start of recursive call 109: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:02,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 91 [2018-11-23 11:21:02,639 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:06,529 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 91 [2018-11-23 11:21:06,533 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:08,065 INFO L478 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 87 treesize of output 85 [2018-11-23 11:21:08,069 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:11,289 INFO L478 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 90 treesize of output 88 [2018-11-23 11:21:11,294 INFO L267 ElimStorePlain]: Start of recursive call 113: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:12,985 INFO L267 ElimStorePlain]: Start of recursive call 105: 5 dim-1 vars, End of recursive call: 12 dim-0 vars, and 11 xjuncts.