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-properties/list_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:05:38,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:05:38,576 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:05:38,598 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:05:38,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:05:38,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:05:38,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:05:38,603 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:05:38,605 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:05:38,605 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:05:38,606 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:05:38,607 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:05:38,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:05:38,609 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:05:38,610 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:05:38,611 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:05:38,612 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:05:38,613 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:05:38,616 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:05:38,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:05:38,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:05:38,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:05:38,622 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:05:38,622 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:05:38,623 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:05:38,624 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:05:38,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:05:38,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:05:38,626 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:05:38,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:05:38,628 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:05:38,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:05:38,629 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:05:38,629 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:05:38,630 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:05:38,631 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:05:38,631 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:05:38,657 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:05:38,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:05:38,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:05:38,660 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:05:38,661 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:05:38,662 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:05:38,662 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:05:38,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:05:38,662 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:05:38,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:05:38,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:05:38,663 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:05:38,663 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:05:38,663 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:05:38,663 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:05:38,665 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:05:38,665 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:05:38,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:05:38,665 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:05:38,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:05:38,666 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:05:38,666 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:05:38,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:05:38,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:05:38,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:05:38,668 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:05:38,668 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:05:38,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:05:38,668 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:05:38,669 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:05:38,669 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:05:38,669 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:05:38,669 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:05:38,715 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:05:38,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:05:38,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:05:38,734 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:05:38,734 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:05:38,735 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:05:38,804 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41a3f397/01074c7d1efb43898869803ea563f565/FLAGebadec24d [2018-11-23 11:05:39,399 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:05:39,400 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:05:39,419 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41a3f397/01074c7d1efb43898869803ea563f565/FLAGebadec24d [2018-11-23 11:05:39,660 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d41a3f397/01074c7d1efb43898869803ea563f565 [2018-11-23 11:05:39,671 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:05:39,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:05:39,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:05:39,674 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:05:39,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:05:39,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:05:39" (1/1) ... [2018-11-23 11:05:39,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbbb612 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:39, skipping insertion in model container [2018-11-23 11:05:39,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:05:39" (1/1) ... [2018-11-23 11:05:39,694 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:05:39,739 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:05:40,109 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:05:40,126 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:05:40,223 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:05:40,290 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:05:40,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40 WrapperNode [2018-11-23 11:05:40,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:05:40,292 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:05:40,292 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:05:40,293 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:05:40,374 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:05:40" (1/1) ... [2018-11-23 11:05:40,397 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:05:40" (1/1) ... [2018-11-23 11:05:40,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:05:40,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:05:40,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:05:40,407 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:05:40,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40" (1/1) ... [2018-11-23 11:05:40,416 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40" (1/1) ... [2018-11-23 11:05:40,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40" (1/1) ... [2018-11-23 11:05:40,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40" (1/1) ... [2018-11-23 11:05:40,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40" (1/1) ... [2018-11-23 11:05:40,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40" (1/1) ... [2018-11-23 11:05:40,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40" (1/1) ... [2018-11-23 11:05:40,452 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:05:40,452 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:05:40,453 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:05:40,453 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:05:40,454 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40" (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:05:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:05:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:05:40,517 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:05:40,518 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:05:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:05:40,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:05:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:05:40,518 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:05:40,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:05:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:05:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:05:40,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:05:40,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:05:41,377 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:05:41,378 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 11:05:41,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:05:41 BoogieIcfgContainer [2018-11-23 11:05:41,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:05:41,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:05:41,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:05:41,383 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:05:41,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:05:39" (1/3) ... [2018-11-23 11:05:41,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc1cdf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:05:41, skipping insertion in model container [2018-11-23 11:05:41,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:40" (2/3) ... [2018-11-23 11:05:41,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dc1cdf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:05:41, skipping insertion in model container [2018-11-23 11:05:41,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:05:41" (3/3) ... [2018-11-23 11:05:41,387 INFO L112 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:05:41,398 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:05:41,409 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:05:41,429 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:05:41,465 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:05:41,466 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:05:41,466 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:05:41,466 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:05:41,467 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:05:41,467 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:05:41,467 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:05:41,467 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:05:41,467 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:05:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-23 11:05:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:05:41,499 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:41,500 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:41,504 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:41,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:41,509 INFO L82 PathProgramCache]: Analyzing trace with hash -994574386, now seen corresponding path program 1 times [2018-11-23 11:05:41,513 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:41,514 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:05:41,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:41,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:41,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:41,664 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-23 11:05:41,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {36#true} is VALID [2018-11-23 11:05:41,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-23 11:05:41,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #97#return; {36#true} is VALID [2018-11-23 11:05:41,669 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret12 := main(); {36#true} is VALID [2018-11-23 11:05:41,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {36#true} is VALID [2018-11-23 11:05:41,670 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {36#true} is VALID [2018-11-23 11:05:41,670 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {36#true} is VALID [2018-11-23 11:05:41,685 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-23 11:05:41,686 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-23 11:05:41,686 INFO L273 TraceCheckUtils]: 10: Hoare triple {37#false} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {37#false} is VALID [2018-11-23 11:05:41,686 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-23 11:05:41,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume !true; {37#false} is VALID [2018-11-23 11:05:41,687 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {37#false} is VALID [2018-11-23 11:05:41,687 INFO L273 TraceCheckUtils]: 14: Hoare triple {37#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {37#false} is VALID [2018-11-23 11:05:41,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-23 11:05:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:41,692 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:05:41,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:05:41,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:05:41,708 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:05:41,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:41,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:05:41,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:41,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:05:41,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:05:41,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:05:41,803 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-23 11:05:41,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:41,952 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2018-11-23 11:05:41,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:05:41,952 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:05:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:05:41,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 11:05:41,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:05:41,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-23 11:05:41,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-23 11:05:42,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:42,385 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:05:42,386 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:05:42,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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:05:42,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:05:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:05:42,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:42,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:05:42,430 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:05:42,430 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:05:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:42,434 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:05:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:05:42,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:42,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:42,436 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:05:42,436 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:05:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:42,440 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:05:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:05:42,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:42,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:42,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:42,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:05:42,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 11:05:42,447 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 16 [2018-11-23 11:05:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:42,448 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 11:05:42,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:05:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:05:42,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:05:42,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:42,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:42,451 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:42,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:42,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2114672812, now seen corresponding path program 1 times [2018-11-23 11:05:42,452 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:42,452 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:05:42,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:42,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:42,976 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:05:42,985 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:05:42,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:42,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:43,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:43,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:05:43,114 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 17 treesize of output 13 [2018-11-23 11:05:43,159 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 5 [2018-11-23 11:05:43,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:43,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:43,167 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:05:43,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:05:43,185 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:43,186 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= |main_#t~mem11| .cse0) (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)))) [2018-11-23 11:05:43,186 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem11| (_ bv4294967293 32))) [2018-11-23 11:05:43,310 INFO L256 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {228#true} is VALID [2018-11-23 11:05:43,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {228#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {228#true} is VALID [2018-11-23 11:05:43,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2018-11-23 11:05:43,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #97#return; {228#true} is VALID [2018-11-23 11:05:43,312 INFO L256 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret12 := main(); {228#true} is VALID [2018-11-23 11:05:43,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {228#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {248#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:43,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {248#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {248#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:43,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {248#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {255#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:43,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {255#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {255#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:43,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {255#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {255#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:43,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {255#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:43,326 INFO L273 TraceCheckUtils]: 11: Hoare triple {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:43,327 INFO L273 TraceCheckUtils]: 12: Hoare triple {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:43,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:43,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(2bv32 == #t~mem9);havoc #t~mem9; {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:43,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {265#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {281#(= (_ bv3 32) |main_#t~mem11|)} is VALID [2018-11-23 11:05:43,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {281#(= (_ bv3 32) |main_#t~mem11|)} assume 3bv32 != #t~mem11;havoc #t~mem11; {229#false} is VALID [2018-11-23 11:05:43,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {229#false} assume !false; {229#false} is VALID [2018-11-23 11:05:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:43,366 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:05:43,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:05:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:05:43,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:05:43,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:43,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:05:43,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:43,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:05:43,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:05:43,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:05:43,406 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2018-11-23 11:05:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:44,304 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-11-23 11:05:44,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:05:44,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 11:05:44,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 11:05:44,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2018-11-23 11:05:44,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2018-11-23 11:05:44,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:44,404 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:05:44,404 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 11:05:44,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:05:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 11:05:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-11-23 11:05:44,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:44,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 30 states. [2018-11-23 11:05:44,429 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 30 states. [2018-11-23 11:05:44,429 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 30 states. [2018-11-23 11:05:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:44,433 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 11:05:44,433 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 11:05:44,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:44,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:44,434 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 42 states. [2018-11-23 11:05:44,435 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 42 states. [2018-11-23 11:05:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:44,439 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-23 11:05:44,439 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 11:05:44,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:44,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:44,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:44,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:05:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-23 11:05:44,443 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2018-11-23 11:05:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:44,443 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-23 11:05:44,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:05:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-23 11:05:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:05:44,445 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:44,445 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:44,445 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:44,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:44,446 INFO L82 PathProgramCache]: Analyzing trace with hash -632364849, now seen corresponding path program 1 times [2018-11-23 11:05:44,446 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:44,446 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:05:44,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:44,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:44,617 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:05:44,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:05:44,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:05:44,746 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 17 treesize of output 13 [2018-11-23 11:05:44,815 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 5 [2018-11-23 11:05:44,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:44,845 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:05:44,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:05:44,852 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:44,853 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)) (= .cse0 |main_#t~mem9|))) [2018-11-23 11:05:44,853 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem9| (_ bv4294967293 32))) [2018-11-23 11:05:44,869 INFO L256 TraceCheckUtils]: 0: Hoare triple {468#true} call ULTIMATE.init(); {468#true} is VALID [2018-11-23 11:05:44,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {468#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {468#true} is VALID [2018-11-23 11:05:44,870 INFO L273 TraceCheckUtils]: 2: Hoare triple {468#true} assume true; {468#true} is VALID [2018-11-23 11:05:44,870 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {468#true} {468#true} #97#return; {468#true} is VALID [2018-11-23 11:05:44,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {468#true} call #t~ret12 := main(); {468#true} is VALID [2018-11-23 11:05:44,872 INFO L273 TraceCheckUtils]: 5: Hoare triple {468#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {488#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:44,872 INFO L273 TraceCheckUtils]: 6: Hoare triple {488#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {488#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:44,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {495#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:44,874 INFO L273 TraceCheckUtils]: 8: Hoare triple {495#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {495#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:44,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {495#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {495#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:44,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {495#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {505#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:44,881 INFO L273 TraceCheckUtils]: 11: Hoare triple {505#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {505#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:44,883 INFO L273 TraceCheckUtils]: 12: Hoare triple {505#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {505#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:44,884 INFO L273 TraceCheckUtils]: 13: Hoare triple {505#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {515#(= (_ bv3 32) |main_#t~mem9|)} is VALID [2018-11-23 11:05:44,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {515#(= (_ bv3 32) |main_#t~mem9|)} assume !!(2bv32 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {469#false} is VALID [2018-11-23 11:05:44,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {469#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {469#false} is VALID [2018-11-23 11:05:44,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {469#false} assume !(2bv32 == #t~mem9);havoc #t~mem9; {469#false} is VALID [2018-11-23 11:05:44,887 INFO L273 TraceCheckUtils]: 17: Hoare triple {469#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {469#false} is VALID [2018-11-23 11:05:44,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {469#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {469#false} is VALID [2018-11-23 11:05:44,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {469#false} assume !false; {469#false} is VALID [2018-11-23 11:05:44,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:44,891 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:05:44,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:05:44,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:05:44,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:05:44,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:44,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:05:44,930 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:44,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:05:44,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:05:44,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:05:44,932 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 6 states. [2018-11-23 11:05:45,465 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-23 11:05:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:45,899 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 11:05:45,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:05:45,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:05:45,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:45,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 11:05:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 11:05:45,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2018-11-23 11:05:46,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:46,012 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:05:46,012 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:05:46,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:05:46,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:05:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2018-11-23 11:05:46,034 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:46,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 28 states. [2018-11-23 11:05:46,035 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 28 states. [2018-11-23 11:05:46,035 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 28 states. [2018-11-23 11:05:46,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:46,039 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:05:46,039 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:05:46,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:46,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:46,040 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 40 states. [2018-11-23 11:05:46,040 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 40 states. [2018-11-23 11:05:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:46,043 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-23 11:05:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 11:05:46,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:46,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:46,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:46,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:05:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 11:05:46,047 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 20 [2018-11-23 11:05:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:46,047 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 11:05:46,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:05:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 11:05:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:05:46,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:46,049 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:46,049 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:46,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:46,050 INFO L82 PathProgramCache]: Analyzing trace with hash 392338127, now seen corresponding path program 1 times [2018-11-23 11:05:46,050 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:46,050 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:05:46,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:46,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:46,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:46,204 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:05:46,210 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:05:46,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:46,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:46,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:46,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 11:05:46,260 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 17 treesize of output 13 [2018-11-23 11:05:46,268 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 5 [2018-11-23 11:05:46,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:46,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:46,335 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:05:46,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:05:46,340 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:46,340 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (bvadd .cse0 (_ bv4294967293 32)) (_ bv0 32)) (= .cse0 |main_#t~mem7|))) [2018-11-23 11:05:46,340 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem7| (_ bv4294967293 32))) [2018-11-23 11:05:46,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-23 11:05:46,358 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {710#true} is VALID [2018-11-23 11:05:46,358 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-23 11:05:46,358 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #97#return; {710#true} is VALID [2018-11-23 11:05:46,359 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret12 := main(); {710#true} is VALID [2018-11-23 11:05:46,360 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {730#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:46,360 INFO L273 TraceCheckUtils]: 6: Hoare triple {730#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {730#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:46,361 INFO L273 TraceCheckUtils]: 7: Hoare triple {730#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {737#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:46,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {737#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {737#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:46,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {737#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {737#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:46,366 INFO L273 TraceCheckUtils]: 10: Hoare triple {737#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {747#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:46,367 INFO L273 TraceCheckUtils]: 11: Hoare triple {747#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967293 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {751#(= (_ bv3 32) |main_#t~mem7|)} is VALID [2018-11-23 11:05:46,367 INFO L273 TraceCheckUtils]: 12: Hoare triple {751#(= (_ bv3 32) |main_#t~mem7|)} assume !!(1bv32 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {711#false} is VALID [2018-11-23 11:05:46,368 INFO L273 TraceCheckUtils]: 13: Hoare triple {711#false} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {711#false} is VALID [2018-11-23 11:05:46,368 INFO L273 TraceCheckUtils]: 14: Hoare triple {711#false} assume !(1bv32 == #t~mem7);havoc #t~mem7; {711#false} is VALID [2018-11-23 11:05:46,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {711#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {711#false} is VALID [2018-11-23 11:05:46,368 INFO L273 TraceCheckUtils]: 16: Hoare triple {711#false} assume !(2bv32 == #t~mem9);havoc #t~mem9; {711#false} is VALID [2018-11-23 11:05:46,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {711#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {711#false} is VALID [2018-11-23 11:05:46,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {711#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {711#false} is VALID [2018-11-23 11:05:46,369 INFO L273 TraceCheckUtils]: 19: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-23 11:05:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:46,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:05:46,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:05:46,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:05:46,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:05:46,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:46,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:05:46,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:46,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:05:46,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:05:46,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:05:46,399 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 6 states. [2018-11-23 11:05:46,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:46,981 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 11:05:46,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:05:46,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-23 11:05:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:46,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 11:05:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2018-11-23 11:05:46,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2018-11-23 11:05:47,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:47,098 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:05:47,099 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:05:47,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:05:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:05:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2018-11-23 11:05:47,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:47,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 25 states. [2018-11-23 11:05:47,111 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 25 states. [2018-11-23 11:05:47,111 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 25 states. [2018-11-23 11:05:47,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:47,115 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 11:05:47,115 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 11:05:47,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:47,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:47,116 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 37 states. [2018-11-23 11:05:47,116 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 37 states. [2018-11-23 11:05:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:47,118 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-23 11:05:47,118 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 11:05:47,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:47,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:47,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:47,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:05:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2018-11-23 11:05:47,121 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2018-11-23 11:05:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:47,122 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2018-11-23 11:05:47,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:05:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2018-11-23 11:05:47,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:05:47,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:47,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:47,123 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:47,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:47,124 INFO L82 PathProgramCache]: Analyzing trace with hash 878132096, now seen corresponding path program 1 times [2018-11-23 11:05:47,124 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:47,124 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:05:47,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:47,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:47,298 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:05:47,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:05:47,314 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:47,314 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_13|]. (and (= |#valid| (store |v_#valid_13| main_~a~0.base (_ bv1 1))) (= main_~a~0.offset (_ bv0 32))) [2018-11-23 11:05:47,314 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:05:47,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:47,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:47,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 4 [2018-11-23 11:05:47,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,478 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:05:47,488 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:05:47,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,514 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-23 11:05:47,523 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:47,523 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, |v_#valid_14|]. (and (= (store |v_#memory_int_19| main_~p~0.base (store (select |v_#memory_int_19| main_~p~0.base) main_~p~0.offset (_ bv2 32))) |#memory_int|) (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_14| main_~a~0.base) (_ bv1 1))) (= main_~a~0.offset main_~p~0.offset) (= (select |v_#valid_14| main_~t~0.base) (_ bv0 1))) [2018-11-23 11:05:47,523 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2018-11-23 11:05:47,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 11:05:47,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:47,627 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 22 treesize of output 14 [2018-11-23 11:05:47,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 11:05:47,766 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:05:47,773 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:05:47,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:47,800 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:05:47,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-23 11:05:47,810 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:47,810 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, v_main_~p~0.base_21, v_main_~p~0.offset_21]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_21 main_~p~0.base)) (= (store |v_#memory_int_21| v_main_~p~0.base_21 (store (select |v_#memory_int_21| v_main_~p~0.base_21) v_main_~p~0.offset_21 (_ bv3 32))) |#memory_int|) (= (_ bv2 32) (select (select |v_#memory_int_21| main_~p~0.base) (_ bv0 32)))) [2018-11-23 11:05:47,810 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_21, v_main_~p~0.offset_21]. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv2 32)) (not (= v_main_~p~0.base_21 main_~p~0.base))) [2018-11-23 11:05:48,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {943#true} call ULTIMATE.init(); {943#true} is VALID [2018-11-23 11:05:48,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {943#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {943#true} is VALID [2018-11-23 11:05:48,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {943#true} assume true; {943#true} is VALID [2018-11-23 11:05:48,050 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {943#true} {943#true} #97#return; {943#true} is VALID [2018-11-23 11:05:48,050 INFO L256 TraceCheckUtils]: 4: Hoare triple {943#true} call #t~ret12 := main(); {943#true} is VALID [2018-11-23 11:05:48,051 INFO L273 TraceCheckUtils]: 5: Hoare triple {943#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {963#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:48,052 INFO L273 TraceCheckUtils]: 6: Hoare triple {963#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {963#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:48,052 INFO L273 TraceCheckUtils]: 7: Hoare triple {963#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {970#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:48,054 INFO L273 TraceCheckUtils]: 8: Hoare triple {970#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {970#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:48,057 INFO L273 TraceCheckUtils]: 9: Hoare triple {970#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {977#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:48,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {977#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {977#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:48,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {977#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {984#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:48,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {984#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {984#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:48,068 INFO L273 TraceCheckUtils]: 13: Hoare triple {984#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {991#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:48,069 INFO L273 TraceCheckUtils]: 14: Hoare triple {991#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {991#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:48,070 INFO L273 TraceCheckUtils]: 15: Hoare triple {991#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {991#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:48,071 INFO L273 TraceCheckUtils]: 16: Hoare triple {991#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1001#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem9|))} is VALID [2018-11-23 11:05:48,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {1001#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.offset_21 (_ BitVec 32)) (v_main_~p~0.base_21 (_ BitVec 32))) (and (= (_ bv3 32) (select (select |#memory_int| v_main_~p~0.base_21) v_main_~p~0.offset_21)) (not (= v_main_~p~0.base_21 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem9|))} assume !(2bv32 == #t~mem9);havoc #t~mem9; {944#false} is VALID [2018-11-23 11:05:48,073 INFO L273 TraceCheckUtils]: 18: Hoare triple {944#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {944#false} is VALID [2018-11-23 11:05:48,074 INFO L273 TraceCheckUtils]: 19: Hoare triple {944#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {944#false} is VALID [2018-11-23 11:05:48,074 INFO L273 TraceCheckUtils]: 20: Hoare triple {944#false} assume !false; {944#false} is VALID [2018-11-23 11:05:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:48,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:05:48,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:48,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:48,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:05:48,520 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-23 11:05:48,532 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:48,532 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_23|, v_subst_1]. (or (not (= (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_23| main_~p~0.base) .cse0)))) |v_#memory_int_23|)) (= (bvadd (select (select (store |v_#memory_int_23| main_~t~0.base (store (select |v_#memory_int_23| main_~t~0.base) v_subst_1 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))) [2018-11-23 11:05:48,532 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_2]. (and (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset)) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:05:48,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-23 11:05:48,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 11:05:48,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:48,893 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:48,895 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2018-11-23 11:05:48,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 11:05:48,979 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:49,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:49,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:49,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-23 11:05:49,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 11:05:49,081 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:49,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:49,095 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 26 treesize of output 24 [2018-11-23 11:05:49,101 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-23 11:05:49,142 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 15 treesize of output 6 [2018-11-23 11:05:49,144 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:49,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:05:49,154 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:49,181 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:49,218 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:49,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-23 11:05:49,293 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:34, output treesize:42 [2018-11-23 11:05:49,308 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:49,309 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_2, v_main_~t~0.base_10]. (and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv2 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv2 32)) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))) [2018-11-23 11:05:49,309 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~t~0.base_10, v_prenex_3, v_prenex_2]. (let ((.cse0 (= main_~a~0.offset main_~p~0.offset))) (and (or .cse0 (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10)))) (or (= (bvadd main_~p~0.offset (_ bv4 32)) main_~a~0.offset) .cse0 (not (= (_ bv0 1) (select |#valid| v_prenex_3)))) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))))) [2018-11-23 11:05:49,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {944#false} assume !false; {944#false} is VALID [2018-11-23 11:05:49,551 INFO L273 TraceCheckUtils]: 19: Hoare triple {944#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {944#false} is VALID [2018-11-23 11:05:49,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {944#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {944#false} is VALID [2018-11-23 11:05:49,552 INFO L273 TraceCheckUtils]: 17: Hoare triple {1023#(= (_ bv2 32) |main_#t~mem9|)} assume !(2bv32 == #t~mem9);havoc #t~mem9; {944#false} is VALID [2018-11-23 11:05:49,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {1027#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1023#(= (_ bv2 32) |main_#t~mem9|)} is VALID [2018-11-23 11:05:49,553 INFO L273 TraceCheckUtils]: 15: Hoare triple {1027#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {1027#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:49,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {1027#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1027#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:49,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {1037#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1027#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:49,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {1037#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {1037#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:49,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {1044#(and (forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset))) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1037#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:49,565 INFO L273 TraceCheckUtils]: 10: Hoare triple {1044#(and (forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset))) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1044#(and (forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset))) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:05:49,574 INFO L273 TraceCheckUtils]: 9: Hoare triple {1051#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {1044#(and (forall ((v_DerPreprocessor_2 (_ BitVec 32))) (= (_ bv2 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset))) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:05:49,575 INFO L273 TraceCheckUtils]: 8: Hoare triple {1051#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1051#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-23 11:05:49,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {1058#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1051#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_2 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_2)))) (= main_~p~0.base main_~a~0.base)) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_main_~t~0.base_10 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_10))))))} is VALID [2018-11-23 11:05:49,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {1058#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1058#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:05:49,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {943#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1058#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:05:49,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {943#true} call #t~ret12 := main(); {943#true} is VALID [2018-11-23 11:05:49,578 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {943#true} {943#true} #97#return; {943#true} is VALID [2018-11-23 11:05:49,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {943#true} assume true; {943#true} is VALID [2018-11-23 11:05:49,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {943#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {943#true} is VALID [2018-11-23 11:05:49,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {943#true} call ULTIMATE.init(); {943#true} is VALID [2018-11-23 11:05:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:49,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:05:49,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:05:49,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 11:05:49,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:49,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:05:49,661 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:05:49,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:05:49,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:05:49,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:05:49,662 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 14 states. [2018-11-23 11:05:50,333 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-11-23 11:05:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:51,989 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-11-23 11:05:51,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:05:51,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 11:05:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:51,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:05:51,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2018-11-23 11:05:51,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:05:51,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2018-11-23 11:05:51,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2018-11-23 11:05:52,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:52,346 INFO L225 Difference]: With dead ends: 49 [2018-11-23 11:05:52,346 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:05:52,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:05:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:05:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 33. [2018-11-23 11:05:52,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:52,376 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 33 states. [2018-11-23 11:05:52,377 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 33 states. [2018-11-23 11:05:52,377 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 33 states. [2018-11-23 11:05:52,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:52,379 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 11:05:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 11:05:52,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:52,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:52,380 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 45 states. [2018-11-23 11:05:52,380 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 45 states. [2018-11-23 11:05:52,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:52,386 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 11:05:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 11:05:52,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:52,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:52,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:52,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:05:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-23 11:05:52,390 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 21 [2018-11-23 11:05:52,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:52,390 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-23 11:05:52,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:05:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 11:05:52,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:05:52,394 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:52,394 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:52,394 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:52,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:52,395 INFO L82 PathProgramCache]: Analyzing trace with hash 500577115, now seen corresponding path program 1 times [2018-11-23 11:05:52,398 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:52,398 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:05:52,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:52,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:52,493 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:05:52,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:05:52,515 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:52,515 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_20|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_20| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:05:52,515 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:05:52,574 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:52,576 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:52,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:05:52,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,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:05:52,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:05:52,611 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-23 11:05:52,644 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:52,645 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_25|, |v_#valid_21|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (store |v_#memory_int_25| main_~p~0.base (store (select |v_#memory_int_25| main_~p~0.base) main_~p~0.offset (_ bv1 32))) |#memory_int|) (= (_ bv0 1) (select |v_#valid_21| main_~t~0.base)) (= (_ bv0 1) (bvadd (select |v_#valid_21| main_~a~0.base) (_ bv1 1))) (= main_~a~0.offset main_~p~0.offset)) [2018-11-23 11:05:52,645 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2018-11-23 11:05:52,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 11:05:52,750 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:52,753 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 22 treesize of output 14 [2018-11-23 11:05:52,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 11:05:52,857 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:05:52,865 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:05:52,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,893 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:05:52,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-11-23 11:05:52,902 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:52,902 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_27|, v_main_~p~0.base_26, v_main_~p~0.offset_26]. (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |v_#memory_int_27| main_~p~0.base) (_ bv0 32)) (_ bv1 32)) (= (store |v_#memory_int_27| v_main_~p~0.base_26 (store (select |v_#memory_int_27| v_main_~p~0.base_26) v_main_~p~0.offset_26 (_ bv3 32))) |#memory_int|) (not (= v_main_~p~0.base_26 main_~p~0.base))) [2018-11-23 11:05:52,902 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_26, v_main_~p~0.offset_26]. (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv3 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv1 32))) [2018-11-23 11:05:53,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {1283#true} call ULTIMATE.init(); {1283#true} is VALID [2018-11-23 11:05:53,187 INFO L273 TraceCheckUtils]: 1: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1283#true} is VALID [2018-11-23 11:05:53,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-23 11:05:53,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1283#true} {1283#true} #97#return; {1283#true} is VALID [2018-11-23 11:05:53,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {1283#true} call #t~ret12 := main(); {1283#true} is VALID [2018-11-23 11:05:53,197 INFO L273 TraceCheckUtils]: 5: Hoare triple {1283#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1303#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:53,205 INFO L273 TraceCheckUtils]: 6: Hoare triple {1303#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1303#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:53,206 INFO L273 TraceCheckUtils]: 7: Hoare triple {1303#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1310#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:53,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {1310#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1314#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:53,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {1314#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1314#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:53,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {1314#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1321#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:53,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {1321#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1321#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:53,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {1321#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {1321#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:53,221 INFO L273 TraceCheckUtils]: 13: Hoare triple {1321#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1331#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:53,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1335#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem7|) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:53,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {1335#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_26 (_ BitVec 32)) (v_main_~p~0.offset_26 (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| v_main_~p~0.base_26) v_main_~p~0.offset_26) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_26 main_~p~0.base)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem7|) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {1284#false} is VALID [2018-11-23 11:05:53,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {1284#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1284#false} is VALID [2018-11-23 11:05:53,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {1284#false} assume !(2bv32 == #t~mem9);havoc #t~mem9; {1284#false} is VALID [2018-11-23 11:05:53,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {1284#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1284#false} is VALID [2018-11-23 11:05:53,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {1284#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {1284#false} is VALID [2018-11-23 11:05:53,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2018-11-23 11:05:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:53,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:05:53,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:53,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:53,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:05:53,556 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-23 11:05:53,568 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:53,568 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_29|, v_subst_2]. (or (not (= (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_29| main_~p~0.base) .cse0)))) |v_#memory_int_29|)) (= (bvadd (select (select (store |v_#memory_int_29| main_~t~0.base (store (select |v_#memory_int_29| main_~t~0.base) v_subst_2 (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:05:53,569 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_8]. (and (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset)) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:05:53,789 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-11-23 11:05:53,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-11-23 11:05:53,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,841 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 26 [2018-11-23 11:05:53,895 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 6 [2018-11-23 11:05:53,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:05:53,908 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:54,005 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:54,007 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2018-11-23 11:05:54,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:05:54,103 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:54,120 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:54,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:54,163 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 17 treesize of output 15 [2018-11-23 11:05:54,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 11:05:54,170 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:54,176 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:54,185 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 26 treesize of output 24 [2018-11-23 11:05:54,195 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-23 11:05:54,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-23 11:05:54,236 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:54,241 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 6 [2018-11-23 11:05:54,242 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:54,266 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:54,302 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:54,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-11-23 11:05:54,360 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 3 variables, input treesize:34, output treesize:42 [2018-11-23 11:05:54,369 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:54,369 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_8, |v_main_#t~malloc2.base_2|]. (and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset)) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))))) [2018-11-23 11:05:54,369 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|v_main_#t~malloc2.base_2|, v_prenex_6, v_prenex_5]. (let ((.cse0 (= main_~a~0.offset main_~p~0.offset))) (and (or (= (bvadd main_~p~0.offset (_ bv4 32)) main_~a~0.offset) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) .cse0) (or (= main_~p~0.base main_~a~0.base) (not (= (select |#valid| v_prenex_6) (_ bv0 1)))) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (not (= (select |#valid| v_prenex_5) (_ bv0 1))) .cse0))) [2018-11-23 11:05:54,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2018-11-23 11:05:54,530 INFO L273 TraceCheckUtils]: 19: Hoare triple {1284#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {1284#false} is VALID [2018-11-23 11:05:54,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {1284#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1284#false} is VALID [2018-11-23 11:05:54,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {1284#false} assume !(2bv32 == #t~mem9);havoc #t~mem9; {1284#false} is VALID [2018-11-23 11:05:54,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {1284#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1284#false} is VALID [2018-11-23 11:05:54,532 INFO L273 TraceCheckUtils]: 15: Hoare triple {1369#(= (_ bv1 32) |main_#t~mem7|)} assume !(1bv32 == #t~mem7);havoc #t~mem7; {1284#false} is VALID [2018-11-23 11:05:54,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {1373#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1369#(= (_ bv1 32) |main_#t~mem7|)} is VALID [2018-11-23 11:05:54,536 INFO L273 TraceCheckUtils]: 13: Hoare triple {1377#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1373#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:54,536 INFO L273 TraceCheckUtils]: 12: Hoare triple {1377#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {1377#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:54,537 INFO L273 TraceCheckUtils]: 11: Hoare triple {1377#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1377#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:54,542 INFO L273 TraceCheckUtils]: 10: Hoare triple {1387#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_8 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {1377#(forall ((main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:54,543 INFO L273 TraceCheckUtils]: 9: Hoare triple {1387#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_8 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1387#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_8 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-23 11:05:54,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {1394#(and (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_prenex_5 (_ BitVec 32))) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_6 (_ BitVec 32))) (not (= (select |#valid| v_prenex_6) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {1387#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_DerPreprocessor_8 (_ BitVec 32))) (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset))))} is VALID [2018-11-23 11:05:54,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {1398#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1394#(and (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_prenex_5 (_ BitVec 32))) (not (= (select |#valid| v_prenex_5) (_ bv0 1))))) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_6 (_ BitVec 32))) (not (= (select |#valid| v_prenex_6) (_ bv0 1)))) (= main_~p~0.base main_~a~0.base)))} is VALID [2018-11-23 11:05:54,549 INFO L273 TraceCheckUtils]: 6: Hoare triple {1398#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1398#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:05:54,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {1283#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1398#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:05:54,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {1283#true} call #t~ret12 := main(); {1283#true} is VALID [2018-11-23 11:05:54,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1283#true} {1283#true} #97#return; {1283#true} is VALID [2018-11-23 11:05:54,550 INFO L273 TraceCheckUtils]: 2: Hoare triple {1283#true} assume true; {1283#true} is VALID [2018-11-23 11:05:54,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1283#true} is VALID [2018-11-23 11:05:54,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {1283#true} call ULTIMATE.init(); {1283#true} is VALID [2018-11-23 11:05:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:54,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:05:54,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:05:54,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 11:05:54,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:54,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:05:54,605 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:54,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:05:54,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:05:54,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:05:54,606 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 14 states. [2018-11-23 11:05:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:56,940 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 11:05:56,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:05:56,941 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2018-11-23 11:05:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:05:56,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 11:05:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:05:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2018-11-23 11:05:56,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2018-11-23 11:05:57,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:57,049 INFO L225 Difference]: With dead ends: 45 [2018-11-23 11:05:57,049 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 11:05:57,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:05:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 11:05:57,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-23 11:05:57,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:57,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2018-11-23 11:05:57,099 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2018-11-23 11:05:57,100 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2018-11-23 11:05:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:57,102 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 11:05:57,103 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 11:05:57,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:57,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:57,103 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2018-11-23 11:05:57,104 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2018-11-23 11:05:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:57,105 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-23 11:05:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 11:05:57,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:57,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:57,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:57,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:05:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-23 11:05:57,108 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 21 [2018-11-23 11:05:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:57,108 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-23 11:05:57,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:05:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 11:05:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:05:57,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:57,109 INFO L402 BasicCegarLoop]: trace histogram [2, 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:05:57,109 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:57,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:57,110 INFO L82 PathProgramCache]: Analyzing trace with hash 2120030715, now seen corresponding path program 1 times [2018-11-23 11:05:57,110 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:57,110 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:05:57,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:57,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:57,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:57,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:57,225 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:05:57,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:05:57,240 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:57,240 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_27| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:05:57,240 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:05:57,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:57,321 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:57,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:05:57,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-23 11:05:57,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:05:57,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 11:05:57,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:05:57,658 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 10 treesize of output 9 [2018-11-23 11:05:57,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,699 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-11-23 11:05:57,730 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:57,730 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_21|, main_~t~0.offset, |v_#memory_$Pointer$.base_23|, main_~t~0.base]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (store |v_#memory_$Pointer$.offset_21| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_21| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= (store |v_#memory_$Pointer$.base_23| main_~a~0.base (store (select |v_#memory_$Pointer$.base_23| main_~a~0.base) .cse0 main_~t~0.base)) |#memory_$Pointer$.base|) (not (= main_~t~0.base main_~a~0.base)))) [2018-11-23 11:05:57,730 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1))))) [2018-11-23 11:05:57,834 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 94 treesize of output 95 [2018-11-23 11:05:57,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-23 11:05:57,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 11:05:57,928 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 16 treesize of output 15 [2018-11-23 11:05:57,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:57,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,004 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 59 treesize of output 55 [2018-11-23 11:05:58,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-23 11:05:58,015 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,023 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,035 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2018-11-23 11:05:58,118 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:58,118 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_24|, |v_#memory_int_31|, |v_#memory_$Pointer$.offset_22|]. (let ((.cse1 (select (select |v_#memory_$Pointer$.offset_22| main_~p~0.base) (_ bv4 32))) (.cse0 (select (select |v_#memory_$Pointer$.base_24| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (store |v_#memory_int_31| .cse0 (store (select |v_#memory_int_31| .cse0) .cse1 (_ bv3 32))) |#memory_int|) (= (store |v_#memory_$Pointer$.offset_22| .cse0 (store (select |v_#memory_$Pointer$.offset_22| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_24| .cse0 (store (select |v_#memory_$Pointer$.base_24| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:05:58,118 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv3 32)) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:05:58,208 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:05:58,222 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 13 [2018-11-23 11:05:58,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,251 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 29 treesize of output 23 [2018-11-23 11:05:58,263 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 23 treesize of output 14 [2018-11-23 11:05:58,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,289 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:05:58,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:9 [2018-11-23 11:05:58,293 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:58,294 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_32, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_32) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_32) (_ bv4 32)))) (and (= main_~p~0.offset .cse0) (= .cse1 main_~p~0.base) (= (bvadd (select (select |#memory_int| .cse1) .cse0) (_ bv4294967293 32)) (_ bv0 32)) (not (= v_main_~p~0.base_32 .cse1)))) [2018-11-23 11:05:58,294 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32))) [2018-11-23 11:05:58,371 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:05:58,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 11 treesize of output 3 [2018-11-23 11:05:58,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,386 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:05:58,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 11:05:58,390 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:58,390 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (_ bv3 32) .cse0) (= .cse0 |main_#t~mem11|))) [2018-11-23 11:05:58,391 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem11| (_ bv3 32)) [2018-11-23 11:05:58,419 INFO L256 TraceCheckUtils]: 0: Hoare triple {1608#true} call ULTIMATE.init(); {1608#true} is VALID [2018-11-23 11:05:58,419 INFO L273 TraceCheckUtils]: 1: Hoare triple {1608#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1608#true} is VALID [2018-11-23 11:05:58,419 INFO L273 TraceCheckUtils]: 2: Hoare triple {1608#true} assume true; {1608#true} is VALID [2018-11-23 11:05:58,419 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1608#true} {1608#true} #97#return; {1608#true} is VALID [2018-11-23 11:05:58,420 INFO L256 TraceCheckUtils]: 4: Hoare triple {1608#true} call #t~ret12 := main(); {1608#true} is VALID [2018-11-23 11:05:58,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {1608#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1628#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:58,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {1628#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1628#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:58,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {1628#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1635#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:58,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {1635#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1635#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:58,429 INFO L273 TraceCheckUtils]: 9: Hoare triple {1635#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {1642#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:05:58,432 INFO L273 TraceCheckUtils]: 10: Hoare triple {1642#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1642#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:05:58,434 INFO L273 TraceCheckUtils]: 11: Hoare triple {1642#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1649#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:05:58,436 INFO L273 TraceCheckUtils]: 12: Hoare triple {1649#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {1649#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:05:58,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {1649#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1656#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:05:58,440 INFO L273 TraceCheckUtils]: 14: Hoare triple {1656#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1656#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:05:58,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {1656#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {1656#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:05:58,446 INFO L273 TraceCheckUtils]: 16: Hoare triple {1656#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1656#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:05:58,448 INFO L273 TraceCheckUtils]: 17: Hoare triple {1656#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(2bv32 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:05:58,448 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:05:58,450 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2bv32 == #t~mem9);havoc #t~mem9; {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:05:58,450 INFO L273 TraceCheckUtils]: 20: Hoare triple {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1679#(= (bvadd |main_#t~mem11| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:05:58,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {1679#(= (bvadd |main_#t~mem11| (_ bv4294967293 32)) (_ bv0 32))} assume 3bv32 != #t~mem11;havoc #t~mem11; {1609#false} is VALID [2018-11-23 11:05:58,452 INFO L273 TraceCheckUtils]: 22: Hoare triple {1609#false} assume !false; {1609#false} is VALID [2018-11-23 11:05:58,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:58,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:05:58,746 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-23 11:05:58,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:58,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:58,807 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:58,837 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:58,933 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 47 treesize of output 39 [2018-11-23 11:05:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2018-11-23 11:05:58,947 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,958 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-11-23 11:05:58,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2018-11-23 11:05:58,981 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,989 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:59,040 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:59,048 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:59,060 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:59,067 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:59,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:05:59,089 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:60, output treesize:35 [2018-11-23 11:05:59,812 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:59,812 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_23|]. (or (not (= |v_#memory_$Pointer$.base_25| (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_25| main_~p~0.base) main_~p~0.offset))))) (not (= |v_#memory_$Pointer$.offset_23| (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_23| main_~p~0.base) main_~p~0.offset))))) (= (_ bv3 32) (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) (select (select |v_#memory_$Pointer$.base_25| main_~a~0.base) .cse0)) (select (select |v_#memory_$Pointer$.offset_23| main_~a~0.base) .cse0))))) [2018-11-23 11:05:59,812 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_10, v_DerPreprocessor_14]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_10)) main_~a~0.base) .cse0)) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) .cse0) main_~p~0.base))) [2018-11-23 11:06:00,033 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 37 treesize of output 29 [2018-11-23 11:06:00,154 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 11 treesize of output 10 [2018-11-23 11:06:00,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,224 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:06:00,232 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 8 treesize of output 1 [2018-11-23 11:06:00,233 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,272 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 20 treesize of output 24 [2018-11-23 11:06:00,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:06:00,290 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,333 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 12 treesize of output 3 [2018-11-23 11:06:00,342 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:06:00,385 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,397 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:00,438 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:06:00,580 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 37 treesize of output 29 [2018-11-23 11:06:00,655 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 11 treesize of output 10 [2018-11-23 11:06:00,658 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,717 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:06:00,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 8 treesize of output 1 [2018-11-23 11:06:00,728 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,736 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,766 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 20 treesize of output 24 [2018-11-23 11:06:00,778 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 11 [2018-11-23 11:06:00,781 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 11:06:00,822 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:06:00,856 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,869 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:00,914 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:06:01,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:06:01,088 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:75, output treesize:33 [2018-11-23 11:06:01,117 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:01,118 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, v_main_~p~0.offset_35, v_DerPreprocessor_14, |#memory_$Pointer$.offset|, v_prenex_7, v_DerPreprocessor_10]. (let ((.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~t~0.base (select (select (let ((.cse0 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse1 main_~t~0.base)))) (store .cse0 main_~t~0.base (store (select .cse0 main_~t~0.base) v_main_~p~0.offset_35 v_DerPreprocessor_14))) main_~a~0.base) .cse2)) (= v_prenex_7 (select (select (let ((.cse3 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1 v_prenex_7)))) (store .cse3 main_~t~0.base (store (select .cse3 main_~t~0.base) v_prenex_7 v_DerPreprocessor_10))) main_~a~0.base) .cse2)))) [2018-11-23 11:06:01,118 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (= main_~p~0.base main_~a~0.base)) (.cse1 (= (bvadd main_~p~0.offset (_ bv4 32)) (bvadd main_~a~0.offset (_ bv4 32)))) (.cse2 (= main_~t~0.base main_~a~0.base))) (and .cse0 .cse1 (not .cse2) (or .cse0 .cse2) (or .cse1 .cse2))) [2018-11-23 11:06:01,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {1609#false} assume !false; {1609#false} is VALID [2018-11-23 11:06:01,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {1679#(= (bvadd |main_#t~mem11| (_ bv4294967293 32)) (_ bv0 32))} assume 3bv32 != #t~mem11;havoc #t~mem11; {1609#false} is VALID [2018-11-23 11:06:01,368 INFO L273 TraceCheckUtils]: 20: Hoare triple {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1679#(= (bvadd |main_#t~mem11| (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:01,368 INFO L273 TraceCheckUtils]: 19: Hoare triple {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(2bv32 == #t~mem9);havoc #t~mem9; {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:06:01,369 INFO L273 TraceCheckUtils]: 18: Hoare triple {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:06:01,371 INFO L273 TraceCheckUtils]: 17: Hoare triple {1701#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume !!(2bv32 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {1669#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:06:01,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {1701#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1701#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:01,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {1701#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {1701#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:01,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {1701#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {1701#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:01,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {1714#(and (forall ((v_DerPreprocessor_14 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_10 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_10)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1701#(= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:01,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {1714#(and (forall ((v_DerPreprocessor_14 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_10 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_10)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {1714#(and (forall ((v_DerPreprocessor_14 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_10 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_10)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:06:01,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {1721#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {1714#(and (forall ((v_DerPreprocessor_14 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_14)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_10 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_10)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:06:01,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {1721#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {1721#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:01,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {1728#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_10 (_ BitVec 32))) (not (= (select |#valid| v_prenex_10) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((|v_main_#t~malloc5.base_3| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_3|) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {1721#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:01,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {1728#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_10 (_ BitVec 32))) (not (= (select |#valid| v_prenex_10) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((|v_main_#t~malloc5.base_3| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_3|) (_ bv0 1))))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1728#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_10 (_ BitVec 32))) (not (= (select |#valid| v_prenex_10) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((|v_main_#t~malloc5.base_3| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_3|) (_ bv0 1))))))} is VALID [2018-11-23 11:06:01,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {1735#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1728#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (forall ((v_prenex_10 (_ BitVec 32))) (not (= (select |#valid| v_prenex_10) (_ bv0 1)))) (= main_~p~0.offset main_~a~0.offset)) (or (= main_~p~0.base main_~a~0.base) (forall ((|v_main_#t~malloc5.base_3| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_3|) (_ bv0 1))))))} is VALID [2018-11-23 11:06:01,396 INFO L273 TraceCheckUtils]: 6: Hoare triple {1735#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {1735#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:06:01,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {1608#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {1735#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:06:01,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {1608#true} call #t~ret12 := main(); {1608#true} is VALID [2018-11-23 11:06:01,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1608#true} {1608#true} #97#return; {1608#true} is VALID [2018-11-23 11:06:01,398 INFO L273 TraceCheckUtils]: 2: Hoare triple {1608#true} assume true; {1608#true} is VALID [2018-11-23 11:06:01,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {1608#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1608#true} is VALID [2018-11-23 11:06:01,399 INFO L256 TraceCheckUtils]: 0: Hoare triple {1608#true} call ULTIMATE.init(); {1608#true} is VALID [2018-11-23 11:06:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:01,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:06:01,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-11-23 11:06:01,415 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 11:06:01,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:01,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:06:01,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:01,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:06:01,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:06:01,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:06:01,565 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 14 states. [2018-11-23 11:06:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:03,870 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2018-11-23 11:06:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:06:03,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 11:06:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:06:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-23 11:06:03,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:06:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2018-11-23 11:06:03,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 61 transitions. [2018-11-23 11:06:03,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:04,001 INFO L225 Difference]: With dead ends: 64 [2018-11-23 11:06:04,001 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:06:04,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:06:04,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:06:04,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2018-11-23 11:06:04,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:04,083 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 50 states. [2018-11-23 11:06:04,083 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 50 states. [2018-11-23 11:06:04,083 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 50 states. [2018-11-23 11:06:04,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:04,087 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-23 11:06:04,087 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 11:06:04,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:04,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:04,087 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 60 states. [2018-11-23 11:06:04,087 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 60 states. [2018-11-23 11:06:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:04,090 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-23 11:06:04,090 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 11:06:04,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:04,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:04,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:04,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:04,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:06:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 60 transitions. [2018-11-23 11:06:04,093 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 60 transitions. Word has length 23 [2018-11-23 11:06:04,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:04,093 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 60 transitions. [2018-11-23 11:06:04,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:06:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2018-11-23 11:06:04,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:06:04,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:04,094 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:04,094 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:04,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:04,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1583695286, now seen corresponding path program 2 times [2018-11-23 11:06:04,095 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:04,095 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:06:04,116 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:06:04,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:06:04,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:06:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:04,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:04,289 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:06:04,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:06:04,407 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:04,408 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_34|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_34| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:06:04,408 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:06:04,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:04,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:04,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:06:04,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-23 11:06:04,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:04,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 11:06:04,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:04,854 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 10 treesize of output 9 [2018-11-23 11:06:04,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-11-23 11:06:04,917 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:04,917 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_26|, main_~t~0.offset, main_~t~0.base, |v_#memory_$Pointer$.base_28|]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_26| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_26| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|) (= (store |v_#memory_$Pointer$.base_28| main_~a~0.base (store (select |v_#memory_$Pointer$.base_28| main_~a~0.base) .cse0 main_~t~0.base)) |#memory_$Pointer$.base|))) [2018-11-23 11:06:04,917 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1))))) [2018-11-23 11:06:04,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 11:06:04,998 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 16 treesize of output 15 [2018-11-23 11:06:04,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,074 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 94 treesize of output 90 [2018-11-23 11:06:05,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-23 11:06:05,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,197 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 51 treesize of output 52 [2018-11-23 11:06:05,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-23 11:06:05,204 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,212 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,225 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2018-11-23 11:06:05,312 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:05,312 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_29|, |v_#memory_int_35|, |v_#memory_$Pointer$.offset_27|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_29| main_~p~0.base) (_ bv4 32))) (.cse1 (select (select |v_#memory_$Pointer$.offset_27| main_~p~0.base) (_ bv4 32)))) (and (not (= main_~p~0.base .cse0)) (= main_~p~0.offset (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_27| .cse0 (store (select |v_#memory_$Pointer$.offset_27| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (= (store |v_#memory_int_35| .cse0 (store (select |v_#memory_int_35| .cse0) .cse1 (_ bv3 32))) |#memory_int|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_29| .cse0 (store (select |v_#memory_$Pointer$.base_29| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))))) [2018-11-23 11:06:05,312 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv3 32)) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:06:05,417 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:06:05,424 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 13 [2018-11-23 11:06:05,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,446 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 29 treesize of output 23 [2018-11-23 11:06:05,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 23 treesize of output 14 [2018-11-23 11:06:05,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,482 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:06:05,482 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:9 [2018-11-23 11:06:05,487 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:05,487 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_39, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_39) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_39) (_ bv4 32)))) (and (not (= v_main_~p~0.base_39 .cse0)) (= main_~p~0.offset .cse1) (= .cse0 main_~p~0.base) (= (bvadd (select (select |#memory_int| .cse0) .cse1) (_ bv4294967293 32)) (_ bv0 32)))) [2018-11-23 11:06:05,488 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32))) [2018-11-23 11:06:05,512 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:06:05,516 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:06:05,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,520 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,521 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:06:05,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 11:06:05,525 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:05,525 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (_ bv3 32) .cse0) (= .cse0 |main_#t~mem9|))) [2018-11-23 11:06:05,525 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv3 32) |main_#t~mem9|) [2018-11-23 11:06:05,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2018-11-23 11:06:05,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {2028#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2028#true} is VALID [2018-11-23 11:06:05,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2018-11-23 11:06:05,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #97#return; {2028#true} is VALID [2018-11-23 11:06:05,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret12 := main(); {2028#true} is VALID [2018-11-23 11:06:05,544 INFO L273 TraceCheckUtils]: 5: Hoare triple {2028#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {2048#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:05,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {2048#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2048#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:05,545 INFO L273 TraceCheckUtils]: 7: Hoare triple {2048#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2055#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:06:05,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {2055#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2055#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:06:05,548 INFO L273 TraceCheckUtils]: 9: Hoare triple {2055#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2062#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:05,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {2062#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2062#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:05,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {2062#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2069#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:06:05,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {2069#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {2069#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:06:05,554 INFO L273 TraceCheckUtils]: 13: Hoare triple {2069#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2076#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:05,555 INFO L273 TraceCheckUtils]: 14: Hoare triple {2076#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2076#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:05,556 INFO L273 TraceCheckUtils]: 15: Hoare triple {2076#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {2076#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:05,557 INFO L273 TraceCheckUtils]: 16: Hoare triple {2076#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2076#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:05,560 INFO L273 TraceCheckUtils]: 17: Hoare triple {2076#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(2bv32 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2089#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:06:05,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {2089#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2093#(= (_ bv3 32) |main_#t~mem9|)} is VALID [2018-11-23 11:06:05,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {2093#(= (_ bv3 32) |main_#t~mem9|)} assume !!(2bv32 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2029#false} is VALID [2018-11-23 11:06:05,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {2029#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2029#false} is VALID [2018-11-23 11:06:05,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {2029#false} assume !(2bv32 == #t~mem9);havoc #t~mem9; {2029#false} is VALID [2018-11-23 11:06:05,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {2029#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2029#false} is VALID [2018-11-23 11:06:05,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {2029#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {2029#false} is VALID [2018-11-23 11:06:05,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2018-11-23 11:06:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:05,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:06:05,783 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 32 treesize of output 24 [2018-11-23 11:06:05,794 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 14 treesize of output 1 [2018-11-23 11:06:05,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,811 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 32 treesize of output 24 [2018-11-23 11:06:05,820 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 14 treesize of output 1 [2018-11-23 11:06:05,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,829 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,893 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:05,904 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:05,910 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,918 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,968 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,975 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:05,986 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:05,994 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:06,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:06:06,016 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2018-11-23 11:06:06,333 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:06,334 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_28|]. (or (not (= |v_#memory_$Pointer$.base_30| (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_30| main_~p~0.base) main_~p~0.offset))))) (not (= (_ bv2 32) (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) (select (select |v_#memory_$Pointer$.base_30| main_~a~0.base) .cse0)) (select (select |v_#memory_$Pointer$.offset_28| main_~a~0.base) .cse0))))) (not (= |v_#memory_$Pointer$.offset_28| (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_28| main_~p~0.base) main_~p~0.offset)))))) [2018-11-23 11:06:06,334 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_18, v_DerPreprocessor_24]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) .cse0)) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_24)) main_~a~0.base) .cse0)))) [2018-11-23 11:06:06,522 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 37 treesize of output 29 [2018-11-23 11:06:06,597 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 11 treesize of output 10 [2018-11-23 11:06:06,598 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,674 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 20 treesize of output 24 [2018-11-23 11:06:06,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:06:06,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:06:06,724 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,754 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 12 treesize of output 3 [2018-11-23 11:06:06,755 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:06,770 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:06:06,779 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 8 treesize of output 1 [2018-11-23 11:06:06,779 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,790 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:06:06,983 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 37 treesize of output 29 [2018-11-23 11:06:07,064 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 11 treesize of output 10 [2018-11-23 11:06:07,066 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:07,152 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 20 treesize of output 24 [2018-11-23 11:06:07,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:06:07,167 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:07,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:06:07,215 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:07,242 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 12 treesize of output 3 [2018-11-23 11:06:07,247 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:07,256 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:07,261 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:06:07,268 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 8 treesize of output 1 [2018-11-23 11:06:07,269 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:07,277 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:07,314 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:06:07,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:06:07,485 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:75, output treesize:33 [2018-11-23 11:06:07,508 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:07,509 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, v_prenex_11, v_DerPreprocessor_18, |#memory_$Pointer$.offset|, main_~t~0.offset, v_DerPreprocessor_24]. (let ((.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~t~0.base (select (select (let ((.cse0 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse1 main_~t~0.base)))) (store .cse0 main_~t~0.base (store (select .cse0 main_~t~0.base) v_prenex_11 v_DerPreprocessor_18))) main_~a~0.base) .cse2)) (= (select (select (let ((.cse3 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1 main_~t~0.offset)))) (store .cse3 main_~t~0.base (store (select .cse3 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_24))) main_~a~0.base) .cse2) main_~t~0.offset))) [2018-11-23 11:06:07,509 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (= main_~p~0.base main_~a~0.base)) (.cse1 (= (bvadd main_~p~0.offset (_ bv4 32)) (bvadd main_~a~0.offset (_ bv4 32)))) (.cse2 (= main_~t~0.base main_~a~0.base))) (and .cse0 .cse1 (not .cse2) (or .cse0 .cse2) (or .cse1 .cse2))) [2018-11-23 11:06:07,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {2029#false} assume !false; {2029#false} is VALID [2018-11-23 11:06:07,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {2029#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {2029#false} is VALID [2018-11-23 11:06:07,786 INFO L273 TraceCheckUtils]: 22: Hoare triple {2029#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2029#false} is VALID [2018-11-23 11:06:07,787 INFO L273 TraceCheckUtils]: 21: Hoare triple {2029#false} assume !(2bv32 == #t~mem9);havoc #t~mem9; {2029#false} is VALID [2018-11-23 11:06:07,787 INFO L273 TraceCheckUtils]: 20: Hoare triple {2029#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2029#false} is VALID [2018-11-23 11:06:07,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {2127#(not (= (_ bv2 32) |main_#t~mem9|))} assume !!(2bv32 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2029#false} is VALID [2018-11-23 11:06:07,788 INFO L273 TraceCheckUtils]: 18: Hoare triple {2131#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2127#(not (= (_ bv2 32) |main_#t~mem9|))} is VALID [2018-11-23 11:06:07,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {2135#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume !!(2bv32 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2131#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:07,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {2135#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2135#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:07,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {2135#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {2135#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:07,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {2135#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2135#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:07,796 INFO L273 TraceCheckUtils]: 13: Hoare triple {2148#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (forall ((v_DerPreprocessor_24 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_24)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2135#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:07,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {2148#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (forall ((v_DerPreprocessor_24 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_24)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {2148#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (forall ((v_DerPreprocessor_24 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_24)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:06:07,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {2155#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2148#(and (forall ((v_DerPreprocessor_18 (_ BitVec 32))) (= main_~p~0.base (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_18)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (forall ((v_DerPreprocessor_24 (_ BitVec 32))) (= main_~p~0.offset (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_24)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:06:07,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {2155#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2155#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:07,805 INFO L273 TraceCheckUtils]: 9: Hoare triple {2162#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc5.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_4|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_14 (_ BitVec 32))) (not (= (select |#valid| v_prenex_14) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2155#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:07,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {2162#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc5.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_4|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_14 (_ BitVec 32))) (not (= (select |#valid| v_prenex_14) (_ bv0 1))))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2162#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc5.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_4|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_14 (_ BitVec 32))) (not (= (select |#valid| v_prenex_14) (_ bv0 1))))))} is VALID [2018-11-23 11:06:07,807 INFO L273 TraceCheckUtils]: 7: Hoare triple {2169#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2162#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc5.base_4| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_4|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_14 (_ BitVec 32))) (not (= (select |#valid| v_prenex_14) (_ bv0 1))))))} is VALID [2018-11-23 11:06:07,807 INFO L273 TraceCheckUtils]: 6: Hoare triple {2169#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2169#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:06:07,808 INFO L273 TraceCheckUtils]: 5: Hoare triple {2028#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {2169#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:06:07,809 INFO L256 TraceCheckUtils]: 4: Hoare triple {2028#true} call #t~ret12 := main(); {2028#true} is VALID [2018-11-23 11:06:07,809 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2028#true} {2028#true} #97#return; {2028#true} is VALID [2018-11-23 11:06:07,809 INFO L273 TraceCheckUtils]: 2: Hoare triple {2028#true} assume true; {2028#true} is VALID [2018-11-23 11:06:07,809 INFO L273 TraceCheckUtils]: 1: Hoare triple {2028#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2028#true} is VALID [2018-11-23 11:06:07,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {2028#true} call ULTIMATE.init(); {2028#true} is VALID [2018-11-23 11:06:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:07,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:06:07,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:06:07,816 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-23 11:06:07,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:07,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:06:07,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:07,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:06:07,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:06:07,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:06:07,892 INFO L87 Difference]: Start difference. First operand 50 states and 60 transitions. Second operand 16 states. [2018-11-23 11:06:10,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:10,785 INFO L93 Difference]: Finished difference Result 66 states and 77 transitions. [2018-11-23 11:06:10,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:06:10,786 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-23 11:06:10,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:10,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:06:10,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2018-11-23 11:06:10,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:06:10,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 63 transitions. [2018-11-23 11:06:10,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 63 transitions. [2018-11-23 11:06:10,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:10,929 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:06:10,929 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 11:06:10,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:06:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 11:06:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2018-11-23 11:06:10,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:10,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 45 states. [2018-11-23 11:06:10,998 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 45 states. [2018-11-23 11:06:10,998 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 45 states. [2018-11-23 11:06:11,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:11,001 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-23 11:06:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-23 11:06:11,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:11,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:11,002 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 56 states. [2018-11-23 11:06:11,002 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 56 states. [2018-11-23 11:06:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:11,004 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-23 11:06:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2018-11-23 11:06:11,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:11,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:11,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:11,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:06:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-23 11:06:11,006 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 25 [2018-11-23 11:06:11,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:11,006 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 11:06:11,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:06:11,006 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-23 11:06:11,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:06:11,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:11,007 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:11,007 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:11,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:11,007 INFO L82 PathProgramCache]: Analyzing trace with hash -494519882, now seen corresponding path program 1 times [2018-11-23 11:06:11,007 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:11,008 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:06:11,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:06:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:11,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:11,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:11,173 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:06:11,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:06:11,190 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:11,191 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_41|]. (and (= main_~a~0.offset (_ bv0 32)) (= (store |v_#valid_41| main_~a~0.base (_ bv1 1)) |#valid|)) [2018-11-23 11:06:11,191 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:06:11,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:11,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:11,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:06:11,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:14 [2018-11-23 11:06:11,284 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:11,284 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_42|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 1) (bvadd (select |v_#valid_42| main_~a~0.base) (_ bv1 1))) (= main_~a~0.offset main_~p~0.offset) (= (select |v_#valid_42| main_~t~0.base) (_ bv0 1))) [2018-11-23 11:06:11,284 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:06:11,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:11,354 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 10 treesize of output 9 [2018-11-23 11:06:11,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:11,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 11:06:11,417 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,455 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:52, output treesize:32 [2018-11-23 11:06:11,482 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:11,482 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_33|, main_~t~0.base, |v_#memory_$Pointer$.offset_31|, main_~t~0.offset]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_33| main_~a~0.base (store (select |v_#memory_$Pointer$.base_33| main_~a~0.base) .cse0 main_~t~0.base))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.offset_31| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_31| main_~a~0.base) .cse0 main_~t~0.offset)) |#memory_$Pointer$.offset|))) [2018-11-23 11:06:11,482 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse1))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse1))))) [2018-11-23 11:06:11,579 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 94 treesize of output 95 [2018-11-23 11:06:11,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-23 11:06:11,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,677 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 67 treesize of output 63 [2018-11-23 11:06:11,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-23 11:06:11,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,696 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-23 11:06:11,728 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 16 treesize of output 15 [2018-11-23 11:06:11,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,735 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,747 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2018-11-23 11:06:11,821 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:11,821 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_34|, |v_#memory_int_39|, |v_#memory_$Pointer$.offset_32|]. (let ((.cse1 (select (select |v_#memory_$Pointer$.offset_32| main_~p~0.base) (_ bv4 32))) (.cse0 (select (select |v_#memory_$Pointer$.base_34| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_34| .cse0 (store (select |v_#memory_$Pointer$.base_34| .cse0) .cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |v_#memory_int_39| .cse0 (store (select |v_#memory_int_39| .cse0) .cse1 (_ bv3 32))) |#memory_int|) (= (store |v_#memory_$Pointer$.offset_32| .cse0 (store (select |v_#memory_$Pointer$.offset_32| .cse0) .cse1 (select (select |#memory_$Pointer$.offset| .cse0) .cse1))) |#memory_$Pointer$.offset|) (not (= main_~p~0.base .cse0)))) [2018-11-23 11:06:11,822 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv3 32)) (not (= .cse0 main_~p~0.base)))) [2018-11-23 11:06:11,872 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:06:11,877 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 13 [2018-11-23 11:06:11,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,898 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 29 treesize of output 23 [2018-11-23 11:06:11,904 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 23 treesize of output 14 [2018-11-23 11:06:11,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,925 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:06:11,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:9 [2018-11-23 11:06:11,929 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:11,930 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_47, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_47) (_ bv4 32))) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_47) (_ bv4 32)))) (and (= (bvadd (select (select |#memory_int| .cse0) .cse1) (_ bv4294967293 32)) (_ bv0 32)) (= main_~p~0.offset .cse1) (= .cse0 main_~p~0.base) (not (= v_main_~p~0.base_47 .cse0)))) [2018-11-23 11:06:11,930 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967293 32))) [2018-11-23 11:06:11,955 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:06:11,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 11 treesize of output 3 [2018-11-23 11:06:11,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,964 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:06:11,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 11:06:11,968 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:11,968 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) (and (= (_ bv3 32) .cse0) (= .cse0 |main_#t~mem7|))) [2018-11-23 11:06:11,968 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv3 32) |main_#t~mem7|) [2018-11-23 11:06:11,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2018-11-23 11:06:11,987 INFO L273 TraceCheckUtils]: 1: Hoare triple {2456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2456#true} is VALID [2018-11-23 11:06:11,987 INFO L273 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2018-11-23 11:06:11,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #97#return; {2456#true} is VALID [2018-11-23 11:06:11,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret12 := main(); {2456#true} is VALID [2018-11-23 11:06:11,992 INFO L273 TraceCheckUtils]: 5: Hoare triple {2456#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {2476#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:11,993 INFO L273 TraceCheckUtils]: 6: Hoare triple {2476#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2476#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:11,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {2476#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2483#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:06:11,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {2483#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2483#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:06:11,996 INFO L273 TraceCheckUtils]: 9: Hoare triple {2483#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2490#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:11,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {2490#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2490#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:11,998 INFO L273 TraceCheckUtils]: 11: Hoare triple {2490#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2497#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:06:12,000 INFO L273 TraceCheckUtils]: 12: Hoare triple {2497#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {2497#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:06:12,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {2497#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2504#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:12,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {2504#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2504#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:12,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {2504#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(1bv32 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2511#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 11:06:12,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {2511#(= (_ bv3 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2515#(= (_ bv3 32) |main_#t~mem7|)} is VALID [2018-11-23 11:06:12,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {2515#(= (_ bv3 32) |main_#t~mem7|)} assume !!(1bv32 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2457#false} is VALID [2018-11-23 11:06:12,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {2457#false} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2457#false} is VALID [2018-11-23 11:06:12,007 INFO L273 TraceCheckUtils]: 19: Hoare triple {2457#false} assume !(1bv32 == #t~mem7);havoc #t~mem7; {2457#false} is VALID [2018-11-23 11:06:12,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {2457#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2457#false} is VALID [2018-11-23 11:06:12,007 INFO L273 TraceCheckUtils]: 21: Hoare triple {2457#false} assume !(2bv32 == #t~mem9);havoc #t~mem9; {2457#false} is VALID [2018-11-23 11:06:12,007 INFO L273 TraceCheckUtils]: 22: Hoare triple {2457#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2457#false} is VALID [2018-11-23 11:06:12,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {2457#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {2457#false} is VALID [2018-11-23 11:06:12,008 INFO L273 TraceCheckUtils]: 24: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2018-11-23 11:06:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:12,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:06:12,269 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:12,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:12,319 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:12,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:12,651 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 40 treesize of output 32 [2018-11-23 11:06:12,708 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 22 treesize of output 1 [2018-11-23 11:06:12,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:12,766 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:12,781 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 48 treesize of output 40 [2018-11-23 11:06:12,846 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 1 [2018-11-23 11:06:12,868 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:12,892 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:12,934 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:12,942 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:12,956 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:12,964 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:12,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:06:12,991 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:61, output treesize:35 [2018-11-23 11:06:13,062 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:13,063 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_33|]. (or (not (= (_ bv1 32) (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))) (select (select |v_#memory_$Pointer$.base_35| main_~a~0.base) .cse0)) (select (select |v_#memory_$Pointer$.offset_33| main_~a~0.base) .cse0))))) (not (= |v_#memory_$Pointer$.offset_33| (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_33| main_~p~0.base) main_~p~0.offset))))) (not (= |v_#memory_$Pointer$.base_35| (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_35| main_~p~0.base) main_~p~0.offset)))))) [2018-11-23 11:06:13,063 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_28, v_DerPreprocessor_32]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_28)) main_~a~0.base) .cse0) main_~p~0.offset) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_32)) main_~a~0.base) .cse0) main_~p~0.base))) [2018-11-23 11:06:13,300 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 37 treesize of output 29 [2018-11-23 11:06:13,378 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 11 treesize of output 10 [2018-11-23 11:06:13,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,499 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 20 treesize of output 24 [2018-11-23 11:06:13,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:06:13,524 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:06:13,580 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,617 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 12 treesize of output 3 [2018-11-23 11:06:13,623 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:13,655 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:06:13,709 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 8 treesize of output 1 [2018-11-23 11:06:13,715 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,727 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:06:13,933 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 37 treesize of output 29 [2018-11-23 11:06:14,016 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 11 treesize of output 10 [2018-11-23 11:06:14,018 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2018-11-23 11:06:14,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-23 11:06:14,110 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,148 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 12 treesize of output 3 [2018-11-23 11:06:14,150 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2018-11-23 11:06:14,184 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,194 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:14,199 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:06:14,208 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 8 treesize of output 1 [2018-11-23 11:06:14,209 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,218 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,258 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:06:14,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-11-23 11:06:14,432 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:75, output treesize:33 [2018-11-23 11:06:14,484 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:14,485 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_$Pointer$.base|, main_~t~0.offset, v_DerPreprocessor_32, |#memory_$Pointer$.offset|, v_prenex_15, v_DerPreprocessor_28]. (let ((.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~t~0.base (select (select (let ((.cse0 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse1 main_~t~0.base)))) (store .cse0 main_~t~0.base (store (select .cse0 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_32))) main_~a~0.base) .cse2)) (= v_prenex_15 (select (select (let ((.cse3 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse1 v_prenex_15)))) (store .cse3 main_~t~0.base (store (select .cse3 main_~t~0.base) v_prenex_15 v_DerPreprocessor_28))) main_~a~0.base) .cse2)))) [2018-11-23 11:06:14,485 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (= main_~p~0.base main_~a~0.base)) (.cse1 (= (bvadd main_~p~0.offset (_ bv4 32)) (bvadd main_~a~0.offset (_ bv4 32)))) (.cse2 (= main_~t~0.base main_~a~0.base))) (and .cse0 .cse1 (not .cse2) (or .cse0 .cse2) (or .cse1 .cse2))) [2018-11-23 11:06:14,764 INFO L273 TraceCheckUtils]: 24: Hoare triple {2457#false} assume !false; {2457#false} is VALID [2018-11-23 11:06:14,764 INFO L273 TraceCheckUtils]: 23: Hoare triple {2457#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {2457#false} is VALID [2018-11-23 11:06:14,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {2457#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2457#false} is VALID [2018-11-23 11:06:14,765 INFO L273 TraceCheckUtils]: 21: Hoare triple {2457#false} assume !(2bv32 == #t~mem9);havoc #t~mem9; {2457#false} is VALID [2018-11-23 11:06:14,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {2457#false} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2457#false} is VALID [2018-11-23 11:06:14,765 INFO L273 TraceCheckUtils]: 19: Hoare triple {2457#false} assume !(1bv32 == #t~mem7);havoc #t~mem7; {2457#false} is VALID [2018-11-23 11:06:14,766 INFO L273 TraceCheckUtils]: 18: Hoare triple {2457#false} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2457#false} is VALID [2018-11-23 11:06:14,766 INFO L273 TraceCheckUtils]: 17: Hoare triple {2561#(not (= (_ bv1 32) |main_#t~mem7|))} assume !!(1bv32 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2457#false} is VALID [2018-11-23 11:06:14,767 INFO L273 TraceCheckUtils]: 16: Hoare triple {2565#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2561#(not (= (_ bv1 32) |main_#t~mem7|))} is VALID [2018-11-23 11:06:14,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {2569#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(1bv32 == #t~mem7);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {2565#(not (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:14,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {2569#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2569#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:14,773 INFO L273 TraceCheckUtils]: 13: Hoare triple {2576#(and (forall ((v_DerPreprocessor_32 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_32)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_28 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_28)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.offset)))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2569#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:14,774 INFO L273 TraceCheckUtils]: 12: Hoare triple {2576#(and (forall ((v_DerPreprocessor_32 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_32)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_28 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_28)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.offset)))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {2576#(and (forall ((v_DerPreprocessor_32 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_32)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_28 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_28)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.offset)))} is VALID [2018-11-23 11:06:14,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {2583#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2576#(and (forall ((v_DerPreprocessor_32 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_32)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base)) (forall ((v_DerPreprocessor_28 (_ BitVec 32))) (= (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_28)) main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.offset)))} is VALID [2018-11-23 11:06:14,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {2583#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2583#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:14,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {2590#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc5.base_5| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_5|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (select |#valid| v_prenex_18) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2583#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:14,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {2590#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc5.base_5| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_5|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (select |#valid| v_prenex_18) (_ bv0 1))))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2590#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc5.base_5| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_5|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (select |#valid| v_prenex_18) (_ bv0 1))))))} is VALID [2018-11-23 11:06:14,784 INFO L273 TraceCheckUtils]: 7: Hoare triple {2597#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2590#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.offset main_~a~0.offset) (forall ((|v_main_#t~malloc5.base_5| (_ BitVec 32))) (not (= (select |#valid| |v_main_#t~malloc5.base_5|) (_ bv0 1))))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_18 (_ BitVec 32))) (not (= (select |#valid| v_prenex_18) (_ bv0 1))))))} is VALID [2018-11-23 11:06:14,784 INFO L273 TraceCheckUtils]: 6: Hoare triple {2597#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2597#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:06:14,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {2456#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {2597#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:06:14,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {2456#true} call #t~ret12 := main(); {2456#true} is VALID [2018-11-23 11:06:14,786 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2456#true} {2456#true} #97#return; {2456#true} is VALID [2018-11-23 11:06:14,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {2456#true} assume true; {2456#true} is VALID [2018-11-23 11:06:14,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {2456#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2456#true} is VALID [2018-11-23 11:06:14,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {2456#true} call ULTIMATE.init(); {2456#true} is VALID [2018-11-23 11:06:14,790 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:14,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:06:14,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:06:14,794 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-23 11:06:14,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:14,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:06:14,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:14,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:06:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:06:14,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:06:14,893 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 16 states. [2018-11-23 11:06:17,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:17,595 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-23 11:06:17,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:06:17,595 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-23 11:06:17,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:06:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 11:06:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:06:17,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 11:06:17,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2018-11-23 11:06:17,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:17,704 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:06:17,704 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:06:17,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:06:17,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:06:17,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-11-23 11:06:17,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:17,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2018-11-23 11:06:17,753 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2018-11-23 11:06:17,753 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2018-11-23 11:06:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:17,756 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 11:06:17,756 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 11:06:17,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:17,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:17,756 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2018-11-23 11:06:17,757 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2018-11-23 11:06:17,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:17,758 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-11-23 11:06:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-11-23 11:06:17,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:17,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:17,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:17,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:17,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:06:17,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-23 11:06:17,761 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 25 [2018-11-23 11:06:17,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:17,761 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-23 11:06:17,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:06:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-23 11:06:17,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:06:17,762 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:17,762 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] [2018-11-23 11:06:17,762 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:17,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:17,763 INFO L82 PathProgramCache]: Analyzing trace with hash -779337393, now seen corresponding path program 3 times [2018-11-23 11:06:17,763 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:17,763 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:06:17,786 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:06:17,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 11:06:17,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:06:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:17,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:17,949 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:06:17,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:17,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:17,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:06:17,962 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:17,962 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_48|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_48| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:06:17,962 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:06:18,024 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:18,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:18,026 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 19 treesize of output 23 [2018-11-23 11:06:18,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:29 [2018-11-23 11:06:18,070 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:18,071 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_49|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 1) (select |v_#valid_49| main_~t~0.base)) (= (_ bv0 1) (bvadd (select |v_#valid_49| main_~a~0.base) (_ bv1 1))) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (= |#valid| (store |v_#valid_49| main_~t~0.base (_ bv1 1)))) [2018-11-23 11:06:18,071 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= (select |#valid| main_~t~0.base) (_ bv1 1)) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:06:18,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:18,156 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 10 treesize of output 9 [2018-11-23 11:06:18,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:18,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 11:06:18,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,245 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,278 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:06:18,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:61 [2018-11-23 11:06:18,403 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:18,404 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_38|, main_~t~0.base, |v_#memory_$Pointer$.offset_36|]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (store |v_#memory_$Pointer$.offset_36| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_36| main_~a~0.base) .cse0 (_ bv0 32))) |#memory_$Pointer$.offset|) (= main_~a~0.offset (_ bv0 32)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_38| main_~a~0.base (store (select |v_#memory_$Pointer$.base_38| main_~a~0.base) .cse0 main_~t~0.base))) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))) [2018-11-23 11:06:18,404 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse2))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= (_ bv0 32) .cse1) (= (bvadd (select |#valid| .cse0) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset .cse1) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1))))) [2018-11-23 11:06:18,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:18,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:18,506 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:18,507 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 26 treesize of output 25 [2018-11-23 11:06:18,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,669 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 14 [2018-11-23 11:06:18,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-11-23 11:06:18,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:18,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 65 [2018-11-23 11:06:18,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 17 [2018-11-23 11:06:18,936 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,966 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,034 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:19,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 60 [2018-11-23 11:06:19,058 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 18 treesize of output 23 [2018-11-23 11:06:19,068 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,088 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,126 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:110, output treesize:77 [2018-11-23 11:06:19,169 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:19,169 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_39|, |v_#valid_50|, |v_#memory_$Pointer$.offset_37|, |v_#memory_int_43|]. (let ((.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.base_39| main_~a~0.base) .cse2)) (.cse1 (select (select |v_#memory_$Pointer$.offset_37| main_~a~0.base) .cse2))) (and (= (_ bv0 1) (bvadd (select |v_#valid_50| .cse0) (_ bv1 1))) (= main_~p~0.base .cse0) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |v_#valid_50| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (not (= main_~a~0.base .cse0)) (= main_~t~0.offset (_ bv0 32)) (= (_ bv0 1) (select |v_#valid_50| main_~t~0.base)) (= main_~p~0.offset .cse1) (= (_ bv0 32) .cse1) (= (store |v_#memory_$Pointer$.base_39| main_~p~0.base (store (select |v_#memory_$Pointer$.base_39| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.base|) (= (store |v_#memory_int_43| main_~p~0.base (store (select |v_#memory_int_43| main_~p~0.base) main_~p~0.offset (_ bv2 32))) |#memory_int|) (= (store |v_#memory_$Pointer$.offset_37| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_37| main_~p~0.base) main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset))) |#memory_$Pointer$.offset|)))) [2018-11-23 11:06:19,170 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse2))) (and (not (= .cse0 main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= (_ bv0 32) .cse1) (= main_~p~0.offset .cse1) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| .cse0) .cse1))))) [2018-11-23 11:06:19,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:19,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 204 [2018-11-23 11:06:19,341 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 40 treesize of output 36 [2018-11-23 11:06:19,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 52 [2018-11-23 11:06:19,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:19,600 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 52 treesize of output 38 [2018-11-23 11:06:19,613 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,693 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:19,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 124 [2018-11-23 11:06:19,717 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 22 treesize of output 21 [2018-11-23 11:06:19,719 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,754 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,810 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:209, output treesize:145 [2018-11-23 11:06:19,894 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:19,894 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_40|, |v_#memory_$Pointer$.offset_38|, |v_#memory_int_44|, main_~t~0.base]. (let ((.cse4 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |v_#memory_$Pointer$.offset_38| main_~a~0.base) .cse4)) (.cse2 (select (select |v_#memory_$Pointer$.base_40| main_~a~0.base) .cse4))) (let ((.cse1 (select |v_#memory_int_44| .cse2)) (.cse3 (bvadd .cse0 (_ bv4 32)))) (and (= .cse0 (_ bv0 32)) (= main_~a~0.offset (_ bv0 32)) (= (select .cse1 .cse0) (_ bv2 32)) (= (store |v_#memory_int_44| .cse2 (store .cse1 .cse3 (select (select |#memory_int| .cse2) .cse3))) |#memory_int|) (= (store |v_#memory_$Pointer$.base_40| .cse2 (store (select |v_#memory_$Pointer$.base_40| .cse2) .cse3 main_~t~0.base)) |#memory_$Pointer$.base|) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| .cse2) .cse3)) (not (= main_~t~0.base main_~a~0.base)) (not (= main_~t~0.base .cse2)) (not (= .cse2 main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| .cse2) .cse3) main_~p~0.base) (= (store |v_#memory_$Pointer$.offset_38| .cse2 (store (select |v_#memory_$Pointer$.offset_38| .cse2) .cse3 (_ bv0 32))) |#memory_$Pointer$.offset|))))) [2018-11-23 11:06:19,895 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse5))) (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse5)) (.cse4 (bvadd .cse1 (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| .cse3) .cse4)) (.cse2 (select (select |#memory_$Pointer$.base| .cse3) .cse4))) (and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) .cse0) (= (_ bv0 32) .cse1) (= main_~p~0.offset .cse0) (= main_~p~0.base .cse2) (not (= .cse3 .cse2)) (= (_ bv2 32) (select (select |#memory_int| .cse3) .cse1)) (not (= main_~a~0.base .cse2))))))) [2018-11-23 11:06:20,048 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:20,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 101 [2018-11-23 11:06:20,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2018-11-23 11:06:20,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:20,112 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:20,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:20,214 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:20,221 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:20,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 256 treesize of output 255 [2018-11-23 11:06:20,284 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 68 treesize of output 1 [2018-11-23 11:06:20,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:20,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:20,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:20,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:20,415 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 180 treesize of output 196 [2018-11-23 11:06:20,423 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 68 treesize of output 1 [2018-11-23 11:06:20,424 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:20,454 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:20,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:20,482 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:306, output treesize:98 [2018-11-23 11:06:22,893 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:22,893 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_41|, |v_#memory_$Pointer$.offset_39|, |v_#memory_int_45|]. (let ((.cse3 (select (select |v_#memory_$Pointer$.offset_39| main_~p~0.base) (_ bv4 32)))) (let ((.cse2 (select (select |v_#memory_$Pointer$.base_41| main_~p~0.base) (_ bv4 32))) (.cse4 (bvadd .cse3 (_ bv4 32)))) (let ((.cse1 (select (select |v_#memory_$Pointer$.base_41| .cse2) .cse4)) (.cse0 (select (select |v_#memory_$Pointer$.offset_39| .cse2) .cse4))) (and (= .cse0 (_ bv0 32)) (= main_~p~0.offset (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_39| .cse1 (store (select |v_#memory_$Pointer$.offset_39| .cse1) .cse0 (select (select |#memory_$Pointer$.offset| .cse1) .cse0))) |#memory_$Pointer$.offset|) (= (_ bv2 32) (select (select |v_#memory_int_45| .cse2) .cse3)) (not (= .cse1 .cse2)) (= .cse3 (_ bv0 32)) (not (= .cse1 main_~p~0.base)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_41| .cse1 (store (select |v_#memory_$Pointer$.base_41| .cse1) .cse0 (select (select |#memory_$Pointer$.base| .cse1) .cse0)))) (= (store |v_#memory_int_45| .cse1 (store (select |v_#memory_int_45| .cse1) .cse0 (_ bv3 32))) |#memory_int|))))) [2018-11-23 11:06:22,893 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (.cse4 (bvadd .cse2 (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.offset| .cse3) .cse4)) (.cse1 (select (select |#memory_$Pointer$.base| .cse3) .cse4))) (and (= (_ bv0 32) .cse0) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| .cse1) .cse0) (_ bv4294967293 32)) (_ bv0 32)) (= .cse2 (_ bv0 32)) (= (select (select |#memory_int| .cse3) .cse2) (_ bv2 32)) (not (= main_~p~0.base .cse1)))))) [2018-11-23 11:06:23,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:23,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 86 [2018-11-23 11:06:23,142 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 37 treesize of output 21 [2018-11-23 11:06:23,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,181 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 47 treesize of output 36 [2018-11-23 11:06:23,184 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,229 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:23,231 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:23,232 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 40 treesize of output 40 [2018-11-23 11:06:23,258 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2018-11-23 11:06:23,274 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:06:23,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:06:23,317 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:23,329 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:23,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:23,347 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:118, output treesize:33 [2018-11-23 11:06:23,364 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:23,364 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_56, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_56) (_ bv4 32)))) (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_56) (_ bv4 32))) (.cse4 (bvadd .cse0 (_ bv4 32)))) (let ((.cse2 (select (select |#memory_$Pointer$.offset| .cse1) .cse4)) (.cse3 (select (select |#memory_$Pointer$.base| .cse1) .cse4))) (and (= main_~p~0.offset .cse0) (= main_~p~0.base .cse1) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_56) (_ bv0 32))) (= (_ bv0 32) .cse0) (= (_ bv0 32) .cse2) (= (_ bv0 32) (bvadd (select (select |#memory_int| .cse3) .cse2) (_ bv4294967293 32))) (not (= v_main_~p~0.base_56 .cse3)) (= (bvadd (select (select |#memory_int| .cse1) .cse0) (_ bv4294967294 32)) (_ bv0 32)))))) [2018-11-23 11:06:23,365 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_56, v_arrayElimCell_114]. (and (= (_ bv0 32) (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967294 32))) (= main_~p~0.offset (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_56) (_ bv0 32))) (= (_ bv0 32) (bvadd (select (select |#memory_int| v_arrayElimCell_114) (_ bv0 32)) (_ bv4294967293 32))) (not (= v_main_~p~0.base_56 main_~p~0.base))) [2018-11-23 11:06:23,469 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:23,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:23,474 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:23,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:23,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-11-23 11:06:23,533 INFO L478 Elim1Store]: Elim1 applied some 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 14 treesize of output 37 [2018-11-23 11:06:23,564 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,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, 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 5 [2018-11-23 11:06:23,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:06:23,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,639 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-11-23 11:06:23,645 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:23,645 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_56, v_arrayElimCell_114]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_56) (_ bv0 32))) (= (bvadd .cse0 (_ bv4294967294 32)) (_ bv0 32)) (= .cse0 |main_#t~mem9|) (not (= v_main_~p~0.base_56 main_~p~0.base)) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_114) (_ bv0 32))))) [2018-11-23 11:06:23,645 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem9| (_ bv4294967294 32))) [2018-11-23 11:06:23,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {2859#true} call ULTIMATE.init(); {2859#true} is VALID [2018-11-23 11:06:23,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {2859#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2859#true} is VALID [2018-11-23 11:06:23,675 INFO L273 TraceCheckUtils]: 2: Hoare triple {2859#true} assume true; {2859#true} is VALID [2018-11-23 11:06:23,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2859#true} {2859#true} #97#return; {2859#true} is VALID [2018-11-23 11:06:23,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {2859#true} call #t~ret12 := main(); {2859#true} is VALID [2018-11-23 11:06:23,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {2859#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {2879#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:23,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {2879#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {2879#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:23,678 INFO L273 TraceCheckUtils]: 7: Hoare triple {2879#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2886#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:06:23,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {2886#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2886#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:06:23,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {2886#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2893#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:23,682 INFO L273 TraceCheckUtils]: 10: Hoare triple {2893#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2893#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:23,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {2893#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (bvadd (select |#valid| main_~t~0.base) (_ bv1 1)) (_ bv0 1)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2900#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:23,689 INFO L273 TraceCheckUtils]: 12: Hoare triple {2900#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !!(0bv32 != #t~nondet4);havoc #t~nondet4;call write~intINTTYPE4(2bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc5.base, #t~malloc5.offset; {2904#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:06:23,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {2904#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {2904#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:06:23,696 INFO L273 TraceCheckUtils]: 14: Hoare triple {2904#(and (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~t~0.base)) (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~t~0.offset (_ bv0 32)) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem6.base, #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset; {2911#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-23 11:06:23,698 INFO L273 TraceCheckUtils]: 15: Hoare triple {2911#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} assume !(0bv32 != #t~nondet4);havoc #t~nondet4; {2911#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} is VALID [2018-11-23 11:06:23,703 INFO L273 TraceCheckUtils]: 16: Hoare triple {2911#(and (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))) (= (_ bv2 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))))) (not (= main_~a~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (bvadd (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) (_ bv4 32))))))} call write~intINTTYPE4(3bv32, ~p~0.base, ~p~0.offset, 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2918#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:06:23,705 INFO L273 TraceCheckUtils]: 17: Hoare triple {2918#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2918#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:06:23,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {2918#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} assume !(1bv32 == #t~mem7);havoc #t~mem7; {2918#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:06:23,708 INFO L273 TraceCheckUtils]: 19: Hoare triple {2918#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2928#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem9|) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} is VALID [2018-11-23 11:06:23,717 INFO L273 TraceCheckUtils]: 20: Hoare triple {2928#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem9|) (not (= main_~p~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32))))))} assume !!(2bv32 == #t~mem9);havoc #t~mem9;call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem10.base, #t~mem10.offset;havoc #t~mem10.base, #t~mem10.offset; {2932#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_arrayElimCell_114 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_114) (_ bv0 32)))) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_56 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_56) (_ bv0 32))) (not (= v_main_~p~0.base_56 main_~p~0.base)))))} is VALID [2018-11-23 11:06:23,719 INFO L273 TraceCheckUtils]: 21: Hoare triple {2932#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_arrayElimCell_114 (_ BitVec 32))) (= (_ bv3 32) (select (select |#memory_int| v_arrayElimCell_114) (_ bv0 32)))) (= (_ bv2 32) (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_56 (_ BitVec 32))) (and (= (_ bv2 32) (select (select |#memory_int| v_main_~p~0.base_56) (_ bv0 32))) (not (= v_main_~p~0.base_56 main_~p~0.base)))))} call #t~mem9 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2936#(= (_ bv2 32) |main_#t~mem9|)} is VALID [2018-11-23 11:06:23,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {2936#(= (_ bv2 32) |main_#t~mem9|)} assume !(2bv32 == #t~mem9);havoc #t~mem9; {2860#false} is VALID [2018-11-23 11:06:23,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {2860#false} call #t~mem11 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {2860#false} is VALID [2018-11-23 11:06:23,722 INFO L273 TraceCheckUtils]: 24: Hoare triple {2860#false} assume 3bv32 != #t~mem11;havoc #t~mem11; {2860#false} is VALID [2018-11-23 11:06:23,722 INFO L273 TraceCheckUtils]: 25: Hoare triple {2860#false} assume !false; {2860#false} is VALID [2018-11-23 11:06:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:23,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:06:24,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:24,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:24,145 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:24,161 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:24,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:24,196 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:64 [2018-11-23 11:06:25,147 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:25,148 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_42|, |v_#memory_$Pointer$.offset_40|]. (let ((.cse0 (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))))) (or (not (= |v_#memory_$Pointer$.offset_40| (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.offset_40| main_~p~0.base) main_~p~0.offset))))) (not (= |v_#memory_$Pointer$.base_42| (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset (select (select |v_#memory_$Pointer$.base_42| main_~p~0.base) main_~p~0.offset))))) (not (= (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))) (= (_ bv2 32) (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select .cse0 (select (select |v_#memory_$Pointer$.base_42| main_~a~0.base) .cse1)) (select (select |v_#memory_$Pointer$.offset_40| main_~a~0.base) .cse1)))))) [2018-11-23 11:06:25,148 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_34, v_DerPreprocessor_36]. (let ((.cse0 (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv3 32))))) (or (= (bvadd (let ((.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select .cse0 (select (select (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_34)) main_~a~0.base) .cse1)) (select (select (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) main_~p~0.offset v_DerPreprocessor_36)) main_~a~0.base) .cse1))) (_ bv4294967294 32)) (_ bv0 32)) (not (= (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))))) [2018-11-23 11:06:25,903 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 11:06:25,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:25,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:26,021 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:26,128 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:26,175 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:26,235 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:26,247 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:26,346 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:26,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2018-11-23 11:06:26,947 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:122, output treesize:421 [2018-11-23 11:06:29,286 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:29,286 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_DerPreprocessor_34, |v_#memory_int_47|, v_DerPreprocessor_36]. (let ((.cse0 (store |v_#memory_int_47| main_~t~0.base (store (select |v_#memory_int_47| main_~t~0.base) main_~t~0.offset (_ bv3 32)))) (.cse2 (bvadd main_~p~0.offset (_ bv4 32)))) (or (= (bvadd (let ((.cse3 (bvadd main_~a~0.offset (_ bv4 32)))) (select (select .cse0 (select (select (let ((.cse1 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse2 main_~t~0.base)))) (store .cse1 main_~t~0.base (store (select .cse1 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_34))) main_~a~0.base) .cse3)) (select (select (let ((.cse4 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse2 main_~t~0.offset)))) (store .cse4 main_~t~0.base (store (select .cse4 main_~t~0.base) main_~t~0.offset v_DerPreprocessor_36))) main_~a~0.base) .cse3))) (_ bv4294967294 32)) (_ bv0 32)) (not (= (_ bv2 32) (select (select .cse0 main_~a~0.base) main_~a~0.offset))) (not (= |v_#memory_int_47| (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) .cse2 (select (select |v_#memory_int_47| main_~p~0.base) .cse2))))))) [2018-11-23 11:06:29,287 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_19, v_prenex_20, v_DerPreprocessor_42, v_prenex_21, v_prenex_22, v_DerPreprocessor_44, v_DerPreprocessor_34, v_DerPreprocessor_40, v_DerPreprocessor_36, v_prenex_24, v_DerPreprocessor_38, v_prenex_23]. (let ((.cse7 (bvadd main_~p~0.offset (_ bv4 32)))) (let ((.cse0 (store |#memory_$Pointer$.offset| main_~p~0.base (store (select |#memory_$Pointer$.offset| main_~p~0.base) .cse7 main_~t~0.offset))) (.cse3 (store |#memory_$Pointer$.base| main_~p~0.base (store (select |#memory_$Pointer$.base| main_~p~0.base) .cse7 main_~t~0.base)))) (let ((.cse8 (= main_~a~0.offset main_~t~0.offset)) (.cse4 (select .cse3 main_~t~0.base)) (.cse1 (select .cse0 main_~t~0.base)) (.cse2 (bvadd main_~a~0.offset (_ bv4 32))) (.cse5 (= main_~t~0.base main_~a~0.base)) (.cse6 (select |#memory_int| main_~p~0.base))) (and (or (not (= main_~t~0.offset (select (select (store .cse0 main_~t~0.base (store .cse1 main_~t~0.offset v_prenex_19)) main_~a~0.base) .cse2))) (not (= main_~t~0.base (select (select (store .cse3 main_~t~0.base (store .cse4 main_~t~0.offset v_prenex_20)) main_~a~0.base) .cse2))) .cse5 (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store .cse6 .cse7 v_DerPreprocessor_42)) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))) (or .cse8 (not (= main_~t~0.offset (select (select (store .cse0 main_~t~0.base (store .cse1 main_~t~0.offset v_prenex_21)) main_~a~0.base) .cse2))) (not (= main_~t~0.base (select (select (store .cse3 main_~t~0.base (store .cse4 main_~t~0.offset v_prenex_22)) main_~a~0.base) .cse2))) (not (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store .cse6 .cse7 v_DerPreprocessor_44)) main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32)))) (let ((.cse9 (store |#memory_int| main_~p~0.base (store .cse6 .cse7 v_DerPreprocessor_40)))) (or (= (_ bv2 32) (select (select .cse9 (select (select (store .cse3 main_~t~0.base (store .cse4 main_~t~0.offset v_DerPreprocessor_34)) main_~a~0.base) .cse2)) (select (select (store .cse0 main_~t~0.base (store .cse1 main_~t~0.offset v_DerPreprocessor_36)) main_~a~0.base) .cse2))) .cse8 (not (= (bvadd (select (select .cse9 main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))))) (let ((.cse10 (store |#memory_int| main_~p~0.base (store .cse6 .cse7 v_DerPreprocessor_38)))) (or (= (bvadd (select (select .cse10 (select (select (store .cse3 main_~t~0.base (store .cse4 main_~t~0.offset v_prenex_24)) main_~a~0.base) .cse2)) (select (select (store .cse0 main_~t~0.base (store .cse1 main_~t~0.offset v_prenex_23)) main_~a~0.base) .cse2)) (_ bv4294967294 32)) (_ bv0 32)) (not (= (bvadd (select (select .cse10 main_~a~0.base) main_~a~0.offset) (_ bv4294967294 32)) (_ bv0 32))) .cse5)))))) [2018-11-23 11:06:30,284 WARN L180 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-11-23 11:06:42,043 WARN L180 SmtUtils]: Spent 11.07 s on a formula simplification that was a NOOP. DAG size: 249 [2018-11-23 11:06:42,284 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:06:42,285 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.classInvariant(MultiDimensionalSelect.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelect.(MultiDimensionalSelect.java:90) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.isCompatibleSelect(MultiDimensionalStore.java:105) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalStore.(MultiDimensionalStore.java:73) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.(MultiDimensionalSelectOverStore.java:48) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSelectOverStore.convert(MultiDimensionalSelectOverStore.java:75) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ArrayQuantifierEliminationUtils.elimAllSos(ArrayQuantifierEliminationUtils.java:57) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:232) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 11:06:42,290 INFO L168 Benchmark]: Toolchain (without parser) took 62618.18 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -413.1 MB). Peak memory consumption was 648.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:42,290 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:42,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:42,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:42,291 INFO L168 Benchmark]: Boogie Preprocessor took 45.52 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 11:06:42,292 INFO L168 Benchmark]: RCFGBuilder took 925.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:42,292 INFO L168 Benchmark]: TraceAbstraction took 60909.22 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 335.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 328.0 MB). Peak memory consumption was 663.5 MB. Max. memory is 7.1 GB. [2018-11-23 11:06:42,294 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 618.19 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 114.07 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 726.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -807.7 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.52 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 925.98 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 60909.22 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 335.5 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 328.0 MB). Peak memory consumption was 663.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.MultiDimensionalSort.areDimensionsConsistent(MultiDimensionalSort.java:84) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...