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/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:09:54,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:09:54,589 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:09:54,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:09:54,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:09:54,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:09:54,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:09:54,607 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:09:54,610 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:09:54,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:09:54,618 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:09:54,619 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:09:54,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:09:54,623 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:09:54,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:09:54,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:09:54,628 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:09:54,630 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:09:54,634 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:09:54,639 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:09:54,641 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:09:54,642 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:09:54,645 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:09:54,645 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:09:54,645 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:09:54,649 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:09:54,650 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:09:54,652 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:09:54,653 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:09:54,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:09:54,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:09:54,658 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:09:54,658 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:09:54,659 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:09:54,660 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:09:54,662 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:09:54,662 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:09:54,688 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:09:54,688 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:09:54,689 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:09:54,689 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:09:54,691 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:09:54,691 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:09:54,691 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:09:54,693 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:09:54,693 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:09:54,693 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:09:54,693 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:09:54,693 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:09:54,694 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:09:54,694 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:09:54,694 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:09:54,694 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:09:54,694 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:09:54,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:09:54,696 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:09:54,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:09:54,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:09:54,697 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:09:54,697 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:09:54,697 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:09:54,698 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:09:54,698 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:09:54,698 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:09:54,698 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:09:54,699 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:09:54,699 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:09:54,699 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:09:54,699 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:09:54,699 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:09:54,748 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:09:54,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:09:54,765 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:09:54,767 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:09:54,767 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:09:54,768 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:09:54,829 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f00bbec5/43b29b7c9e474d16a9588803f0372a00/FLAG02324d600 [2018-11-23 11:09:55,371 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:09:55,372 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:09:55,393 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f00bbec5/43b29b7c9e474d16a9588803f0372a00/FLAG02324d600 [2018-11-23 11:09:55,666 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f00bbec5/43b29b7c9e474d16a9588803f0372a00 [2018-11-23 11:09:55,677 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:09:55,678 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:09:55,679 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:09:55,679 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:09:55,683 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:09:55,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:09:55" (1/1) ... [2018-11-23 11:09:55,688 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d482dce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:55, skipping insertion in model container [2018-11-23 11:09:55,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:09:55" (1/1) ... [2018-11-23 11:09:55,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:09:55,760 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:09:56,231 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:09:56,253 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:09:56,384 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:09:56,468 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:09:56,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56 WrapperNode [2018-11-23 11:09:56,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:09:56,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:09:56,470 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:09:56,470 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:09:56,480 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:09:56" (1/1) ... [2018-11-23 11:09:56,501 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:09:56" (1/1) ... [2018-11-23 11:09:56,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:09:56,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:09:56,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:09:56,513 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:09:56,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,525 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (1/1) ... [2018-11-23 11:09:56,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:09:56,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:09:56,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:09:56,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:09:56,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (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:09:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:09:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:09:56,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:09:56,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:09:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:09:56,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:09:56,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:09:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:09:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:09:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:09:56,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:09:56,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:09:57,663 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:09:57,663 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-23 11:09:57,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:09:57 BoogieIcfgContainer [2018-11-23 11:09:57,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:09:57,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:09:57,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:09:57,669 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:09:57,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:09:55" (1/3) ... [2018-11-23 11:09:57,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48278d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:09:57, skipping insertion in model container [2018-11-23 11:09:57,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:09:56" (2/3) ... [2018-11-23 11:09:57,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48278d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:09:57, skipping insertion in model container [2018-11-23 11:09:57,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:09:57" (3/3) ... [2018-11-23 11:09:57,673 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:09:57,683 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:09:57,692 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:09:57,708 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:09:57,740 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:09:57,741 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:09:57,741 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:09:57,741 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:09:57,741 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:09:57,742 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:09:57,742 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:09:57,742 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:09:57,742 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:09:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 11:09:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:09:57,768 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:57,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:57,771 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:57,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1157674678, now seen corresponding path program 1 times [2018-11-23 11:09:57,783 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:57,784 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:09:57,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:09:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:57,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:57,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 11:09:57,956 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32#true} is VALID [2018-11-23 11:09:57,956 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 11:09:57,956 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #110#return; {32#true} is VALID [2018-11-23 11:09:57,957 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret17 := main(); {32#true} is VALID [2018-11-23 11:09:57,957 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {32#true} is VALID [2018-11-23 11:09:57,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 11:09:57,963 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} assume 0bv32 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {33#false} is VALID [2018-11-23 11:09:57,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {33#false} is VALID [2018-11-23 11:09:57,964 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume !true; {33#false} is VALID [2018-11-23 11:09:57,964 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {33#false} is VALID [2018-11-23 11:09:57,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {33#false} is VALID [2018-11-23 11:09:57,965 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume 1bv32 == #t~mem14;havoc #t~mem14; {33#false} is VALID [2018-11-23 11:09:57,965 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 11:09:57,969 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:09:57,969 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:09:57,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:09:57,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:09:57,979 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:09:57,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:09:57,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:09:58,119 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:58,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:09:58,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:09:58,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:09:58,134 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 11:09:58,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:58,592 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2018-11-23 11:09:58,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:09:58,593 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:09:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:09:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:09:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 11:09:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:09:58,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 77 transitions. [2018-11-23 11:09:58,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 77 transitions. [2018-11-23 11:09:58,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:09:58,995 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:09:58,995 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:09:58,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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:09:59,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:09:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:09:59,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:09:59,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:09:59,042 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:09:59,043 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:09:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:59,046 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-23 11:09:59,047 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-23 11:09:59,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:59,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:59,048 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:09:59,048 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:09:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:09:59,052 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-11-23 11:09:59,052 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-23 11:09:59,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:09:59,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:09:59,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:09:59,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:09:59,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:09:59,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2018-11-23 11:09:59,058 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 14 [2018-11-23 11:09:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:09:59,059 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2018-11-23 11:09:59,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:09:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2018-11-23 11:09:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:09:59,060 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:09:59,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:09:59,061 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:09:59,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:09:59,061 INFO L82 PathProgramCache]: Analyzing trace with hash -38156386, now seen corresponding path program 1 times [2018-11-23 11:09:59,062 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:09:59,062 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:09:59,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:09:59,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:59,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:59,281 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:09:59,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:59,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:09:59,367 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:09:59,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:59,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:59,486 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:09:59,487 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:23, output treesize:18 [2018-11-23 11:09:59,504 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:59,505 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, |v_#valid_17|]. (and (= (store |v_#memory_int_22| main_~head~0.base (store (select |v_#memory_int_22| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)) (_ bv0 32))) |#memory_int|) (= (store |v_#valid_17| main_~head~0.base (_ bv1 1)) |#valid|) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:09:59,505 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (select |#valid| main_~head~0.base) (_ bv1 1)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:09:59,697 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-11-23 11:09:59,968 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:59,990 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:59,991 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:10:00,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,197 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:00,226 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 26 treesize of output 43 [2018-11-23 11:10:00,269 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 32 treesize of output 31 [2018-11-23 11:10:00,343 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 31 treesize of output 16 [2018-11-23 11:10:00,345 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,383 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,437 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:10:00,444 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:10:00,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,487 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:10:00,497 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:10:00,499 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,503 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,527 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:63, output treesize:29 [2018-11-23 11:10:00,571 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:00,571 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_26|, v_main_~head~0.base_8, |v_#valid_18|, |v_#memory_int_23|, |v_#memory_$Pointer$.offset_26|]. (and (= (_ bv0 1) (select |v_#valid_18| main_~head~0.base)) (= (_ bv0 32) (select (select |v_#memory_int_23| v_main_~head~0.base_8) (_ bv4 32))) (= (bvadd (select |v_#valid_18| v_main_~head~0.base_8) (_ bv1 1)) (_ bv0 1)) (= (store |v_#memory_$Pointer$.offset_26| main_~head~0.base (store (select |v_#memory_$Pointer$.offset_26| main_~head~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |v_#memory_int_23| main_~head~0.base (store (store (select |v_#memory_int_23| main_~head~0.base) (_ bv4 32) (_ bv1 32)) (_ bv0 32) (select (select |#memory_int| main_~head~0.base) (_ bv0 32)))) |#memory_int|) (= (store |v_#memory_$Pointer$.base_26| main_~head~0.base (store (select |v_#memory_$Pointer$.base_26| main_~head~0.base) (_ bv0 32) v_main_~head~0.base_8)) |#memory_$Pointer$.base|) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:00,572 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:00,738 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:10:00,751 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:10:00,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,814 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 19 treesize of output 15 [2018-11-23 11:10:00,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-23 11:10:00,831 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,844 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:00,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:00,861 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:18 [2018-11-23 11:10:00,867 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:00,867 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~x~0.base_24, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~x~0.base_24) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_24) (_ bv0 32)))) (and (= (_ bv0 32) (select (select |#memory_int| .cse0) (_ bv4 32))) (= main_~x~0.offset .cse1) (= main_~x~0.base .cse0) (= (select (select |#memory_int| v_main_~x~0.base_24) (_ bv4 32)) (_ bv1 32)) (= .cse1 (_ bv0 32)))) [2018-11-23 11:10:00,868 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~x~0.base_24]. (and (= (select (select |#memory_int| v_main_~x~0.base_24) (_ bv4 32)) (_ bv1 32)) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32)))) [2018-11-23 11:10:01,054 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:01,058 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:01,060 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 24 treesize of output 26 [2018-11-23 11:10:01,088 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:10:01,171 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:10:01,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-23 11:10:01,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:01,228 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:10:01,229 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:24, output treesize:3 [2018-11-23 11:10:01,233 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:01,233 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, v_main_~x~0.base_24]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) (_ bv4 32)))) (and (= |main_#t~mem14| .cse0) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_24) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) .cse0))) [2018-11-23 11:10:01,233 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem14| (_ bv0 32)) [2018-11-23 11:10:01,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-23 11:10:01,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {212#true} is VALID [2018-11-23 11:10:01,254 INFO L273 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-23 11:10:01,254 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #110#return; {212#true} is VALID [2018-11-23 11:10:01,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret17 := main(); {212#true} is VALID [2018-11-23 11:10:01,258 INFO L273 TraceCheckUtils]: 5: Hoare triple {212#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {232#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:01,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {232#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {232#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:01,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {232#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) main_~head~0.offset))} assume 0bv32 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {239#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:01,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {239#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {243#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:10:01,267 INFO L273 TraceCheckUtils]: 9: Hoare triple {243#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {243#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:10:01,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {243#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} assume !(1bv32 != #t~mem11);havoc #t~mem11; {243#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:10:01,270 INFO L273 TraceCheckUtils]: 11: Hoare triple {243#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {253#(and (= main_~x~0.offset (_ bv0 32)) (exists ((v_main_~x~0.base_24 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_24) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:10:01,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {253#(and (= main_~x~0.offset (_ bv0 32)) (exists ((v_main_~x~0.base_24 (_ BitVec 32))) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_24) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {257#(= |main_#t~mem14| (_ bv0 32))} is VALID [2018-11-23 11:10:01,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {257#(= |main_#t~mem14| (_ bv0 32))} assume 1bv32 == #t~mem14;havoc #t~mem14; {213#false} is VALID [2018-11-23 11:10:01,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-23 11:10:01,286 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:10:01,286 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:01,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:01,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:10:01,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 11:10:01,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:01,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:10:01,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:01,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:10:01,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:10:01,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:10:01,316 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand 7 states. [2018-11-23 11:10:03,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:03,732 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-11-23 11:10:03,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:10:03,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 11:10:03,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:10:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-11-23 11:10:03,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:10:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-11-23 11:10:03,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2018-11-23 11:10:03,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:03,918 INFO L225 Difference]: With dead ends: 47 [2018-11-23 11:10:03,918 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:10:03,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:10:03,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:10:04,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2018-11-23 11:10:04,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:04,041 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 29 states. [2018-11-23 11:10:04,041 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 29 states. [2018-11-23 11:10:04,042 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 29 states. [2018-11-23 11:10:04,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:04,046 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2018-11-23 11:10:04,046 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-23 11:10:04,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:04,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:04,047 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 45 states. [2018-11-23 11:10:04,047 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 45 states. [2018-11-23 11:10:04,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:04,051 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2018-11-23 11:10:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2018-11-23 11:10:04,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:04,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:04,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:04,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:10:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2018-11-23 11:10:04,056 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 15 [2018-11-23 11:10:04,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:04,056 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2018-11-23 11:10:04,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:10:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2018-11-23 11:10:04,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:10:04,057 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:04,057 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:10:04,058 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:04,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:04,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1665324002, now seen corresponding path program 1 times [2018-11-23 11:10:04,059 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:04,059 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:10:04,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:04,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:04,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:10:04,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:10:04,270 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:10:04,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,303 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:10:04,304 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 11:10:04,324 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:04,324 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_24|, |v_#valid_19|]. (and (= |#valid| (store |v_#valid_19| main_~head~0.base (_ bv1 1))) (= main_~head~0.base main_~x~0.base) (= (store |v_#memory_int_24| main_~head~0.base (store (select |v_#memory_int_24| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)) (_ bv0 32))) |#memory_int|) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) [2018-11-23 11:10:04,324 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) [2018-11-23 11:10:04,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,415 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:10:04,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,584 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:04,605 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:04,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-11-23 11:10:04,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 11:10:04,788 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,845 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 37 treesize of output 38 [2018-11-23 11:10:04,858 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 17 treesize of output 20 [2018-11-23 11:10:04,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:04,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:10:04,879 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,891 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,910 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,928 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:04,962 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:66, output treesize:38 [2018-11-23 11:10:05,006 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:05,007 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_25|, |main_#t~malloc2.base|, main_~x~0.offset, |v_#valid_20|, |v_#memory_int_26|]. (let ((.cse0 (select |v_#memory_int_26| main_~head~0.base))) (and (= |#valid| (store |v_#valid_20| |main_#t~malloc2.base| (_ bv1 1))) (= (select .cse0 (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |v_#valid_20| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (store |v_#memory_int_25| |main_#t~malloc2.base| (store (store (select |v_#memory_int_25| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv0 32)) main_~x~0.offset (select (select |#memory_int| |main_#t~malloc2.base|) main_~x~0.offset))) |#memory_int|) (= (_ bv0 1) (select |v_#valid_20| |main_#t~malloc2.base|)) (= |v_#memory_int_25| (store |v_#memory_int_26| main_~head~0.base (store .cse0 main_~head~0.offset (select (select |v_#memory_int_25| main_~head~0.base) main_~head~0.offset)))) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:10:05,007 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc2.base|, main_~x~0.offset]. (and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (= (_ bv0 1) (bvadd (select |#valid| main_~head~0.base) (_ bv1 1))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:05,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:05,164 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:05,175 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:05,177 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 16 treesize of output 13 [2018-11-23 11:10:05,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-11-23 11:10:05,374 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:10:05,376 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,386 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-11-23 11:10:05,512 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 8 treesize of output 7 [2018-11-23 11:10:05,513 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,523 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,616 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:05,632 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 68 [2018-11-23 11:10:05,643 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 36 treesize of output 35 [2018-11-23 11:10:05,677 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 35 treesize of output 20 [2018-11-23 11:10:05,682 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,693 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,715 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:05,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:05,781 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:79, output treesize:50 [2018-11-23 11:10:05,828 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:05,829 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_27|, v_main_~head~0.base_9, |v_#valid_21|, |main_#t~malloc2.base|, |v_#memory_int_27|, main_~x~0.offset, |v_#memory_$Pointer$.offset_27|]. (and (= (select |v_#valid_21| v_main_~head~0.base_9) (_ bv1 1)) (= (_ bv0 1) (select |v_#valid_21| main_~head~0.base)) (= (_ bv1 1) (select |v_#valid_21| |main_#t~malloc2.base|)) (= (_ bv0 32) (select (select |v_#memory_int_27| v_main_~head~0.base_9) (_ bv4 32))) (= |#memory_int| (store |v_#memory_int_27| main_~head~0.base (store (store (select |v_#memory_int_27| main_~head~0.base) (_ bv4 32) (_ bv1 32)) (_ bv0 32) (select (select |#memory_int| main_~head~0.base) (_ bv0 32))))) (= (select (select |v_#memory_int_27| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_27| main_~head~0.base (store (select |v_#memory_$Pointer$.base_27| main_~head~0.base) (_ bv0 32) v_main_~head~0.base_9))) (= (store |v_#memory_$Pointer$.offset_27| main_~head~0.base (store (select |v_#memory_$Pointer$.offset_27| main_~head~0.base) (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (not (= |main_#t~malloc2.base| v_main_~head~0.base_9)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:10:05,829 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc2.base|, main_~x~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (not (= |main_#t~malloc2.base| .cse0)) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| .cse0) (_ bv4 32))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:10:06,137 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 15 treesize of output 11 [2018-11-23 11:10:06,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, 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:10:06,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,249 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 27 treesize of output 21 [2018-11-23 11:10:06,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 11:10:06,271 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:06,321 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:61, output treesize:35 [2018-11-23 11:10:06,331 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:06,331 WARN L384 uantifierElimination]: Input elimination task: ∃ [|main_#t~malloc2.base|, v_prenex_1, |#memory_$Pointer$.offset|, v_main_~x~0.base_26, |#memory_$Pointer$.base|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~x~0.base_26) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_26) (_ bv0 32)))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (= .cse0 main_~x~0.offset) (= (select (select |#memory_int| v_main_~x~0.base_26) (_ bv4 32)) (_ bv1 32)) (= (select (select |#memory_int| .cse1) (_ bv4 32)) (_ bv0 32)) (= .cse1 main_~x~0.base) (not (= |main_#t~malloc2.base| v_main_~x~0.base_26)) (not (= |main_#t~malloc2.base| .cse1)) (= .cse0 (_ bv0 32)))) [2018-11-23 11:10:06,331 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc2.base|, v_prenex_1, v_main_~x~0.base_26]. (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (= (select (select |#memory_int| v_main_~x~0.base_26) (_ bv4 32)) (_ bv1 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_26)) (= main_~x~0.offset (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32)))) [2018-11-23 11:10:06,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:06,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:06,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-11-23 11:10:06,456 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 7 treesize of output 1 [2018-11-23 11:10:06,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,487 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 7 treesize of output 1 [2018-11-23 11:10:06,489 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,507 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:10:06,513 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,521 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:06,538 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2018-11-23 11:10:06,543 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:06,544 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_#t~malloc2.base|, v_prenex_1, main_~x~0.base, v_main_~x~0.base_26]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) (_ bv4 32)))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (= |main_#t~mem14| .cse0) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_26) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_26)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (_ bv0 32) .cse0))) [2018-11-23 11:10:06,544 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem14| (_ bv0 32)) [2018-11-23 11:10:06,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2018-11-23 11:10:06,568 INFO L273 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {465#true} is VALID [2018-11-23 11:10:06,568 INFO L273 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-23 11:10:06,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #110#return; {465#true} is VALID [2018-11-23 11:10:06,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret17 := main(); {465#true} is VALID [2018-11-23 11:10:06,574 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {485#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:10:06,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {485#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~intINTTYPE4(0bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {489#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)))) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:06,582 INFO L273 TraceCheckUtils]: 7: Hoare triple {489#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)))) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {489#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)))) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:06,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {489#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)))) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume 0bv32 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {496#(and (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:10:06,617 INFO L273 TraceCheckUtils]: 9: Hoare triple {496#(and (exists ((main_~x~0.offset (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {500#(and (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:10:06,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {500#(and (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {500#(and (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:10:06,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {500#(and (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} assume !(1bv32 != #t~mem11);havoc #t~mem11; {500#(and (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:10:06,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {500#(and (exists ((|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (not (= |main_#t~malloc2.base| main_~x~0.base)))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {510#(and (exists ((v_main_~x~0.base_26 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_26) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_26)) (not (= |main_#t~malloc2.base| main_~x~0.base)))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:10:06,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {510#(and (exists ((v_main_~x~0.base_26 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (and (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_1 (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_26) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_26)) (not (= |main_#t~malloc2.base| main_~x~0.base)))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {514#(= |main_#t~mem14| (_ bv0 32))} is VALID [2018-11-23 11:10:06,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {514#(= |main_#t~mem14| (_ bv0 32))} assume 1bv32 == #t~mem14;havoc #t~mem14; {466#false} is VALID [2018-11-23 11:10:06,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {466#false} assume !false; {466#false} is VALID [2018-11-23 11:10:06,633 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:10:06,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:07,097 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:10:07,127 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:10:07,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:07,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:30 [2018-11-23 11:10:07,207 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:07,207 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_28|, v_main_~head~0.base_10]. (or (not (= (_ bv1 32) (select (select |v_#memory_int_28| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))))) (not (= (store |#memory_int| v_main_~head~0.base_10 (store (store (select |#memory_int| v_main_~head~0.base_10) (_ bv4 32) (_ bv1 32)) (_ bv0 32) (select (select |v_#memory_int_28| v_main_~head~0.base_10) (_ bv0 32)))) |v_#memory_int_28|)) (not (= (select |#valid| v_main_~head~0.base_10) (_ bv0 1)))) [2018-11-23 11:10:07,208 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~head~0.base_10, v_DerPreprocessor_4]. (or (not (= (bvadd (select (select (store |#memory_int| v_main_~head~0.base_10 (store (store (select |#memory_int| v_main_~head~0.base_10) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_4)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select |#valid| v_main_~head~0.base_10) (_ bv0 1)))) [2018-11-23 11:10:09,582 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2018-11-23 11:10:09,600 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:10:09,616 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:10:09,823 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:10:09,865 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:10:09,897 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:10:09,923 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:10:10,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-11-23 11:10:10,047 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:76, output treesize:122 [2018-11-23 11:10:10,092 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:10,092 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_29|, v_main_~head~0.base_10, v_DerPreprocessor_4, |v_#memory_int_25|, |v_main_#t~malloc2.base_2|, v_main_~x~0.offset_30]. (or (not (= |v_#memory_int_29| (store |v_#memory_int_25| |v_main_#t~malloc2.base_2| (store (store (select |v_#memory_int_25| |v_main_#t~malloc2.base_2|) (bvadd v_main_~x~0.offset_30 (_ bv4 32)) (_ bv0 32)) v_main_~x~0.offset_30 (select (select |v_#memory_int_29| |v_main_#t~malloc2.base_2|) v_main_~x~0.offset_30))))) (not (= (select (store |#valid| |v_main_#t~malloc2.base_2| (_ bv1 1)) v_main_~head~0.base_10) (_ bv0 1))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (not (= (bvadd (select (select (store |v_#memory_int_29| v_main_~head~0.base_10 (store (store (select |v_#memory_int_29| v_main_~head~0.base_10) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_4)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= |v_#memory_int_25| (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset (select (select |v_#memory_int_25| main_~x~0.base) main_~x~0.offset)))))) [2018-11-23 11:10:10,093 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_2, v_prenex_4, v_prenex_3, v_DerPreprocessor_8, v_main_~head~0.base_10, v_DerPreprocessor_6, |v_main_#t~malloc2.base_2|, v_main_~x~0.offset_30, v_DerPreprocessor_10, v_DerPreprocessor_4]. (let ((.cse1 (select |#memory_int| main_~x~0.base)) (.cse2 (bvadd main_~head~0.offset (_ bv4 32)))) (and (or (not (= (select (store |#valid| v_prenex_4 (_ bv1 1)) v_main_~head~0.base_10) (_ bv0 1))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))) (not (= (bvadd (select (select (let ((.cse0 (store |#memory_int| main_~x~0.base (store .cse1 main_~x~0.offset v_prenex_2)))) (store .cse0 v_prenex_4 (store (store (select .cse0 v_prenex_4) (bvadd v_prenex_3 (_ bv4 32)) (_ bv0 32)) v_prenex_3 v_DerPreprocessor_8))) main_~head~0.base) .cse2) (_ bv4294967295 32)) (_ bv0 32))) (= v_main_~head~0.base_10 main_~head~0.base)) (or (not (= (_ bv1 32) (select (store (store (select (let ((.cse3 (store |#memory_int| main_~x~0.base (store .cse1 main_~x~0.offset v_DerPreprocessor_6)))) (store .cse3 |v_main_#t~malloc2.base_2| (store (store (select .cse3 |v_main_#t~malloc2.base_2|) (bvadd v_main_~x~0.offset_30 (_ bv4 32)) (_ bv0 32)) v_main_~x~0.offset_30 v_DerPreprocessor_10))) main_~head~0.base) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_4) .cse2))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (not (= (select (store |#valid| |v_main_#t~malloc2.base_2| (_ bv1 1)) main_~head~0.base) (_ bv0 1)))))) [2018-11-23 11:10:14,973 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 69 [2018-11-23 11:10:15,075 INFO L273 TraceCheckUtils]: 15: Hoare triple {466#false} assume !false; {466#false} is VALID [2018-11-23 11:10:15,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {524#(not (= (bvadd |main_#t~mem14| (_ bv4294967295 32)) (_ bv0 32)))} assume 1bv32 == #t~mem14;havoc #t~mem14; {466#false} is VALID [2018-11-23 11:10:15,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {528#(not (= (bvadd (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {524#(not (= (bvadd |main_#t~mem14| (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:15,080 INFO L273 TraceCheckUtils]: 12: Hoare triple {532#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {528#(not (= (bvadd (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:15,081 INFO L273 TraceCheckUtils]: 11: Hoare triple {532#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} assume !(1bv32 != #t~mem11);havoc #t~mem11; {532#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:15,084 INFO L273 TraceCheckUtils]: 10: Hoare triple {532#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {532#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:15,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {542#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {532#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:15,129 INFO L273 TraceCheckUtils]: 8: Hoare triple {546#(forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_main_~head~0.base_10 (_ BitVec 32))) (or (not (= (bvadd (select (select (store |#memory_int| v_main_~head~0.base_10 (store (store (select |#memory_int| v_main_~head~0.base_10) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_4)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select |#valid| v_main_~head~0.base_10) (_ bv0 1)))))} assume 0bv32 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {542#(not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:15,130 INFO L273 TraceCheckUtils]: 7: Hoare triple {546#(forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_main_~head~0.base_10 (_ BitVec 32))) (or (not (= (bvadd (select (select (store |#memory_int| v_main_~head~0.base_10 (store (store (select |#memory_int| v_main_~head~0.base_10) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_4)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select |#valid| v_main_~head~0.base_10) (_ bv0 1)))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {546#(forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_main_~head~0.base_10 (_ BitVec 32))) (or (not (= (bvadd (select (select (store |#memory_int| v_main_~head~0.base_10 (store (store (select |#memory_int| v_main_~head~0.base_10) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_4)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select |#valid| v_main_~head~0.base_10) (_ bv0 1)))))} is VALID [2018-11-23 11:10:17,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {553#(and (forall ((v_main_~head~0.base_10 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (bvadd (select (select (store (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_prenex_2)) v_prenex_4 (store (store (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_prenex_2)) v_prenex_4) (bvadd v_prenex_3 (_ bv4 32)) (_ bv0 32)) v_prenex_3 v_DerPreprocessor_8)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))) (not (= (select (store |#valid| v_prenex_4 (_ bv1 1)) v_main_~head~0.base_10) (_ bv0 1))) (= v_main_~head~0.base_10 main_~head~0.base))) (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_main_~x~0.offset_30 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (_ bv1 32) (select (store (store (select (store (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_DerPreprocessor_6)) |v_main_#t~malloc2.base_2| (store (store (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_DerPreprocessor_6)) |v_main_#t~malloc2.base_2|) (bvadd v_main_~x~0.offset_30 (_ bv4 32)) (_ bv0 32)) v_main_~x~0.offset_30 v_DerPreprocessor_10)) main_~head~0.base) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_4) (bvadd main_~head~0.offset (_ bv4 32))))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (not (= (select (store |#valid| |v_main_#t~malloc2.base_2| (_ bv1 1)) main_~head~0.base) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~intINTTYPE4(0bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {546#(forall ((v_DerPreprocessor_4 (_ BitVec 32)) (v_main_~head~0.base_10 (_ BitVec 32))) (or (not (= (bvadd (select (select (store |#memory_int| v_main_~head~0.base_10 (store (store (select |#memory_int| v_main_~head~0.base_10) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_4)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select |#valid| v_main_~head~0.base_10) (_ bv0 1)))))} is UNKNOWN [2018-11-23 11:10:17,150 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {553#(and (forall ((v_main_~head~0.base_10 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32)) (v_prenex_3 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (= (bvadd (select (select (store (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_prenex_2)) v_prenex_4 (store (store (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_prenex_2)) v_prenex_4) (bvadd v_prenex_3 (_ bv4 32)) (_ bv0 32)) v_prenex_3 v_DerPreprocessor_8)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select |#valid| v_prenex_4) (_ bv0 1))) (not (= (select (store |#valid| v_prenex_4 (_ bv1 1)) v_main_~head~0.base_10) (_ bv0 1))) (= v_main_~head~0.base_10 main_~head~0.base))) (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_main_~x~0.offset_30 (_ BitVec 32)) (v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_10 (_ BitVec 32)) (|v_main_#t~malloc2.base_2| (_ BitVec 32))) (or (not (= (_ bv1 32) (select (store (store (select (store (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_DerPreprocessor_6)) |v_main_#t~malloc2.base_2| (store (store (select (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset v_DerPreprocessor_6)) |v_main_#t~malloc2.base_2|) (bvadd v_main_~x~0.offset_30 (_ bv4 32)) (_ bv0 32)) v_main_~x~0.offset_30 v_DerPreprocessor_10)) main_~head~0.base) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_4) (bvadd main_~head~0.offset (_ bv4 32))))) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (not (= (select (store |#valid| |v_main_#t~malloc2.base_2| (_ bv1 1)) main_~head~0.base) (_ bv0 1))))))} is VALID [2018-11-23 11:10:17,151 INFO L256 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret17 := main(); {465#true} is VALID [2018-11-23 11:10:17,151 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #110#return; {465#true} is VALID [2018-11-23 11:10:17,152 INFO L273 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-23 11:10:17,152 INFO L273 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {465#true} is VALID [2018-11-23 11:10:17,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2018-11-23 11:10:17,154 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:10:17,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:17,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:10:17,157 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-11-23 11:10:17,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:17,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:10:19,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:19,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:10:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:10:19,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=147, Unknown=2, NotChecked=0, Total=182 [2018-11-23 11:10:19,529 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 14 states. [2018-11-23 11:10:28,793 WARN L180 SmtUtils]: Spent 4.79 s on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2018-11-23 11:10:44,664 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-23 11:10:45,079 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2018-11-23 11:10:52,967 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 38 [2018-11-23 11:10:55,527 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-11-23 11:10:56,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:56,803 INFO L93 Difference]: Finished difference Result 91 states and 120 transitions. [2018-11-23 11:10:56,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:10:56,803 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2018-11-23 11:10:56,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:10:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2018-11-23 11:10:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:10:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 113 transitions. [2018-11-23 11:10:56,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 113 transitions. [2018-11-23 11:11:01,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 111 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:01,301 INFO L225 Difference]: With dead ends: 91 [2018-11-23 11:11:01,301 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 11:11:01,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=117, Invalid=481, Unknown=2, NotChecked=0, Total=600 [2018-11-23 11:11:01,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 11:11:01,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 31. [2018-11-23 11:11:01,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:01,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 31 states. [2018-11-23 11:11:01,476 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 31 states. [2018-11-23 11:11:01,477 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 31 states. [2018-11-23 11:11:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:01,483 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2018-11-23 11:11:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2018-11-23 11:11:01,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:01,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:01,485 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 89 states. [2018-11-23 11:11:01,485 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 89 states. [2018-11-23 11:11:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:01,490 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2018-11-23 11:11:01,491 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2018-11-23 11:11:01,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:01,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:01,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:01,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:01,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:11:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2018-11-23 11:11:01,494 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 16 [2018-11-23 11:11:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:01,495 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2018-11-23 11:11:01,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:11:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2018-11-23 11:11:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:11:01,496 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:01,496 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:01,496 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:01,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:01,496 INFO L82 PathProgramCache]: Analyzing trace with hash -805420317, now seen corresponding path program 1 times [2018-11-23 11:11:01,497 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:01,497 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:11:01,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:01,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:01,629 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 18 treesize of output 15 [2018-11-23 11:11:01,638 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 15 treesize of output 18 [2018-11-23 11:11:01,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2018-11-23 11:11:01,653 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,666 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2018-11-23 11:11:01,729 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:11:01,738 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:11:01,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,742 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:11:01,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:11:01,745 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:01,746 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) (_ bv4 32)))) (and (= |main_#t~mem11| .cse0) (= (_ bv1 32) .cse0))) [2018-11-23 11:11:01,746 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem11| (_ bv1 32)) [2018-11-23 11:11:01,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {942#true} call ULTIMATE.init(); {942#true} is VALID [2018-11-23 11:11:01,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {942#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {942#true} is VALID [2018-11-23 11:11:01,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {942#true} assume true; {942#true} is VALID [2018-11-23 11:11:01,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {942#true} {942#true} #110#return; {942#true} is VALID [2018-11-23 11:11:01,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {942#true} call #t~ret17 := main(); {942#true} is VALID [2018-11-23 11:11:01,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {942#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {942#true} is VALID [2018-11-23 11:11:01,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {942#true} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {942#true} is VALID [2018-11-23 11:11:01,763 INFO L273 TraceCheckUtils]: 7: Hoare triple {942#true} assume 0bv32 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {968#(and (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:01,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {968#(and (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {972#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:11:01,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {972#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {976#(= (bvadd |main_#t~mem11| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:01,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {976#(= (bvadd |main_#t~mem11| (_ bv4294967295 32)) (_ bv0 32))} assume !!(1bv32 != #t~mem11);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem12.base, #t~mem12.offset;havoc #t~mem12.base, #t~mem12.offset; {943#false} is VALID [2018-11-23 11:11:01,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {943#false} call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {943#false} is VALID [2018-11-23 11:11:01,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {943#false} assume !(1bv32 != #t~mem11);havoc #t~mem11; {943#false} is VALID [2018-11-23 11:11:01,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {943#false} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {943#false} is VALID [2018-11-23 11:11:01,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#false} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {943#false} is VALID [2018-11-23 11:11:01,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {943#false} assume 1bv32 == #t~mem14;havoc #t~mem14; {943#false} is VALID [2018-11-23 11:11:01,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {943#false} assume !false; {943#false} is VALID [2018-11-23 11:11:01,767 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:11:01,767 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:11:01,768 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:11:01,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:11:01,769 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:11:01,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:01,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:11:01,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:01,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:11:01,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:11:01,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:11:01,795 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 5 states. [2018-11-23 11:11:02,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:02,781 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-11-23 11:11:02,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:11:02,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 11:11:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:11:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 11:11:02,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:11:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 11:11:02,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2018-11-23 11:11:02,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:02,983 INFO L225 Difference]: With dead ends: 48 [2018-11-23 11:11:02,983 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:11:02,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:11:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:11:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2018-11-23 11:11:03,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:03,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 34 states. [2018-11-23 11:11:03,266 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 34 states. [2018-11-23 11:11:03,266 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 34 states. [2018-11-23 11:11:03,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:03,269 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 11:11:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-23 11:11:03,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:03,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:03,270 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 40 states. [2018-11-23 11:11:03,270 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 40 states. [2018-11-23 11:11:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:03,272 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2018-11-23 11:11:03,272 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2018-11-23 11:11:03,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:03,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:03,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:03,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:11:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-23 11:11:03,275 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 17 [2018-11-23 11:11:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:03,275 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-23 11:11:03,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:11:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-23 11:11:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:11:03,276 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:03,276 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:03,277 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:03,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:03,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1467497518, now seen corresponding path program 1 times [2018-11-23 11:11:03,277 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:03,277 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:11:03,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:03,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:03,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:03,406 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:11:03,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,470 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 22 treesize of output 19 [2018-11-23 11:11:03,478 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 19 treesize of output 22 [2018-11-23 11:11:03,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:03,495 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:11:03,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,508 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,515 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,544 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 22 treesize of output 19 [2018-11-23 11:11:03,551 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 19 treesize of output 22 [2018-11-23 11:11:03,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:03,647 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:11:03,669 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,759 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,787 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,828 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:54, output treesize:23 [2018-11-23 11:11:08,670 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:08,671 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|, |v_#valid_28|]. (let ((.cse0 (bvadd main_~head~0.offset (_ bv4 32)))) (and (= (store |v_#memory_$Pointer$.offset_32| main_~head~0.base (store (store (select |v_#memory_$Pointer$.offset_32| main_~head~0.base) main_~head~0.offset (_ bv0 32)) .cse0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) .cse0))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_32| main_~head~0.base (store (store (select |v_#memory_$Pointer$.base_32| main_~head~0.base) main_~head~0.offset (_ bv0 32)) .cse0 (select (select |#memory_$Pointer$.base| main_~head~0.base) .cse0)))) (= |#valid| (store |v_#valid_28| main_~head~0.base (_ bv1 1))) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:11:08,671 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (select |#valid| main_~head~0.base) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:11:08,773 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:08,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:08,790 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:11:08,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,105 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-23 11:11:09,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 11:11:09,118 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 1 [2018-11-23 11:11:09,119 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,147 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-23 11:11:09,300 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 1 [2018-11-23 11:11:09,301 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,317 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,387 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:11:09,393 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:11:09,394 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,408 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,501 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:11:09,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:11:09,520 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,532 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,556 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:82, output treesize:41 [2018-11-23 11:11:09,689 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:09,690 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_31|, v_main_~head~0.base_12, |v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|, |v_#valid_29|, |v_#memory_$Pointer$.offset_31|]. (let ((.cse0 (select |v_#memory_$Pointer$.base_31| main_~head~0.base)) (.cse1 (select |v_#memory_$Pointer$.offset_31| main_~head~0.base))) (and (= (select (select |v_#memory_$Pointer$.offset_33| v_main_~head~0.base_12) (_ bv0 32)) (_ bv0 32)) (= |v_#memory_$Pointer$.base_31| (store |v_#memory_$Pointer$.base_33| main_~head~0.base (store (select |v_#memory_$Pointer$.base_33| main_~head~0.base) (_ bv4 32) (select .cse0 (_ bv4 32))))) (= (store |v_#memory_$Pointer$.base_31| main_~head~0.base (store .cse0 (_ bv0 32) v_main_~head~0.base_12)) |#memory_$Pointer$.base|) (= (_ bv0 1) (bvadd (select |v_#valid_29| v_main_~head~0.base_12) (_ bv1 1))) (= |v_#memory_$Pointer$.offset_31| (store |v_#memory_$Pointer$.offset_33| main_~head~0.base (store (select |v_#memory_$Pointer$.offset_33| main_~head~0.base) (_ bv4 32) (select .cse1 (_ bv4 32))))) (= (store |v_#memory_$Pointer$.offset_31| main_~head~0.base (store .cse1 (_ bv0 32) (_ bv0 32))) |#memory_$Pointer$.offset|) (= (_ bv0 1) (select |v_#valid_29| main_~head~0.base)) (= (select (select |v_#memory_$Pointer$.base_33| v_main_~head~0.base_12) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:11:09,690 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) (_ bv0 32))) (not (= .cse0 main_~head~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) (_ bv0 32))) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:11:10,018 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 49 treesize of output 39 [2018-11-23 11:11:10,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 11:11:10,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:10,041 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:11:10,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:10,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:10,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-11-23 11:11:10,079 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 6 treesize of output 4 [2018-11-23 11:11:10,094 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:10,101 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:11:10,102 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:10,105 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:10,111 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:11:10,111 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:68, output treesize:7 [2018-11-23 11:11:10,120 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:10,120 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~x~0.base_32, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)))) (let ((.cse3 (select |#memory_$Pointer$.offset| .cse0)) (.cse2 (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32))) (.cse1 (select |#memory_$Pointer$.base| .cse0))) (and (not (= .cse0 v_main_~x~0.base_32)) (= (select .cse1 .cse2) main_~x~0.base) (= (select .cse3 (_ bv0 32)) (_ bv0 32)) (= main_~x~0.offset (select .cse3 .cse2)) (= .cse2 (_ bv0 32)) (= (_ bv0 32) (select .cse1 (_ bv0 32)))))) [2018-11-23 11:11:10,121 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) main_~x~0.base)) [2018-11-23 11:11:10,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-23 11:11:10,142 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1198#true} is VALID [2018-11-23 11:11:10,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-23 11:11:10,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #110#return; {1198#true} is VALID [2018-11-23 11:11:10,143 INFO L256 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret17 := main(); {1198#true} is VALID [2018-11-23 11:11:10,146 INFO L273 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1218#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:10,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {1218#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1218#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:10,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {1218#(and (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))} assume 0bv32 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {1225#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))))} is VALID [2018-11-23 11:11:10,153 INFO L273 TraceCheckUtils]: 8: Hoare triple {1225#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv0 32))))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1229#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) main_~x~0.base)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:10,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {1229#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) main_~x~0.base)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1229#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) main_~x~0.base)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:10,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {1229#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) main_~x~0.base)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} assume !(1bv32 != #t~mem11);havoc #t~mem11; {1229#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) main_~x~0.base)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:10,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {1229#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) main_~x~0.base)) (= main_~x~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1239#(exists ((v_main_~x~0.base_32 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) v_main_~x~0.base_32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.base)))} is VALID [2018-11-23 11:11:10,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {1239#(exists ((v_main_~x~0.base_32 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) v_main_~x~0.base_32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.base)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1239#(exists ((v_main_~x~0.base_32 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) v_main_~x~0.base_32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.base)))} is VALID [2018-11-23 11:11:10,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {1239#(exists ((v_main_~x~0.base_32 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) v_main_~x~0.base_32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.base)))} assume !(1bv32 == #t~mem14);havoc #t~mem14; {1239#(exists ((v_main_~x~0.base_32 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) v_main_~x~0.base_32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.base)))} is VALID [2018-11-23 11:11:10,160 INFO L273 TraceCheckUtils]: 14: Hoare triple {1239#(exists ((v_main_~x~0.base_32 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) v_main_~x~0.base_32)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32))) (_ bv0 32))) (= (select (select |#memory_$Pointer$.base| v_main_~x~0.base_32) (_ bv0 32)) main_~x~0.base)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1249#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-23 11:11:10,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {1249#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) main_~x~0.base))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1199#false} is VALID [2018-11-23 11:11:10,161 INFO L273 TraceCheckUtils]: 16: Hoare triple {1199#false} assume 1bv32 == #t~mem14;havoc #t~mem14; {1199#false} is VALID [2018-11-23 11:11:10,161 INFO L273 TraceCheckUtils]: 17: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-23 11:11:10,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:11:10,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:11:12,064 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2018-11-23 11:11:12,079 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:11:12,110 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:11:12,125 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:11:12,162 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:11:12,800 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:11:12,838 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:11:12,845 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:12,871 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:12,886 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:11:12,921 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:11:13,426 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,447 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,454 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,472 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,786 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,800 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,809 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,828 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,839 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:13,856 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:14,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 5 xjuncts. [2018-11-23 11:11:14,040 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:109, output treesize:115 [2018-11-23 11:11:16,134 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:16,134 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_prenex_6, v_prenex_7, v_prenex_5, |v_#memory_$Pointer$.offset_31|, v_main_~head~0.base_13, |v_#memory_$Pointer$.base_31|]. (and (let ((.cse0 (select v_prenex_6 v_prenex_7))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_7))) (not (= v_prenex_6 (store |#memory_$Pointer$.base| v_prenex_7 (store (select |#memory_$Pointer$.base| v_prenex_7) (_ bv4 32) (select .cse0 (_ bv4 32)))))) (not (= v_prenex_5 (store |#memory_$Pointer$.offset| v_prenex_7 (store (select |#memory_$Pointer$.offset| v_prenex_7) (_ bv4 32) (select (select v_prenex_5 v_prenex_7) (_ bv4 32)))))) (= (select (select (store v_prenex_6 v_prenex_7 (store .cse0 (_ bv0 32) main_~head~0.base)) main_~head~0.base) main_~head~0.offset) (_ bv0 32)))) (let ((.cse1 (select |v_#memory_$Pointer$.offset_31| v_main_~head~0.base_13))) (or (not (= |v_#memory_$Pointer$.offset_31| (store |#memory_$Pointer$.offset| v_main_~head~0.base_13 (store (select |#memory_$Pointer$.offset| v_main_~head~0.base_13) (_ bv4 32) (select .cse1 (_ bv4 32)))))) (not (= (_ bv0 1) (select |#valid| v_main_~head~0.base_13))) (not (= |v_#memory_$Pointer$.base_31| (store |#memory_$Pointer$.base| v_main_~head~0.base_13 (store (select |#memory_$Pointer$.base| v_main_~head~0.base_13) (_ bv4 32) (select (select |v_#memory_$Pointer$.base_31| v_main_~head~0.base_13) (_ bv4 32)))))) (= (select (select (store |v_#memory_$Pointer$.offset_31| v_main_~head~0.base_13 (store .cse1 (_ bv0 32) main_~head~0.offset)) main_~head~0.base) main_~head~0.offset) (_ bv0 32))))) [2018-11-23 11:11:16,135 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~head~0.base_13, v_DerPreprocessor_12, v_prenex_8, v_DerPreprocessor_16, v_prenex_9, v_DerPreprocessor_14, v_prenex_7, v_DerPreprocessor_20]. (let ((.cse0 (= (_ bv0 32) main_~head~0.offset))) (and (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_main_~head~0.base_13 (store (select |#memory_$Pointer$.offset| v_main_~head~0.base_13) (_ bv4 32) v_DerPreprocessor_12)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_main_~head~0.base_13))) (= v_main_~head~0.base_13 main_~head~0.base)) (or (not .cse0) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (not (= (_ bv0 1) (select |#valid| v_prenex_8))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_8 (store (select |#memory_$Pointer$.base| v_prenex_8) (_ bv4 32) v_DerPreprocessor_16)) main_~head~0.base) main_~head~0.offset)) .cse0) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv4 32) v_DerPreprocessor_14)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_prenex_9))) .cse0) (or (not (= (_ bv0 1) (select |#valid| v_prenex_7))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_7 (store (select |#memory_$Pointer$.base| v_prenex_7) (_ bv4 32) v_DerPreprocessor_20)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base v_prenex_7)))) [2018-11-23 11:11:34,442 WARN L180 SmtUtils]: Spent 16.19 s on a formula simplification that was a NOOP. DAG size: 72 [2018-11-23 11:11:34,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {1199#false} assume !false; {1199#false} is VALID [2018-11-23 11:11:34,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {1199#false} assume 1bv32 == #t~mem14;havoc #t~mem14; {1199#false} is VALID [2018-11-23 11:11:34,539 INFO L273 TraceCheckUtils]: 15: Hoare triple {1249#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) main_~x~0.base))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1199#false} is VALID [2018-11-23 11:11:34,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {1268#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem15.base, #t~mem15.offset;havoc #t~mem15.base, #t~mem15.offset; {1249#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-23 11:11:34,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {1268#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !(1bv32 == #t~mem14);havoc #t~mem14; {1268#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:34,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {1268#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1268#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:34,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {1278#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1268#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)))} is VALID [2018-11-23 11:11:34,544 INFO L273 TraceCheckUtils]: 10: Hoare triple {1278#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))} assume !(1bv32 != #t~mem11);havoc #t~mem11; {1278#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))} is VALID [2018-11-23 11:11:34,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {1278#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))} call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1278#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))} is VALID [2018-11-23 11:11:34,547 INFO L273 TraceCheckUtils]: 8: Hoare triple {1288#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1278#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset))))} is VALID [2018-11-23 11:11:34,561 INFO L273 TraceCheckUtils]: 7: Hoare triple {1292#(and (or (forall ((v_prenex_8 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_8 (store (select |#memory_$Pointer$.base| v_prenex_8) (_ bv4 32) v_DerPreprocessor_16)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_prenex_8))))) (= (_ bv0 32) main_~head~0.offset)) (forall ((v_DerPreprocessor_20 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_7))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_7 (store (select |#memory_$Pointer$.base| v_prenex_7) (_ bv4 32) v_DerPreprocessor_20)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base v_prenex_7))) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_9))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv4 32) v_DerPreprocessor_14)) main_~head~0.base) main_~head~0.offset)))) (= (_ bv0 32) main_~head~0.offset)) (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~head~0.base_13 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_main_~head~0.base_13 (store (select |#memory_$Pointer$.offset| v_main_~head~0.base_13) (_ bv4 32) v_DerPreprocessor_12)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_main_~head~0.base_13))) (= v_main_~head~0.base_13 main_~head~0.base))))} assume 0bv32 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {1288#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))} is VALID [2018-11-23 11:11:34,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {1292#(and (or (forall ((v_prenex_8 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_8 (store (select |#memory_$Pointer$.base| v_prenex_8) (_ bv4 32) v_DerPreprocessor_16)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_prenex_8))))) (= (_ bv0 32) main_~head~0.offset)) (forall ((v_DerPreprocessor_20 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_7))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_7 (store (select |#memory_$Pointer$.base| v_prenex_7) (_ bv4 32) v_DerPreprocessor_20)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base v_prenex_7))) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_9))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv4 32) v_DerPreprocessor_14)) main_~head~0.base) main_~head~0.offset)))) (= (_ bv0 32) main_~head~0.offset)) (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~head~0.base_13 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_main_~head~0.base_13 (store (select |#memory_$Pointer$.offset| v_main_~head~0.base_13) (_ bv4 32) v_DerPreprocessor_12)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_main_~head~0.base_13))) (= v_main_~head~0.base_13 main_~head~0.base))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1292#(and (or (forall ((v_prenex_8 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_8 (store (select |#memory_$Pointer$.base| v_prenex_8) (_ bv4 32) v_DerPreprocessor_16)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_prenex_8))))) (= (_ bv0 32) main_~head~0.offset)) (forall ((v_DerPreprocessor_20 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_7))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_7 (store (select |#memory_$Pointer$.base| v_prenex_7) (_ bv4 32) v_DerPreprocessor_20)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base v_prenex_7))) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_9))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv4 32) v_DerPreprocessor_14)) main_~head~0.base) main_~head~0.offset)))) (= (_ bv0 32) main_~head~0.offset)) (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~head~0.base_13 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_main_~head~0.base_13 (store (select |#memory_$Pointer$.offset| v_main_~head~0.base_13) (_ bv4 32) v_DerPreprocessor_12)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_main_~head~0.base_13))) (= v_main_~head~0.base_13 main_~head~0.base))))} is VALID [2018-11-23 11:11:34,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {1198#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1292#(and (or (forall ((v_prenex_8 (_ BitVec 32)) (v_DerPreprocessor_16 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_8 (store (select |#memory_$Pointer$.base| v_prenex_8) (_ bv4 32) v_DerPreprocessor_16)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_prenex_8))))) (= (_ bv0 32) main_~head~0.offset)) (forall ((v_DerPreprocessor_20 (_ BitVec 32)) (v_prenex_7 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_7))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.base| v_prenex_7 (store (select |#memory_$Pointer$.base| v_prenex_7) (_ bv4 32) v_DerPreprocessor_20)) main_~head~0.base) main_~head~0.offset)) (= main_~head~0.base v_prenex_7))) (or (not (= (_ bv0 32) main_~head~0.offset)) (not (= (select |#valid| main_~head~0.base) (_ bv0 1))) (= (_ bv0 32) main_~head~0.base)) (or (forall ((v_prenex_9 (_ BitVec 32)) (v_DerPreprocessor_14 (_ BitVec 32))) (or (not (= (_ bv0 1) (select |#valid| v_prenex_9))) (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_prenex_9 (store (select |#memory_$Pointer$.offset| v_prenex_9) (_ bv4 32) v_DerPreprocessor_14)) main_~head~0.base) main_~head~0.offset)))) (= (_ bv0 32) main_~head~0.offset)) (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~head~0.base_13 (_ BitVec 32))) (or (= (_ bv0 32) (select (select (store |#memory_$Pointer$.offset| v_main_~head~0.base_13 (store (select |#memory_$Pointer$.offset| v_main_~head~0.base_13) (_ bv4 32) v_DerPreprocessor_12)) main_~head~0.base) main_~head~0.offset)) (not (= (_ bv0 1) (select |#valid| v_main_~head~0.base_13))) (= v_main_~head~0.base_13 main_~head~0.base))))} is VALID [2018-11-23 11:11:34,570 INFO L256 TraceCheckUtils]: 4: Hoare triple {1198#true} call #t~ret17 := main(); {1198#true} is VALID [2018-11-23 11:11:34,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1198#true} {1198#true} #110#return; {1198#true} is VALID [2018-11-23 11:11:34,571 INFO L273 TraceCheckUtils]: 2: Hoare triple {1198#true} assume true; {1198#true} is VALID [2018-11-23 11:11:34,571 INFO L273 TraceCheckUtils]: 1: Hoare triple {1198#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1198#true} is VALID [2018-11-23 11:11:34,571 INFO L256 TraceCheckUtils]: 0: Hoare triple {1198#true} call ULTIMATE.init(); {1198#true} is VALID [2018-11-23 11:11:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:11:34,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:11:34,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-23 11:11:34,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 11:11:34,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:34,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:11:34,692 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:34,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:11:34,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:11:34,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=86, Unknown=1, NotChecked=0, Total=110 [2018-11-23 11:11:34,694 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 11 states. [2018-11-23 11:11:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:42,157 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2018-11-23 11:11:42,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:11:42,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-11-23 11:11:42,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:11:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2018-11-23 11:11:42,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:11:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 81 transitions. [2018-11-23 11:11:42,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 81 transitions. [2018-11-23 11:11:42,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:42,318 INFO L225 Difference]: With dead ends: 77 [2018-11-23 11:11:42,318 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 11:11:42,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=50, Invalid=189, Unknown=1, NotChecked=0, Total=240 [2018-11-23 11:11:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 11:11:42,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 45. [2018-11-23 11:11:42,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:42,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 45 states. [2018-11-23 11:11:42,417 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 45 states. [2018-11-23 11:11:42,417 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 45 states. [2018-11-23 11:11:42,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:42,421 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2018-11-23 11:11:42,421 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-11-23 11:11:42,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:42,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:42,422 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 62 states. [2018-11-23 11:11:42,422 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 62 states. [2018-11-23 11:11:42,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:42,425 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2018-11-23 11:11:42,425 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-11-23 11:11:42,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:42,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:42,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:42,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 11:11:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2018-11-23 11:11:42,428 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 18 [2018-11-23 11:11:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:42,428 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2018-11-23 11:11:42,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:11:42,428 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2018-11-23 11:11:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:11:42,429 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:42,429 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:11:42,429 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:42,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1146609064, now seen corresponding path program 1 times [2018-11-23 11:11:42,430 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:42,430 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:11:42,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:42,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:42,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 11:11:42,675 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 15 [2018-11-23 11:11:42,676 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,731 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:11:42,738 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:11:42,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 11:11:42,777 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 15 [2018-11-23 11:11:42,779 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,786 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,804 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:11:42,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:11:42,815 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,817 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,828 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:48, output treesize:18 [2018-11-23 11:11:42,854 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:42,854 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.offset_36|, |v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.base_36|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.offset_37| main_~head~0.base) main_~head~0.offset)) (.cse1 (select (select |v_#memory_$Pointer$.base_37| main_~head~0.base) main_~head~0.offset))) (and (= .cse0 (_ bv0 32)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_36| main_~head~0.base (store (select |v_#memory_$Pointer$.offset_36| main_~head~0.base) main_~head~0.offset .cse0))) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_36| main_~head~0.base (store (select |v_#memory_$Pointer$.base_36| main_~head~0.base) main_~head~0.offset .cse1))) (= .cse1 (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:11:42,854 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:11:42,978 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:11:42,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:11:42,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:42,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:43,004 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:11:43,008 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:11:43,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:43,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:43,017 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:11:43,018 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:11:43,023 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:43,024 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~x~0.base_39, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~x~0.base_39) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_39) (_ bv0 32)))) (and (= (_ bv0 32) .cse0) (= .cse1 main_~x~0.base) (= .cse1 (_ bv0 32)) (= main_~x~0.offset .cse0))) [2018-11-23 11:11:43,024 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) main_~x~0.base)) [2018-11-23 11:11:43,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {1619#true} call ULTIMATE.init(); {1619#true} is VALID [2018-11-23 11:11:43,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {1619#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1619#true} is VALID [2018-11-23 11:11:43,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {1619#true} assume true; {1619#true} is VALID [2018-11-23 11:11:43,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1619#true} {1619#true} #110#return; {1619#true} is VALID [2018-11-23 11:11:43,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {1619#true} call #t~ret17 := main(); {1619#true} is VALID [2018-11-23 11:11:43,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {1619#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1639#(= (_ bv0 32) main_~head~0.offset)} is VALID [2018-11-23 11:11:43,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {1639#(= (_ bv0 32) main_~head~0.offset)} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {1639#(= (_ bv0 32) main_~head~0.offset)} is VALID [2018-11-23 11:11:43,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {1639#(= (_ bv0 32) main_~head~0.offset)} assume !(0bv32 != #t~nondet4);havoc #t~nondet4;~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1646#(and (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:43,060 INFO L273 TraceCheckUtils]: 8: Hoare triple {1646#(and (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32); {1650#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.base|) (= |main_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:43,061 INFO L273 TraceCheckUtils]: 9: Hoare triple {1650#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem8.base|) (= |main_#t~mem8.offset| (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !(#t~mem8.base != 0bv32 || #t~mem8.offset != 0bv32);havoc #t~mem8.base, #t~mem8.offset; {1654#(and (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:43,064 INFO L273 TraceCheckUtils]: 10: Hoare triple {1654#(and (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} call #t~mem9.base, #t~mem9.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~y~0.base, ~y~0.offset := #t~mem9.base, #t~mem9.offset;havoc #t~mem9.base, #t~mem9.offset;call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc10.base, #t~malloc10.offset, ~x~0.base, ~x~0.offset, 4bv32);call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~y~0.base, ~y~0.offset, ~x~0.base, ~x~0.offset, 4bv32); {1658#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:43,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {1658#(and (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) main_~head~0.offset) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1662#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:11:43,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {1662#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (_ bv0 32)))} call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1662#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:11:43,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {1662#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (_ bv0 32)))} assume !(1bv32 != #t~mem11);havoc #t~mem11; {1662#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (_ bv0 32)))} is VALID [2018-11-23 11:11:43,072 INFO L273 TraceCheckUtils]: 14: Hoare triple {1662#(and (= main_~x~0.offset (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)) (= main_~x~0.offset (_ bv0 32)))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {1672#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) main_~x~0.base))} is VALID [2018-11-23 11:11:43,073 INFO L273 TraceCheckUtils]: 15: Hoare triple {1672#(and (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) main_~x~0.base))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {1620#false} is VALID [2018-11-23 11:11:43,073 INFO L273 TraceCheckUtils]: 16: Hoare triple {1620#false} assume 1bv32 == #t~mem14;havoc #t~mem14; {1620#false} is VALID [2018-11-23 11:11:43,073 INFO L273 TraceCheckUtils]: 17: Hoare triple {1620#false} assume !false; {1620#false} is VALID [2018-11-23 11:11:43,074 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:11:43,074 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:11:43,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:11:43,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:11:43,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 11:11:43,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:11:43,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:11:43,102 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:11:43,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:11:43,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:11:43,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:11:43,102 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand 9 states. [2018-11-23 11:11:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:46,977 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2018-11-23 11:11:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:11:46,977 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 11:11:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:46,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:11:46,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2018-11-23 11:11:46,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:11:46,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 79 transitions. [2018-11-23 11:11:46,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 79 transitions. [2018-11-23 11:11:47,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:47,140 INFO L225 Difference]: With dead ends: 83 [2018-11-23 11:11:47,140 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:11:47,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:11:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:11:47,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 43. [2018-11-23 11:11:47,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:47,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 43 states. [2018-11-23 11:11:47,320 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 43 states. [2018-11-23 11:11:47,320 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 43 states. [2018-11-23 11:11:47,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:47,323 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 11:11:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 11:11:47,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:47,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:47,324 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 60 states. [2018-11-23 11:11:47,324 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 60 states. [2018-11-23 11:11:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:47,326 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2018-11-23 11:11:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2018-11-23 11:11:47,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:47,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:47,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:47,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:11:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2018-11-23 11:11:47,329 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 18 [2018-11-23 11:11:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:47,329 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2018-11-23 11:11:47,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:11:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2018-11-23 11:11:47,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:11:47,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:47,330 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:47,331 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:47,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:47,331 INFO L82 PathProgramCache]: Analyzing trace with hash -907895778, now seen corresponding path program 2 times [2018-11-23 11:11:47,331 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:47,331 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:11:47,352 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:11:47,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:11:47,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:11:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:47,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:47,570 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:11:47,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:11:47,601 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:11:47,603 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,626 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:11:47,626 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:29, output treesize:24 [2018-11-23 11:11:47,645 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:47,645 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_34|, |v_#valid_35|]. (and (= |#valid| (store |v_#valid_35| main_~head~0.base (_ bv1 1))) (= main_~head~0.base main_~x~0.base) (= (store |v_#memory_int_34| main_~head~0.base (store (select |v_#memory_int_34| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)) (_ bv0 32))) |#memory_int|) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) [2018-11-23 11:11:47,645 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset)) [2018-11-23 11:11:47,703 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:47,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:47,711 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 17 treesize of output 21 [2018-11-23 11:11:47,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:47,819 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:47,836 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:47,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2018-11-23 11:11:47,951 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:47,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 11:11:47,959 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,015 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 37 treesize of output 38 [2018-11-23 11:11:48,025 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 17 treesize of output 20 [2018-11-23 11:11:48,033 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:48,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:11:48,039 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,050 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,071 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,091 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,127 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:64, output treesize:36 [2018-11-23 11:11:48,209 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:48,209 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_35|, |v_#memory_int_38|, |v_#valid_36|]. (let ((.cse0 (select |v_#memory_int_38| main_~head~0.base))) (and (= (_ bv0 1) (select |v_#valid_36| main_~x~0.base)) (= |#valid| (store |v_#valid_36| main_~x~0.base (_ bv1 1))) (= (_ bv1 1) (select |v_#valid_36| main_~head~0.base)) (= |v_#memory_int_35| (store |v_#memory_int_38| main_~head~0.base (store .cse0 main_~head~0.offset (select (select |v_#memory_int_35| main_~head~0.base) main_~head~0.offset)))) (= (store |v_#memory_int_35| main_~x~0.base (store (store (select |v_#memory_int_35| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv0 32)) main_~x~0.offset (select (select |#memory_int| main_~x~0.base) main_~x~0.offset))) |#memory_int|) (= (select .cse0 (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:11:48,209 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= (select |#valid| main_~head~0.base) (_ bv1 1)) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:11:48,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:48,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:48,332 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:48,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 36 [2018-11-23 11:11:48,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:48,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:48,760 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-11-23 11:11:48,791 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:48,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-23 11:11:48,801 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,895 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 55 [2018-11-23 11:11:48,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:11:48,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:48,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:11:48,943 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:48,962 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:49,001 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:49,031 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:49,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:49,120 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:84, output treesize:60 [2018-11-23 11:11:51,129 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:51,129 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_36|, |v_#memory_int_39|, v_main_~x~0.base_41, v_main_~x~0.offset_41, |v_#valid_37|]. (let ((.cse0 (select |v_#memory_int_39| v_main_~x~0.base_41))) (and (= (select (select |v_#memory_int_39| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (store |v_#memory_int_36| main_~x~0.base (store (store (select |v_#memory_int_36| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv0 32)) main_~x~0.offset (select (select |#memory_int| main_~x~0.base) main_~x~0.offset))) |#memory_int|) (= (_ bv0 32) (select .cse0 (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (= |v_#memory_int_36| (store |v_#memory_int_39| v_main_~x~0.base_41 (store .cse0 v_main_~x~0.offset_41 (select (select |v_#memory_int_36| v_main_~x~0.base_41) v_main_~x~0.offset_41)))) (= (_ bv0 1) (select |v_#valid_37| main_~x~0.base)) (= |#valid| (store |v_#valid_37| main_~x~0.base (_ bv1 1))) (= (_ bv0 1) (bvadd (select |v_#valid_37| main_~head~0.base) (_ bv1 1))) (not (= v_main_~x~0.base_41 main_~head~0.base)) (= (_ bv1 1) (select |v_#valid_37| v_main_~x~0.base_41)) (= (_ bv0 32) main_~head~0.offset))) [2018-11-23 11:11:51,129 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~x~0.base_41, v_main_~x~0.offset_41]. (and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_41 main_~x~0.base)) (= (_ bv0 1) (bvadd (select |#valid| main_~head~0.base) (_ bv1 1))) (= (select |#valid| v_main_~x~0.base_41) (_ bv1 1)) (not (= main_~head~0.base main_~x~0.base)) (not (= v_main_~x~0.base_41 main_~head~0.base)) (= (_ bv0 32) main_~head~0.offset)) [2018-11-23 11:11:51,287 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:51,296 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:51,307 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:51,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:51,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 53 [2018-11-23 11:11:51,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:51,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2018-11-23 11:11:51,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:51,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:11:51,685 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:51,734 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:51,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 69 [2018-11-23 11:11:51,973 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 17 treesize of output 20 [2018-11-23 11:11:51,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:52,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:11:52,004 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:52,024 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:52,082 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:52,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:52,199 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:106, output treesize:86 [2018-11-23 11:11:52,334 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:52,334 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_37|, v_main_~x~0.base_42, v_main_~x~0.offset_42, |v_#memory_int_40|, |v_#valid_38|, v_main_~x~0.base_41, |main_#t~malloc2.base|, main_~x~0.offset, v_main_~x~0.offset_41]. (let ((.cse0 (select |v_#memory_int_40| v_main_~x~0.base_42))) (and (= (_ bv1 1) (select |v_#valid_38| v_main_~x~0.base_42)) (= (store |v_#memory_int_40| v_main_~x~0.base_42 (store .cse0 v_main_~x~0.offset_42 (select (select |v_#memory_int_37| v_main_~x~0.base_42) v_main_~x~0.offset_42))) |v_#memory_int_37|) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= (_ bv0 32) (select (select |v_#memory_int_40| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (= |#valid| (store |v_#valid_38| |main_#t~malloc2.base| (_ bv1 1))) (= (select |v_#valid_38| main_~head~0.base) (_ bv1 1)) (= (_ bv0 32) main_~head~0.offset) (= (store |v_#memory_int_37| |main_#t~malloc2.base| (store (store (select |v_#memory_int_37| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32)) (_ bv0 32)) main_~x~0.offset (select (select |#memory_int| |main_#t~malloc2.base|) main_~x~0.offset))) |#memory_int|) (= (_ bv0 32) (select .cse0 (bvadd v_main_~x~0.offset_42 (_ bv4 32)))) (= (select (select |v_#memory_int_40| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32))) (_ bv0 32)) (not (= v_main_~x~0.base_42 main_~head~0.base)) (= (_ bv0 1) (select |v_#valid_38| |main_#t~malloc2.base|)) (= (bvadd (select |v_#valid_38| v_main_~x~0.base_41) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) [2018-11-23 11:11:52,335 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~malloc2.base|, v_main_~x~0.base_42, v_main_~x~0.base_41, v_main_~x~0.offset_41, v_main_~x~0.offset_42, main_~x~0.offset]. (and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (= (_ bv0 1) (bvadd (select |#valid| v_main_~x~0.base_41) (_ bv1 1))) (= (_ bv0 32) main_~head~0.offset) (= (select |#valid| v_main_~x~0.base_42) (_ bv1 1)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (not (= v_main_~x~0.base_42 main_~head~0.base)) (= (select |#valid| main_~head~0.base) (_ bv1 1)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (not (= v_main_~x~0.base_41 main_~head~0.base))) [2018-11-23 11:11:52,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:52,701 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:52,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:52,719 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:52,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:52,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2018-11-23 11:11:52,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:53,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:53,466 INFO L303 Elim1Store]: Index analysis took 310 ms [2018-11-23 11:11:53,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 106 [2018-11-23 11:11:53,489 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 32 treesize of output 31 [2018-11-23 11:11:53,514 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 31 treesize of output 16 [2018-11-23 11:11:53,516 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:53,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:53,656 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:53,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:11:53,884 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:11:53,886 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:53,899 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:54,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:11:54,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:11:54,090 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:54,107 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:54,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:54,251 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:131, output treesize:104 [2018-11-23 11:11:56,278 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:56,279 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_38|, v_main_~head~0.base_15, |v_#memory_int_41|, v_main_~x~0.base_41, v_main_~x~0.offset_41, |main_#t~malloc2.base|, v_main_~x~0.base_42, |v_#valid_39|, main_~x~0.offset, |v_#memory_$Pointer$.offset_38|, v_main_~x~0.offset_42]. (and (= (_ bv0 32) (select (select |v_#memory_int_41| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (= (select (select |v_#memory_int_41| v_main_~head~0.base_15) (_ bv4 32)) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv1 1) (select |v_#valid_39| v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 v_main_~head~0.base_15)) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_38| main_~head~0.base (store (select |v_#memory_$Pointer$.base_38| main_~head~0.base) (_ bv0 32) v_main_~head~0.base_15))) (= (_ bv0 1) (bvadd (select |v_#valid_39| v_main_~head~0.base_15) (_ bv1 1))) (= (_ bv0 1) (select |v_#valid_39| main_~head~0.base)) (not (= v_main_~x~0.base_42 v_main_~head~0.base_15)) (= (_ bv0 32) (select (select |v_#memory_int_41| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32)))) (= (_ bv1 1) (select |v_#valid_39| |main_#t~malloc2.base|)) (= (_ bv0 32) main_~head~0.offset) (not (= |main_#t~malloc2.base| v_main_~head~0.base_15)) (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_38| main_~head~0.base (store (select |v_#memory_$Pointer$.offset_38| main_~head~0.base) (_ bv0 32) (_ bv0 32)))) (= (select (select |v_#memory_int_41| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (= (store |v_#memory_int_41| main_~head~0.base (store (store (select |v_#memory_int_41| main_~head~0.base) (_ bv4 32) (_ bv1 32)) (_ bv0 32) (select (select |#memory_int| main_~head~0.base) (_ bv0 32)))) |#memory_int|) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (= (bvadd (select |v_#valid_39| v_main_~x~0.base_42) (_ bv1 1)) (_ bv0 1))) [2018-11-23 11:11:56,279 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~x~0.base_42, |main_#t~malloc2.base|, v_main_~x~0.base_41, v_main_~x~0.offset_41, v_main_~x~0.offset_42, main_~x~0.offset]. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= .cse0 v_main_~x~0.base_42)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= (_ bv0 32) main_~head~0.offset) (not (= .cse0 v_main_~x~0.base_41)) (not (= |main_#t~malloc2.base| .cse0)) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| .cse0) (_ bv4 32))) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (not (= v_main_~x~0.base_42 main_~head~0.base)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) [2018-11-23 11:11:56,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:11:56,906 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:11:56,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:56,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:57,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2018-11-23 11:11:57,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 20 [2018-11-23 11:11:57,115 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:57,148 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:57,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:57,322 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:115, output treesize:81 [2018-11-23 11:11:57,363 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:57,364 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~x~0.base_43, |main_#t~malloc2.base|, v_main_~x~0.base_42, v_main_~x~0.base_41, v_main_~x~0.offset_41, v_prenex_10, v_main_~x~0.offset_42, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~x~0.base_43) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~x~0.base_43) (_ bv0 32)))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv0 32) (select (select |#memory_int| .cse0) (_ bv4 32))) (not (= v_main_~x~0.base_42 .cse0)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= .cse0 main_~x~0.base) (not (= v_main_~x~0.base_43 v_main_~x~0.base_42)) (= (select (select |#memory_int| v_main_~x~0.base_43) (_ bv4 32)) (_ bv1 32)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_43)) (not (= v_main_~x~0.base_43 v_main_~x~0.base_41)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (= main_~x~0.offset .cse1) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (= .cse1 (_ bv0 32)) (not (= |main_#t~malloc2.base| .cse0)) (not (= v_main_~x~0.base_41 .cse0)))) [2018-11-23 11:11:57,364 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~x~0.base_41, v_main_~x~0.offset_41, |main_#t~malloc2.base|, v_main_~x~0.base_42, v_main_~x~0.base_43, v_prenex_10, v_main_~x~0.offset_42]. (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= v_main_~x~0.base_43 v_main_~x~0.base_42)) (= (select (select |#memory_int| v_main_~x~0.base_43) (_ bv4 32)) (_ bv1 32)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_43)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (= main_~x~0.offset (_ bv0 32)) (not (= v_main_~x~0.base_43 v_main_~x~0.base_41)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32)))) [2018-11-23 11:11:57,674 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:57,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:57,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 83 [2018-11-23 11:11:57,755 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-23 11:11:57,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:11:57,871 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 7 treesize of output 1 [2018-11-23 11:11:57,886 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:57,931 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 7 treesize of output 1 [2018-11-23 11:11:57,932 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:57,967 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 7 treesize of output 1 [2018-11-23 11:11:57,968 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:57,992 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 7 treesize of output 1 [2018-11-23 11:11:57,993 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:58,074 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:87, output treesize:3 [2018-11-23 11:11:58,085 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:58,085 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~x~0.base, |main_#t~malloc2.base|, v_main_~x~0.base_42, v_main_~x~0.base_41, v_main_~x~0.offset_41, v_main_~x~0.base_43, v_prenex_10, v_main_~x~0.offset_42]. (let ((.cse0 (select (select |#memory_int| main_~x~0.base) (_ bv4 32)))) (and (= |main_#t~mem14| .cse0) (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= v_main_~x~0.base_43 v_main_~x~0.base_42)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_43)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (not (= v_main_~x~0.base_43 v_main_~x~0.base_41)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_43) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (_ bv0 32) .cse0))) [2018-11-23 11:11:58,086 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem14| (_ bv0 32)) [2018-11-23 11:11:58,135 INFO L256 TraceCheckUtils]: 0: Hoare triple {1981#true} call ULTIMATE.init(); {1981#true} is VALID [2018-11-23 11:11:58,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {1981#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1981#true} is VALID [2018-11-23 11:11:58,136 INFO L273 TraceCheckUtils]: 2: Hoare triple {1981#true} assume true; {1981#true} is VALID [2018-11-23 11:11:58,136 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1981#true} {1981#true} #110#return; {1981#true} is VALID [2018-11-23 11:11:58,136 INFO L256 TraceCheckUtils]: 4: Hoare triple {1981#true} call #t~ret17 := main(); {1981#true} is VALID [2018-11-23 11:11:58,139 INFO L273 TraceCheckUtils]: 5: Hoare triple {1981#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset;call write~$Pointer$(0bv32, 0bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2001#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} is VALID [2018-11-23 11:11:58,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {2001#(and (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (select (select |#memory_int| main_~x~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= main_~head~0.base main_~x~0.base) (= (_ bv0 32) main_~head~0.offset) (= main_~x~0.offset main_~head~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~intINTTYPE4(0bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {2005#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:58,260 INFO L273 TraceCheckUtils]: 7: Hoare triple {2005#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~intINTTYPE4(0bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {2009#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (exists ((v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_41 main_~x~0.base)) (= (bvadd (select |#valid| v_main_~x~0.base_41) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:58,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {2009#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (_ bv1 1) (select |#valid| main_~x~0.base)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (bvadd main_~x~0.offset (_ bv4 32)))) (= (_ bv1 1) (select |#valid| main_~head~0.base)) (exists ((v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32))) (and (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_41 main_~x~0.base)) (= (bvadd (select |#valid| v_main_~x~0.base_41) (_ bv1 1)) (_ bv0 1)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) (not (= main_~head~0.base main_~x~0.base)) (= (_ bv0 32) main_~head~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset;call write~intINTTYPE4(0bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(0bv32, 0bv32, ~x~0.base, ~x~0.offset, 4bv32); {2013#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((main_~x~0.offset (_ BitVec 32)) (v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| v_main_~x~0.base_42) (_ bv1 1)) (_ bv0 1)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (not (= v_main_~x~0.base_42 main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (= (_ bv1 1) (select |#valid| v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:58,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {2013#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((main_~x~0.offset (_ BitVec 32)) (v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| v_main_~x~0.base_42) (_ bv1 1)) (_ bv0 1)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (not (= v_main_~x~0.base_42 main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (= (_ bv1 1) (select |#valid| v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) (= (_ bv0 32) main_~head~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {2013#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((main_~x~0.offset (_ BitVec 32)) (v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| v_main_~x~0.base_42) (_ bv1 1)) (_ bv0 1)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (not (= v_main_~x~0.base_42 main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (= (_ bv1 1) (select |#valid| v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:59,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {2013#(and (= (select (select |#memory_int| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| main_~head~0.base) (_ bv1 1)) (_ bv0 1)) (exists ((main_~x~0.offset (_ BitVec 32)) (v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv1 1) (select |#valid| |main_#t~malloc2.base|)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (= (bvadd (select |#valid| v_main_~x~0.base_42) (_ bv1 1)) (_ bv0 1)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (not (= v_main_~x~0.base_42 main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (= (_ bv1 1) (select |#valid| v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) (= (_ bv0 32) main_~head~0.offset))} assume 0bv32 != #t~nondet4;havoc #t~nondet4;call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(8bv32);~x~0.base, ~x~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~intINTTYPE4(1bv32, ~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~x~0.base, ~x~0.offset, 4bv32);~head~0.base, ~head~0.offset := ~x~0.base, ~x~0.offset; {2020#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv4 32))) (exists ((main_~x~0.offset (_ BitVec 32)) (v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) v_main_~x~0.base_41)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) v_main_~x~0.base_42)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)))) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (not (= v_main_~x~0.base_42 main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) (= (_ bv0 32) main_~head~0.offset))} is VALID [2018-11-23 11:11:59,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {2020#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (_ bv0 32))) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32))) (_ bv4 32))) (exists ((main_~x~0.offset (_ BitVec 32)) (v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) v_main_~x~0.base_41)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)) v_main_~x~0.base_42)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) (_ bv0 32)))) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~head~0.base)) (not (= v_main_~x~0.base_42 main_~head~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd main_~x~0.offset (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~head~0.base)))) (= (_ bv0 32) main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2024#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))) (exists ((v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_41)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_42)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)))))} is VALID [2018-11-23 11:11:59,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {2024#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))) (exists ((v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_41)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_42)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)))))} call #t~mem11 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {2024#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))) (exists ((v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_41)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_42)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)))))} is VALID [2018-11-23 11:11:59,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {2024#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))) (exists ((v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_41)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_42)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)))))} assume !(1bv32 != #t~mem11);havoc #t~mem11; {2024#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))) (exists ((v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_41)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_42)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)))))} is VALID [2018-11-23 11:11:59,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {2024#(and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~x~0.base) (_ bv0 32))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))) (exists ((v_main_~x~0.offset_41 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_41)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= |main_#t~malloc2.base| (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)))) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) (_ bv0 32)) v_main_~x~0.base_42)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)))))} call #t~mem13.base, #t~mem13.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4bv32);~x~0.base, ~x~0.offset := #t~mem13.base, #t~mem13.offset;havoc #t~mem13.base, #t~mem13.offset; {2034#(and (exists ((v_main_~x~0.base_43 (_ BitVec 32)) (v_main_~x~0.offset_41 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= v_main_~x~0.base_43 v_main_~x~0.base_42)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_43)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= v_main_~x~0.base_43 v_main_~x~0.base_41)) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_43) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:11:59,035 INFO L273 TraceCheckUtils]: 15: Hoare triple {2034#(and (exists ((v_main_~x~0.base_43 (_ BitVec 32)) (v_main_~x~0.offset_41 (_ BitVec 32)) (v_prenex_10 (_ BitVec 32)) (v_main_~x~0.offset_42 (_ BitVec 32)) (|main_#t~malloc2.base| (_ BitVec 32)) (v_main_~x~0.base_41 (_ BitVec 32)) (v_main_~x~0.base_42 (_ BitVec 32))) (and (not (= |main_#t~malloc2.base| v_main_~x~0.base_42)) (= (_ bv0 32) (select (select |#memory_int| v_main_~x~0.base_41) (bvadd v_main_~x~0.offset_41 (_ bv4 32)))) (not (= v_main_~x~0.base_42 v_main_~x~0.base_41)) (not (= v_main_~x~0.base_41 main_~x~0.base)) (not (= v_main_~x~0.base_43 v_main_~x~0.base_42)) (= (select (select |#memory_int| |main_#t~malloc2.base|) (bvadd v_prenex_10 (_ bv4 32))) (_ bv0 32)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_43)) (not (= v_main_~x~0.base_42 main_~x~0.base)) (= (select (select |#memory_int| v_main_~x~0.base_42) (bvadd v_main_~x~0.offset_42 (_ bv4 32))) (_ bv0 32)) (not (= v_main_~x~0.base_43 v_main_~x~0.base_41)) (= (bvadd (select (select |#memory_int| v_main_~x~0.base_43) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= |main_#t~malloc2.base| main_~x~0.base)) (not (= |main_#t~malloc2.base| v_main_~x~0.base_41)))) (= main_~x~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_int| main_~x~0.base) (_ bv4 32))))} assume !!(~x~0.base != 0bv32 || ~x~0.offset != 0bv32);call #t~mem14 := read~intINTTYPE4(~x~0.base, ~bvadd32(4bv32, ~x~0.offset), 4bv32); {2038#(= |main_#t~mem14| (_ bv0 32))} is VALID [2018-11-23 11:11:59,036 INFO L273 TraceCheckUtils]: 16: Hoare triple {2038#(= |main_#t~mem14| (_ bv0 32))} assume 1bv32 == #t~mem14;havoc #t~mem14; {1982#false} is VALID [2018-11-23 11:11:59,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {1982#false} assume !false; {1982#false} is VALID [2018-11-23 11:11:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:11:59,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:11:59,813 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:11:59,824 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:11:59,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:59,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:28 [2018-11-23 11:11:59,896 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:59,896 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_42|, |v_main_#t~malloc5.base_4|]. (or (not (= (bvadd (select (select |v_#memory_int_42| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (not (= (store |#memory_int| |v_main_#t~malloc5.base_4| (store (store (select |#memory_int| |v_main_#t~malloc5.base_4|) (_ bv4 32) (_ bv1 32)) (_ bv0 32) (select (select |v_#memory_int_42| |v_main_#t~malloc5.base_4|) (_ bv0 32)))) |v_#memory_int_42|)) (not (= (select |#valid| |v_main_#t~malloc5.base_4|) (_ bv0 1)))) [2018-11-23 11:11:59,896 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|v_main_#t~malloc5.base_4|, v_DerPreprocessor_36]. (or (not (= (_ bv1 32) (select (select (store |#memory_int| |v_main_#t~malloc5.base_4| (store (store (select |#memory_int| |v_main_#t~malloc5.base_4|) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_36)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))))) (not (= (select |#valid| |v_main_#t~malloc5.base_4|) (_ bv0 1)))) [2018-11-23 11:12:00,966 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 11:12:00,985 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:12:01,027 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:12:01,041 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:12:01,070 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:12:01,214 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:12:01,261 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:12:01,289 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:12:01,312 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:12:01,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-11-23 11:12:01,446 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:74, output treesize:124 [2018-11-23 11:12:01,510 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:12:01,511 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_43|, |v_main_#t~malloc5.base_4|, v_DerPreprocessor_36, |v_#memory_int_37|, |v_main_#t~malloc2.base_3|, v_main_~x~0.offset_47]. (or (not (= |v_#memory_int_37| (store |#memory_int| main_~x~0.base (store (select |#memory_int| main_~x~0.base) main_~x~0.offset (select (select |v_#memory_int_37| main_~x~0.base) main_~x~0.offset))))) (not (= (select (select (store |v_#memory_int_43| |v_main_#t~malloc5.base_4| (store (store (select |v_#memory_int_43| |v_main_#t~malloc5.base_4|) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_36)) main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (_ bv1 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_3|) (_ bv0 1))) (not (= (store |v_#memory_int_37| |v_main_#t~malloc2.base_3| (store (store (select |v_#memory_int_37| |v_main_#t~malloc2.base_3|) (bvadd v_main_~x~0.offset_47 (_ bv4 32)) (_ bv0 32)) v_main_~x~0.offset_47 (select (select |v_#memory_int_43| |v_main_#t~malloc2.base_3|) v_main_~x~0.offset_47))) |v_#memory_int_43|)) (not (= (select (store |#valid| |v_main_#t~malloc2.base_3| (_ bv1 1)) |v_main_#t~malloc5.base_4|) (_ bv0 1)))) [2018-11-23 11:12:01,511 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_44, v_prenex_12, v_prenex_11, v_DerPreprocessor_40, v_DerPreprocessor_36, v_DerPreprocessor_42, |v_main_#t~malloc2.base_3|, v_main_~x~0.offset_47, v_DerPreprocessor_38, |v_main_#t~malloc5.base_4|]. (let ((.cse1 (select |#memory_int| main_~x~0.base)) (.cse2 (bvadd main_~head~0.offset (_ bv4 32)))) (and (or (not (= (bvadd (select (store (store (select (let ((.cse0 (store |#memory_int| main_~x~0.base (store .cse1 main_~x~0.offset v_DerPreprocessor_44)))) (store .cse0 v_prenex_12 (store (store (select .cse0 v_prenex_12) (bvadd v_prenex_11 (_ bv4 32)) (_ bv0 32)) v_prenex_11 v_DerPreprocessor_40))) main_~head~0.base) (_ bv4 32) (_ bv1 32)) (_ bv0 32) v_DerPreprocessor_36) .cse2) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select |#valid| v_prenex_12) (_ bv0 1))) (not (= (select (store |#valid| v_prenex_12 (_ bv1 1)) main_~head~0.base) (_ bv0 1)))) (or (= |v_main_#t~malloc5.base_4| main_~head~0.base) (not (= (bvadd (select (select (let ((.cse3 (store |#memory_int| main_~x~0.base (store .cse1 main_~x~0.offset v_DerPreprocessor_42)))) (store .cse3 |v_main_#t~malloc2.base_3| (store (store (select .cse3 |v_main_#t~malloc2.base_3|) (bvadd v_main_~x~0.offset_47 (_ bv4 32)) (_ bv0 32)) v_main_~x~0.offset_47 v_DerPreprocessor_38))) main_~head~0.base) .cse2) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select |#valid| |v_main_#t~malloc2.base_3|) (_ bv0 1))) (not (= (select (store |#valid| |v_main_#t~malloc2.base_3| (_ bv1 1)) |v_main_#t~malloc5.base_4|) (_ bv0 1)))))) [2018-11-23 11:12:07,432 WARN L180 SmtUtils]: Spent 3.15 s on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 11:12:09,548 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:12:09,636 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:12:10,748 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:12:10,750 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:12:10,755 INFO L168 Benchmark]: Toolchain (without parser) took 135077.55 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 824.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:10,756 INFO L168 Benchmark]: CDTParser took 0.23 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:12:10,756 INFO L168 Benchmark]: CACSL2BoogieTranslator took 790.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.9 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:10,756 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.47 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:12:10,757 INFO L168 Benchmark]: Boogie Preprocessor took 56.91 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:10,757 INFO L168 Benchmark]: RCFGBuilder took 1094.62 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: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:10,757 INFO L168 Benchmark]: TraceAbstraction took 133088.53 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 305.7 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -366.9 MB). Peak memory consumption was 823.8 MB. Max. memory is 7.1 GB. [2018-11-23 11:12:10,759 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.23 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 790.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 736.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -785.9 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.47 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. * Boogie Preprocessor took 56.91 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: 13.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1094.62 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: 37.0 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 133088.53 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 305.7 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -366.9 MB). Peak memory consumption was 823.8 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...