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-ext3-properties/sll_nondet_insert_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:21:30,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:21:30,359 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:21:30,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:21:30,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:21:30,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:21:30,379 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:21:30,381 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:21:30,383 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:21:30,384 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:21:30,388 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:21:30,388 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:21:30,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:21:30,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:21:30,391 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:21:30,392 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:21:30,393 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:21:30,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:21:30,397 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:21:30,398 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:21:30,400 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:21:30,401 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:21:30,403 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:21:30,403 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:21:30,404 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:21:30,405 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:21:30,406 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:21:30,406 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:21:30,407 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:21:30,409 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:21:30,409 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:21:30,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:21:30,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:21:30,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:21:30,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:21:30,412 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:21:30,412 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:21:30,440 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:21:30,440 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:21:30,441 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:21:30,441 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:21:30,442 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:21:30,442 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:21:30,442 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:21:30,446 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:21:30,446 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:21:30,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:21:30,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:21:30,447 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:21:30,447 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:21:30,447 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:21:30,447 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:21:30,447 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:21:30,449 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:21:30,449 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:21:30,449 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:21:30,449 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:21:30,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:21:30,450 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:21:30,450 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:21:30,450 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:21:30,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:21:30,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:21:30,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:21:30,451 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:21:30,451 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:21:30,452 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:21:30,452 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:21:30,452 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:21:30,452 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:21:30,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:21:30,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:21:30,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:21:30,532 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:21:30,532 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:21:30,533 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:21:30,593 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c27c9b98/b01aac7092224c47aa0f8a0da348c562/FLAG405b859e8 [2018-11-23 11:21:31,200 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:21:31,202 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_nondet_insert_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:21:31,219 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c27c9b98/b01aac7092224c47aa0f8a0da348c562/FLAG405b859e8 [2018-11-23 11:21:31,427 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c27c9b98/b01aac7092224c47aa0f8a0da348c562 [2018-11-23 11:21:31,440 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:21:31,441 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:21:31,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:21:31,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:21:31,446 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:21:31,448 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:21:31" (1/1) ... [2018-11-23 11:21:31,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5a07bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:31, skipping insertion in model container [2018-11-23 11:21:31,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:21:31" (1/1) ... [2018-11-23 11:21:31,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:21:31,524 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:21:31,920 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:21:31,936 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:21:31,996 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:21:32,077 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:21:32,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32 WrapperNode [2018-11-23 11:21:32,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:21:32,079 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:21:32,079 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:21:32,079 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:21:32,167 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:21:32" (1/1) ... [2018-11-23 11:21:32,191 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:21:32" (1/1) ... [2018-11-23 11:21:32,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:21:32,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:21:32,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:21:32,203 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:21:32,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32" (1/1) ... [2018-11-23 11:21:32,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32" (1/1) ... [2018-11-23 11:21:32,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32" (1/1) ... [2018-11-23 11:21:32,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32" (1/1) ... [2018-11-23 11:21:32,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32" (1/1) ... [2018-11-23 11:21:32,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32" (1/1) ... [2018-11-23 11:21:32,258 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32" (1/1) ... [2018-11-23 11:21:32,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:21:32,263 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:21:32,263 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:21:32,263 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:21:32,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32" (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:21:32,319 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 11:21:32,320 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 11:21:32,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:21:32,320 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2018-11-23 11:21:32,320 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2018-11-23 11:21:32,320 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:21:32,320 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:21:32,321 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 11:21:32,321 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 11:21:32,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:21:32,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:21:32,321 INFO L130 BoogieDeclarations]: Found specification of procedure _get_nondet_int [2018-11-23 11:21:32,321 INFO L138 BoogieDeclarations]: Found implementation of procedure _get_nondet_int [2018-11-23 11:21:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:21:32,322 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:21:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:21:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:21:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:21:32,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:21:32,323 INFO L130 BoogieDeclarations]: Found specification of procedure sll_insert [2018-11-23 11:21:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_insert [2018-11-23 11:21:32,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:21:32,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:21:33,461 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:21:33,462 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:21:33,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:21:33 BoogieIcfgContainer [2018-11-23 11:21:33,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:21:33,463 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:21:33,464 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:21:33,467 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:21:33,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:21:31" (1/3) ... [2018-11-23 11:21:33,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787685b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:21:33, skipping insertion in model container [2018-11-23 11:21:33,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:21:32" (2/3) ... [2018-11-23 11:21:33,469 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787685b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:21:33, skipping insertion in model container [2018-11-23 11:21:33,469 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:21:33" (3/3) ... [2018-11-23 11:21:33,471 INFO L112 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert_true-unreach-call_true-valid-memsafety.i [2018-11-23 11:21:33,482 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:21:33,491 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:21:33,510 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:21:33,543 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:21:33,543 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:21:33,544 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:21:33,544 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:21:33,544 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:21:33,544 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:21:33,544 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:21:33,544 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:21:33,545 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:21:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-11-23 11:21:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:21:33,572 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:33,573 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] [2018-11-23 11:21:33,576 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:33,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:33,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1110829348, now seen corresponding path program 1 times [2018-11-23 11:21:33,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:33,587 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:21:33,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:33,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:33,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {65#true} call ULTIMATE.init(); {65#true} is VALID [2018-11-23 11:21:33,803 INFO L273 TraceCheckUtils]: 1: Hoare triple {65#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {65#true} is VALID [2018-11-23 11:21:33,804 INFO L273 TraceCheckUtils]: 2: Hoare triple {65#true} assume true; {65#true} is VALID [2018-11-23 11:21:33,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {65#true} {65#true} #161#return; {65#true} is VALID [2018-11-23 11:21:33,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {65#true} call #t~ret21 := main(); {65#true} is VALID [2018-11-23 11:21:33,805 INFO L256 TraceCheckUtils]: 5: Hoare triple {65#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {65#true} is VALID [2018-11-23 11:21:33,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {65#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {65#true} is VALID [2018-11-23 11:21:33,824 INFO L273 TraceCheckUtils]: 7: Hoare triple {65#true} assume !true; {66#false} is VALID [2018-11-23 11:21:33,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {66#false} #res := ~len~1; {66#false} is VALID [2018-11-23 11:21:33,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-23 11:21:33,825 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {66#false} {65#true} #143#return; {66#false} is VALID [2018-11-23 11:21:33,826 INFO L273 TraceCheckUtils]: 11: Hoare triple {66#false} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {66#false} is VALID [2018-11-23 11:21:33,826 INFO L256 TraceCheckUtils]: 12: Hoare triple {66#false} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {66#false} is VALID [2018-11-23 11:21:33,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {66#false} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {66#false} is VALID [2018-11-23 11:21:33,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-23 11:21:33,827 INFO L273 TraceCheckUtils]: 15: Hoare triple {66#false} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {66#false} is VALID [2018-11-23 11:21:33,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-23 11:21:33,828 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {66#false} {66#false} #145#return; {66#false} is VALID [2018-11-23 11:21:33,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {66#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {66#false} is VALID [2018-11-23 11:21:33,829 INFO L256 TraceCheckUtils]: 19: Hoare triple {66#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {66#false} is VALID [2018-11-23 11:21:33,829 INFO L273 TraceCheckUtils]: 20: Hoare triple {66#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {66#false} is VALID [2018-11-23 11:21:33,830 INFO L273 TraceCheckUtils]: 21: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-23 11:21:33,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {66#false} #res := ~len~1; {66#false} is VALID [2018-11-23 11:21:33,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-23 11:21:33,831 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {66#false} {66#false} #147#return; {66#false} is VALID [2018-11-23 11:21:33,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {66#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {66#false} is VALID [2018-11-23 11:21:33,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {66#false} assume !true; {66#false} is VALID [2018-11-23 11:21:33,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {66#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {66#false} is VALID [2018-11-23 11:21:33,832 INFO L256 TraceCheckUtils]: 28: Hoare triple {66#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {66#false} is VALID [2018-11-23 11:21:33,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {66#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {66#false} is VALID [2018-11-23 11:21:33,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {66#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {66#false} is VALID [2018-11-23 11:21:33,833 INFO L273 TraceCheckUtils]: 31: Hoare triple {66#false} #res := ~len~0; {66#false} is VALID [2018-11-23 11:21:33,834 INFO L273 TraceCheckUtils]: 32: Hoare triple {66#false} assume true; {66#false} is VALID [2018-11-23 11:21:33,834 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {66#false} {66#false} #153#return; {66#false} is VALID [2018-11-23 11:21:33,834 INFO L273 TraceCheckUtils]: 34: Hoare triple {66#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {66#false} is VALID [2018-11-23 11:21:33,835 INFO L273 TraceCheckUtils]: 35: Hoare triple {66#false} assume !false; {66#false} is VALID [2018-11-23 11:21:33,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:21:33,844 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:21:33,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:21:33,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:21:33,859 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-23 11:21:33,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:33,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:21:34,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:34,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:21:34,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:21:34,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:21:34,069 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-11-23 11:21:35,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:35,152 INFO L93 Difference]: Finished difference Result 118 states and 158 transitions. [2018-11-23 11:21:35,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:21:35,153 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 36 [2018-11-23 11:21:35,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:35,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:21:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2018-11-23 11:21:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:21:35,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 158 transitions. [2018-11-23 11:21:35,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 158 transitions. [2018-11-23 11:21:35,598 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:35,612 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:21:35,612 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:21:35,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:21:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:21:35,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 11:21:35,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:35,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:35,713 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:35,713 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:35,721 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 11:21:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 11:21:35,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:35,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:35,724 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:35,729 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 11:21:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:35,737 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 11:21:35,738 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 11:21:35,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:35,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:35,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:35,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:21:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-11-23 11:21:35,747 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 36 [2018-11-23 11:21:35,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:35,748 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-11-23 11:21:35,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:21:35,748 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 11:21:35,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 11:21:35,750 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:35,750 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:21:35,751 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:35,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:35,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1172876686, now seen corresponding path program 1 times [2018-11-23 11:21:35,752 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:35,752 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:21:35,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:35,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:35,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:36,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {503#true} call ULTIMATE.init(); {503#true} is VALID [2018-11-23 11:21:36,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {503#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {503#true} is VALID [2018-11-23 11:21:36,263 INFO L273 TraceCheckUtils]: 2: Hoare triple {503#true} assume true; {503#true} is VALID [2018-11-23 11:21:36,263 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {503#true} {503#true} #161#return; {503#true} is VALID [2018-11-23 11:21:36,264 INFO L256 TraceCheckUtils]: 4: Hoare triple {503#true} call #t~ret21 := main(); {503#true} is VALID [2018-11-23 11:21:36,264 INFO L256 TraceCheckUtils]: 5: Hoare triple {503#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {503#true} is VALID [2018-11-23 11:21:36,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {503#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {526#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:36,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {526#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {526#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:36,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {526#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} #res := ~len~1; {533#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:36,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {533#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} assume true; {533#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:36,267 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {533#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} {503#true} #143#return; {540#(= (_ bv2 32) |main_#t~ret13|)} is VALID [2018-11-23 11:21:36,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {540#(= (_ bv2 32) |main_#t~ret13|)} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {544#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:36,269 INFO L256 TraceCheckUtils]: 12: Hoare triple {544#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {503#true} is VALID [2018-11-23 11:21:36,271 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {551#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:21:36,277 INFO L273 TraceCheckUtils]: 14: Hoare triple {551#(= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {555#(= |sll_create_#in~len| |sll_create_#t~post2|)} is VALID [2018-11-23 11:21:36,278 INFO L273 TraceCheckUtils]: 15: Hoare triple {555#(= |sll_create_#in~len| |sll_create_#t~post2|)} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:36,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:36,279 INFO L273 TraceCheckUtils]: 17: Hoare triple {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:36,281 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {559#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {544#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #145#return; {504#false} is VALID [2018-11-23 11:21:36,281 INFO L273 TraceCheckUtils]: 19: Hoare triple {504#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {504#false} is VALID [2018-11-23 11:21:36,281 INFO L256 TraceCheckUtils]: 20: Hoare triple {504#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {504#false} is VALID [2018-11-23 11:21:36,282 INFO L273 TraceCheckUtils]: 21: Hoare triple {504#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {504#false} is VALID [2018-11-23 11:21:36,282 INFO L273 TraceCheckUtils]: 22: Hoare triple {504#false} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {504#false} is VALID [2018-11-23 11:21:36,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {504#false} #res := ~len~1; {504#false} is VALID [2018-11-23 11:21:36,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {504#false} assume true; {504#false} is VALID [2018-11-23 11:21:36,282 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {504#false} {504#false} #147#return; {504#false} is VALID [2018-11-23 11:21:36,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {504#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {504#false} is VALID [2018-11-23 11:21:36,283 INFO L273 TraceCheckUtils]: 27: Hoare triple {504#false} assume !~bvslt32(~i~0, ~k~0); {504#false} is VALID [2018-11-23 11:21:36,283 INFO L273 TraceCheckUtils]: 28: Hoare triple {504#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {504#false} is VALID [2018-11-23 11:21:36,284 INFO L256 TraceCheckUtils]: 29: Hoare triple {504#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {504#false} is VALID [2018-11-23 11:21:36,284 INFO L273 TraceCheckUtils]: 30: Hoare triple {504#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {504#false} is VALID [2018-11-23 11:21:36,284 INFO L273 TraceCheckUtils]: 31: Hoare triple {504#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {504#false} is VALID [2018-11-23 11:21:36,285 INFO L273 TraceCheckUtils]: 32: Hoare triple {504#false} #res := ~len~0; {504#false} is VALID [2018-11-23 11:21:36,285 INFO L273 TraceCheckUtils]: 33: Hoare triple {504#false} assume true; {504#false} is VALID [2018-11-23 11:21:36,285 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {504#false} {504#false} #153#return; {504#false} is VALID [2018-11-23 11:21:36,285 INFO L273 TraceCheckUtils]: 35: Hoare triple {504#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {504#false} is VALID [2018-11-23 11:21:36,286 INFO L273 TraceCheckUtils]: 36: Hoare triple {504#false} assume !false; {504#false} is VALID [2018-11-23 11:21:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:36,289 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:21:36,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:21:36,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:21:36,296 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:21:36,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:36,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:21:36,365 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:21:36,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:21:36,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:21:36,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:21:36,367 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 9 states. [2018-11-23 11:21:37,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:37,867 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-11-23 11:21:37,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:21:37,868 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 11:21:37,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:21:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2018-11-23 11:21:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:21:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 128 transitions. [2018-11-23 11:21:37,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 128 transitions. [2018-11-23 11:21:38,160 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:38,167 INFO L225 Difference]: With dead ends: 104 [2018-11-23 11:21:38,167 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 11:21:38,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:21:38,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 11:21:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 59. [2018-11-23 11:21:38,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:38,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 59 states. [2018-11-23 11:21:38,225 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 59 states. [2018-11-23 11:21:38,225 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 59 states. [2018-11-23 11:21:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:38,232 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2018-11-23 11:21:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2018-11-23 11:21:38,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:38,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:38,234 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 72 states. [2018-11-23 11:21:38,234 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 72 states. [2018-11-23 11:21:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:38,242 INFO L93 Difference]: Finished difference Result 72 states and 90 transitions. [2018-11-23 11:21:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 90 transitions. [2018-11-23 11:21:38,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:38,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:38,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:38,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:38,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 11:21:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2018-11-23 11:21:38,249 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 37 [2018-11-23 11:21:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:38,249 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2018-11-23 11:21:38,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:21:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-11-23 11:21:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:21:38,252 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:38,252 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:21:38,252 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:38,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1295334673, now seen corresponding path program 1 times [2018-11-23 11:21:38,253 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:38,254 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:21:38,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:38,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:38,556 INFO L256 TraceCheckUtils]: 0: Hoare triple {993#true} call ULTIMATE.init(); {993#true} is VALID [2018-11-23 11:21:38,557 INFO L273 TraceCheckUtils]: 1: Hoare triple {993#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {993#true} is VALID [2018-11-23 11:21:38,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {993#true} assume true; {993#true} is VALID [2018-11-23 11:21:38,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {993#true} {993#true} #161#return; {993#true} is VALID [2018-11-23 11:21:38,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {993#true} call #t~ret21 := main(); {993#true} is VALID [2018-11-23 11:21:38,560 INFO L256 TraceCheckUtils]: 5: Hoare triple {993#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {993#true} is VALID [2018-11-23 11:21:38,566 INFO L273 TraceCheckUtils]: 6: Hoare triple {993#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1016#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:38,567 INFO L273 TraceCheckUtils]: 7: Hoare triple {1016#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1020#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:38,568 INFO L273 TraceCheckUtils]: 8: Hoare triple {1020#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {1020#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:38,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {1020#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} #res := ~len~1; {1027#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:38,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {1027#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} assume true; {1027#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:21:38,571 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1027#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} {993#true} #143#return; {1034#(= (bvadd |main_#t~ret13| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:38,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {1034#(= (bvadd |main_#t~ret13| (_ bv4294967293 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1038#(= (bvadd main_~len~2 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:21:38,572 INFO L256 TraceCheckUtils]: 13: Hoare triple {1038#(= (bvadd main_~len~2 (_ bv4294967293 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {993#true} is VALID [2018-11-23 11:21:38,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {993#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1045#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:21:38,575 INFO L273 TraceCheckUtils]: 15: Hoare triple {1045#(= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {1049#(= |sll_create_#in~len| |sll_create_#t~post2|)} is VALID [2018-11-23 11:21:38,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {1049#(= |sll_create_#in~len| |sll_create_#t~post2|)} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:38,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:38,578 INFO L273 TraceCheckUtils]: 18: Hoare triple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:38,580 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {1038#(= (bvadd main_~len~2 (_ bv4294967293 32)) (_ bv0 32))} #145#return; {994#false} is VALID [2018-11-23 11:21:38,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {994#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {994#false} is VALID [2018-11-23 11:21:38,580 INFO L256 TraceCheckUtils]: 21: Hoare triple {994#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {994#false} is VALID [2018-11-23 11:21:38,581 INFO L273 TraceCheckUtils]: 22: Hoare triple {994#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {994#false} is VALID [2018-11-23 11:21:38,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {994#false} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {994#false} is VALID [2018-11-23 11:21:38,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {994#false} #res := ~len~1; {994#false} is VALID [2018-11-23 11:21:38,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {994#false} assume true; {994#false} is VALID [2018-11-23 11:21:38,582 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {994#false} {994#false} #147#return; {994#false} is VALID [2018-11-23 11:21:38,583 INFO L273 TraceCheckUtils]: 27: Hoare triple {994#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {994#false} is VALID [2018-11-23 11:21:38,583 INFO L273 TraceCheckUtils]: 28: Hoare triple {994#false} assume !~bvslt32(~i~0, ~k~0); {994#false} is VALID [2018-11-23 11:21:38,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {994#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {994#false} is VALID [2018-11-23 11:21:38,584 INFO L256 TraceCheckUtils]: 30: Hoare triple {994#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {994#false} is VALID [2018-11-23 11:21:38,584 INFO L273 TraceCheckUtils]: 31: Hoare triple {994#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {994#false} is VALID [2018-11-23 11:21:38,584 INFO L273 TraceCheckUtils]: 32: Hoare triple {994#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {994#false} is VALID [2018-11-23 11:21:38,585 INFO L273 TraceCheckUtils]: 33: Hoare triple {994#false} #res := ~len~0; {994#false} is VALID [2018-11-23 11:21:38,585 INFO L273 TraceCheckUtils]: 34: Hoare triple {994#false} assume true; {994#false} is VALID [2018-11-23 11:21:38,585 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {994#false} {994#false} #153#return; {994#false} is VALID [2018-11-23 11:21:38,586 INFO L273 TraceCheckUtils]: 36: Hoare triple {994#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {994#false} is VALID [2018-11-23 11:21:38,586 INFO L273 TraceCheckUtils]: 37: Hoare triple {994#false} assume !false; {994#false} is VALID [2018-11-23 11:21:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:38,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:21:39,199 INFO L273 TraceCheckUtils]: 37: Hoare triple {994#false} assume !false; {994#false} is VALID [2018-11-23 11:21:39,200 INFO L273 TraceCheckUtils]: 36: Hoare triple {994#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {994#false} is VALID [2018-11-23 11:21:39,200 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {993#true} {994#false} #153#return; {994#false} is VALID [2018-11-23 11:21:39,201 INFO L273 TraceCheckUtils]: 34: Hoare triple {993#true} assume true; {993#true} is VALID [2018-11-23 11:21:39,201 INFO L273 TraceCheckUtils]: 33: Hoare triple {993#true} #res := ~len~0; {993#true} is VALID [2018-11-23 11:21:39,202 INFO L273 TraceCheckUtils]: 32: Hoare triple {993#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {993#true} is VALID [2018-11-23 11:21:39,202 INFO L273 TraceCheckUtils]: 31: Hoare triple {993#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {993#true} is VALID [2018-11-23 11:21:39,202 INFO L256 TraceCheckUtils]: 30: Hoare triple {994#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {993#true} is VALID [2018-11-23 11:21:39,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {994#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {994#false} is VALID [2018-11-23 11:21:39,203 INFO L273 TraceCheckUtils]: 28: Hoare triple {994#false} assume !~bvslt32(~i~0, ~k~0); {994#false} is VALID [2018-11-23 11:21:39,203 INFO L273 TraceCheckUtils]: 27: Hoare triple {994#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {994#false} is VALID [2018-11-23 11:21:39,203 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {993#true} {994#false} #147#return; {994#false} is VALID [2018-11-23 11:21:39,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {993#true} assume true; {993#true} is VALID [2018-11-23 11:21:39,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {993#true} #res := ~len~1; {993#true} is VALID [2018-11-23 11:21:39,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {993#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {993#true} is VALID [2018-11-23 11:21:39,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {993#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {993#true} is VALID [2018-11-23 11:21:39,205 INFO L256 TraceCheckUtils]: 21: Hoare triple {994#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {993#true} is VALID [2018-11-23 11:21:39,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {994#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {994#false} is VALID [2018-11-23 11:21:39,218 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} {1171#(bvsgt main_~len~2 (_ bv0 32))} #145#return; {994#false} is VALID [2018-11-23 11:21:39,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} assume true; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:39,220 INFO L273 TraceCheckUtils]: 17: Hoare triple {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:39,220 INFO L273 TraceCheckUtils]: 16: Hoare triple {1184#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt |sll_create_#in~len| (_ bv0 32))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {1053#(not (bvsgt |sll_create_#in~len| (_ bv0 32)))} is VALID [2018-11-23 11:21:39,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {1188#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {1184#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt |sll_create_#in~len| (_ bv0 32))))} is VALID [2018-11-23 11:21:39,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {993#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1188#(or (not (bvsgt |sll_create_#in~len| (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:21:39,222 INFO L256 TraceCheckUtils]: 13: Hoare triple {1171#(bvsgt main_~len~2 (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {993#true} is VALID [2018-11-23 11:21:39,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {1195#(bvsgt |main_#t~ret13| (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1171#(bvsgt main_~len~2 (_ bv0 32))} is VALID [2018-11-23 11:21:39,225 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1202#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt |_get_nondet_int_#res| (_ bv0 32)))} {993#true} #143#return; {1195#(bvsgt |main_#t~ret13| (_ bv0 32))} is VALID [2018-11-23 11:21:39,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {1202#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt |_get_nondet_int_#res| (_ bv0 32)))} assume true; {1202#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt |_get_nondet_int_#res| (_ bv0 32)))} is VALID [2018-11-23 11:21:39,227 INFO L273 TraceCheckUtils]: 9: Hoare triple {1209#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} #res := ~len~1; {1202#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt |_get_nondet_int_#res| (_ bv0 32)))} is VALID [2018-11-23 11:21:39,227 INFO L273 TraceCheckUtils]: 8: Hoare triple {1209#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {1209#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} is VALID [2018-11-23 11:21:39,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {1216#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv1 32)) (_ bv0 32)))} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1209#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} is VALID [2018-11-23 11:21:39,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {993#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1216#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:21:39,230 INFO L256 TraceCheckUtils]: 5: Hoare triple {993#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {993#true} is VALID [2018-11-23 11:21:39,230 INFO L256 TraceCheckUtils]: 4: Hoare triple {993#true} call #t~ret21 := main(); {993#true} is VALID [2018-11-23 11:21:39,230 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {993#true} {993#true} #161#return; {993#true} is VALID [2018-11-23 11:21:39,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {993#true} assume true; {993#true} is VALID [2018-11-23 11:21:39,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {993#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {993#true} is VALID [2018-11-23 11:21:39,231 INFO L256 TraceCheckUtils]: 0: Hoare triple {993#true} call ULTIMATE.init(); {993#true} is VALID [2018-11-23 11:21:39,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:21:39,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:21:39,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 11:21:39,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 11:21:39,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:39,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:21:39,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:39,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:21:39,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:21:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:21:39,375 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand 17 states. [2018-11-23 11:21:40,240 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 11:21:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:43,381 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2018-11-23 11:21:43,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:21:43,381 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-11-23 11:21:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:21:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 159 transitions. [2018-11-23 11:21:43,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:21:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 159 transitions. [2018-11-23 11:21:43,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 159 transitions. [2018-11-23 11:21:43,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:43,834 INFO L225 Difference]: With dead ends: 127 [2018-11-23 11:21:43,834 INFO L226 Difference]: Without dead ends: 88 [2018-11-23 11:21:43,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:21:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-23 11:21:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 50. [2018-11-23 11:21:43,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:43,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 50 states. [2018-11-23 11:21:43,908 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 50 states. [2018-11-23 11:21:43,908 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 50 states. [2018-11-23 11:21:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:43,915 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2018-11-23 11:21:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2018-11-23 11:21:43,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:43,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:43,918 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 88 states. [2018-11-23 11:21:43,918 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 88 states. [2018-11-23 11:21:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:43,925 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2018-11-23 11:21:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 120 transitions. [2018-11-23 11:21:43,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:43,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:43,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:43,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:21:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-11-23 11:21:43,930 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 38 [2018-11-23 11:21:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:43,931 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-11-23 11:21:43,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:21:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-23 11:21:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 11:21:43,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:43,933 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:21:43,935 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:43,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:43,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1300984299, now seen corresponding path program 1 times [2018-11-23 11:21:43,936 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:43,936 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:21:43,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:44,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:44,465 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:21:44,476 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:21:44,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:44,485 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:44,487 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:21:44,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2018-11-23 11:21:44,495 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:44,495 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= |main_#t~mem18.base| .cse0) (not (= (_ bv0 32) .cse0)))) [2018-11-23 11:21:44,496 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (= |main_#t~mem18.base| (_ bv0 32))) [2018-11-23 11:21:44,557 INFO L256 TraceCheckUtils]: 0: Hoare triple {1675#true} call ULTIMATE.init(); {1675#true} is VALID [2018-11-23 11:21:44,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {1675#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1675#true} is VALID [2018-11-23 11:21:44,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {1675#true} assume true; {1675#true} is VALID [2018-11-23 11:21:44,558 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1675#true} {1675#true} #161#return; {1675#true} is VALID [2018-11-23 11:21:44,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {1675#true} call #t~ret21 := main(); {1675#true} is VALID [2018-11-23 11:21:44,558 INFO L256 TraceCheckUtils]: 5: Hoare triple {1675#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {1675#true} is VALID [2018-11-23 11:21:44,559 INFO L273 TraceCheckUtils]: 6: Hoare triple {1675#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1675#true} is VALID [2018-11-23 11:21:44,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {1675#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {1675#true} is VALID [2018-11-23 11:21:44,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {1675#true} #res := ~len~1; {1675#true} is VALID [2018-11-23 11:21:44,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {1675#true} assume true; {1675#true} is VALID [2018-11-23 11:21:44,559 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {1675#true} {1675#true} #143#return; {1675#true} is VALID [2018-11-23 11:21:44,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {1675#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {1675#true} is VALID [2018-11-23 11:21:44,560 INFO L256 TraceCheckUtils]: 12: Hoare triple {1675#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {1675#true} is VALID [2018-11-23 11:21:44,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {1675#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {1675#true} is VALID [2018-11-23 11:21:44,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {1675#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {1675#true} is VALID [2018-11-23 11:21:44,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {1675#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {1725#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:21:44,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {1725#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {1725#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:21:44,562 INFO L273 TraceCheckUtils]: 17: Hoare triple {1725#(not (= (_ bv0 32) sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:21:44,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:21:44,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:21:44,563 INFO L273 TraceCheckUtils]: 20: Hoare triple {1732#(not (= sll_create_~head~0.base (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1742#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-23 11:21:44,563 INFO L273 TraceCheckUtils]: 21: Hoare triple {1742#(not (= (_ bv0 32) |sll_create_#res.base|))} assume true; {1742#(not (= (_ bv0 32) |sll_create_#res.base|))} is VALID [2018-11-23 11:21:44,564 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1742#(not (= (_ bv0 32) |sll_create_#res.base|))} {1675#true} #145#return; {1749#(not (= (_ bv0 32) |main_#t~ret14.base|))} is VALID [2018-11-23 11:21:44,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {1749#(not (= (_ bv0 32) |main_#t~ret14.base|))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:21:44,568 INFO L256 TraceCheckUtils]: 24: Hoare triple {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:44,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} ~from := #in~from;~until := #in~until;~len~1 := ~from; {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:44,570 INFO L273 TraceCheckUtils]: 26: Hoare triple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:44,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} #res := ~len~1; {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:44,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} assume true; {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} is VALID [2018-11-23 11:21:44,572 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1757#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_1| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_1| (_ BitVec 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_1|) |v_main_~#s~0.offset_BEFORE_CALL_1|))))} {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} #147#return; {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:21:44,573 INFO L273 TraceCheckUtils]: 30: Hoare triple {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:21:44,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} assume !~bvslt32(~i~0, ~k~0); {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} is VALID [2018-11-23 11:21:44,575 INFO L273 TraceCheckUtils]: 32: Hoare triple {1753#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {1782#(not (= |main_#t~mem18.base| (_ bv0 32)))} is VALID [2018-11-23 11:21:44,575 INFO L256 TraceCheckUtils]: 33: Hoare triple {1782#(not (= |main_#t~mem18.base| (_ bv0 32)))} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {1675#true} is VALID [2018-11-23 11:21:44,576 INFO L273 TraceCheckUtils]: 34: Hoare triple {1675#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {1789#(= sll_length_~head.base |sll_length_#in~head.base|)} is VALID [2018-11-23 11:21:44,576 INFO L273 TraceCheckUtils]: 35: Hoare triple {1789#(= sll_length_~head.base |sll_length_#in~head.base|)} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-23 11:21:44,577 INFO L273 TraceCheckUtils]: 36: Hoare triple {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} #res := ~len~0; {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-23 11:21:44,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} assume true; {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} is VALID [2018-11-23 11:21:44,579 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {1793#(= (_ bv0 32) |sll_length_#in~head.base|)} {1782#(not (= |main_#t~mem18.base| (_ bv0 32)))} #153#return; {1676#false} is VALID [2018-11-23 11:21:44,580 INFO L273 TraceCheckUtils]: 39: Hoare triple {1676#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {1676#false} is VALID [2018-11-23 11:21:44,580 INFO L273 TraceCheckUtils]: 40: Hoare triple {1676#false} assume !false; {1676#false} is VALID [2018-11-23 11:21:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:44,583 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:21:44,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:21:44,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-23 11:21:44,587 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-23 11:21:44,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:44,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:21:44,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:44,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:21:44,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:21:44,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:21:44,687 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 11 states. [2018-11-23 11:22:12,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:12,898 INFO L93 Difference]: Finished difference Result 88 states and 100 transitions. [2018-11-23 11:22:12,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:22:12,898 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-11-23 11:22:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:12,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:22:12,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2018-11-23 11:22:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:22:12,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 100 transitions. [2018-11-23 11:22:12,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 100 transitions. [2018-11-23 11:22:13,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:13,261 INFO L225 Difference]: With dead ends: 88 [2018-11-23 11:22:13,262 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 11:22:13,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:22:13,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 11:22:13,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2018-11-23 11:22:13,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:13,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 65 states. [2018-11-23 11:22:13,383 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 65 states. [2018-11-23 11:22:13,383 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 65 states. [2018-11-23 11:22:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:13,387 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-11-23 11:22:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2018-11-23 11:22:13,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:13,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:13,388 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 82 states. [2018-11-23 11:22:13,388 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 82 states. [2018-11-23 11:22:13,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:13,392 INFO L93 Difference]: Finished difference Result 82 states and 94 transitions. [2018-11-23 11:22:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 94 transitions. [2018-11-23 11:22:13,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:13,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:13,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:13,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-23 11:22:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-11-23 11:22:13,396 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 41 [2018-11-23 11:22:13,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:13,397 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-11-23 11:22:13,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:22:13,397 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-23 11:22:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:22:13,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:13,398 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:13,398 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:13,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:13,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1019856888, now seen corresponding path program 1 times [2018-11-23 11:22:13,399 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:13,399 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:22:13,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:13,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:13,732 INFO L256 TraceCheckUtils]: 0: Hoare triple {2200#true} call ULTIMATE.init(); {2200#true} is VALID [2018-11-23 11:22:13,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {2200#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2200#true} is VALID [2018-11-23 11:22:13,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {2200#true} assume true; {2200#true} is VALID [2018-11-23 11:22:13,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2200#true} {2200#true} #161#return; {2200#true} is VALID [2018-11-23 11:22:13,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {2200#true} call #t~ret21 := main(); {2200#true} is VALID [2018-11-23 11:22:13,735 INFO L256 TraceCheckUtils]: 5: Hoare triple {2200#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {2200#true} is VALID [2018-11-23 11:22:13,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {2200#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2223#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:13,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {2223#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {2223#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:13,737 INFO L273 TraceCheckUtils]: 8: Hoare triple {2223#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} #res := ~len~1; {2230#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:13,737 INFO L273 TraceCheckUtils]: 9: Hoare triple {2230#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} assume true; {2230#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:13,738 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {2230#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} {2200#true} #143#return; {2237#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:13,739 INFO L273 TraceCheckUtils]: 11: Hoare triple {2237#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {2241#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:13,739 INFO L256 TraceCheckUtils]: 12: Hoare triple {2241#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {2200#true} is VALID [2018-11-23 11:22:13,739 INFO L273 TraceCheckUtils]: 13: Hoare triple {2200#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2248#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:22:13,754 INFO L273 TraceCheckUtils]: 14: Hoare triple {2248#(= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:13,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:13,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:13,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:13,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {2252#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {2265#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) |sll_create_#t~post2|)} is VALID [2018-11-23 11:22:13,760 INFO L273 TraceCheckUtils]: 19: Hoare triple {2265#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) |sll_create_#t~post2|)} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:13,761 INFO L273 TraceCheckUtils]: 20: Hoare triple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:13,761 INFO L273 TraceCheckUtils]: 21: Hoare triple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:13,763 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {2241#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #145#return; {2201#false} is VALID [2018-11-23 11:22:13,763 INFO L273 TraceCheckUtils]: 23: Hoare triple {2201#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {2201#false} is VALID [2018-11-23 11:22:13,764 INFO L256 TraceCheckUtils]: 24: Hoare triple {2201#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {2201#false} is VALID [2018-11-23 11:22:13,764 INFO L273 TraceCheckUtils]: 25: Hoare triple {2201#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2201#false} is VALID [2018-11-23 11:22:13,764 INFO L273 TraceCheckUtils]: 26: Hoare triple {2201#false} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {2201#false} is VALID [2018-11-23 11:22:13,764 INFO L273 TraceCheckUtils]: 27: Hoare triple {2201#false} #res := ~len~1; {2201#false} is VALID [2018-11-23 11:22:13,765 INFO L273 TraceCheckUtils]: 28: Hoare triple {2201#false} assume true; {2201#false} is VALID [2018-11-23 11:22:13,765 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2201#false} {2201#false} #147#return; {2201#false} is VALID [2018-11-23 11:22:13,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {2201#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {2201#false} is VALID [2018-11-23 11:22:13,765 INFO L273 TraceCheckUtils]: 31: Hoare triple {2201#false} assume !~bvslt32(~i~0, ~k~0); {2201#false} is VALID [2018-11-23 11:22:13,765 INFO L273 TraceCheckUtils]: 32: Hoare triple {2201#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {2201#false} is VALID [2018-11-23 11:22:13,766 INFO L256 TraceCheckUtils]: 33: Hoare triple {2201#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {2201#false} is VALID [2018-11-23 11:22:13,766 INFO L273 TraceCheckUtils]: 34: Hoare triple {2201#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2201#false} is VALID [2018-11-23 11:22:13,766 INFO L273 TraceCheckUtils]: 35: Hoare triple {2201#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2201#false} is VALID [2018-11-23 11:22:13,766 INFO L273 TraceCheckUtils]: 36: Hoare triple {2201#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2201#false} is VALID [2018-11-23 11:22:13,766 INFO L273 TraceCheckUtils]: 37: Hoare triple {2201#false} #res := ~len~0; {2201#false} is VALID [2018-11-23 11:22:13,766 INFO L273 TraceCheckUtils]: 38: Hoare triple {2201#false} assume true; {2201#false} is VALID [2018-11-23 11:22:13,767 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2201#false} {2201#false} #153#return; {2201#false} is VALID [2018-11-23 11:22:13,767 INFO L273 TraceCheckUtils]: 40: Hoare triple {2201#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {2201#false} is VALID [2018-11-23 11:22:13,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {2201#false} assume !false; {2201#false} is VALID [2018-11-23 11:22:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:22:13,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:14,421 INFO L273 TraceCheckUtils]: 41: Hoare triple {2201#false} assume !false; {2201#false} is VALID [2018-11-23 11:22:14,421 INFO L273 TraceCheckUtils]: 40: Hoare triple {2201#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {2201#false} is VALID [2018-11-23 11:22:14,422 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {2200#true} {2201#false} #153#return; {2201#false} is VALID [2018-11-23 11:22:14,422 INFO L273 TraceCheckUtils]: 38: Hoare triple {2200#true} assume true; {2200#true} is VALID [2018-11-23 11:22:14,422 INFO L273 TraceCheckUtils]: 37: Hoare triple {2200#true} #res := ~len~0; {2200#true} is VALID [2018-11-23 11:22:14,423 INFO L273 TraceCheckUtils]: 36: Hoare triple {2200#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {2200#true} is VALID [2018-11-23 11:22:14,423 INFO L273 TraceCheckUtils]: 35: Hoare triple {2200#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {2200#true} is VALID [2018-11-23 11:22:14,423 INFO L273 TraceCheckUtils]: 34: Hoare triple {2200#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {2200#true} is VALID [2018-11-23 11:22:14,423 INFO L256 TraceCheckUtils]: 33: Hoare triple {2201#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {2200#true} is VALID [2018-11-23 11:22:14,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {2201#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {2201#false} is VALID [2018-11-23 11:22:14,424 INFO L273 TraceCheckUtils]: 31: Hoare triple {2201#false} assume !~bvslt32(~i~0, ~k~0); {2201#false} is VALID [2018-11-23 11:22:14,424 INFO L273 TraceCheckUtils]: 30: Hoare triple {2201#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {2201#false} is VALID [2018-11-23 11:22:14,425 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {2200#true} {2201#false} #147#return; {2201#false} is VALID [2018-11-23 11:22:14,425 INFO L273 TraceCheckUtils]: 28: Hoare triple {2200#true} assume true; {2200#true} is VALID [2018-11-23 11:22:14,425 INFO L273 TraceCheckUtils]: 27: Hoare triple {2200#true} #res := ~len~1; {2200#true} is VALID [2018-11-23 11:22:14,425 INFO L273 TraceCheckUtils]: 26: Hoare triple {2200#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {2200#true} is VALID [2018-11-23 11:22:14,425 INFO L273 TraceCheckUtils]: 25: Hoare triple {2200#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2200#true} is VALID [2018-11-23 11:22:14,426 INFO L256 TraceCheckUtils]: 24: Hoare triple {2201#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {2200#true} is VALID [2018-11-23 11:22:14,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {2201#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {2201#false} is VALID [2018-11-23 11:22:14,459 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {2393#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} #145#return; {2201#false} is VALID [2018-11-23 11:22:14,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:14,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:14,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {2406#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {2269#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:14,471 INFO L273 TraceCheckUtils]: 18: Hoare triple {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {2406#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:14,476 INFO L273 TraceCheckUtils]: 17: Hoare triple {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:14,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:14,478 INFO L273 TraceCheckUtils]: 15: Hoare triple {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:14,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {2423#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {2410#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:14,481 INFO L273 TraceCheckUtils]: 13: Hoare triple {2200#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {2423#(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:22:14,481 INFO L256 TraceCheckUtils]: 12: Hoare triple {2393#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {2200#true} is VALID [2018-11-23 11:22:14,481 INFO L273 TraceCheckUtils]: 11: Hoare triple {2430#(bvsgt (bvadd |main_#t~ret13| (_ bv4294967295 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {2393#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:14,482 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {2437#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} {2200#true} #143#return; {2430#(bvsgt (bvadd |main_#t~ret13| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:14,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {2437#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} assume true; {2437#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:14,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {2444#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} #res := ~len~1; {2437#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:14,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {2444#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {2444#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:14,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {2200#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {2444#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:14,486 INFO L256 TraceCheckUtils]: 5: Hoare triple {2200#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {2200#true} is VALID [2018-11-23 11:22:14,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {2200#true} call #t~ret21 := main(); {2200#true} is VALID [2018-11-23 11:22:14,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2200#true} {2200#true} #161#return; {2200#true} is VALID [2018-11-23 11:22:14,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {2200#true} assume true; {2200#true} is VALID [2018-11-23 11:22:14,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {2200#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2200#true} is VALID [2018-11-23 11:22:14,488 INFO L256 TraceCheckUtils]: 0: Hoare triple {2200#true} call ULTIMATE.init(); {2200#true} is VALID [2018-11-23 11:22:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:22:14,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:14,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-11-23 11:22:14,492 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-23 11:22:14,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:14,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:22:14,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:14,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:22:14,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:22:14,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:22:14,612 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 17 states. [2018-11-23 11:22:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:18,078 INFO L93 Difference]: Finished difference Result 180 states and 240 transitions. [2018-11-23 11:22:18,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:22:18,078 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-11-23 11:22:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:22:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 176 transitions. [2018-11-23 11:22:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:22:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 176 transitions. [2018-11-23 11:22:18,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 176 transitions. [2018-11-23 11:22:18,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 176 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:18,443 INFO L225 Difference]: With dead ends: 180 [2018-11-23 11:22:18,443 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:22:18,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:22:18,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:22:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 79. [2018-11-23 11:22:18,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:18,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 79 states. [2018-11-23 11:22:18,571 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 79 states. [2018-11-23 11:22:18,571 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 79 states. [2018-11-23 11:22:18,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:18,581 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2018-11-23 11:22:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2018-11-23 11:22:18,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:18,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:18,582 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 133 states. [2018-11-23 11:22:18,583 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 133 states. [2018-11-23 11:22:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:18,591 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2018-11-23 11:22:18,591 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 183 transitions. [2018-11-23 11:22:18,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:18,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:18,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:18,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 11:22:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2018-11-23 11:22:18,597 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 42 [2018-11-23 11:22:18,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:18,598 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2018-11-23 11:22:18,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:22:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2018-11-23 11:22:18,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 11:22:18,599 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:18,599 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:18,600 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:18,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash 725675112, now seen corresponding path program 1 times [2018-11-23 11:22:18,600 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:18,601 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:18,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:22:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:18,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:19,009 INFO L256 TraceCheckUtils]: 0: Hoare triple {3109#true} call ULTIMATE.init(); {3109#true} is VALID [2018-11-23 11:22:19,009 INFO L273 TraceCheckUtils]: 1: Hoare triple {3109#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3109#true} is VALID [2018-11-23 11:22:19,010 INFO L273 TraceCheckUtils]: 2: Hoare triple {3109#true} assume true; {3109#true} is VALID [2018-11-23 11:22:19,010 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3109#true} {3109#true} #161#return; {3109#true} is VALID [2018-11-23 11:22:19,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {3109#true} call #t~ret21 := main(); {3109#true} is VALID [2018-11-23 11:22:19,011 INFO L256 TraceCheckUtils]: 5: Hoare triple {3109#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {3109#true} is VALID [2018-11-23 11:22:19,020 INFO L273 TraceCheckUtils]: 6: Hoare triple {3109#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {3132#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:19,021 INFO L273 TraceCheckUtils]: 7: Hoare triple {3132#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3136#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:19,044 INFO L273 TraceCheckUtils]: 8: Hoare triple {3136#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3140#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:19,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {3140#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {3140#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:19,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {3140#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} #res := ~len~1; {3147#(= (bvadd |_get_nondet_int_#res| (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:19,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {3147#(= (bvadd |_get_nondet_int_#res| (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} assume true; {3147#(= (bvadd |_get_nondet_int_#res| (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:19,047 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {3147#(= (bvadd |_get_nondet_int_#res| (_ bv4294967294 32)) |_get_nondet_int_#in~from|)} {3109#true} #143#return; {3154#(= (bvadd |main_#t~ret13| (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:19,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {3154#(= (bvadd |main_#t~ret13| (_ bv4294967292 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {3158#(= (bvadd main_~len~2 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:19,048 INFO L256 TraceCheckUtils]: 14: Hoare triple {3158#(= (bvadd main_~len~2 (_ bv4294967292 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {3109#true} is VALID [2018-11-23 11:22:19,048 INFO L273 TraceCheckUtils]: 15: Hoare triple {3109#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3165#(= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 11:22:19,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {3165#(= |sll_create_#in~len| sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:19,067 INFO L273 TraceCheckUtils]: 17: Hoare triple {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:19,068 INFO L273 TraceCheckUtils]: 18: Hoare triple {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:19,068 INFO L273 TraceCheckUtils]: 19: Hoare triple {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} is VALID [2018-11-23 11:22:19,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {3169#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len)} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {3182#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) |sll_create_#t~post2|)} is VALID [2018-11-23 11:22:19,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {3182#(= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) |sll_create_#t~post2|)} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:19,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:19,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:19,074 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {3158#(= (bvadd main_~len~2 (_ bv4294967292 32)) (_ bv0 32))} #145#return; {3110#false} is VALID [2018-11-23 11:22:19,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {3110#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {3110#false} is VALID [2018-11-23 11:22:19,075 INFO L256 TraceCheckUtils]: 26: Hoare triple {3110#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {3110#false} is VALID [2018-11-23 11:22:19,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {3110#false} ~from := #in~from;~until := #in~until;~len~1 := ~from; {3110#false} is VALID [2018-11-23 11:22:19,075 INFO L273 TraceCheckUtils]: 28: Hoare triple {3110#false} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {3110#false} is VALID [2018-11-23 11:22:19,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {3110#false} #res := ~len~1; {3110#false} is VALID [2018-11-23 11:22:19,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {3110#false} assume true; {3110#false} is VALID [2018-11-23 11:22:19,076 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3110#false} {3110#false} #147#return; {3110#false} is VALID [2018-11-23 11:22:19,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {3110#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {3110#false} is VALID [2018-11-23 11:22:19,077 INFO L273 TraceCheckUtils]: 33: Hoare triple {3110#false} assume !~bvslt32(~i~0, ~k~0); {3110#false} is VALID [2018-11-23 11:22:19,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {3110#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {3110#false} is VALID [2018-11-23 11:22:19,078 INFO L256 TraceCheckUtils]: 35: Hoare triple {3110#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {3110#false} is VALID [2018-11-23 11:22:19,078 INFO L273 TraceCheckUtils]: 36: Hoare triple {3110#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3110#false} is VALID [2018-11-23 11:22:19,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {3110#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3110#false} is VALID [2018-11-23 11:22:19,078 INFO L273 TraceCheckUtils]: 38: Hoare triple {3110#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3110#false} is VALID [2018-11-23 11:22:19,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {3110#false} #res := ~len~0; {3110#false} is VALID [2018-11-23 11:22:19,079 INFO L273 TraceCheckUtils]: 40: Hoare triple {3110#false} assume true; {3110#false} is VALID [2018-11-23 11:22:19,079 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3110#false} {3110#false} #153#return; {3110#false} is VALID [2018-11-23 11:22:19,079 INFO L273 TraceCheckUtils]: 42: Hoare triple {3110#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {3110#false} is VALID [2018-11-23 11:22:19,079 INFO L273 TraceCheckUtils]: 43: Hoare triple {3110#false} assume !false; {3110#false} is VALID [2018-11-23 11:22:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:22:19,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:19,899 INFO L273 TraceCheckUtils]: 43: Hoare triple {3110#false} assume !false; {3110#false} is VALID [2018-11-23 11:22:19,900 INFO L273 TraceCheckUtils]: 42: Hoare triple {3110#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {3110#false} is VALID [2018-11-23 11:22:19,900 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {3109#true} {3110#false} #153#return; {3110#false} is VALID [2018-11-23 11:22:19,900 INFO L273 TraceCheckUtils]: 40: Hoare triple {3109#true} assume true; {3109#true} is VALID [2018-11-23 11:22:19,900 INFO L273 TraceCheckUtils]: 39: Hoare triple {3109#true} #res := ~len~0; {3109#true} is VALID [2018-11-23 11:22:19,901 INFO L273 TraceCheckUtils]: 38: Hoare triple {3109#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {3109#true} is VALID [2018-11-23 11:22:19,901 INFO L273 TraceCheckUtils]: 37: Hoare triple {3109#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {3109#true} is VALID [2018-11-23 11:22:19,901 INFO L273 TraceCheckUtils]: 36: Hoare triple {3109#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {3109#true} is VALID [2018-11-23 11:22:19,901 INFO L256 TraceCheckUtils]: 35: Hoare triple {3110#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {3109#true} is VALID [2018-11-23 11:22:19,902 INFO L273 TraceCheckUtils]: 34: Hoare triple {3110#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {3110#false} is VALID [2018-11-23 11:22:19,902 INFO L273 TraceCheckUtils]: 33: Hoare triple {3110#false} assume !~bvslt32(~i~0, ~k~0); {3110#false} is VALID [2018-11-23 11:22:19,902 INFO L273 TraceCheckUtils]: 32: Hoare triple {3110#false} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {3110#false} is VALID [2018-11-23 11:22:19,902 INFO L268 TraceCheckUtils]: 31: Hoare quadruple {3109#true} {3110#false} #147#return; {3110#false} is VALID [2018-11-23 11:22:19,902 INFO L273 TraceCheckUtils]: 30: Hoare triple {3109#true} assume true; {3109#true} is VALID [2018-11-23 11:22:19,902 INFO L273 TraceCheckUtils]: 29: Hoare triple {3109#true} #res := ~len~1; {3109#true} is VALID [2018-11-23 11:22:19,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {3109#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {3109#true} is VALID [2018-11-23 11:22:19,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {3109#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {3109#true} is VALID [2018-11-23 11:22:19,903 INFO L256 TraceCheckUtils]: 26: Hoare triple {3110#false} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {3109#true} is VALID [2018-11-23 11:22:19,903 INFO L273 TraceCheckUtils]: 25: Hoare triple {3110#false} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {3110#false} is VALID [2018-11-23 11:22:19,904 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} {3310#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} #145#return; {3110#false} is VALID [2018-11-23 11:22:19,904 INFO L273 TraceCheckUtils]: 23: Hoare triple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:19,904 INFO L273 TraceCheckUtils]: 22: Hoare triple {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:19,905 INFO L273 TraceCheckUtils]: 21: Hoare triple {3323#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {3186#(not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:19,907 INFO L273 TraceCheckUtils]: 20: Hoare triple {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {3323#(or (bvsgt |sll_create_#t~post2| (_ bv0 32)) (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:19,914 INFO L273 TraceCheckUtils]: 19: Hoare triple {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:19,916 INFO L273 TraceCheckUtils]: 18: Hoare triple {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:19,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:19,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {3340#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt (bvadd sll_create_~len (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {3327#(or (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt sll_create_~len (_ bv0 32)))} is VALID [2018-11-23 11:22:19,919 INFO L273 TraceCheckUtils]: 15: Hoare triple {3109#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {3340#(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:22:19,919 INFO L256 TraceCheckUtils]: 14: Hoare triple {3310#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {3109#true} is VALID [2018-11-23 11:22:19,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {3347#(bvsgt (bvadd |main_#t~ret13| (_ bv4294967295 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {3310#(bvsgt (bvadd main_~len~2 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:19,921 INFO L268 TraceCheckUtils]: 12: Hoare quadruple {3354#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} {3109#true} #143#return; {3347#(bvsgt (bvadd |main_#t~ret13| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:19,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {3354#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} assume true; {3354#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:19,924 INFO L273 TraceCheckUtils]: 10: Hoare triple {3361#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} #res := ~len~1; {3354#(or (bvsgt (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:19,924 INFO L273 TraceCheckUtils]: 9: Hoare triple {3361#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {3361#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:19,927 INFO L273 TraceCheckUtils]: 8: Hoare triple {3368#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3361#(or (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv2 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:22:19,928 INFO L273 TraceCheckUtils]: 7: Hoare triple {3372#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv1 32)) (_ bv0 32)))} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3368#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt _get_nondet_int_~len~1 (_ bv0 32)))} is VALID [2018-11-23 11:22:19,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {3109#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {3372#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (bvsgt (bvadd _get_nondet_int_~len~1 (_ bv1 32)) (_ bv0 32)))} is VALID [2018-11-23 11:22:19,928 INFO L256 TraceCheckUtils]: 5: Hoare triple {3109#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {3109#true} is VALID [2018-11-23 11:22:19,928 INFO L256 TraceCheckUtils]: 4: Hoare triple {3109#true} call #t~ret21 := main(); {3109#true} is VALID [2018-11-23 11:22:19,929 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3109#true} {3109#true} #161#return; {3109#true} is VALID [2018-11-23 11:22:19,929 INFO L273 TraceCheckUtils]: 2: Hoare triple {3109#true} assume true; {3109#true} is VALID [2018-11-23 11:22:19,929 INFO L273 TraceCheckUtils]: 1: Hoare triple {3109#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3109#true} is VALID [2018-11-23 11:22:19,929 INFO L256 TraceCheckUtils]: 0: Hoare triple {3109#true} call ULTIMATE.init(); {3109#true} is VALID [2018-11-23 11:22:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:22:19,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:19,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-11-23 11:22:19,933 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 11:22:19,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:19,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:22:20,092 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:20,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:22:20,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:22:20,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:22:20,093 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand 21 states. [2018-11-23 11:22:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:27,948 INFO L93 Difference]: Finished difference Result 188 states and 252 transitions. [2018-11-23 11:22:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:22:27,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-11-23 11:22:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:22:27,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 175 transitions. [2018-11-23 11:22:27,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:22:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 175 transitions. [2018-11-23 11:22:27,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 175 transitions. [2018-11-23 11:22:28,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:28,417 INFO L225 Difference]: With dead ends: 188 [2018-11-23 11:22:28,417 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:22:28,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:22:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:22:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 69. [2018-11-23 11:22:28,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:28,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 69 states. [2018-11-23 11:22:28,720 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 69 states. [2018-11-23 11:22:28,720 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 69 states. [2018-11-23 11:22:28,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:28,729 INFO L93 Difference]: Finished difference Result 133 states and 185 transitions. [2018-11-23 11:22:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2018-11-23 11:22:28,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:28,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:28,731 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 133 states. [2018-11-23 11:22:28,731 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 133 states. [2018-11-23 11:22:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:28,739 INFO L93 Difference]: Finished difference Result 133 states and 185 transitions. [2018-11-23 11:22:28,740 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2018-11-23 11:22:28,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:28,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:28,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:28,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 11:22:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-11-23 11:22:28,746 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 44 [2018-11-23 11:22:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:28,746 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-11-23 11:22:28,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:22:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-23 11:22:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 11:22:28,747 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:28,748 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:28,748 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:28,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash -319300561, now seen corresponding path program 2 times [2018-11-23 11:22:28,748 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:28,750 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:28,766 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:22:28,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:22:28,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:22:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:28,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:29,003 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:22:29,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:22:29,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:29,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:29,024 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:22:29,025 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-11-23 11:22:29,035 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:29,035 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_34|, v_sll_create_~head~0.base_21]. (and (not (= (_ bv0 32) v_sll_create_~head~0.base_21)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_34| sll_create_~head~0.base (store (select |v_#memory_$Pointer$.base_34| sll_create_~head~0.base) (_ bv0 32) v_sll_create_~head~0.base_21))) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:22:29,036 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset)) [2018-11-23 11:22:29,346 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:22:29,353 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:22:29,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:29,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:29,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:29,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2018-11-23 11:22:29,383 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:29,383 WARN L384 uantifierElimination]: Input elimination task: ∃ [|main_~#s~0.base|, |main_~#s~0.offset|, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= |main_#t~mem18.base| .cse0) (= .cse1 |main_#t~mem18.offset|) (= .cse1 (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv0 32)) (_ bv0 32))))) [2018-11-23 11:22:29,383 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (and (= |main_#t~mem18.base| .cse0) (not (= (select (select |#memory_$Pointer$.base| .cse0) (_ bv0 32)) (_ bv0 32))) (= |main_#t~mem18.offset| (_ bv0 32)))) [2018-11-23 11:22:29,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {4043#true} call ULTIMATE.init(); {4043#true} is VALID [2018-11-23 11:22:29,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {4043#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4043#true} is VALID [2018-11-23 11:22:29,867 INFO L273 TraceCheckUtils]: 2: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:29,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4043#true} {4043#true} #161#return; {4043#true} is VALID [2018-11-23 11:22:29,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {4043#true} call #t~ret21 := main(); {4043#true} is VALID [2018-11-23 11:22:29,868 INFO L256 TraceCheckUtils]: 5: Hoare triple {4043#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {4043#true} is VALID [2018-11-23 11:22:29,868 INFO L273 TraceCheckUtils]: 6: Hoare triple {4043#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4043#true} is VALID [2018-11-23 11:22:29,868 INFO L273 TraceCheckUtils]: 7: Hoare triple {4043#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4043#true} is VALID [2018-11-23 11:22:29,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {4043#true} #res := ~len~1; {4043#true} is VALID [2018-11-23 11:22:29,868 INFO L273 TraceCheckUtils]: 9: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:29,868 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {4043#true} {4043#true} #143#return; {4043#true} is VALID [2018-11-23 11:22:29,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {4043#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {4043#true} is VALID [2018-11-23 11:22:29,869 INFO L256 TraceCheckUtils]: 12: Hoare triple {4043#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {4043#true} is VALID [2018-11-23 11:22:29,869 INFO L273 TraceCheckUtils]: 13: Hoare triple {4043#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4043#true} is VALID [2018-11-23 11:22:29,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {4043#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4043#true} is VALID [2018-11-23 11:22:29,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {4043#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:22:29,874 INFO L273 TraceCheckUtils]: 16: Hoare triple {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:22:29,874 INFO L273 TraceCheckUtils]: 17: Hoare triple {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:29,878 INFO L273 TraceCheckUtils]: 18: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:29,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4107#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:22:29,879 INFO L273 TraceCheckUtils]: 20: Hoare triple {4107#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4107#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:22:29,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {4107#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (not (= sll_create_~head~0.base (_ bv0 32))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:22:29,888 INFO L273 TraceCheckUtils]: 22: Hoare triple {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:22:29,890 INFO L273 TraceCheckUtils]: 23: Hoare triple {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:22:29,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {4114#(and (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4124#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:29,891 INFO L273 TraceCheckUtils]: 25: Hoare triple {4124#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32)))} assume true; {4124#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:29,892 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4124#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32))) (= |sll_create_#res.offset| (_ bv0 32)))} {4043#true} #145#return; {4131#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret14.offset|))} is VALID [2018-11-23 11:22:29,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {4131#(and (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32)) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret14.offset|))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:29,897 INFO L256 TraceCheckUtils]: 28: Hoare triple {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,898 INFO L273 TraceCheckUtils]: 29: Hoare triple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,898 INFO L273 TraceCheckUtils]: 30: Hoare triple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} #res := ~len~1; {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,899 INFO L273 TraceCheckUtils]: 32: Hoare triple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} assume true; {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,900 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4139#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_2| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_2|) |v_main_~#s~0.offset_BEFORE_CALL_2|)) (_ bv0 32)) (_ bv0 32)))))} {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} #147#return; {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:29,901 INFO L273 TraceCheckUtils]: 34: Hoare triple {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:29,901 INFO L273 TraceCheckUtils]: 35: Hoare triple {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} assume !~bvslt32(~i~0, ~k~0); {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:29,902 INFO L273 TraceCheckUtils]: 36: Hoare triple {4135#(and (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {4164#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))) (= |main_#t~mem18.offset| (_ bv0 32)))} is VALID [2018-11-23 11:22:29,904 INFO L256 TraceCheckUtils]: 37: Hoare triple {4164#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))) (= |main_#t~mem18.offset| (_ bv0 32)))} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {4168#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:22:29,905 INFO L273 TraceCheckUtils]: 38: Hoare triple {4168#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4172#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,906 INFO L273 TraceCheckUtils]: 39: Hoare triple {4172#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (= sll_length_~head.base |sll_length_#in~head.base|) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4176#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,907 INFO L273 TraceCheckUtils]: 40: Hoare triple {4176#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,907 INFO L273 TraceCheckUtils]: 41: Hoare triple {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} #res := ~len~0; {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,908 INFO L273 TraceCheckUtils]: 42: Hoare triple {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} assume true; {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:22:29,910 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {4180#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32)))))} {4164#(and (exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (_ bv0 32))))) (= |main_#t~mem18.offset| (_ bv0 32)))} #153#return; {4044#false} is VALID [2018-11-23 11:22:29,911 INFO L273 TraceCheckUtils]: 44: Hoare triple {4044#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {4044#false} is VALID [2018-11-23 11:22:29,911 INFO L273 TraceCheckUtils]: 45: Hoare triple {4044#false} assume !false; {4044#false} is VALID [2018-11-23 11:22:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:29,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:30,277 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 25 treesize of output 21 [2018-11-23 11:22:30,296 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 21 treesize of output 12 [2018-11-23 11:22:30,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:30,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:21 [2018-11-23 11:22:30,322 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:30,322 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.offset|, |main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse0 (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= .cse0 |main_#t~ret14.offset|)) (not (= .cse1 |main_#t~ret14.base|)) (not (= (select (select |#memory_$Pointer$.base| .cse1) .cse0) (_ bv0 32))))) [2018-11-23 11:22:30,322 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= .cse0 |main_#t~ret14.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) |main_#t~ret14.offset|))))) [2018-11-23 11:22:30,949 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 22 [2018-11-23 11:22:30,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-11-23 11:22:30,959 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:22:30,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,965 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 12 treesize of output 10 [2018-11-23 11:22:30,972 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 6 treesize of output 1 [2018-11-23 11:22:30,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:30,978 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:31,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:22:31,004 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:14 [2018-11-23 11:22:31,010 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:31,010 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, |main_~#s~0.base|, |main_~#s~0.offset|]. (let ((.cse1 (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)))) (let ((.cse0 (select (select .cse1 |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= .cse0 sll_create_~new_head~0.base)) (not (= (select (select .cse1 .cse0) sll_create_~new_head~0.offset) (_ bv0 32)))))) [2018-11-23 11:22:31,010 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (not (= sll_create_~head~0.base (_ bv0 32))))) (and (or .cse0 (not (= sll_create_~head~0.base sll_create_~new_head~0.base))) .cse0)) [2018-11-23 11:22:31,038 INFO L273 TraceCheckUtils]: 45: Hoare triple {4044#false} assume !false; {4044#false} is VALID [2018-11-23 11:22:31,038 INFO L273 TraceCheckUtils]: 44: Hoare triple {4044#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {4044#false} is VALID [2018-11-23 11:22:31,040 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} {4202#(not (= (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|) (_ bv0 32)))} #153#return; {4044#false} is VALID [2018-11-23 11:22:31,040 INFO L273 TraceCheckUtils]: 42: Hoare triple {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} assume true; {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} is VALID [2018-11-23 11:22:31,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} #res := ~len~0; {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} is VALID [2018-11-23 11:22:31,041 INFO L273 TraceCheckUtils]: 40: Hoare triple {4216#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (not (= (_ bv0 32) sll_length_~head.base)))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4206#(= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32))} is VALID [2018-11-23 11:22:31,042 INFO L273 TraceCheckUtils]: 39: Hoare triple {4220#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4216#(or (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)) (not (= (_ bv0 32) sll_length_~head.base)))} is VALID [2018-11-23 11:22:31,043 INFO L273 TraceCheckUtils]: 38: Hoare triple {4043#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4220#(or (not (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) (_ bv0 32)))} is VALID [2018-11-23 11:22:31,043 INFO L256 TraceCheckUtils]: 37: Hoare triple {4202#(not (= (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|) (_ bv0 32)))} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {4043#true} is VALID [2018-11-23 11:22:31,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {4202#(not (= (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|) (_ bv0 32)))} is VALID [2018-11-23 11:22:31,045 INFO L273 TraceCheckUtils]: 35: Hoare triple {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~k~0); {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:22:31,046 INFO L273 TraceCheckUtils]: 34: Hoare triple {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:22:31,047 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4043#true} {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} #147#return; {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:22:31,047 INFO L273 TraceCheckUtils]: 32: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:31,048 INFO L273 TraceCheckUtils]: 31: Hoare triple {4043#true} #res := ~len~1; {4043#true} is VALID [2018-11-23 11:22:31,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {4043#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4043#true} is VALID [2018-11-23 11:22:31,048 INFO L273 TraceCheckUtils]: 29: Hoare triple {4043#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4043#true} is VALID [2018-11-23 11:22:31,048 INFO L256 TraceCheckUtils]: 28: Hoare triple {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {4043#true} is VALID [2018-11-23 11:22:31,050 INFO L273 TraceCheckUtils]: 27: Hoare triple {4255#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_#t~ret14.offset|)))))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {4227#(not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:22:31,051 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4262#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |sll_create_#res.offset|) (_ bv0 32)))))} {4043#true} #145#return; {4255#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.base|)) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |main_#t~ret14.offset|)))))} is VALID [2018-11-23 11:22:31,051 INFO L273 TraceCheckUtils]: 25: Hoare triple {4262#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |sll_create_#res.offset|) (_ bv0 32)))))} assume true; {4262#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |sll_create_#res.offset|) (_ bv0 32)))))} is VALID [2018-11-23 11:22:31,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4262#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) |sll_create_#res.offset|) (_ bv0 32)))))} is VALID [2018-11-23 11:22:31,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:22:31,054 INFO L273 TraceCheckUtils]: 22: Hoare triple {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:22:31,056 INFO L273 TraceCheckUtils]: 21: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4269#(forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) sll_create_~head~0.offset))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:22:31,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:31,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:31,058 INFO L273 TraceCheckUtils]: 18: Hoare triple {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:31,059 INFO L273 TraceCheckUtils]: 17: Hoare triple {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4100#(not (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:22:31,059 INFO L273 TraceCheckUtils]: 16: Hoare triple {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:22:31,060 INFO L273 TraceCheckUtils]: 15: Hoare triple {4043#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4093#(not (= (_ bv0 32) sll_create_~new_head~0.base))} is VALID [2018-11-23 11:22:31,060 INFO L273 TraceCheckUtils]: 14: Hoare triple {4043#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4043#true} is VALID [2018-11-23 11:22:31,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {4043#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4043#true} is VALID [2018-11-23 11:22:31,061 INFO L256 TraceCheckUtils]: 12: Hoare triple {4043#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {4043#true} is VALID [2018-11-23 11:22:31,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {4043#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {4043#true} is VALID [2018-11-23 11:22:31,061 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {4043#true} {4043#true} #143#return; {4043#true} is VALID [2018-11-23 11:22:31,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:31,062 INFO L273 TraceCheckUtils]: 8: Hoare triple {4043#true} #res := ~len~1; {4043#true} is VALID [2018-11-23 11:22:31,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {4043#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4043#true} is VALID [2018-11-23 11:22:31,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {4043#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4043#true} is VALID [2018-11-23 11:22:31,063 INFO L256 TraceCheckUtils]: 5: Hoare triple {4043#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {4043#true} is VALID [2018-11-23 11:22:31,063 INFO L256 TraceCheckUtils]: 4: Hoare triple {4043#true} call #t~ret21 := main(); {4043#true} is VALID [2018-11-23 11:22:31,063 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4043#true} {4043#true} #161#return; {4043#true} is VALID [2018-11-23 11:22:31,064 INFO L273 TraceCheckUtils]: 2: Hoare triple {4043#true} assume true; {4043#true} is VALID [2018-11-23 11:22:31,064 INFO L273 TraceCheckUtils]: 1: Hoare triple {4043#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4043#true} is VALID [2018-11-23 11:22:31,064 INFO L256 TraceCheckUtils]: 0: Hoare triple {4043#true} call ULTIMATE.init(); {4043#true} is VALID [2018-11-23 11:22:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (8)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:22:31,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:31,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2018-11-23 11:22:31,077 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-11-23 11:22:31,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:31,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:22:31,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:31,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:22:31,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:22:31,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:22:31,222 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 23 states. [2018-11-23 11:22:58,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:58,642 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2018-11-23 11:22:58,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:22:58,643 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2018-11-23 11:22:58,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:22:58,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-23 11:22:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:22:58,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2018-11-23 11:22:58,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2018-11-23 11:22:58,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:58,907 INFO L225 Difference]: With dead ends: 97 [2018-11-23 11:22:58,907 INFO L226 Difference]: Without dead ends: 91 [2018-11-23 11:22:58,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:22:58,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-23 11:22:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2018-11-23 11:22:59,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:59,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand 70 states. [2018-11-23 11:22:59,040 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand 70 states. [2018-11-23 11:22:59,040 INFO L87 Difference]: Start difference. First operand 91 states. Second operand 70 states. [2018-11-23 11:22:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:59,044 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-23 11:22:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-11-23 11:22:59,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:59,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:59,045 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 91 states. [2018-11-23 11:22:59,045 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 91 states. [2018-11-23 11:22:59,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:59,047 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2018-11-23 11:22:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-11-23 11:22:59,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:59,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:59,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:59,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:22:59,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2018-11-23 11:22:59,050 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 46 [2018-11-23 11:22:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:59,051 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2018-11-23 11:22:59,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:22:59,051 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2018-11-23 11:22:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 11:22:59,052 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:59,052 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:59,052 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:59,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:59,052 INFO L82 PathProgramCache]: Analyzing trace with hash 290920004, now seen corresponding path program 3 times [2018-11-23 11:22:59,053 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:59,053 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:59,078 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:22:59,135 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 11:22:59,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:22:59,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:59,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:59,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {4775#true} call ULTIMATE.init(); {4775#true} is VALID [2018-11-23 11:22:59,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {4775#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4775#true} is VALID [2018-11-23 11:22:59,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {4775#true} assume true; {4775#true} is VALID [2018-11-23 11:22:59,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4775#true} {4775#true} #161#return; {4775#true} is VALID [2018-11-23 11:22:59,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {4775#true} call #t~ret21 := main(); {4775#true} is VALID [2018-11-23 11:22:59,404 INFO L256 TraceCheckUtils]: 5: Hoare triple {4775#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {4775#true} is VALID [2018-11-23 11:22:59,405 INFO L273 TraceCheckUtils]: 6: Hoare triple {4775#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:59,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:59,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} #res := ~len~1; {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:59,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} assume true; {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:59,406 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} {4775#true} #143#return; {4812#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:59,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {4812#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:59,407 INFO L256 TraceCheckUtils]: 12: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {4775#true} is VALID [2018-11-23 11:22:59,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {4775#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4775#true} is VALID [2018-11-23 11:22:59,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:22:59,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {4775#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4775#true} is VALID [2018-11-23 11:22:59,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {4775#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4775#true} is VALID [2018-11-23 11:22:59,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {4775#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4775#true} is VALID [2018-11-23 11:22:59,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:22:59,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {4775#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4775#true} is VALID [2018-11-23 11:22:59,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {4775#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4775#true} is VALID [2018-11-23 11:22:59,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {4775#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4775#true} is VALID [2018-11-23 11:22:59,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:22:59,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {4775#true} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {4775#true} is VALID [2018-11-23 11:22:59,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {4775#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4775#true} is VALID [2018-11-23 11:22:59,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {4775#true} assume true; {4775#true} is VALID [2018-11-23 11:22:59,411 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4775#true} {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #145#return; {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:59,411 INFO L273 TraceCheckUtils]: 27: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:59,411 INFO L256 TraceCheckUtils]: 28: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {4775#true} is VALID [2018-11-23 11:22:59,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {4775#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:59,412 INFO L273 TraceCheckUtils]: 30: Hoare triple {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:59,413 INFO L273 TraceCheckUtils]: 31: Hoare triple {4798#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} #res := ~len~1; {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:59,413 INFO L273 TraceCheckUtils]: 32: Hoare triple {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} assume true; {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:22:59,414 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4805#(= |_get_nondet_int_#res| |_get_nondet_int_#in~from|)} {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #147#return; {4883#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret15| (_ bv0 32)))} is VALID [2018-11-23 11:22:59,414 INFO L273 TraceCheckUtils]: 34: Hoare triple {4883#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= |main_#t~ret15| (_ bv0 32)))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:59,415 INFO L273 TraceCheckUtils]: 35: Hoare triple {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~k~0); {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:59,415 INFO L273 TraceCheckUtils]: 36: Hoare triple {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:59,415 INFO L256 TraceCheckUtils]: 37: Hoare triple {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {4775#true} is VALID [2018-11-23 11:22:59,415 INFO L273 TraceCheckUtils]: 38: Hoare triple {4775#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4900#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-23 11:22:59,416 INFO L273 TraceCheckUtils]: 39: Hoare triple {4900#(= sll_length_~len~0 (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:59,422 INFO L273 TraceCheckUtils]: 40: Hoare triple {4904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:59,423 INFO L273 TraceCheckUtils]: 41: Hoare triple {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:59,423 INFO L273 TraceCheckUtils]: 42: Hoare triple {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #res := ~len~0; {4915#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-23 11:22:59,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {4915#(= (_ bv2 32) |sll_length_#res|)} assume true; {4915#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-23 11:22:59,425 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4915#(= (_ bv2 32) |sll_length_#res|)} {4887#(and (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} #153#return; {4922#(and (= (bvadd |main_#t~ret19| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 11:22:59,425 INFO L273 TraceCheckUtils]: 45: Hoare triple {4922#(and (= (bvadd |main_#t~ret19| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {4776#false} is VALID [2018-11-23 11:22:59,425 INFO L273 TraceCheckUtils]: 46: Hoare triple {4776#false} assume !false; {4776#false} is VALID [2018-11-23 11:22:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 11:22:59,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:00,173 INFO L273 TraceCheckUtils]: 46: Hoare triple {4776#false} assume !false; {4776#false} is VALID [2018-11-23 11:23:00,175 INFO L273 TraceCheckUtils]: 45: Hoare triple {4932#(= (bvadd main_~len~2 main_~k~0) |main_#t~ret19|)} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {4776#false} is VALID [2018-11-23 11:23:00,176 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4915#(= (_ bv2 32) |sll_length_#res|)} {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} #153#return; {4932#(= (bvadd main_~len~2 main_~k~0) |main_#t~ret19|)} is VALID [2018-11-23 11:23:00,176 INFO L273 TraceCheckUtils]: 43: Hoare triple {4915#(= (_ bv2 32) |sll_length_#res|)} assume true; {4915#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-23 11:23:00,176 INFO L273 TraceCheckUtils]: 42: Hoare triple {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} #res := ~len~0; {4915#(= (_ bv2 32) |sll_length_#res|)} is VALID [2018-11-23 11:23:00,177 INFO L273 TraceCheckUtils]: 41: Hoare triple {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,178 INFO L273 TraceCheckUtils]: 40: Hoare triple {4904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4908#(= (bvadd sll_length_~len~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,178 INFO L273 TraceCheckUtils]: 39: Hoare triple {4900#(= sll_length_~len~0 (_ bv0 32))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {4904#(= (bvadd sll_length_~len~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {4775#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {4900#(= sll_length_~len~0 (_ bv0 32))} is VALID [2018-11-23 11:23:00,179 INFO L256 TraceCheckUtils]: 37: Hoare triple {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {4775#true} is VALID [2018-11-23 11:23:00,179 INFO L273 TraceCheckUtils]: 36: Hoare triple {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,195 INFO L273 TraceCheckUtils]: 35: Hoare triple {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~k~0); {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,234 INFO L273 TraceCheckUtils]: 34: Hoare triple {4967#(= (_ bv2 32) (bvadd |main_#t~ret15| main_~len~2))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {4936#(= (bvadd main_~len~2 main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,235 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {4974#(or (= (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #147#return; {4967#(= (_ bv2 32) (bvadd |main_#t~ret15| main_~len~2))} is VALID [2018-11-23 11:23:00,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {4974#(or (= (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} assume true; {4974#(or (= (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:23:00,236 INFO L273 TraceCheckUtils]: 31: Hoare triple {4981#(or (not (= (_ bv0 32) |_get_nondet_int_#in~from|)) (= (_ bv0 32) _get_nondet_int_~len~1))} #res := ~len~1; {4974#(or (= (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:23:00,236 INFO L273 TraceCheckUtils]: 30: Hoare triple {4981#(or (not (= (_ bv0 32) |_get_nondet_int_#in~from|)) (= (_ bv0 32) _get_nondet_int_~len~1))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {4981#(or (not (= (_ bv0 32) |_get_nondet_int_#in~from|)) (= (_ bv0 32) _get_nondet_int_~len~1))} is VALID [2018-11-23 11:23:00,237 INFO L273 TraceCheckUtils]: 29: Hoare triple {4775#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {4981#(or (not (= (_ bv0 32) |_get_nondet_int_#in~from|)) (= (_ bv0 32) _get_nondet_int_~len~1))} is VALID [2018-11-23 11:23:00,237 INFO L256 TraceCheckUtils]: 28: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {4775#true} is VALID [2018-11-23 11:23:00,238 INFO L273 TraceCheckUtils]: 27: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,239 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4775#true} {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} #145#return; {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {4775#true} assume true; {4775#true} is VALID [2018-11-23 11:23:00,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {4775#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {4775#true} is VALID [2018-11-23 11:23:00,239 INFO L273 TraceCheckUtils]: 23: Hoare triple {4775#true} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {4775#true} is VALID [2018-11-23 11:23:00,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:23:00,240 INFO L273 TraceCheckUtils]: 21: Hoare triple {4775#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4775#true} is VALID [2018-11-23 11:23:00,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {4775#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4775#true} is VALID [2018-11-23 11:23:00,240 INFO L273 TraceCheckUtils]: 19: Hoare triple {4775#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4775#true} is VALID [2018-11-23 11:23:00,240 INFO L273 TraceCheckUtils]: 18: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:23:00,240 INFO L273 TraceCheckUtils]: 17: Hoare triple {4775#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {4775#true} is VALID [2018-11-23 11:23:00,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {4775#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {4775#true} is VALID [2018-11-23 11:23:00,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {4775#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {4775#true} is VALID [2018-11-23 11:23:00,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {4775#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {4775#true} is VALID [2018-11-23 11:23:00,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {4775#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {4775#true} is VALID [2018-11-23 11:23:00,241 INFO L256 TraceCheckUtils]: 12: Hoare triple {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {4775#true} is VALID [2018-11-23 11:23:00,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {4812#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {4816#(= (bvadd main_~len~2 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,242 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {5045#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) |_get_nondet_int_#res|))} {4775#true} #143#return; {4812#(= (bvadd |main_#t~ret13| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:00,242 INFO L273 TraceCheckUtils]: 9: Hoare triple {5045#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) |_get_nondet_int_#res|))} assume true; {5045#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) |_get_nondet_int_#res|))} is VALID [2018-11-23 11:23:00,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {5052#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) _get_nondet_int_~len~1))} #res := ~len~1; {5045#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) |_get_nondet_int_#res|))} is VALID [2018-11-23 11:23:00,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {5052#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) _get_nondet_int_~len~1))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5052#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) _get_nondet_int_~len~1))} is VALID [2018-11-23 11:23:00,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {4775#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5052#(or (not (= (_ bv2 32) |_get_nondet_int_#in~from|)) (= (_ bv2 32) _get_nondet_int_~len~1))} is VALID [2018-11-23 11:23:00,244 INFO L256 TraceCheckUtils]: 5: Hoare triple {4775#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {4775#true} is VALID [2018-11-23 11:23:00,244 INFO L256 TraceCheckUtils]: 4: Hoare triple {4775#true} call #t~ret21 := main(); {4775#true} is VALID [2018-11-23 11:23:00,244 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4775#true} {4775#true} #161#return; {4775#true} is VALID [2018-11-23 11:23:00,244 INFO L273 TraceCheckUtils]: 2: Hoare triple {4775#true} assume true; {4775#true} is VALID [2018-11-23 11:23:00,245 INFO L273 TraceCheckUtils]: 1: Hoare triple {4775#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4775#true} is VALID [2018-11-23 11:23:00,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {4775#true} call ULTIMATE.init(); {4775#true} is VALID [2018-11-23 11:23:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 11:23:00,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:00,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 20 [2018-11-23 11:23:00,250 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:23:00,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:00,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:23:00,319 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:23:00,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:23:00,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:23:00,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=331, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:23:00,320 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand 20 states. [2018-11-23 11:23:05,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:05,746 INFO L93 Difference]: Finished difference Result 136 states and 182 transitions. [2018-11-23 11:23:05,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:23:05,747 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-23 11:23:05,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:23:05,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 11:23:05,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:23:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 129 transitions. [2018-11-23 11:23:05,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 129 transitions. [2018-11-23 11:23:05,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:05,974 INFO L225 Difference]: With dead ends: 136 [2018-11-23 11:23:05,974 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:23:05,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:23:05,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:23:06,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 104. [2018-11-23 11:23:06,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:06,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 104 states. [2018-11-23 11:23:06,277 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 104 states. [2018-11-23 11:23:06,277 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 104 states. [2018-11-23 11:23:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:06,284 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2018-11-23 11:23:06,284 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2018-11-23 11:23:06,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:06,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:06,285 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 133 states. [2018-11-23 11:23:06,286 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 133 states. [2018-11-23 11:23:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:06,292 INFO L93 Difference]: Finished difference Result 133 states and 178 transitions. [2018-11-23 11:23:06,292 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2018-11-23 11:23:06,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:06,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:06,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:06,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:06,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 11:23:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 134 transitions. [2018-11-23 11:23:06,298 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 134 transitions. Word has length 47 [2018-11-23 11:23:06,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:06,298 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 134 transitions. [2018-11-23 11:23:06,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:23:06,299 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 134 transitions. [2018-11-23 11:23:06,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:23:06,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:06,300 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:06,300 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:06,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:06,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2027888335, now seen corresponding path program 4 times [2018-11-23 11:23:06,301 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:06,301 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:06,329 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:23:06,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:23:06,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:06,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:06,526 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:23:06,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-11-23 11:23:06,546 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:06,546 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_68|]. (and (= |#valid| (store |v_#valid_68| sll_create_~new_head~0.base (_ bv1 1))) (= sll_create_~new_head~0.offset (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32))) [2018-11-23 11:23:06,546 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (= (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (= sll_create_~head~0.base (_ bv0 32))) [2018-11-23 11:23:06,604 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:23:06,609 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:23:06,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,615 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,639 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:23:06,644 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:23:06,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-11-23 11:23:06,712 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:06,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:06,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:23:06,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-11-23 11:23:06,739 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:23:06,739 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_69|]. (and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 1) (select |v_#valid_69| sll_create_~new_head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset) (= (_ bv1 1) (select |v_#valid_69| sll_create_~head~0.base))) [2018-11-23 11:23:06,740 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base))) [2018-11-23 11:23:06,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-23 11:23:06,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:23:06,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-11-23 11:23:06,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:23:06,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,884 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:06,906 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:23:06,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2018-11-23 11:23:08,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {5698#true} call ULTIMATE.init(); {5698#true} is VALID [2018-11-23 11:23:08,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {5698#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5698#true} is VALID [2018-11-23 11:23:08,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:23:08,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5698#true} {5698#true} #161#return; {5698#true} is VALID [2018-11-23 11:23:08,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {5698#true} call #t~ret21 := main(); {5698#true} is VALID [2018-11-23 11:23:08,697 INFO L256 TraceCheckUtils]: 5: Hoare triple {5698#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {5698#true} is VALID [2018-11-23 11:23:08,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {5698#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5698#true} is VALID [2018-11-23 11:23:08,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {5698#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5698#true} is VALID [2018-11-23 11:23:08,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {5698#true} #res := ~len~1; {5698#true} is VALID [2018-11-23 11:23:08,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:23:08,698 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {5698#true} {5698#true} #143#return; {5698#true} is VALID [2018-11-23 11:23:08,698 INFO L273 TraceCheckUtils]: 11: Hoare triple {5698#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {5698#true} is VALID [2018-11-23 11:23:08,698 INFO L256 TraceCheckUtils]: 12: Hoare triple {5698#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {5698#true} is VALID [2018-11-23 11:23:08,699 INFO L273 TraceCheckUtils]: 13: Hoare triple {5698#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:23:08,699 INFO L273 TraceCheckUtils]: 14: Hoare triple {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:23:08,704 INFO L273 TraceCheckUtils]: 15: Hoare triple {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {5749#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:23:08,705 INFO L273 TraceCheckUtils]: 16: Hoare triple {5749#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5749#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:23:08,706 INFO L273 TraceCheckUtils]: 17: Hoare triple {5749#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (bvadd (select |#valid| sll_create_~new_head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5756#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:23:08,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {5756#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5756#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} is VALID [2018-11-23 11:23:08,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {5756#(and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {5763#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} is VALID [2018-11-23 11:23:08,708 INFO L273 TraceCheckUtils]: 20: Hoare triple {5763#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5763#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} is VALID [2018-11-23 11:23:08,710 INFO L273 TraceCheckUtils]: 21: Hoare triple {5763#(and (= sll_create_~new_head~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) sll_create_~head~0.offset) (not (= sll_create_~head~0.base sll_create_~new_head~0.base)))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:08,710 INFO L273 TraceCheckUtils]: 22: Hoare triple {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:08,711 INFO L273 TraceCheckUtils]: 23: Hoare triple {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:08,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {5770#(and (= (select (select |#memory_$Pointer$.offset| sll_create_~head~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) sll_create_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32)) sll_create_~head~0.base)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5780#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:08,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {5780#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} assume true; {5780#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:08,717 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {5780#(and (not (= (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32)) |sll_create_#res.base|)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_create_#res.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= |sll_create_#res.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |sll_create_#res.base|) (_ bv0 32)) (_ bv0 32)))} {5698#true} #145#return; {5787#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32)) |main_#t~ret14.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret14.offset|) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret14.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:08,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {5787#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32)) |main_#t~ret14.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~ret14.base|) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) |main_#t~ret14.offset|) (= (select (select |#memory_$Pointer$.offset| |main_#t~ret14.base|) (_ bv0 32)) (_ bv0 32)))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,723 INFO L256 TraceCheckUtils]: 28: Hoare triple {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,723 INFO L273 TraceCheckUtils]: 29: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,724 INFO L273 TraceCheckUtils]: 30: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} #res := ~len~1; {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} assume true; {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,726 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} #147#return; {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,727 INFO L273 TraceCheckUtils]: 34: Hoare triple {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} assume !~bvslt32(~i~0, ~k~0); {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,731 INFO L273 TraceCheckUtils]: 36: Hoare triple {5791#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {5820#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem18.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:23:08,734 INFO L256 TraceCheckUtils]: 37: Hoare triple {5820#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem18.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))))} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} is VALID [2018-11-23 11:23:08,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {5795#(exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32))))} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5827#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|))} is VALID [2018-11-23 11:23:08,739 INFO L273 TraceCheckUtils]: 39: Hoare triple {5827#(and (= sll_length_~head.offset |sll_length_#in~head.offset|) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.base |sll_length_#in~head.base|))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5831#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} is VALID [2018-11-23 11:23:08,743 INFO L273 TraceCheckUtils]: 40: Hoare triple {5831#(and (= (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|) sll_length_~head.base) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= sll_length_~head.offset (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5835#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.offset) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} is VALID [2018-11-23 11:23:08,744 INFO L273 TraceCheckUtils]: 41: Hoare triple {5835#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.offset) (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) sll_length_~head.base))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:23:08,745 INFO L273 TraceCheckUtils]: 42: Hoare triple {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:23:08,746 INFO L273 TraceCheckUtils]: 43: Hoare triple {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} #res := ~len~0; {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:23:08,746 INFO L273 TraceCheckUtils]: 44: Hoare triple {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} assume true; {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} is VALID [2018-11-23 11:23:08,749 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5839#(or (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))) (and (exists ((|v_main_~#s~0.offset_BEFORE_CALL_4| (_ BitVec 32)) (|v_main_~#s~0.base_BEFORE_CALL_4| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.offset| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |v_main_~#s~0.base_BEFORE_CALL_4|) |v_main_~#s~0.offset_BEFORE_CALL_4|)) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32)))))} {5820#(exists ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)) (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))) (= |main_#t~mem18.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~mem18.offset|) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (_ bv0 32)))))} #153#return; {5699#false} is VALID [2018-11-23 11:23:08,749 INFO L273 TraceCheckUtils]: 46: Hoare triple {5699#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {5699#false} is VALID [2018-11-23 11:23:08,749 INFO L273 TraceCheckUtils]: 47: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2018-11-23 11:23:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:08,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:10,247 WARN L180 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 11:23:10,624 WARN L180 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-23 11:23:10,996 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:23:11,348 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:23:15,202 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 270 treesize of output 215 [2018-11-23 11:23:15,517 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 45 [2018-11-23 11:23:15,525 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 9 treesize of output 8 [2018-11-23 11:23:15,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:15,642 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 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 11:23:15,658 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 108 treesize of output 102 [2018-11-23 11:23:15,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:15,902 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 86 [2018-11-23 11:23:15,911 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:16,084 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 99 treesize of output 78 [2018-11-23 11:23:16,086 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:16,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:16,191 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 111 treesize of output 113 [2018-11-23 11:23:16,206 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 108 treesize of output 87 [2018-11-23 11:23:16,210 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:16,346 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 87 treesize of output 81 [2018-11-23 11:23:16,352 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:16,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 86 [2018-11-23 11:23:16,474 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:16,514 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:16,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:16,842 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 270 treesize of output 215 [2018-11-23 11:23:17,384 WARN L180 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2018-11-23 11:23:17,397 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 9 treesize of output 8 [2018-11-23 11:23:17,398 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:17,617 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 111 treesize of output 113 [2018-11-23 11:23:17,638 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 108 treesize of output 100 [2018-11-23 11:23:17,645 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:17,770 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 94 [2018-11-23 11:23:17,773 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:17,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 99 [2018-11-23 11:23:17,928 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:18,024 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:18,075 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 1 case distinctions, treesize of input 111 treesize of output 113 [2018-11-23 11:23:18,092 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 108 treesize of output 102 [2018-11-23 11:23:18,095 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:18,266 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 99 [2018-11-23 11:23:18,271 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:18,403 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 94 [2018-11-23 11:23:18,407 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:18,488 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:18,495 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 21 treesize of output 19 [2018-11-23 11:23:18,507 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:23:18,508 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:18,530 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:18,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:18,540 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 112 [2018-11-23 11:23:18,551 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 92 [2018-11-23 11:23:18,555 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:18,603 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:18,887 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 16 xjuncts. [2018-11-23 11:23:19,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 74 [2018-11-23 11:23:19,841 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-11-23 11:23:19,847 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 9 treesize of output 8 [2018-11-23 11:23:19,849 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:19,963 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:19,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:20,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 70 [2018-11-23 11:23:20,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:23:20,017 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,060 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:20,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-11-23 11:23:20,089 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 3 [2018-11-23 11:23:20,093 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,122 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:23:20,124 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-11-23 11:23:20,145 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,164 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,176 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,190 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:20,192 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:20,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 77 [2018-11-23 11:23:20,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 65 [2018-11-23 11:23:20,320 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:23:20,486 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,643 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 41 treesize of output 42 [2018-11-23 11:23:20,655 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 33 treesize of output 27 [2018-11-23 11:23:20,660 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,746 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 27 treesize of output 21 [2018-11-23 11:23:20,749 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,808 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 11:23:20,810 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-23 11:23:20,861 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,882 INFO L267 ElimStorePlain]: Start of recursive call 37: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,931 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:20,945 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:20,948 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:21,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 87 [2018-11-23 11:23:21,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 72 [2018-11-23 11:23:21,057 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,227 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 46 [2018-11-23 11:23:21,235 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,375 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-11-23 11:23:21,401 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 3 [2018-11-23 11:23:21,403 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,436 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 6 treesize of output 1 [2018-11-23 11:23:21,436 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,464 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 3 [2018-11-23 11:23:21,465 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,481 INFO L267 ElimStorePlain]: Start of recursive call 45: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,601 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 47 [2018-11-23 11:23:21,678 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 30 treesize of output 22 [2018-11-23 11:23:21,680 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,752 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 27 treesize of output 19 [2018-11-23 11:23:21,755 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,811 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 19 treesize of output 13 [2018-11-23 11:23:21,813 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,858 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,858 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-11-23 11:23:21,860 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,883 INFO L267 ElimStorePlain]: Start of recursive call 49: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,921 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:21,936 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:21,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:22,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 77 [2018-11-23 11:23:22,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-11-23 11:23:22,053 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:22,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 11:23:22,236 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:22,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2018-11-23 11:23:22,432 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:23:22,433 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:22,470 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:23:22,471 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:22,501 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 3 [2018-11-23 11:23:22,502 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:22,516 INFO L267 ElimStorePlain]: Start of recursive call 57: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:22,676 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 35 treesize of output 32 [2018-11-23 11:23:22,702 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:23:22,730 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:22,999 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:23:23,016 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:23,200 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:23,254 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 31 treesize of output 30 [2018-11-23 11:23:23,272 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:23:23,287 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:23,313 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:23:23,314 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:23,328 INFO L267 ElimStorePlain]: Start of recursive call 64: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:23,390 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:23,406 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:23,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:23,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 94 [2018-11-23 11:23:23,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-11-23 11:23:23,608 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:24,884 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:24,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-11-23 11:23:24,888 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:25,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 43 [2018-11-23 11:23:25,492 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:26,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 11:23:26,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 11:23:26,140 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:26,191 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:26,794 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 38 treesize of output 35 [2018-11-23 11:23:26,818 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:23:26,820 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:26,854 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 6 treesize of output 1 [2018-11-23 11:23:26,854 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:26,878 INFO L267 ElimStorePlain]: Start of recursive call 73: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:26,892 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 34 treesize of output 33 [2018-11-23 11:23:26,897 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:23:26,904 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:26,933 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 6 treesize of output 1 [2018-11-23 11:23:26,933 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:26,969 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:27,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-11-23 11:23:27,438 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:27,438 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:27,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 11:23:27,441 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:27,470 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 3 [2018-11-23 11:23:27,471 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:27,486 INFO L267 ElimStorePlain]: Start of recursive call 79: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:28,384 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 2 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 11:23:28,790 WARN L180 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-23 11:23:28,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 30 [2018-11-23 11:23:28,821 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:29,083 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 26 [2018-11-23 11:23:29,086 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:29,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:23:29,336 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:29,496 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 30 treesize of output 24 [2018-11-23 11:23:29,498 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:29,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 24 treesize of output 16 [2018-11-23 11:23:29,732 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:29,849 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 22 treesize of output 16 [2018-11-23 11:23:29,852 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:29,921 INFO L267 ElimStorePlain]: Start of recursive call 82: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:30,010 INFO L267 ElimStorePlain]: Start of recursive call 67: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,022 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:30,023 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:30,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2018-11-23 11:23:30,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:23:30,055 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,087 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 17 treesize of output 16 [2018-11-23 11:23:30,096 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:23:30,096 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,107 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 6 treesize of output 1 [2018-11-23 11:23:30,108 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,110 INFO L267 ElimStorePlain]: Start of recursive call 91: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,122 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,137 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:30,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 50 [2018-11-23 11:23:30,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:23:30,168 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,197 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:30,205 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-23 11:23:30,223 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:23:30,224 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,239 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:23:30,240 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,245 INFO L267 ElimStorePlain]: Start of recursive call 96: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,254 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:30,266 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:30,271 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:30,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 54 treesize of output 94 [2018-11-23 11:23:30,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-11-23 11:23:30,517 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:31,624 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:31,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 49 [2018-11-23 11:23:31,627 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:32,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-23 11:23:32,782 INFO L267 ElimStorePlain]: Start of recursive call 102: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:33,314 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 45 treesize of output 38 [2018-11-23 11:23:33,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 12 [2018-11-23 11:23:33,343 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:33,379 INFO L267 ElimStorePlain]: Start of recursive call 103: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:33,942 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 44 treesize of output 45 [2018-11-23 11:23:33,954 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 36 treesize of output 30 [2018-11-23 11:23:33,956 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-11-23 11:23:34,045 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,100 INFO L267 ElimStorePlain]: Start of recursive call 105: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,363 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 39 treesize of output 34 [2018-11-23 11:23:34,371 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:23:34,372 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,401 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:34,401 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:34,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 11:23:34,403 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,422 INFO L267 ElimStorePlain]: Start of recursive call 108: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,539 INFO L267 ElimStorePlain]: Start of recursive call 99: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:34,608 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:23:34,620 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 133 treesize of output 78 [2018-11-23 11:23:34,896 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-11-23 11:23:34,905 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 9 treesize of output 8 [2018-11-23 11:23:34,931 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:35,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:35,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 73 [2018-11-23 11:23:35,216 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 59 treesize of output 58 [2018-11-23 11:23:35,218 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:35,390 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:35,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 11:23:35,403 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:35,622 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:35,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 51 [2018-11-23 11:23:35,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 18 [2018-11-23 11:23:35,926 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:36,118 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 27 treesize of output 21 [2018-11-23 11:23:36,120 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:36,281 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 13 [2018-11-23 11:23:36,283 INFO L267 ElimStorePlain]: Start of recursive call 119: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:36,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-23 11:23:36,427 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:36,543 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 18 treesize of output 10 [2018-11-23 11:23:36,544 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:36,651 INFO L267 ElimStorePlain]: Start of recursive call 116: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:36,818 INFO L267 ElimStorePlain]: Start of recursive call 113: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:36,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:36,954 INFO L303 Elim1Store]: Index analysis took 132 ms [2018-11-23 11:23:37,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 11:23:37,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2018-11-23 11:23:37,096 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:37,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:23:37,850 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:38,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 11:23:38,547 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:39,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 43 [2018-11-23 11:23:39,277 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:40,053 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 34 treesize of output 30 [2018-11-23 11:23:40,061 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:23:40,061 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:40,088 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 6 treesize of output 1 [2018-11-23 11:23:40,089 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:40,109 INFO L267 ElimStorePlain]: Start of recursive call 127: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:40,122 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 38 treesize of output 32 [2018-11-23 11:23:40,193 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:23:40,195 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:40,234 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 6 treesize of output 1 [2018-11-23 11:23:40,235 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:40,259 INFO L267 ElimStorePlain]: Start of recursive call 130: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:40,937 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 2 case distinctions, treesize of input 38 treesize of output 46 [2018-11-23 11:23:40,952 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 36 treesize of output 30 [2018-11-23 11:23:40,954 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:41,150 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 30 treesize of output 22 [2018-11-23 11:23:41,152 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:41,361 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 11:23:41,366 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:41,613 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 33 treesize of output 27 [2018-11-23 11:23:41,614 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:41,833 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 33 treesize of output 27 [2018-11-23 11:23:41,835 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:42,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:23:42,062 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:42,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:23:42,242 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:42,392 INFO L267 ElimStorePlain]: Start of recursive call 133: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:42,952 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 42 treesize of output 40 [2018-11-23 11:23:42,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 11:23:42,984 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:43,081 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:43,111 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 30 [2018-11-23 11:23:43,118 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:43,197 INFO L267 ElimStorePlain]: Start of recursive call 141: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:43,671 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 31 treesize of output 27 [2018-11-23 11:23:43,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:23:43,683 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:43,700 INFO L267 ElimStorePlain]: Start of recursive call 144: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:44,096 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 1 case distinctions, treesize of input 38 treesize of output 36 [2018-11-23 11:23:44,143 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 11:23:44,147 INFO L267 ElimStorePlain]: Start of recursive call 147: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:44,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:23:44,273 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:44,343 INFO L267 ElimStorePlain]: Start of recursive call 146: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:23:44,708 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 3 case distinctions, treesize of input 38 treesize of output 52 [2018-11-23 11:23:45,930 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 109 DAG size of output: 108 [2018-11-23 11:23:45,943 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:45,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 11:23:45,946 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:46,546 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 11:23:46,551 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:47,075 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 26 [2018-11-23 11:23:47,079 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 4 xjuncts. [2018-11-23 11:23:47,324 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 13 [2018-11-23 11:23:47,325 INFO L267 ElimStorePlain]: Start of recursive call 153: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:47,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:23:47,947 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:48,039 INFO L267 ElimStorePlain]: Start of recursive call 149: 10 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:23:48,180 INFO L267 ElimStorePlain]: Start of recursive call 122: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:48,200 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:48,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 64 [2018-11-23 11:23:48,300 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 50 treesize of output 43 [2018-11-23 11:23:48,305 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,474 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 37 treesize of output 35 [2018-11-23 11:23:48,480 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,634 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 41 [2018-11-23 11:23:48,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 11:23:48,651 INFO L267 ElimStorePlain]: Start of recursive call 159: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:48,715 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 11:23:48,717 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,758 INFO L267 ElimStorePlain]: Start of recursive call 158: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:48,834 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 28 treesize of output 24 [2018-11-23 11:23:48,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:48,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:23:48,845 INFO L267 ElimStorePlain]: Start of recursive call 162: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,857 INFO L267 ElimStorePlain]: Start of recursive call 161: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,893 INFO L267 ElimStorePlain]: Start of recursive call 155: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:48,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:49,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 11:23:49,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 58 [2018-11-23 11:23:49,488 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:50,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:23:50,289 INFO L267 ElimStorePlain]: Start of recursive call 165: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:50,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-23 11:23:50,847 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:51,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 11:23:51,399 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:52,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:52,044 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 2 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 11:23:52,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:23:52,159 INFO L267 ElimStorePlain]: Start of recursive call 169: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:52,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 11:23:52,349 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:52,450 INFO L267 ElimStorePlain]: Start of recursive call 168: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:23:52,820 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 39 treesize of output 39 [2018-11-23 11:23:52,830 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:52,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2018-11-23 11:23:52,836 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:52,902 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 11:23:52,904 INFO L267 ElimStorePlain]: Start of recursive call 173: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:52,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 11:23:52,987 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:53,043 INFO L267 ElimStorePlain]: Start of recursive call 171: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:53,835 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 38 treesize of output 46 [2018-11-23 11:23:53,849 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 36 treesize of output 30 [2018-11-23 11:23:53,851 INFO L267 ElimStorePlain]: Start of recursive call 176: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,027 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 30 treesize of output 24 [2018-11-23 11:23:54,028 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,196 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2018-11-23 11:23:54,198 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,350 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 11:23:54,352 INFO L267 ElimStorePlain]: Start of recursive call 179: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,510 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:54,522 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 1 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 11:23:54,525 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:54,638 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:54,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-23 11:23:54,640 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:54,807 INFO L267 ElimStorePlain]: Start of recursive call 175: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:55,142 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 38 treesize of output 52 [2018-11-23 11:23:56,658 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 112 DAG size of output: 104 [2018-11-23 11:23:56,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 11:23:56,692 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:57,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:23:57,439 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:57,868 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 11:23:57,870 INFO L267 ElimStorePlain]: Start of recursive call 185: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:58,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 22 treesize of output 16 [2018-11-23 11:23:58,071 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:58,260 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 33 treesize of output 27 [2018-11-23 11:23:58,262 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:58,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 11:23:58,475 INFO L267 ElimStorePlain]: Start of recursive call 188: End of recursive call: and 2 xjuncts. [2018-11-23 11:23:58,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2018-11-23 11:23:58,611 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:58,715 INFO L267 ElimStorePlain]: Start of recursive call 182: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:58,859 INFO L267 ElimStorePlain]: Start of recursive call 163: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:23:58,959 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:23:58,967 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 134 treesize of output 79 [2018-11-23 11:23:59,219 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-11-23 11:23:59,226 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 9 treesize of output 8 [2018-11-23 11:23:59,227 INFO L267 ElimStorePlain]: Start of recursive call 191: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:59,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2018-11-23 11:23:59,366 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 22 treesize of output 24 [2018-11-23 11:23:59,368 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:59,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-23 11:23:59,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 11:23:59,414 INFO L267 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,418 INFO L267 ElimStorePlain]: Start of recursive call 194: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,430 INFO L267 ElimStorePlain]: Start of recursive call 192: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,465 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:59,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 61 [2018-11-23 11:23:59,520 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:59,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 27 [2018-11-23 11:23:59,529 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,569 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:23:59,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 11:23:59,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:23:59,582 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,603 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 3 [2018-11-23 11:23:59,605 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,618 INFO L267 ElimStorePlain]: Start of recursive call 198: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,632 INFO L267 ElimStorePlain]: Start of recursive call 196: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:23:59,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 68 [2018-11-23 11:23:59,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2018-11-23 11:23:59,774 INFO L267 ElimStorePlain]: Start of recursive call 202: End of recursive call: and 1 xjuncts. [2018-11-23 11:23:59,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-11-23 11:23:59,922 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,062 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 1 case distinctions, treesize of input 41 treesize of output 39 [2018-11-23 11:24:00,081 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-23 11:24:00,083 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:00,137 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,172 INFO L267 ElimStorePlain]: Start of recursive call 204: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:00,250 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:00,251 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2018-11-23 11:24:00,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-11-23 11:24:00,268 INFO L267 ElimStorePlain]: Start of recursive call 208: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,281 INFO L267 ElimStorePlain]: Start of recursive call 207: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,315 INFO L267 ElimStorePlain]: Start of recursive call 201: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,324 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:24:00,325 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,340 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 48 treesize of output 39 [2018-11-23 11:24:00,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:24:00,356 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,375 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:24:00,381 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:24:00,382 INFO L267 ElimStorePlain]: Start of recursive call 213: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,384 INFO L267 ElimStorePlain]: Start of recursive call 212: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,397 INFO L267 ElimStorePlain]: Start of recursive call 210: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:00,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2018-11-23 11:24:00,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 11:24:00,430 INFO L267 ElimStorePlain]: Start of recursive call 215: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,456 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:24:00,461 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:24:00,461 INFO L267 ElimStorePlain]: Start of recursive call 217: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,464 INFO L267 ElimStorePlain]: Start of recursive call 216: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,476 INFO L267 ElimStorePlain]: Start of recursive call 214: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,527 INFO L267 ElimStorePlain]: Start of recursive call 190: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:00,550 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 132 treesize of output 77 [2018-11-23 11:24:00,804 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-11-23 11:24:00,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:24:00,818 INFO L267 ElimStorePlain]: Start of recursive call 219: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:00,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:01,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 11:24:01,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-23 11:24:01,058 INFO L267 ElimStorePlain]: Start of recursive call 221: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-23 11:24:01,197 INFO L267 ElimStorePlain]: Start of recursive call 222: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,349 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 38 treesize of output 41 [2018-11-23 11:24:01,363 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-23 11:24:01,366 INFO L267 ElimStorePlain]: Start of recursive call 224: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,439 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 25 treesize of output 19 [2018-11-23 11:24:01,441 INFO L267 ElimStorePlain]: Start of recursive call 225: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:01,508 INFO L267 ElimStorePlain]: Start of recursive call 226: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,568 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 19 treesize of output 13 [2018-11-23 11:24:01,570 INFO L267 ElimStorePlain]: Start of recursive call 227: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:01,638 INFO L267 ElimStorePlain]: Start of recursive call 228: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,668 INFO L267 ElimStorePlain]: Start of recursive call 223: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,760 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 35 treesize of output 30 [2018-11-23 11:24:01,769 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 6 treesize of output 1 [2018-11-23 11:24:01,769 INFO L267 ElimStorePlain]: Start of recursive call 230: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:24:01,800 INFO L267 ElimStorePlain]: Start of recursive call 231: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,808 INFO L267 ElimStorePlain]: Start of recursive call 229: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,838 INFO L267 ElimStorePlain]: Start of recursive call 220: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:01,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 59 [2018-11-23 11:24:01,924 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 9 treesize of output 8 [2018-11-23 11:24:01,926 INFO L267 ElimStorePlain]: Start of recursive call 233: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:01,966 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:02,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2018-11-23 11:24:02,047 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 38 treesize of output 27 [2018-11-23 11:24:02,049 INFO L267 ElimStorePlain]: Start of recursive call 235: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,122 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 24 treesize of output 18 [2018-11-23 11:24:02,124 INFO L267 ElimStorePlain]: Start of recursive call 236: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,184 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-23 11:24:02,185 INFO L267 ElimStorePlain]: Start of recursive call 237: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:02,242 INFO L267 ElimStorePlain]: Start of recursive call 238: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,282 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 13 treesize of output 7 [2018-11-23 11:24:02,284 INFO L267 ElimStorePlain]: Start of recursive call 239: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,306 INFO L267 ElimStorePlain]: Start of recursive call 234: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,316 INFO L267 ElimStorePlain]: Start of recursive call 232: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,329 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:02,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-11-23 11:24:02,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:24:02,401 INFO L267 ElimStorePlain]: Start of recursive call 241: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,433 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 17 treesize of output 16 [2018-11-23 11:24:02,441 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 6 treesize of output 1 [2018-11-23 11:24:02,442 INFO L267 ElimStorePlain]: Start of recursive call 243: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,454 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 6 treesize of output 1 [2018-11-23 11:24:02,455 INFO L267 ElimStorePlain]: Start of recursive call 244: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,459 INFO L267 ElimStorePlain]: Start of recursive call 242: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,471 INFO L267 ElimStorePlain]: Start of recursive call 240: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:02,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:02,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 11:24:02,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 55 [2018-11-23 11:24:02,655 INFO L267 ElimStorePlain]: Start of recursive call 246: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:02,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-11-23 11:24:02,855 INFO L267 ElimStorePlain]: Start of recursive call 247: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:03,019 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 31 treesize of output 30 [2018-11-23 11:24:03,028 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 6 treesize of output 1 [2018-11-23 11:24:03,029 INFO L267 ElimStorePlain]: Start of recursive call 249: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:03,052 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:24:03,053 INFO L267 ElimStorePlain]: Start of recursive call 250: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:03,070 INFO L267 ElimStorePlain]: Start of recursive call 248: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:03,082 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 35 treesize of output 32 [2018-11-23 11:24:03,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:24:03,105 INFO L267 ElimStorePlain]: Start of recursive call 252: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:03,139 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 6 treesize of output 1 [2018-11-23 11:24:03,140 INFO L267 ElimStorePlain]: Start of recursive call 253: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:03,164 INFO L267 ElimStorePlain]: Start of recursive call 251: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:03,365 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 2 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 11:24:03,423 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 11:24:03,428 INFO L267 ElimStorePlain]: Start of recursive call 255: End of recursive call: and 4 xjuncts. [2018-11-23 11:24:03,640 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 11:24:03,642 INFO L267 ElimStorePlain]: Start of recursive call 256: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:03,819 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 30 treesize of output 24 [2018-11-23 11:24:03,825 INFO L267 ElimStorePlain]: Start of recursive call 257: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,007 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 19 treesize of output 13 [2018-11-23 11:24:04,010 INFO L267 ElimStorePlain]: Start of recursive call 258: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:04,231 INFO L267 ElimStorePlain]: Start of recursive call 259: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,281 INFO L267 ElimStorePlain]: Start of recursive call 254: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:04,321 INFO L267 ElimStorePlain]: Start of recursive call 245: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,371 INFO L267 ElimStorePlain]: Start of recursive call 218: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:04,386 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 132 treesize of output 77 [2018-11-23 11:24:04,658 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2018-11-23 11:24:04,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:24:04,668 INFO L267 ElimStorePlain]: Start of recursive call 261: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:04,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 64 [2018-11-23 11:24:04,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 43 [2018-11-23 11:24:04,856 INFO L267 ElimStorePlain]: Start of recursive call 263: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:04,986 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 37 treesize of output 35 [2018-11-23 11:24:04,989 INFO L267 ElimStorePlain]: Start of recursive call 264: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,109 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 31 treesize of output 27 [2018-11-23 11:24:05,150 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 6 treesize of output 1 [2018-11-23 11:24:05,151 INFO L267 ElimStorePlain]: Start of recursive call 266: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,172 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:24:05,173 INFO L267 ElimStorePlain]: Start of recursive call 267: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,185 INFO L267 ElimStorePlain]: Start of recursive call 265: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,311 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 41 [2018-11-23 11:24:05,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-11-23 11:24:05,328 INFO L267 ElimStorePlain]: Start of recursive call 269: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:05,390 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 11:24:05,391 INFO L267 ElimStorePlain]: Start of recursive call 270: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,431 INFO L267 ElimStorePlain]: Start of recursive call 268: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:05,494 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 28 treesize of output 24 [2018-11-23 11:24:05,505 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:05,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:24:05,507 INFO L267 ElimStorePlain]: Start of recursive call 272: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,518 INFO L267 ElimStorePlain]: Start of recursive call 271: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,541 INFO L267 ElimStorePlain]: Start of recursive call 262: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:05,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 73 [2018-11-23 11:24:05,685 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 59 treesize of output 58 [2018-11-23 11:24:05,687 INFO L267 ElimStorePlain]: Start of recursive call 274: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,828 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:05,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 57 [2018-11-23 11:24:05,830 INFO L267 ElimStorePlain]: Start of recursive call 275: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:05,961 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:05,994 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 50 treesize of output 50 [2018-11-23 11:24:06,005 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 45 treesize of output 37 [2018-11-23 11:24:06,007 INFO L267 ElimStorePlain]: Start of recursive call 277: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,094 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:24:06,096 INFO L267 ElimStorePlain]: Start of recursive call 278: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-11-23 11:24:06,170 INFO L267 ElimStorePlain]: Start of recursive call 279: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,229 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 11:24:06,230 INFO L267 ElimStorePlain]: Start of recursive call 280: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 11:24:06,281 INFO L267 ElimStorePlain]: Start of recursive call 281: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,303 INFO L267 ElimStorePlain]: Start of recursive call 276: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,396 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:06,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 11:24:06,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:24:06,411 INFO L267 ElimStorePlain]: Start of recursive call 283: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,431 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:24:06,432 INFO L267 ElimStorePlain]: Start of recursive call 284: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,442 INFO L267 ElimStorePlain]: Start of recursive call 282: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,471 INFO L267 ElimStorePlain]: Start of recursive call 273: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:06,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:06,641 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 11:24:06,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 11:24:06,681 INFO L267 ElimStorePlain]: Start of recursive call 286: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:07,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 11:24:07,302 INFO L267 ElimStorePlain]: Start of recursive call 287: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:07,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2018-11-23 11:24:07,937 INFO L267 ElimStorePlain]: Start of recursive call 288: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:08,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-23 11:24:08,609 INFO L267 ElimStorePlain]: Start of recursive call 289: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:09,222 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 42 treesize of output 40 [2018-11-23 11:24:09,246 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 31 treesize of output 17 [2018-11-23 11:24:09,249 INFO L267 ElimStorePlain]: Start of recursive call 291: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:09,288 INFO L267 ElimStorePlain]: Start of recursive call 290: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:09,728 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 38 treesize of output 46 [2018-11-23 11:24:09,746 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 11:24:09,747 INFO L267 ElimStorePlain]: Start of recursive call 293: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:09,920 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:09,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-23 11:24:09,922 INFO L267 ElimStorePlain]: Start of recursive call 294: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:10,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:10,115 INFO L267 ElimStorePlain]: Start of recursive call 295: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:10,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:10,372 INFO L267 ElimStorePlain]: Start of recursive call 296: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:10,414 INFO L267 ElimStorePlain]: Start of recursive call 292: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:10,876 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 35 treesize of output 35 [2018-11-23 11:24:10,889 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:10,891 INFO L267 ElimStorePlain]: Start of recursive call 298: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:10,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-23 11:24:10,958 INFO L267 ElimStorePlain]: Start of recursive call 299: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,016 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 27 treesize of output 13 [2018-11-23 11:24:11,018 INFO L267 ElimStorePlain]: Start of recursive call 300: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,037 INFO L267 ElimStorePlain]: Start of recursive call 297: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,107 INFO L267 ElimStorePlain]: Start of recursive call 285: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:11,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:11,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 51 treesize of output 80 [2018-11-23 11:24:11,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 62 [2018-11-23 11:24:11,682 INFO L267 ElimStorePlain]: Start of recursive call 302: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:12,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 43 [2018-11-23 11:24:12,568 INFO L267 ElimStorePlain]: Start of recursive call 303: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:13,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 45 [2018-11-23 11:24:13,407 INFO L267 ElimStorePlain]: Start of recursive call 304: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:14,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:24:14,185 INFO L267 ElimStorePlain]: Start of recursive call 305: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:14,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 11:24:14,943 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:14,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-11-23 11:24:14,944 INFO L267 ElimStorePlain]: Start of recursive call 307: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:14,975 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-11-23 11:24:14,976 INFO L267 ElimStorePlain]: Start of recursive call 308: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:14,994 INFO L267 ElimStorePlain]: Start of recursive call 306: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:15,714 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 2 case distinctions, treesize of input 41 treesize of output 47 [2018-11-23 11:24:15,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 27 [2018-11-23 11:24:15,752 INFO L267 ElimStorePlain]: Start of recursive call 310: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:15,945 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-11-23 11:24:15,949 INFO L267 ElimStorePlain]: Start of recursive call 311: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:15,953 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 11:24:15,955 INFO L267 ElimStorePlain]: Start of recursive call 312: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:16,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:16,125 INFO L267 ElimStorePlain]: Start of recursive call 313: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:16,338 INFO L267 ElimStorePlain]: Start of recursive call 309: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:16,800 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 3 case distinctions, treesize of input 38 treesize of output 52 [2018-11-23 11:24:18,496 WARN L180 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 112 DAG size of output: 108 [2018-11-23 11:24:18,518 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:18,530 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 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:18,533 INFO L267 ElimStorePlain]: Start of recursive call 315: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:19,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:19,028 INFO L267 ElimStorePlain]: Start of recursive call 316: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:19,434 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 11:24:19,436 INFO L267 ElimStorePlain]: Start of recursive call 317: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:19,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:19,449 INFO L267 ElimStorePlain]: Start of recursive call 318: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:19,974 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 11:24:19,977 INFO L267 ElimStorePlain]: Start of recursive call 319: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:20,213 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:20,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 11:24:20,215 INFO L267 ElimStorePlain]: Start of recursive call 320: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:20,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:24:20,334 INFO L267 ElimStorePlain]: Start of recursive call 321: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:20,385 INFO L267 ElimStorePlain]: Start of recursive call 314: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:20,726 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 26 treesize of output 22 [2018-11-23 11:24:20,733 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:24:20,734 INFO L267 ElimStorePlain]: Start of recursive call 323: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:20,761 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-11-23 11:24:20,762 INFO L267 ElimStorePlain]: Start of recursive call 324: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:20,776 INFO L267 ElimStorePlain]: Start of recursive call 322: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,082 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 23 treesize of output 19 [2018-11-23 11:24:21,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-23 11:24:21,093 INFO L267 ElimStorePlain]: Start of recursive call 326: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,105 INFO L267 ElimStorePlain]: Start of recursive call 325: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,125 INFO L267 ElimStorePlain]: Start of recursive call 301: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,173 INFO L267 ElimStorePlain]: Start of recursive call 260: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:21,191 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 133 treesize of output 78 [2018-11-23 11:24:21,404 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 44 [2018-11-23 11:24:21,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-11-23 11:24:21,412 INFO L267 ElimStorePlain]: Start of recursive call 328: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,501 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:21,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2018-11-23 11:24:21,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 11:24:21,538 INFO L267 ElimStorePlain]: Start of recursive call 330: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,583 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 21 treesize of output 18 [2018-11-23 11:24:21,588 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 3 [2018-11-23 11:24:21,589 INFO L267 ElimStorePlain]: Start of recursive call 332: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,598 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:24:21,599 INFO L267 ElimStorePlain]: Start of recursive call 333: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,602 INFO L267 ElimStorePlain]: Start of recursive call 331: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,611 INFO L267 ElimStorePlain]: Start of recursive call 329: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,631 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:21,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 11:24:21,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 11:24:21,749 INFO L267 ElimStorePlain]: Start of recursive call 335: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:21,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2018-11-23 11:24:21,925 INFO L267 ElimStorePlain]: Start of recursive call 336: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:22,089 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 35 treesize of output 32 [2018-11-23 11:24:22,110 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 8 [2018-11-23 11:24:22,112 INFO L267 ElimStorePlain]: Start of recursive call 338: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:22,143 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:24:22,144 INFO L267 ElimStorePlain]: Start of recursive call 339: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:22,164 INFO L267 ElimStorePlain]: Start of recursive call 337: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:22,176 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 31 treesize of output 30 [2018-11-23 11:24:22,183 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:24:22,183 INFO L267 ElimStorePlain]: Start of recursive call 341: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:22,210 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:24:22,210 INFO L267 ElimStorePlain]: Start of recursive call 342: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:22,225 INFO L267 ElimStorePlain]: Start of recursive call 340: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:22,399 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 2 case distinctions, treesize of input 38 treesize of output 47 [2018-11-23 11:24:22,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:22,417 INFO L267 ElimStorePlain]: Start of recursive call 344: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:22,600 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 0 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2018-11-23 11:24:22,607 INFO L267 ElimStorePlain]: Start of recursive call 345: End of recursive call: and 8 xjuncts. [2018-11-23 11:24:22,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:22,855 INFO L267 ElimStorePlain]: Start of recursive call 346: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:24:23,101 INFO L267 ElimStorePlain]: Start of recursive call 347: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,104 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 17 treesize of output 11 [2018-11-23 11:24:23,108 INFO L267 ElimStorePlain]: Start of recursive call 348: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 11:24:23,288 INFO L267 ElimStorePlain]: Start of recursive call 349: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:23,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, 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 13 [2018-11-23 11:24:23,405 INFO L267 ElimStorePlain]: Start of recursive call 350: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,475 INFO L267 ElimStorePlain]: Start of recursive call 343: 6 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:24:23,585 INFO L267 ElimStorePlain]: Start of recursive call 334: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:23,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:23,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 59 [2018-11-23 11:24:23,673 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 9 treesize of output 8 [2018-11-23 11:24:23,674 INFO L267 ElimStorePlain]: Start of recursive call 352: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,711 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:23,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 47 [2018-11-23 11:24:23,762 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 42 treesize of output 34 [2018-11-23 11:24:23,764 INFO L267 ElimStorePlain]: Start of recursive call 354: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,832 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 24 treesize of output 16 [2018-11-23 11:24:23,834 INFO L267 ElimStorePlain]: Start of recursive call 355: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,891 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 29 treesize of output 23 [2018-11-23 11:24:23,894 INFO L267 ElimStorePlain]: Start of recursive call 356: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 11:24:23,941 INFO L267 ElimStorePlain]: Start of recursive call 357: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:23,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 15 [2018-11-23 11:24:24,001 INFO L267 ElimStorePlain]: Start of recursive call 358: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:24,044 INFO L267 ElimStorePlain]: Start of recursive call 353: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:24,093 INFO L267 ElimStorePlain]: Start of recursive call 351: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:24,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:24,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 51 treesize of output 66 [2018-11-23 11:24:24,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-11-23 11:24:24,262 INFO L267 ElimStorePlain]: Start of recursive call 360: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:24,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-23 11:24:24,505 INFO L267 ElimStorePlain]: Start of recursive call 361: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:24,686 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 38 treesize of output 47 [2018-11-23 11:24:24,711 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 11:24:24,713 INFO L267 ElimStorePlain]: Start of recursive call 363: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:24,887 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 23 [2018-11-23 11:24:24,890 INFO L267 ElimStorePlain]: Start of recursive call 364: End of recursive call: and 4 xjuncts. [2018-11-23 11:24:25,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2018-11-23 11:24:25,109 INFO L267 ElimStorePlain]: Start of recursive call 365: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:25,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 16 [2018-11-23 11:24:25,227 INFO L267 ElimStorePlain]: Start of recursive call 366: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:25,306 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 19 treesize of output 13 [2018-11-23 11:24:25,307 INFO L267 ElimStorePlain]: Start of recursive call 367: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:25,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 11:24:25,378 INFO L267 ElimStorePlain]: Start of recursive call 368: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:25,422 INFO L267 ElimStorePlain]: Start of recursive call 362: 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:25,562 INFO L267 ElimStorePlain]: Start of recursive call 359: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:25,654 INFO L267 ElimStorePlain]: Start of recursive call 327: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:24:26,137 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 116 treesize of output 69 [2018-11-23 11:24:26,287 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-11-23 11:24:26,292 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 9 treesize of output 8 [2018-11-23 11:24:26,293 INFO L267 ElimStorePlain]: Start of recursive call 370: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:26,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 48 [2018-11-23 11:24:26,467 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 9 treesize of output 8 [2018-11-23 11:24:26,468 INFO L267 ElimStorePlain]: Start of recursive call 372: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:26,528 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 32 treesize of output 38 [2018-11-23 11:24:26,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:26,542 INFO L267 ElimStorePlain]: Start of recursive call 374: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:26,605 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 27 treesize of output 21 [2018-11-23 11:24:26,607 INFO L267 ElimStorePlain]: Start of recursive call 375: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:26,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-11-23 11:24:26,654 INFO L267 ElimStorePlain]: Start of recursive call 376: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:26,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:24:26,694 INFO L267 ElimStorePlain]: Start of recursive call 377: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:26,727 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 13 treesize of output 7 [2018-11-23 11:24:26,729 INFO L267 ElimStorePlain]: Start of recursive call 378: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:26,753 INFO L267 ElimStorePlain]: Start of recursive call 373: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:26,781 INFO L267 ElimStorePlain]: Start of recursive call 371: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:26,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 72 [2018-11-23 11:24:27,200 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 61 [2018-11-23 11:24:27,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:24:27,209 INFO L267 ElimStorePlain]: Start of recursive call 380: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 39 [2018-11-23 11:24:27,338 INFO L267 ElimStorePlain]: Start of recursive call 381: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,447 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 36 treesize of output 31 [2018-11-23 11:24:27,466 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:27,469 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:24:27,471 INFO L267 ElimStorePlain]: Start of recursive call 383: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,495 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:24:27,496 INFO L267 ElimStorePlain]: Start of recursive call 384: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,508 INFO L267 ElimStorePlain]: Start of recursive call 382: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,645 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 35 treesize of output 46 [2018-11-23 11:24:27,691 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 36 treesize of output 30 [2018-11-23 11:24:27,693 INFO L267 ElimStorePlain]: Start of recursive call 386: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,843 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:27,844 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:27,847 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 24 treesize of output 13 [2018-11-23 11:24:27,849 INFO L267 ElimStorePlain]: Start of recursive call 387: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:27,983 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 11:24:27,985 INFO L267 ElimStorePlain]: Start of recursive call 388: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,105 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:28,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:28,111 INFO L267 ElimStorePlain]: Start of recursive call 389: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-11-23 11:24:28,219 INFO L267 ElimStorePlain]: Start of recursive call 390: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,292 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 27 treesize of output 21 [2018-11-23 11:24:28,293 INFO L267 ElimStorePlain]: Start of recursive call 391: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 10 [2018-11-23 11:24:28,407 INFO L267 ElimStorePlain]: Start of recursive call 392: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,442 INFO L267 ElimStorePlain]: Start of recursive call 385: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:28,509 INFO L267 ElimStorePlain]: Start of recursive call 379: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:28,569 INFO L267 ElimStorePlain]: Start of recursive call 369: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:28,579 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 116 treesize of output 69 [2018-11-23 11:24:28,756 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2018-11-23 11:24:28,761 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 9 treesize of output 8 [2018-11-23 11:24:28,762 INFO L267 ElimStorePlain]: Start of recursive call 394: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:28,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 86 [2018-11-23 11:24:30,943 WARN L180 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 208 DAG size of output: 185 [2018-11-23 11:24:30,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 41 [2018-11-23 11:24:30,957 INFO L267 ElimStorePlain]: Start of recursive call 396: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:31,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-11-23 11:24:31,776 INFO L267 ElimStorePlain]: Start of recursive call 397: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:32,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2018-11-23 11:24:32,445 INFO L267 ElimStorePlain]: Start of recursive call 398: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:33,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 42 [2018-11-23 11:24:33,130 INFO L267 ElimStorePlain]: Start of recursive call 399: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:33,830 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 63 treesize of output 61 [2018-11-23 11:24:34,255 WARN L180 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 56 [2018-11-23 11:24:34,266 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 11:24:34,267 INFO L267 ElimStorePlain]: Start of recursive call 401: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:34,434 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 22 treesize of output 16 [2018-11-23 11:24:34,436 INFO L267 ElimStorePlain]: Start of recursive call 402: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:34,589 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-11-23 11:24:34,595 INFO L267 ElimStorePlain]: Start of recursive call 403: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:34,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:34,722 INFO L267 ElimStorePlain]: Start of recursive call 404: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:34,838 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:34,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 16 [2018-11-23 11:24:34,840 INFO L267 ElimStorePlain]: Start of recursive call 405: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:34,935 INFO L267 ElimStorePlain]: Start of recursive call 400: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:35,427 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 54 [2018-11-23 11:24:35,653 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 41 [2018-11-23 11:24:35,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2018-11-23 11:24:35,680 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 24 treesize of output 13 [2018-11-23 11:24:35,704 INFO L267 ElimStorePlain]: Start of recursive call 408: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:35,726 INFO L267 ElimStorePlain]: Start of recursive call 407: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:35,735 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:35,740 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:35,740 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:35,741 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:35,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:24:35,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 67 [2018-11-23 11:24:36,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2018-11-23 11:24:36,071 INFO L267 ElimStorePlain]: Start of recursive call 410: End of recursive call: and 2 xjuncts. [2018-11-23 11:24:36,138 INFO L267 ElimStorePlain]: Start of recursive call 409: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:36,194 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:36,197 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 28 treesize of output 17 [2018-11-23 11:24:36,199 INFO L267 ElimStorePlain]: Start of recursive call 411: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:36,230 INFO L267 ElimStorePlain]: Start of recursive call 406: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:36,882 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 60 treesize of output 50 [2018-11-23 11:24:37,015 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2018-11-23 11:24:37,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:37,026 INFO L267 ElimStorePlain]: Start of recursive call 413: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:37,075 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:37,078 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 24 treesize of output 13 [2018-11-23 11:24:37,080 INFO L267 ElimStorePlain]: Start of recursive call 414: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:37,105 INFO L267 ElimStorePlain]: Start of recursive call 412: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:24:37,539 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 60 treesize of output 66 [2018-11-23 11:24:38,823 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 186 DAG size of output: 104 [2018-11-23 11:24:38,862 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-11-23 11:24:38,863 INFO L267 ElimStorePlain]: Start of recursive call 416: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:39,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 11:24:39,291 INFO L267 ElimStorePlain]: Start of recursive call 417: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:39,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 16 [2018-11-23 11:24:39,638 INFO L267 ElimStorePlain]: Start of recursive call 418: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:39,966 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:39,969 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 27 treesize of output 16 [2018-11-23 11:24:39,970 INFO L267 ElimStorePlain]: Start of recursive call 419: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:40,450 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:40,453 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 24 treesize of output 13 [2018-11-23 11:24:40,454 INFO L267 ElimStorePlain]: Start of recursive call 420: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:40,620 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:24:40,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 11:24:40,625 INFO L267 ElimStorePlain]: Start of recursive call 421: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-11-23 11:24:40,695 INFO L267 ElimStorePlain]: Start of recursive call 422: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:40,734 INFO L267 ElimStorePlain]: Start of recursive call 415: 10 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:40,835 INFO L267 ElimStorePlain]: Start of recursive call 395: 4 dim-1 vars, 9 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:40,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 62 [2018-11-23 11:24:41,305 WARN L180 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2018-11-23 11:24:41,312 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 39 treesize of output 38 [2018-11-23 11:24:41,314 INFO L267 ElimStorePlain]: Start of recursive call 424: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:41,472 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 40 treesize of output 39 [2018-11-23 11:24:41,474 INFO L267 ElimStorePlain]: Start of recursive call 425: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:41,632 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 38 treesize of output 38 [2018-11-23 11:24:41,645 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 33 treesize of output 25 [2018-11-23 11:24:41,647 INFO L267 ElimStorePlain]: Start of recursive call 427: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:41,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 11:24:41,724 INFO L267 ElimStorePlain]: Start of recursive call 428: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:41,793 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 19 treesize of output 13 [2018-11-23 11:24:41,794 INFO L267 ElimStorePlain]: Start of recursive call 429: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:41,859 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 25 treesize of output 19 [2018-11-23 11:24:41,860 INFO L267 ElimStorePlain]: Start of recursive call 430: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:41,912 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 19 treesize of output 13 [2018-11-23 11:24:41,913 INFO L267 ElimStorePlain]: Start of recursive call 431: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:41,958 INFO L267 ElimStorePlain]: Start of recursive call 426: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:42,137 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 35 treesize of output 43 [2018-11-23 11:24:42,158 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 33 treesize of output 25 [2018-11-23 11:24:42,160 INFO L267 ElimStorePlain]: Start of recursive call 433: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:42,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 11:24:42,314 INFO L267 ElimStorePlain]: Start of recursive call 434: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:42,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2018-11-23 11:24:42,477 INFO L267 ElimStorePlain]: Start of recursive call 435: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:42,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2018-11-23 11:24:42,608 INFO L267 ElimStorePlain]: Start of recursive call 436: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:42,732 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 25 treesize of output 19 [2018-11-23 11:24:42,733 INFO L267 ElimStorePlain]: Start of recursive call 437: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:42,851 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 19 treesize of output 13 [2018-11-23 11:24:42,852 INFO L267 ElimStorePlain]: Start of recursive call 438: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:42,956 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 18 treesize of output 10 [2018-11-23 11:24:42,957 INFO L267 ElimStorePlain]: Start of recursive call 439: End of recursive call: and 1 xjuncts. [2018-11-23 11:24:43,031 INFO L267 ElimStorePlain]: Start of recursive call 432: 8 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:43,116 INFO L267 ElimStorePlain]: Start of recursive call 423: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:24:43,181 INFO L267 ElimStorePlain]: Start of recursive call 393: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:24:43,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-11-23 11:24:43,588 INFO L202 ElimStorePlain]: Needed 439 recursive calls to eliminate 10 variables, input treesize:541, output treesize:81 [2018-11-23 11:24:43,645 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:24:43,645 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, v_sll_create_~new_head~0.base_27, |main_~#s~0.base|, |main_~#s~0.offset|, |#memory_$Pointer$.offset|, v_prenex_11, v_prenex_9, v_prenex_8, v_prenex_7, v_prenex_10]. (and (let ((.cse3 (let ((.cse5 (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)))) (store .cse5 v_sll_create_~new_head~0.base_27 (store (select .cse5 v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~new_head~0.offset)))) (.cse2 (let ((.cse4 (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)))) (store .cse4 v_sll_create_~new_head~0.base_27 (store (select .cse4 v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~new_head~0.base))))) (let ((.cse0 (select (select .cse2 |main_~#s~0.base|) |main_~#s~0.offset|)) (.cse1 (select (select .cse3 |main_~#s~0.base|) |main_~#s~0.offset|))) (or (not (= .cse0 v_sll_create_~new_head~0.base_27)) (not (= (_ bv0 32) .cse1)) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))) (= (select (select .cse2 (select (select .cse2 .cse0) .cse1)) (select (select .cse3 .cse0) .cse1)) (_ bv0 32))))) (let ((.cse8 (let ((.cse11 (store v_prenex_11 sll_create_~new_head~0.base (store (select v_prenex_11 sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)))) (store .cse11 v_prenex_9 (store (select .cse11 v_prenex_9) (_ bv0 32) sll_create_~new_head~0.base)))) (.cse7 (let ((.cse10 (store v_prenex_10 sll_create_~new_head~0.base (store (select v_prenex_10 sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)))) (store .cse10 v_prenex_9 (store (select .cse10 v_prenex_9) (_ bv0 32) sll_create_~new_head~0.offset))))) (let ((.cse6 (select (select .cse7 v_prenex_8) v_prenex_7)) (.cse9 (select (select .cse8 v_prenex_8) v_prenex_7))) (or (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) .cse6)) (= (select (select .cse7 (select (select .cse8 .cse9) .cse6)) (select (select .cse7 .cse9) .cse6)) (_ bv0 32)) (not (= .cse9 v_prenex_9)))))) [2018-11-23 11:24:43,645 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_sll_create_~new_head~0.base_27, v_prenex_233, v_prenex_9, v_prenex_232]. (let ((.cse0 (= sll_create_~new_head~0.offset (_ bv0 32))) (.cse1 (= sll_create_~head~0.base (_ bv0 32))) (.cse2 (= (_ bv0 32) sll_create_~head~0.offset))) (and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not .cse0) (= (_ bv0 32) sll_create_~new_head~0.base)) (or .cse0 (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))) .cse1) (or (not (= (select |#valid| v_prenex_233) (_ bv0 1))) .cse1 (= v_prenex_233 sll_create_~new_head~0.base)) (or .cse0 (not (= (select |#valid| v_prenex_9) (_ bv0 1))) .cse2) (or (not .cse2) .cse1 (not (= (select |#valid| sll_create_~head~0.base) (_ bv0 1)))) (or (= v_prenex_232 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_232) (_ bv0 1))) .cse2))) [2018-11-23 11:24:43,903 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-11-23 11:24:44,007 INFO L273 TraceCheckUtils]: 47: Hoare triple {5699#false} assume !false; {5699#false} is VALID [2018-11-23 11:24:44,008 INFO L273 TraceCheckUtils]: 46: Hoare triple {5699#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {5699#false} is VALID [2018-11-23 11:24:44,009 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} {5864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (_ bv0 32)))} #153#return; {5699#false} is VALID [2018-11-23 11:24:44,020 INFO L273 TraceCheckUtils]: 44: Hoare triple {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume true; {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:44,032 INFO L273 TraceCheckUtils]: 43: Hoare triple {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} #res := ~len~0; {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:44,045 INFO L273 TraceCheckUtils]: 42: Hoare triple {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:44,058 INFO L273 TraceCheckUtils]: 41: Hoare triple {5881#(or (and (= sll_length_~head.offset (_ bv0 32)) (= (_ bv0 32) sll_length_~head.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5868#(or (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:44,071 INFO L273 TraceCheckUtils]: 40: Hoare triple {5885#(or (and (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5881#(or (and (= sll_length_~head.offset (_ bv0 32)) (= (_ bv0 32) sll_length_~head.base)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:44,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {5889#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {5885#(or (and (= (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:44,096 INFO L273 TraceCheckUtils]: 38: Hoare triple {5698#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {5889#(or (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| sll_length_~head.base) sll_length_~head.offset)) (select (select |#memory_$Pointer$.offset| sll_length_~head.base) sll_length_~head.offset)))) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (select (select |#memory_$Pointer$.offset| |sll_length_#in~head.base|) |sll_length_#in~head.offset|)) (_ bv0 32))))} is VALID [2018-11-23 11:24:44,097 INFO L256 TraceCheckUtils]: 37: Hoare triple {5864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (_ bv0 32)))} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {5698#true} is VALID [2018-11-23 11:24:44,109 INFO L273 TraceCheckUtils]: 36: Hoare triple {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {5864#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) |main_#t~mem18.offset|)) (_ bv0 32)))} is VALID [2018-11-23 11:24:44,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} assume !~bvslt32(~i~0, ~k~0); {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:24:44,135 INFO L273 TraceCheckUtils]: 34: Hoare triple {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:24:44,148 INFO L268 TraceCheckUtils]: 33: Hoare quadruple {5698#true} {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} #147#return; {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:24:44,148 INFO L273 TraceCheckUtils]: 32: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:24:44,148 INFO L273 TraceCheckUtils]: 31: Hoare triple {5698#true} #res := ~len~1; {5698#true} is VALID [2018-11-23 11:24:44,148 INFO L273 TraceCheckUtils]: 30: Hoare triple {5698#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5698#true} is VALID [2018-11-23 11:24:44,149 INFO L273 TraceCheckUtils]: 29: Hoare triple {5698#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5698#true} is VALID [2018-11-23 11:24:44,149 INFO L256 TraceCheckUtils]: 28: Hoare triple {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {5698#true} is VALID [2018-11-23 11:24:44,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {5924#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.base|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7) |main_#t~ret14.base|)) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) |main_#t~ret14.offset|)))))} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {5896#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))))} is VALID [2018-11-23 11:24:44,175 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {5931#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.offset|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= |sll_create_#res.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))) (not (= |sll_create_#res.offset| (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))))))} {5698#true} #145#return; {5924#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.offset|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |main_#t~ret14.base|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7) |main_#t~ret14.base|)) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) |main_#t~ret14.offset|)))))} is VALID [2018-11-23 11:24:44,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {5931#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.offset|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= |sll_create_#res.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))) (not (= |sll_create_#res.offset| (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))))))} assume true; {5931#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.offset|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= |sll_create_#res.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))) (not (= |sll_create_#res.offset| (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))))))} is VALID [2018-11-23 11:24:44,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {5931#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) |sll_create_#res.offset|)))) (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= |sll_create_#res.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))) (not (= |sll_create_#res.offset| (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))))))} is VALID [2018-11-23 11:24:44,218 INFO L273 TraceCheckUtils]: 23: Hoare triple {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} is VALID [2018-11-23 11:24:44,231 INFO L273 TraceCheckUtils]: 22: Hoare triple {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} is VALID [2018-11-23 11:24:44,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {5948#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.offset)) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.base)))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5938#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7)) (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7)))) (not (= (select (select |#memory_$Pointer$.offset| v_prenex_8) v_prenex_7) sll_create_~head~0.offset)) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| v_prenex_8) v_prenex_7))))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (not (= (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~head~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select |#memory_$Pointer$.offset| |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= sll_create_~head~0.base (select (select |#memory_$Pointer$.base| |main_~#s~0.base|) |main_~#s~0.offset|))))))} is VALID [2018-11-23 11:24:44,332 INFO L273 TraceCheckUtils]: 20: Hoare triple {5948#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.offset)) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.base)))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5948#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.offset)) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.base)))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))))))} is VALID [2018-11-23 11:24:44,669 INFO L273 TraceCheckUtils]: 19: Hoare triple {5955#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (v_sll_create_~new_head~0.base_27 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= v_sll_create_~new_head~0.base_27 (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (not (= (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7) v_prenex_9)))))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {5948#(and (forall ((v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.offset)) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) v_prenex_8) v_prenex_7) sll_create_~new_head~0.base)))) (forall ((|main_~#s~0.offset| (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|)))) (not (= (select (select (store |#memory_$Pointer$.base| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.base| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|) sll_create_~new_head~0.base)) (not (= sll_create_~new_head~0.offset (select (select (store |#memory_$Pointer$.offset| sll_create_~new_head~0.base (store (select |#memory_$Pointer$.offset| sll_create_~new_head~0.base) sll_create_~new_head~0.offset sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))))))} is VALID [2018-11-23 11:24:44,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {5955#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (v_sll_create_~new_head~0.base_27 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= v_sll_create_~new_head~0.base_27 (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (not (= (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7) v_prenex_9)))))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5955#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (v_sll_create_~new_head~0.base_27 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= v_sll_create_~new_head~0.base_27 (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (not (= (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7) v_prenex_9)))))} is VALID [2018-11-23 11:24:44,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {5962#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_232 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_232) (_ bv0 1))) (= v_prenex_232 sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (forall ((v_prenex_233 (_ BitVec 32))) (or (= v_prenex_233 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_233) (_ bv0 1))))) (= sll_create_~head~0.base (_ bv0 32))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))))} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {5955#(and (forall ((|main_~#s~0.offset| (_ BitVec 32)) (v_sll_create_~new_head~0.base_27 (_ BitVec 32)) (|main_~#s~0.base| (_ BitVec 32))) (or (= (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|)) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (_ bv0 32)) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.offset| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.offset)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= v_sll_create_~new_head~0.base_27 (select (select (store |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27 (store (select |#memory_$Pointer$.base| v_sll_create_~new_head~0.base_27) (_ bv0 32) sll_create_~head~0.base)) |main_~#s~0.base|) |main_~#s~0.offset|))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1))))) (forall ((v_prenex_9 (_ BitVec 32)) (v_prenex_8 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7)) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7)))) (not (= (select |#valid| v_prenex_9) (_ bv0 1))) (not (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv0 32) sll_create_~head~0.offset)) v_prenex_8) v_prenex_7))) (not (= (select (select (store |#memory_$Pointer$.base| v_prenex_9 (store (select |#memory_$Pointer$.base| v_prenex_9) (_ bv0 32) sll_create_~head~0.base)) v_prenex_8) v_prenex_7) v_prenex_9)))))} is VALID [2018-11-23 11:24:44,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {5962#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_232 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_232) (_ bv0 1))) (= v_prenex_232 sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (forall ((v_prenex_233 (_ BitVec 32))) (or (= v_prenex_233 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_233) (_ bv0 1))))) (= sll_create_~head~0.base (_ bv0 32))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))))} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {5962#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_232 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_232) (_ bv0 1))) (= v_prenex_232 sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (forall ((v_prenex_233 (_ BitVec 32))) (or (= v_prenex_233 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_233) (_ bv0 1))))) (= sll_create_~head~0.base (_ bv0 32))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:24:44,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {5962#(and (or (not (= (select |#valid| sll_create_~new_head~0.base) (_ bv0 1))) (not (= sll_create_~new_head~0.offset (_ bv0 32))) (= (_ bv0 32) sll_create_~new_head~0.base)) (or (forall ((v_prenex_232 (_ BitVec 32))) (or (not (= (select |#valid| v_prenex_232) (_ bv0 1))) (= v_prenex_232 sll_create_~new_head~0.base))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (forall ((v_prenex_233 (_ BitVec 32))) (or (= v_prenex_233 sll_create_~new_head~0.base) (not (= (select |#valid| v_prenex_233) (_ bv0 1))))) (= sll_create_~head~0.base (_ bv0 32))) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_prenex_9 (_ BitVec 32))) (not (= (select |#valid| v_prenex_9) (_ bv0 1)))) (= (_ bv0 32) sll_create_~head~0.offset)) (or (= sll_create_~new_head~0.offset (_ bv0 32)) (forall ((v_sll_create_~new_head~0.base_27 (_ BitVec 32))) (not (= (select |#valid| v_sll_create_~new_head~0.base_27) (_ bv0 1)))) (= sll_create_~head~0.base (_ bv0 32))))} is VALID [2018-11-23 11:24:44,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:24:44,690 INFO L273 TraceCheckUtils]: 13: Hoare triple {5698#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {5742#(and (= (_ bv0 32) sll_create_~head~0.offset) (= sll_create_~head~0.base (_ bv0 32)))} is VALID [2018-11-23 11:24:44,690 INFO L256 TraceCheckUtils]: 12: Hoare triple {5698#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {5698#true} is VALID [2018-11-23 11:24:44,690 INFO L273 TraceCheckUtils]: 11: Hoare triple {5698#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {5698#true} is VALID [2018-11-23 11:24:44,690 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {5698#true} {5698#true} #143#return; {5698#true} is VALID [2018-11-23 11:24:44,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:24:44,690 INFO L273 TraceCheckUtils]: 8: Hoare triple {5698#true} #res := ~len~1; {5698#true} is VALID [2018-11-23 11:24:44,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {5698#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {5698#true} is VALID [2018-11-23 11:24:44,691 INFO L273 TraceCheckUtils]: 6: Hoare triple {5698#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {5698#true} is VALID [2018-11-23 11:24:44,691 INFO L256 TraceCheckUtils]: 5: Hoare triple {5698#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {5698#true} is VALID [2018-11-23 11:24:44,691 INFO L256 TraceCheckUtils]: 4: Hoare triple {5698#true} call #t~ret21 := main(); {5698#true} is VALID [2018-11-23 11:24:44,691 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5698#true} {5698#true} #161#return; {5698#true} is VALID [2018-11-23 11:24:44,691 INFO L273 TraceCheckUtils]: 2: Hoare triple {5698#true} assume true; {5698#true} is VALID [2018-11-23 11:24:44,691 INFO L273 TraceCheckUtils]: 1: Hoare triple {5698#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5698#true} is VALID [2018-11-23 11:24:44,691 INFO L256 TraceCheckUtils]: 0: Hoare triple {5698#true} call ULTIMATE.init(); {5698#true} is VALID [2018-11-23 11:24:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 11:24:44,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:24:44,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 28 [2018-11-23 11:24:44,708 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-11-23 11:24:44,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:44,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:24:45,066 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:45,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:24:45,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:24:45,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=671, Unknown=7, NotChecked=0, Total=756 [2018-11-23 11:24:45,067 INFO L87 Difference]: Start difference. First operand 104 states and 134 transitions. Second operand 28 states. [2018-11-23 11:24:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:57,714 INFO L93 Difference]: Finished difference Result 169 states and 217 transitions. [2018-11-23 11:24:57,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:24:57,714 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-11-23 11:24:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:57,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:24:57,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2018-11-23 11:24:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:24:57,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2018-11-23 11:24:57,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 128 transitions. [2018-11-23 11:24:58,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:58,019 INFO L225 Difference]: With dead ends: 169 [2018-11-23 11:24:58,019 INFO L226 Difference]: Without dead ends: 160 [2018-11-23 11:24:58,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=111, Invalid=937, Unknown=8, NotChecked=0, Total=1056 [2018-11-23 11:24:58,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-11-23 11:24:59,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 139. [2018-11-23 11:24:59,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:59,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand 139 states. [2018-11-23 11:24:59,073 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 139 states. [2018-11-23 11:24:59,073 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 139 states. [2018-11-23 11:24:59,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:59,081 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2018-11-23 11:24:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2018-11-23 11:24:59,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:59,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:59,082 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 160 states. [2018-11-23 11:24:59,082 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 160 states. [2018-11-23 11:24:59,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:59,090 INFO L93 Difference]: Finished difference Result 160 states and 205 transitions. [2018-11-23 11:24:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 205 transitions. [2018-11-23 11:24:59,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:59,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:59,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:59,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 11:24:59,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 180 transitions. [2018-11-23 11:24:59,097 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 180 transitions. Word has length 48 [2018-11-23 11:24:59,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:59,098 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 180 transitions. [2018-11-23 11:24:59,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:24:59,098 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 180 transitions. [2018-11-23 11:24:59,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:24:59,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:59,099 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:59,099 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:59,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:59,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1564890461, now seen corresponding path program 2 times [2018-11-23 11:24:59,100 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:59,100 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:24:59,129 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:24:59,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:24:59,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:24:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:24:59,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:24:59,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {6779#true} call ULTIMATE.init(); {6779#true} is VALID [2018-11-23 11:24:59,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {6779#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6779#true} is VALID [2018-11-23 11:24:59,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {6779#true} assume true; {6779#true} is VALID [2018-11-23 11:24:59,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6779#true} {6779#true} #161#return; {6779#true} is VALID [2018-11-23 11:24:59,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {6779#true} call #t~ret21 := main(); {6779#true} is VALID [2018-11-23 11:24:59,450 INFO L256 TraceCheckUtils]: 5: Hoare triple {6779#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {6779#true} is VALID [2018-11-23 11:24:59,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {6779#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {6779#true} is VALID [2018-11-23 11:24:59,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {6779#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {6779#true} is VALID [2018-11-23 11:24:59,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {6779#true} #res := ~len~1; {6779#true} is VALID [2018-11-23 11:24:59,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {6779#true} assume true; {6779#true} is VALID [2018-11-23 11:24:59,451 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {6779#true} {6779#true} #143#return; {6779#true} is VALID [2018-11-23 11:24:59,451 INFO L273 TraceCheckUtils]: 11: Hoare triple {6779#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {6779#true} is VALID [2018-11-23 11:24:59,452 INFO L256 TraceCheckUtils]: 12: Hoare triple {6779#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {6779#true} is VALID [2018-11-23 11:24:59,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {6779#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {6779#true} is VALID [2018-11-23 11:24:59,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {6779#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {6779#true} is VALID [2018-11-23 11:24:59,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {6779#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {6779#true} is VALID [2018-11-23 11:24:59,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {6779#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6779#true} is VALID [2018-11-23 11:24:59,453 INFO L273 TraceCheckUtils]: 17: Hoare triple {6779#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6779#true} is VALID [2018-11-23 11:24:59,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {6779#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {6779#true} is VALID [2018-11-23 11:24:59,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {6779#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {6779#true} is VALID [2018-11-23 11:24:59,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {6779#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6779#true} is VALID [2018-11-23 11:24:59,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {6779#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6779#true} is VALID [2018-11-23 11:24:59,454 INFO L273 TraceCheckUtils]: 22: Hoare triple {6779#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {6779#true} is VALID [2018-11-23 11:24:59,454 INFO L273 TraceCheckUtils]: 23: Hoare triple {6779#true} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {6779#true} is VALID [2018-11-23 11:24:59,454 INFO L273 TraceCheckUtils]: 24: Hoare triple {6779#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6779#true} is VALID [2018-11-23 11:24:59,454 INFO L273 TraceCheckUtils]: 25: Hoare triple {6779#true} assume true; {6779#true} is VALID [2018-11-23 11:24:59,455 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {6779#true} {6779#true} #145#return; {6779#true} is VALID [2018-11-23 11:24:59,455 INFO L273 TraceCheckUtils]: 27: Hoare triple {6779#true} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {6779#true} is VALID [2018-11-23 11:24:59,455 INFO L256 TraceCheckUtils]: 28: Hoare triple {6779#true} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {6779#true} is VALID [2018-11-23 11:24:59,473 INFO L273 TraceCheckUtils]: 29: Hoare triple {6779#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {6871#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:24:59,474 INFO L273 TraceCheckUtils]: 30: Hoare triple {6871#(= _get_nondet_int_~len~1 |_get_nondet_int_#in~from|)} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {6875#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:24:59,474 INFO L273 TraceCheckUtils]: 31: Hoare triple {6875#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {6875#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:24:59,474 INFO L273 TraceCheckUtils]: 32: Hoare triple {6875#(= (bvadd _get_nondet_int_~len~1 (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} #res := ~len~1; {6882#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:24:59,475 INFO L273 TraceCheckUtils]: 33: Hoare triple {6882#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} assume true; {6882#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} is VALID [2018-11-23 11:24:59,476 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6882#(= (bvadd |_get_nondet_int_#res| (_ bv4294967295 32)) |_get_nondet_int_#in~from|)} {6779#true} #147#return; {6889#(= (_ bv1 32) |main_#t~ret15|)} is VALID [2018-11-23 11:24:59,477 INFO L273 TraceCheckUtils]: 35: Hoare triple {6889#(= (_ bv1 32) |main_#t~ret15|)} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {6893#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:24:59,477 INFO L273 TraceCheckUtils]: 36: Hoare triple {6893#(and (= main_~i~0 (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~k~0); {6780#false} is VALID [2018-11-23 11:24:59,477 INFO L273 TraceCheckUtils]: 37: Hoare triple {6780#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {6780#false} is VALID [2018-11-23 11:24:59,477 INFO L256 TraceCheckUtils]: 38: Hoare triple {6780#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {6780#false} is VALID [2018-11-23 11:24:59,477 INFO L273 TraceCheckUtils]: 39: Hoare triple {6780#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {6780#false} is VALID [2018-11-23 11:24:59,478 INFO L273 TraceCheckUtils]: 40: Hoare triple {6780#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {6780#false} is VALID [2018-11-23 11:24:59,478 INFO L273 TraceCheckUtils]: 41: Hoare triple {6780#false} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {6780#false} is VALID [2018-11-23 11:24:59,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {6780#false} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {6780#false} is VALID [2018-11-23 11:24:59,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {6780#false} #res := ~len~0; {6780#false} is VALID [2018-11-23 11:24:59,478 INFO L273 TraceCheckUtils]: 44: Hoare triple {6780#false} assume true; {6780#false} is VALID [2018-11-23 11:24:59,479 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {6780#false} {6780#false} #153#return; {6780#false} is VALID [2018-11-23 11:24:59,479 INFO L273 TraceCheckUtils]: 46: Hoare triple {6780#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {6780#false} is VALID [2018-11-23 11:24:59,479 INFO L273 TraceCheckUtils]: 47: Hoare triple {6780#false} assume !false; {6780#false} is VALID [2018-11-23 11:24:59,480 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:24:59,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:24:59,719 INFO L273 TraceCheckUtils]: 47: Hoare triple {6780#false} assume !false; {6780#false} is VALID [2018-11-23 11:24:59,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {6780#false} assume ~bvadd32(~k~0, ~len~2) != #t~ret19;havoc #t~mem18.base, #t~mem18.offset;havoc #t~ret19; {6780#false} is VALID [2018-11-23 11:24:59,720 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {6779#true} {6780#false} #153#return; {6780#false} is VALID [2018-11-23 11:24:59,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {6779#true} assume true; {6779#true} is VALID [2018-11-23 11:24:59,720 INFO L273 TraceCheckUtils]: 43: Hoare triple {6779#true} #res := ~len~0; {6779#true} is VALID [2018-11-23 11:24:59,720 INFO L273 TraceCheckUtils]: 42: Hoare triple {6779#true} assume !(~head.base != 0bv32 || ~head.offset != 0bv32); {6779#true} is VALID [2018-11-23 11:24:59,720 INFO L273 TraceCheckUtils]: 41: Hoare triple {6779#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {6779#true} is VALID [2018-11-23 11:24:59,720 INFO L273 TraceCheckUtils]: 40: Hoare triple {6779#true} assume !!(~head.base != 0bv32 || ~head.offset != 0bv32);#t~post4 := ~len~0;~len~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~head.base, ~head.offset, 4bv32);~head.base, ~head.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {6779#true} is VALID [2018-11-23 11:24:59,721 INFO L273 TraceCheckUtils]: 39: Hoare triple {6779#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~len~0 := 0bv32; {6779#true} is VALID [2018-11-23 11:24:59,721 INFO L256 TraceCheckUtils]: 38: Hoare triple {6780#false} call #t~ret19 := sll_length(#t~mem18.base, #t~mem18.offset); {6779#true} is VALID [2018-11-23 11:24:59,721 INFO L273 TraceCheckUtils]: 37: Hoare triple {6780#false} call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~#s~0.base, ~#s~0.offset, 4bv32); {6780#false} is VALID [2018-11-23 11:24:59,722 INFO L273 TraceCheckUtils]: 36: Hoare triple {6963#(bvslt main_~i~0 main_~k~0)} assume !~bvslt32(~i~0, ~k~0); {6780#false} is VALID [2018-11-23 11:24:59,723 INFO L273 TraceCheckUtils]: 35: Hoare triple {6967#(bvslt (_ bv0 32) |main_#t~ret15|)} ~k~0 := #t~ret15;havoc #t~ret15;~i~0 := 0bv32; {6963#(bvslt main_~i~0 main_~k~0)} is VALID [2018-11-23 11:24:59,724 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {6974#(or (bvslt (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} {6779#true} #147#return; {6967#(bvslt (_ bv0 32) |main_#t~ret15|)} is VALID [2018-11-23 11:24:59,724 INFO L273 TraceCheckUtils]: 33: Hoare triple {6974#(or (bvslt (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} assume true; {6974#(or (bvslt (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:24:59,725 INFO L273 TraceCheckUtils]: 32: Hoare triple {6981#(or (bvslt (_ bv0 32) _get_nondet_int_~len~1) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} #res := ~len~1; {6974#(or (bvslt (_ bv0 32) |_get_nondet_int_#res|) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:24:59,725 INFO L273 TraceCheckUtils]: 31: Hoare triple {6981#(or (bvslt (_ bv0 32) _get_nondet_int_~len~1) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {6981#(or (bvslt (_ bv0 32) _get_nondet_int_~len~1) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:24:59,726 INFO L273 TraceCheckUtils]: 30: Hoare triple {6988#(or (bvslt (_ bv0 32) (bvadd _get_nondet_int_~len~1 (_ bv1 32))) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} assume !!(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11;#t~post12 := ~len~1;~len~1 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {6981#(or (bvslt (_ bv0 32) _get_nondet_int_~len~1) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:24:59,727 INFO L273 TraceCheckUtils]: 29: Hoare triple {6779#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {6988#(or (bvslt (_ bv0 32) (bvadd _get_nondet_int_~len~1 (_ bv1 32))) (not (= (_ bv0 32) |_get_nondet_int_#in~from|)))} is VALID [2018-11-23 11:24:59,728 INFO L256 TraceCheckUtils]: 28: Hoare triple {6779#true} call #t~ret15 := _get_nondet_int(0bv32, ~bvsub32(~len~2, 1bv32)); {6779#true} is VALID [2018-11-23 11:24:59,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {6779#true} call write~init~$Pointer$(#t~ret14.base, #t~ret14.offset, ~#s~0.base, ~#s~0.offset, 4bv32);havoc #t~ret14.base, #t~ret14.offset; {6779#true} is VALID [2018-11-23 11:24:59,728 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {6779#true} {6779#true} #145#return; {6779#true} is VALID [2018-11-23 11:24:59,728 INFO L273 TraceCheckUtils]: 25: Hoare triple {6779#true} assume true; {6779#true} is VALID [2018-11-23 11:24:59,728 INFO L273 TraceCheckUtils]: 24: Hoare triple {6779#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {6779#true} is VALID [2018-11-23 11:24:59,728 INFO L273 TraceCheckUtils]: 23: Hoare triple {6779#true} assume !~bvsgt32(#t~post2, 0bv32);havoc #t~post2; {6779#true} is VALID [2018-11-23 11:24:59,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {6779#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {6779#true} is VALID [2018-11-23 11:24:59,729 INFO L273 TraceCheckUtils]: 21: Hoare triple {6779#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6779#true} is VALID [2018-11-23 11:24:59,729 INFO L273 TraceCheckUtils]: 20: Hoare triple {6779#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6779#true} is VALID [2018-11-23 11:24:59,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {6779#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {6779#true} is VALID [2018-11-23 11:24:59,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {6779#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {6779#true} is VALID [2018-11-23 11:24:59,729 INFO L273 TraceCheckUtils]: 17: Hoare triple {6779#true} call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, ~new_head~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {6779#true} is VALID [2018-11-23 11:24:59,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {6779#true} assume !(0bv32 == ~new_head~0.base && 0bv32 == ~new_head~0.offset); {6779#true} is VALID [2018-11-23 11:24:59,729 INFO L273 TraceCheckUtils]: 15: Hoare triple {6779#true} assume !!~bvsgt32(#t~post2, 0bv32);havoc #t~post2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(4bv32);~new_head~0.base, ~new_head~0.offset := #t~malloc3.base, #t~malloc3.offset; {6779#true} is VALID [2018-11-23 11:24:59,729 INFO L273 TraceCheckUtils]: 14: Hoare triple {6779#true} #t~post2 := ~len;~len := ~bvsub32(#t~post2, 1bv32); {6779#true} is VALID [2018-11-23 11:24:59,730 INFO L273 TraceCheckUtils]: 13: Hoare triple {6779#true} ~len := #in~len;~head~0.base, ~head~0.offset := 0bv32, 0bv32; {6779#true} is VALID [2018-11-23 11:24:59,730 INFO L256 TraceCheckUtils]: 12: Hoare triple {6779#true} call #t~ret14.base, #t~ret14.offset := sll_create(~len~2); {6779#true} is VALID [2018-11-23 11:24:59,730 INFO L273 TraceCheckUtils]: 11: Hoare triple {6779#true} ~len~2 := #t~ret13;havoc #t~ret13;call ~#s~0.base, ~#s~0.offset := #Ultimate.alloc(4bv32); {6779#true} is VALID [2018-11-23 11:24:59,730 INFO L268 TraceCheckUtils]: 10: Hoare quadruple {6779#true} {6779#true} #143#return; {6779#true} is VALID [2018-11-23 11:24:59,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {6779#true} assume true; {6779#true} is VALID [2018-11-23 11:24:59,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {6779#true} #res := ~len~1; {6779#true} is VALID [2018-11-23 11:24:59,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {6779#true} assume !(~bvslt32(~len~1, ~until) && 0bv32 != #t~nondet11);havoc #t~nondet11; {6779#true} is VALID [2018-11-23 11:24:59,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {6779#true} ~from := #in~from;~until := #in~until;~len~1 := ~from; {6779#true} is VALID [2018-11-23 11:24:59,731 INFO L256 TraceCheckUtils]: 5: Hoare triple {6779#true} call #t~ret13 := _get_nondet_int(2bv32, 5bv32); {6779#true} is VALID [2018-11-23 11:24:59,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {6779#true} call #t~ret21 := main(); {6779#true} is VALID [2018-11-23 11:24:59,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6779#true} {6779#true} #161#return; {6779#true} is VALID [2018-11-23 11:24:59,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {6779#true} assume true; {6779#true} is VALID [2018-11-23 11:24:59,731 INFO L273 TraceCheckUtils]: 1: Hoare triple {6779#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6779#true} is VALID [2018-11-23 11:24:59,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {6779#true} call ULTIMATE.init(); {6779#true} is VALID [2018-11-23 11:24:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:24:59,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:24:59,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:24:59,735 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-11-23 11:24:59,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:24:59,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:24:59,820 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:59,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:24:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:24:59,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:24:59,821 INFO L87 Difference]: Start difference. First operand 139 states and 180 transitions. Second operand 12 states. [2018-11-23 11:25:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:02,476 INFO L93 Difference]: Finished difference Result 210 states and 291 transitions. [2018-11-23 11:25:02,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:25:02,476 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-11-23 11:25:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:02,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2018-11-23 11:25:02,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:25:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 114 transitions. [2018-11-23 11:25:02,482 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 114 transitions. [2018-11-23 11:25:02,727 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:02,732 INFO L225 Difference]: With dead ends: 210 [2018-11-23 11:25:02,732 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 11:25:02,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:25:02,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states.