java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:05:47,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:05:47,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:05:47,819 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:05:47,819 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:05:47,820 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:05:47,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:05:47,823 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:05:47,827 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:05:47,828 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:05:47,830 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:05:47,830 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:05:47,831 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:05:47,832 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:05:47,833 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:05:47,836 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:05:47,837 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:05:47,839 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:05:47,847 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:05:47,848 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:05:47,849 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:05:47,853 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:05:47,856 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:05:47,856 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:05:47,856 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:05:47,857 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:05:47,858 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:05:47,859 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:05:47,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:05:47,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:05:47,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:05:47,864 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:05:47,864 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:05:47,864 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:05:47,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:05:47,868 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:05:47,868 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:05:47,887 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:05:47,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:05:47,888 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:05:47,888 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:05:47,889 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:05:47,889 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:05:47,889 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:05:47,889 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:05:47,890 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:05:47,890 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:05:47,890 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:05:47,890 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:05:47,890 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:05:47,891 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:05:47,891 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:05:47,891 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:05:47,891 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:05:47,891 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:05:47,892 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:05:47,892 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:05:47,892 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:05:47,892 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:05:47,892 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:05:47,892 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:05:47,893 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:05:47,893 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:05:47,895 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:05:47,895 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:05:47,895 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:05:47,895 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:05:47,895 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:05:47,896 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:05:47,896 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:05:47,943 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:05:47,957 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:05:47,961 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:05:47,963 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:05:47,963 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:05:47,964 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:05:48,023 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b91b4f5/99322a49138d419a8068e36a741b0f4c/FLAG8f47e8acf [2018-11-23 11:05:48,482 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:05:48,483 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:05:48,495 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b91b4f5/99322a49138d419a8068e36a741b0f4c/FLAG8f47e8acf [2018-11-23 11:05:48,792 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15b91b4f5/99322a49138d419a8068e36a741b0f4c [2018-11-23 11:05:48,801 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:05:48,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:05:48,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:05:48,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:05:48,808 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:05:48,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:05:48" (1/1) ... [2018-11-23 11:05:48,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8831bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:48, skipping insertion in model container [2018-11-23 11:05:48,812 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:05:48" (1/1) ... [2018-11-23 11:05:48,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:05:48,877 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:05:49,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:05:49,260 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:05:49,345 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:05:49,399 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:05:49,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49 WrapperNode [2018-11-23 11:05:49,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:05:49,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:05:49,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:05:49,401 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:05:49,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... [2018-11-23 11:05:49,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... [2018-11-23 11:05:49,519 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:05:49,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:05:49,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:05:49,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:05:49,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... [2018-11-23 11:05:49,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... [2018-11-23 11:05:49,532 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... [2018-11-23 11:05:49,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... [2018-11-23 11:05:49,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... [2018-11-23 11:05:49,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... [2018-11-23 11:05:49,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... [2018-11-23 11:05:49,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:05:49,557 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:05:49,558 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:05:49,558 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:05:49,559 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:05:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:05:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:05:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:05:49,607 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:05:49,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:05:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:05:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:05:49,608 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:05:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:05:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:05:49,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:05:49,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:05:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:05:50,205 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:05:50,206 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:05:50,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:05:50 BoogieIcfgContainer [2018-11-23 11:05:50,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:05:50,208 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:05:50,208 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:05:50,211 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:05:50,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:05:48" (1/3) ... [2018-11-23 11:05:50,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626681fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:05:50, skipping insertion in model container [2018-11-23 11:05:50,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:05:49" (2/3) ... [2018-11-23 11:05:50,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626681fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:05:50, skipping insertion in model container [2018-11-23 11:05:50,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:05:50" (3/3) ... [2018-11-23 11:05:50,215 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call_false-valid-memtrack.i [2018-11-23 11:05:50,225 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:05:50,233 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:05:50,249 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:05:50,277 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:05:50,278 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:05:50,278 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:05:50,278 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:05:50,278 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:05:50,278 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:05:50,279 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:05:50,279 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:05:50,279 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:05:50,296 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states. [2018-11-23 11:05:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:05:50,302 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:50,303 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:50,306 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:50,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:50,312 INFO L82 PathProgramCache]: Analyzing trace with hash -457132283, now seen corresponding path program 1 times [2018-11-23 11:05:50,317 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:50,317 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:05:50,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:50,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:50,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {29#true} is VALID [2018-11-23 11:05:50,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {29#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {29#true} is VALID [2018-11-23 11:05:50,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2018-11-23 11:05:50,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #65#return; {29#true} is VALID [2018-11-23 11:05:50,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret6 := main(); {29#true} is VALID [2018-11-23 11:05:50,668 INFO L273 TraceCheckUtils]: 5: Hoare triple {29#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {29#true} is VALID [2018-11-23 11:05:50,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {29#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {29#true} is VALID [2018-11-23 11:05:50,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {29#true} is VALID [2018-11-23 11:05:50,675 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#true} assume !true; {30#false} is VALID [2018-11-23 11:05:50,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {30#false} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {30#false} is VALID [2018-11-23 11:05:50,676 INFO L273 TraceCheckUtils]: 10: Hoare triple {30#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {30#false} is VALID [2018-11-23 11:05:50,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {30#false} assume 1bv32 != #t~mem4;havoc #t~mem4; {30#false} is VALID [2018-11-23 11:05:50,676 INFO L273 TraceCheckUtils]: 12: Hoare triple {30#false} assume !false; {30#false} is VALID [2018-11-23 11:05:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:50,680 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:05:50,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:05:50,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:05:50,693 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:05:50,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:50,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:05:50,794 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:50,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:05:50,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:05:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:05:50,804 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 2 states. [2018-11-23 11:05:50,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:50,918 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2018-11-23 11:05:50,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:05:50,919 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:05:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:05:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-23 11:05:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:05:50,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2018-11-23 11:05:50,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2018-11-23 11:05:51,165 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:05:51,176 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:05:51,176 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:05:51,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:05:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:05:51,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:05:51,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:51,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:05:51,224 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:05:51,224 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:05:51,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:51,227 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:05:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:05:51,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:51,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:51,228 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:05:51,228 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:05:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:51,232 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:05:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:05:51,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:51,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:51,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:51,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:05:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:05:51,237 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-11-23 11:05:51,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:51,238 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:05:51,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:05:51,238 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:05:51,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:05:51,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:51,239 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:51,239 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:51,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:51,240 INFO L82 PathProgramCache]: Analyzing trace with hash -468214535, now seen corresponding path program 1 times [2018-11-23 11:05:51,240 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:51,240 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:05:51,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:51,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:51,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, 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:05:51,547 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:05:51,621 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:05:51,638 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,646 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:51,664 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2018-11-23 11:05:51,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 11:05:51,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 11:05:52,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,018 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:52,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:05:52,041 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:52,042 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= .cse0 |main_#t~mem4|) (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:05:52,042 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem4| (_ bv4294967295 32))) [2018-11-23 11:05:52,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2018-11-23 11:05:52,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {174#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {174#true} is VALID [2018-11-23 11:05:52,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {174#true} assume true; {174#true} is VALID [2018-11-23 11:05:52,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {174#true} {174#true} #65#return; {174#true} is VALID [2018-11-23 11:05:52,073 INFO L256 TraceCheckUtils]: 4: Hoare triple {174#true} call #t~ret6 := main(); {174#true} is VALID [2018-11-23 11:05:52,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {174#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {194#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:52,075 INFO L273 TraceCheckUtils]: 6: Hoare triple {194#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {194#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:52,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {194#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {201#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:52,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {201#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {201#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:52,094 INFO L273 TraceCheckUtils]: 9: Hoare triple {201#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {208#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:52,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {208#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {212#(= (_ bv1 32) |main_#t~mem4|)} is VALID [2018-11-23 11:05:52,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {212#(= (_ bv1 32) |main_#t~mem4|)} assume 1bv32 != #t~mem4;havoc #t~mem4; {175#false} is VALID [2018-11-23 11:05:52,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {175#false} assume !false; {175#false} is VALID [2018-11-23 11:05:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:52,125 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:05:52,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:05:52,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:05:52,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:05:52,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:52,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:05:52,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:52,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:05:52,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:05:52,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:05:52,236 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-11-23 11:05:52,517 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 15 [2018-11-23 11:05:53,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:53,011 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 11:05:53,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:05:53,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:05:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:53,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:53,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:05:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:05:53,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:05:53,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2018-11-23 11:05:53,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:53,138 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:05:53,138 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:05:53,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:05:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:05:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-11-23 11:05:53,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:53,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 21 states. [2018-11-23 11:05:53,182 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 21 states. [2018-11-23 11:05:53,182 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 21 states. [2018-11-23 11:05:53,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:53,185 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:05:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:05:53,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:53,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:53,186 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 29 states. [2018-11-23 11:05:53,186 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 29 states. [2018-11-23 11:05:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:53,189 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:05:53,189 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:05:53,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:53,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:53,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:53,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:53,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:05:53,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 11:05:53,193 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 11:05:53,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:53,193 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 11:05:53,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:05:53,193 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 11:05:53,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:05:53,194 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:53,194 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:53,195 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:53,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:53,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1479379545, now seen corresponding path program 1 times [2018-11-23 11:05:53,195 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:53,196 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:05:53,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:53,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:53,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:05:53,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:05:53,442 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:05:53,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:05:53,489 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,504 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 11:05:53,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:05:53,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:05:53,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:05:53,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:05:53,623 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:53,634 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:05:53,638 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:53,638 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~p~0.base_13, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_13) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_13) (_ bv4 32)))) (and (= .cse0 (_ bv0 32)) (= main_~p~0.offset .cse1) (= .cse0 main_~p~0.base) (= (_ bv0 32) .cse1))) [2018-11-23 11:05:53,638 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base)) [2018-11-23 11:05:53,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-23 11:05:53,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {349#true} is VALID [2018-11-23 11:05:53,658 INFO L273 TraceCheckUtils]: 2: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-23 11:05:53,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {349#true} {349#true} #65#return; {349#true} is VALID [2018-11-23 11:05:53,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {349#true} call #t~ret6 := main(); {349#true} is VALID [2018-11-23 11:05:53,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {349#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {369#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:53,663 INFO L273 TraceCheckUtils]: 6: Hoare triple {369#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {369#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:05:53,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {369#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {376#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:53,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {376#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:53,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {376#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:53,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:53,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} assume !(1bv32 != #t~mem4);havoc #t~mem4; {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:05:53,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {383#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {393#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:53,672 INFO L273 TraceCheckUtils]: 13: Hoare triple {393#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {350#false} is VALID [2018-11-23 11:05:53,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {350#false} assume 1bv32 != #t~mem4;havoc #t~mem4; {350#false} is VALID [2018-11-23 11:05:53,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-23 11:05:53,675 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:05:53,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:05:54,081 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 13 treesize of output 11 [2018-11-23 11:05:54,091 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 7 treesize of output 3 [2018-11-23 11:05:54,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:54,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:54,102 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 13 treesize of output 11 [2018-11-23 11:05:54,109 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 7 treesize of output 3 [2018-11-23 11:05:54,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:54,113 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:54,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:54,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2018-11-23 11:05:54,151 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:54,151 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.offset_12|, |v_#memory_$Pointer$.base_12|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32))) (.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (select (select (store |v_#memory_$Pointer$.offset_12| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_12| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1) (_ bv0 32)) (= (_ bv0 32) (select (select (store |v_#memory_$Pointer$.base_12| main_~p~0.base (store (select |v_#memory_$Pointer$.base_12| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1)))) [2018-11-23 11:05:54,152 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) [2018-11-23 11:05:54,192 INFO L273 TraceCheckUtils]: 15: Hoare triple {350#false} assume !false; {350#false} is VALID [2018-11-23 11:05:54,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {350#false} assume 1bv32 != #t~mem4;havoc #t~mem4; {350#false} is VALID [2018-11-23 11:05:54,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {393#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {350#false} is VALID [2018-11-23 11:05:54,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {393#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:05:54,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(1bv32 != #t~mem4);havoc #t~mem4; {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:54,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:54,210 INFO L273 TraceCheckUtils]: 9: Hoare triple {422#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {412#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:05:54,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {422#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {422#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 11:05:54,211 INFO L273 TraceCheckUtils]: 7: Hoare triple {349#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {422#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 11:05:54,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {349#true} is VALID [2018-11-23 11:05:54,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {349#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {349#true} is VALID [2018-11-23 11:05:54,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {349#true} call #t~ret6 := main(); {349#true} is VALID [2018-11-23 11:05:54,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {349#true} {349#true} #65#return; {349#true} is VALID [2018-11-23 11:05:54,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {349#true} assume true; {349#true} is VALID [2018-11-23 11:05:54,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {349#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {349#true} is VALID [2018-11-23 11:05:54,214 INFO L256 TraceCheckUtils]: 0: Hoare triple {349#true} call ULTIMATE.init(); {349#true} is VALID [2018-11-23 11:05:54,215 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:05:54,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:05:54,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-23 11:05:54,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 11:05:54,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:05:54,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:05:54,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:54,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:05:54,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:05:54,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:05:54,276 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 8 states. [2018-11-23 11:05:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:54,747 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:05:54,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:05:54,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 11:05:54,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:05:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:05:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:05:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:05:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:05:54,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 11:05:54,831 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:05:54,833 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:05:54,833 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:05:54,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:05:54,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:05:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-11-23 11:05:54,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:05:54,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 18 states. [2018-11-23 11:05:54,859 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 18 states. [2018-11-23 11:05:54,859 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 18 states. [2018-11-23 11:05:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:54,862 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:05:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:05:54,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:54,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:54,864 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 25 states. [2018-11-23 11:05:54,864 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 25 states. [2018-11-23 11:05:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:05:54,866 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:05:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:05:54,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:05:54,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:05:54,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:05:54,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:05:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:05:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 11:05:54,870 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-11-23 11:05:54,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:05:54,872 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 11:05:54,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:05:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:05:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:05:54,873 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:05:54,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:05:54,873 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:05:54,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:05:54,874 INFO L82 PathProgramCache]: Analyzing trace with hash -761396014, now seen corresponding path program 1 times [2018-11-23 11:05:54,874 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:05:54,874 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:05:54,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:05:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:05:54,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:05:55,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:05:55,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:05:55,138 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:55,138 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_14|]. (and (= main_~a~0.offset (_ bv0 32)) (= (store |v_#valid_14| main_~a~0.base (_ bv1 1)) |#valid|)) [2018-11-23 11:05:55,139 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:05:55,225 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:55,227 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:55,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:05:55,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 11:05:55,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:05:55,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,299 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-23 11:05:55,307 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:55,308 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, |v_#valid_15|]. (and (= (_ bv0 1) (select |v_#valid_15| main_~t~0.base)) (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (= (store |v_#memory_int_13| main_~p~0.base (store (select |v_#memory_int_13| main_~p~0.base) main_~p~0.offset (_ bv1 32))) |#memory_int|) (= (bvadd (select |v_#valid_15| main_~a~0.base) (_ bv1 1)) (_ bv0 1))) [2018-11-23 11:05:55,308 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2018-11-23 11:05:55,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-23 11:05:55,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:55,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 11:05:55,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,414 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,425 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 11:05:55,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 11:05:55,560 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:05:55,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:05:55,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 11:05:55,584 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,592 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:55,617 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-11-23 11:05:55,649 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:55,650 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (store |v_#memory_int_15| v_main_~p~0.base_18 (let ((.cse0 (bvadd v_main_~p~0.offset_18 (_ bv4 32)))) (store (store (select |v_#memory_int_15| v_main_~p~0.base_18) v_main_~p~0.offset_18 (_ bv1 32)) .cse0 (select (select |#memory_int| v_main_~p~0.base_18) .cse0)))) |#memory_int|) (= (select (select |v_#memory_int_15| main_~p~0.base) (_ bv0 32)) (_ bv1 32))) [2018-11-23 11:05:55,650 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv1 32))) [2018-11-23 11:05:55,837 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 24 treesize of output 22 [2018-11-23 11:05:55,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:05:55,848 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 11:05:55,862 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:05:55,874 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:5 [2018-11-23 11:05:55,879 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:55,880 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= .cse0 |main_#t~mem4|) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)) (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:05:55,880 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv0 32) (bvadd |main_#t~mem4| (_ bv4294967295 32))) [2018-11-23 11:05:55,894 INFO L256 TraceCheckUtils]: 0: Hoare triple {577#true} call ULTIMATE.init(); {577#true} is VALID [2018-11-23 11:05:55,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {577#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {577#true} is VALID [2018-11-23 11:05:55,895 INFO L273 TraceCheckUtils]: 2: Hoare triple {577#true} assume true; {577#true} is VALID [2018-11-23 11:05:55,895 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {577#true} {577#true} #65#return; {577#true} is VALID [2018-11-23 11:05:55,896 INFO L256 TraceCheckUtils]: 4: Hoare triple {577#true} call #t~ret6 := main(); {577#true} is VALID [2018-11-23 11:05:55,900 INFO L273 TraceCheckUtils]: 5: Hoare triple {577#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {597#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:55,905 INFO L273 TraceCheckUtils]: 6: Hoare triple {597#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {597#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:05:55,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {597#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {604#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:05:55,908 INFO L273 TraceCheckUtils]: 8: Hoare triple {604#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {608#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:55,915 INFO L273 TraceCheckUtils]: 9: Hoare triple {608#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {608#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:55,918 INFO L273 TraceCheckUtils]: 10: Hoare triple {608#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {615#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:55,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {615#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {615#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:05:55,923 INFO L273 TraceCheckUtils]: 12: Hoare triple {615#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {622#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_main_~p~0.base_18 (_ BitVec 32)) (v_main_~p~0.offset_18 (_ BitVec 32))) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))))} is VALID [2018-11-23 11:05:55,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {622#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_main_~p~0.base_18 (_ BitVec 32)) (v_main_~p~0.offset_18 (_ BitVec 32))) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {626#(= (_ bv1 32) |main_#t~mem4|)} is VALID [2018-11-23 11:05:55,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {626#(= (_ bv1 32) |main_#t~mem4|)} assume 1bv32 != #t~mem4;havoc #t~mem4; {578#false} is VALID [2018-11-23 11:05:55,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {578#false} assume !false; {578#false} is VALID [2018-11-23 11:05:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:05:55,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:05:56,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:56,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:56,097 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:05:56,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-11-23 11:05:56,181 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:56,182 WARN L384 uantifierElimination]: Input elimination task: ∀ [main_~p~0.offset, |v_#memory_int_16|]. (or (= (bvadd (select (select |v_#memory_int_16| main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) .cse0 (select (select |v_#memory_int_16| main_~p~0.base) .cse0)))) |v_#memory_int_16|))) [2018-11-23 11:05:56,182 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [main_~p~0.offset, v_DerPreprocessor_2]. (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)) [2018-11-23 11:05:56,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:56,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:56,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:56,567 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:05:56,600 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:05:56,634 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:05:56,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-23 11:05:56,716 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:97 [2018-11-23 11:05:56,733 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:05:56,733 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_17|, v_subst_1, v_DerPreprocessor_2]. (or (not (= |v_#memory_int_17| (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_17| main_~p~0.base) .cse0)))))) (= (bvadd (select (select (store |v_#memory_int_17| main_~t~0.base (store (store (select |v_#memory_int_17| main_~t~0.base) v_subst_1 (_ bv1 32)) (bvadd v_subst_1 (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:05:56,733 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_8, v_subst_1, v_DerPreprocessor_2, v_DerPreprocessor_4, v_DerPreprocessor_6, v_prenex_1, v_prenex_2]. (let ((.cse2 (= main_~t~0.base main_~a~0.base)) (.cse0 (select |#memory_int| main_~p~0.base)) (.cse1 (bvadd main_~p~0.offset (_ bv4 32)))) (and (or (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store .cse0 .cse1 v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset)) .cse2) (or (not .cse2) (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store .cse0 .cse1 v_DerPreprocessor_8)) main_~t~0.base) v_subst_1 (_ bv1 32)) (bvadd v_subst_1 (_ bv4 32)) v_DerPreprocessor_2) main_~a~0.offset))) (let ((.cse3 (store |#memory_int| main_~p~0.base (store .cse0 .cse1 v_DerPreprocessor_6)))) (or (= (bvadd (select (select .cse3 main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) (select (store (store (select .cse3 main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)))))) [2018-11-23 11:05:56,932 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2018-11-23 11:05:58,011 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 46 treesize of output 42 [2018-11-23 11:05:58,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 15 treesize of output 19 [2018-11-23 11:05:58,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:05:58,064 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:05:58,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,106 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:58,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 17 [2018-11-23 11:05:58,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:05:58,238 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:05:58,272 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,308 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:05:58,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:05:58,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 67 [2018-11-23 11:05:58,493 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 57 treesize of output 55 [2018-11-23 11:05:58,501 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:58,648 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 50 treesize of output 53 [2018-11-23 11:05:58,663 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:58,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-23 11:05:58,688 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:58,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-11-23 11:05:58,960 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:58,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 35 treesize of output 26 [2018-11-23 11:05:58,965 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:59,029 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:59,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-11-23 11:05:59,040 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:59,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:59,089 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 11:05:59,114 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:05:59,424 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:59,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 24 [2018-11-23 11:05:59,453 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 11:05:59,490 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:05:59,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 35 [2018-11-23 11:05:59,568 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-11-23 11:05:59,717 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:05:59,800 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:05:59,880 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:00,155 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 37 treesize of output 40 [2018-11-23 11:06:00,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:06:00,274 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:06:00,312 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,376 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:00,387 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 35 treesize of output 38 [2018-11-23 11:06:00,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 11:06:00,519 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:06:00,533 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,594 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:00,631 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 35 treesize of output 40 [2018-11-23 11:06:00,755 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 10 treesize of output 1 [2018-11-23 11:06:00,756 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:00,792 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:01,128 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 39 treesize of output 37 [2018-11-23 11:06:01,135 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:01,491 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 34 treesize of output 37 [2018-11-23 11:06:01,501 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:01,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-23 11:06:01,539 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:01,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-11-23 11:06:01,816 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:01,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 19 [2018-11-23 11:06:01,819 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:01,866 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:01,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 26 [2018-11-23 11:06:01,882 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:01,908 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:01,909 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-23 11:06:01,912 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:02,088 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 11:06:02,132 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 3 xjuncts. [2018-11-23 11:06:02,158 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2018-11-23 11:06:02,211 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-11-23 11:06:02,381 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:02,446 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:02,522 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:02,798 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 50 [2018-11-23 11:06:02,831 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:02,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 65 [2018-11-23 11:06:03,048 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:03,072 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:03,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2018-11-23 11:06:03,990 WARN L180 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2018-11-23 11:06:04,021 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-11-23 11:06:04,031 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,055 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:04,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 14 [2018-11-23 11:06:04,073 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:04,139 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:04,277 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:04,278 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:05,665 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 67 [2018-11-23 11:06:05,933 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2018-11-23 11:06:06,036 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:06,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2018-11-23 11:06:06,171 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 3 xjuncts. [2018-11-23 11:06:06,185 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:06,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 49 [2018-11-23 11:06:06,236 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 3 xjuncts. [2018-11-23 11:06:06,606 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:06,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 33 [2018-11-23 11:06:06,612 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,633 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:06,635 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2018-11-23 11:06:06,653 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:06,855 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:06,970 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:07,194 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:07,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 44 [2018-11-23 11:06:07,207 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:07,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 45 [2018-11-23 11:06:07,623 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:06:07,647 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:07,648 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2018-11-23 11:06:07,654 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:07,693 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:07,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 24 [2018-11-23 11:06:07,696 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:07,740 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:07,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-11-23 11:06:07,743 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:07,921 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:07,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 11:06:07,962 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 3 xjuncts. [2018-11-23 11:06:07,987 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:08,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2018-11-23 11:06:08,009 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-11-23 11:06:08,158 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:08,233 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:08,317 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:08,632 INFO L267 ElimStorePlain]: Start of recursive call 9: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:08,670 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 1 case distinctions, treesize of input 37 treesize of output 41 [2018-11-23 11:06:08,689 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 36 treesize of output 34 [2018-11-23 11:06:08,693 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:08,753 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:08,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2018-11-23 11:06:08,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:06:08,850 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:08,884 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:09,007 INFO L267 ElimStorePlain]: Start of recursive call 53: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:09,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 87 [2018-11-23 11:06:09,244 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 72 treesize of output 75 [2018-11-23 11:06:09,454 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-11-23 11:06:09,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:06:09,496 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:09,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-23 11:06:09,511 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:09,558 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:09,896 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:09,896 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:09,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 52 [2018-11-23 11:06:10,048 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-11-23 11:06:10,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:06:10,089 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:10,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 11:06:10,147 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:10,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 11:06:10,156 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:10,204 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:11,528 INFO L267 ElimStorePlain]: Start of recursive call 57: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:11,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2018-11-23 11:06:11,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2018-11-23 11:06:11,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 11:06:11,687 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 11:06:11,695 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:11,745 INFO L267 ElimStorePlain]: Start of recursive call 66: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:11,955 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 51 [2018-11-23 11:06:12,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 11:06:12,044 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:12,067 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 11:06:12,077 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:12,128 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:12,504 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 51 treesize of output 49 [2018-11-23 11:06:12,520 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:12,890 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 44 treesize of output 47 [2018-11-23 11:06:12,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 11:06:12,995 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:06:13,008 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,064 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:13,416 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 35 treesize of output 38 [2018-11-23 11:06:13,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:06:13,515 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:06:13,601 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,667 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:13,675 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 37 treesize of output 40 [2018-11-23 11:06:13,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:06:13,807 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:06:13,843 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:13,908 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:14,377 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:14,378 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:14,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2018-11-23 11:06:14,554 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-11-23 11:06:14,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:06:14,567 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 11:06:14,575 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-23 11:06:14,646 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:14,696 INFO L267 ElimStorePlain]: Start of recursive call 82: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:15,177 INFO L267 ElimStorePlain]: Start of recursive call 65: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:15,229 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 55 treesize of output 51 [2018-11-23 11:06:15,241 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 37 treesize of output 37 [2018-11-23 11:06:15,296 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:15,296 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:15,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 52 [2018-11-23 11:06:15,340 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:15,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-11-23 11:06:16,824 WARN L180 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-11-23 11:06:16,917 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:16,930 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:16,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2018-11-23 11:06:16,942 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:16,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-11-23 11:06:16,979 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:17,021 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:17,064 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:17,156 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:17,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 56 [2018-11-23 11:06:17,394 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:17,412 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:17,416 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:17,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 61 [2018-11-23 11:06:18,771 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-11-23 11:06:18,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-23 11:06:18,791 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:18,827 INFO L267 ElimStorePlain]: Start of recursive call 93: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:18,929 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:18,930 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:19,231 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2018-11-23 11:06:19,414 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2018-11-23 11:06:19,472 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:19,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 11:06:19,546 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 3 xjuncts. [2018-11-23 11:06:19,554 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:19,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 11:06:19,605 INFO L267 ElimStorePlain]: Start of recursive call 97: End of recursive call: and 3 xjuncts. [2018-11-23 11:06:19,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-11-23 11:06:19,865 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-11-23 11:06:19,894 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:19,949 INFO L267 ElimStorePlain]: Start of recursive call 95: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:20,017 INFO L267 ElimStorePlain]: Start of recursive call 92: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:20,083 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:20,207 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:20,239 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 62 [2018-11-23 11:06:20,249 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 57 treesize of output 55 [2018-11-23 11:06:20,253 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:20,320 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:20,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-11-23 11:06:20,440 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:20,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 56 [2018-11-23 11:06:20,817 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:20,818 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:21,152 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 56 [2018-11-23 11:06:21,357 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2018-11-23 11:06:21,390 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:21,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 11:06:21,437 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 3 xjuncts. [2018-11-23 11:06:21,453 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:21,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 11:06:21,497 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 3 xjuncts. [2018-11-23 11:06:21,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-11-23 11:06:21,694 INFO L267 ElimStorePlain]: Start of recursive call 107: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:21,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-11-23 11:06:21,705 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:21,762 INFO L267 ElimStorePlain]: Start of recursive call 104: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:22,008 INFO L267 ElimStorePlain]: Start of recursive call 103: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:22,124 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:22,384 INFO L267 ElimStorePlain]: Start of recursive call 100: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:22,394 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 46 treesize of output 42 [2018-11-23 11:06:22,402 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 7 treesize of output 5 [2018-11-23 11:06:22,404 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,428 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 21 treesize of output 25 [2018-11-23 11:06:22,435 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:22,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-23 11:06:22,447 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:22,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 43 [2018-11-23 11:06:22,739 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-23 11:06:22,764 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:22,765 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 11:06:22,767 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,809 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:22,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-11-23 11:06:22,812 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:22,858 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:22,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 35 treesize of output 26 [2018-11-23 11:06:22,861 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,065 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:23,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 42 [2018-11-23 11:06:23,109 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 3 xjuncts. [2018-11-23 11:06:23,139 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:23,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2018-11-23 11:06:23,162 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 2 xjuncts. [2018-11-23 11:06:23,351 INFO L267 ElimStorePlain]: Start of recursive call 113: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:23,421 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:23,483 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:23,567 INFO L267 ElimStorePlain]: Start of recursive call 109: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:06:23,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 68 [2018-11-23 11:06:23,612 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 63 treesize of output 63 [2018-11-23 11:06:23,758 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2018-11-23 11:06:23,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:06:23,772 INFO L267 ElimStorePlain]: Start of recursive call 121: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 11:06:23,781 INFO L267 ElimStorePlain]: Start of recursive call 122: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:23,830 INFO L267 ElimStorePlain]: Start of recursive call 120: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:06:23,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 45 [2018-11-23 11:06:24,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 6 [2018-11-23 11:06:24,082 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:24,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:06:24,089 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:24,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:06:24,160 INFO L267 ElimStorePlain]: Start of recursive call 126: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:24,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-11-23 11:06:24,185 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:24,237 INFO L267 ElimStorePlain]: Start of recursive call 123: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:24,507 INFO L267 ElimStorePlain]: Start of recursive call 119: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:24,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-23 11:06:24,744 INFO L202 ElimStorePlain]: Needed 127 recursive calls to eliminate 5 variables, input treesize:64, output treesize:55 [2018-11-23 11:06:24,763 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:24,764 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_6, |v_main_#t~malloc2.base_2|, v_prenex_1, v_prenex_2]. (and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (let ((.cse0 (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_6)))) (or (= (select (store (store (select .cse0 |v_main_#t~malloc2.base_2|) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset) (_ bv1 32)) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) (= (_ bv0 32) (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)))))) [2018-11-23 11:06:24,764 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [|v_main_#t~malloc2.base_2|, v_prenex_37, v_prenex_39, v_prenex_38]. (let ((.cse0 (= main_~a~0.offset main_~p~0.offset)) (.cse1 (= main_~p~0.base main_~a~0.base))) (and (or (= (bvadd main_~p~0.offset (_ bv4 32)) main_~a~0.offset) (not (= (select |#valid| |v_main_#t~malloc2.base_2|) (_ bv0 1))) .cse0) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (not (= (select |#valid| v_prenex_37) (_ bv0 1))) .cse0) (or .cse1 (= v_prenex_39 main_~p~0.base) (not (= (select |#valid| v_prenex_39) (_ bv0 1)))) (or .cse1 (not (= (select |#valid| v_prenex_38) (_ bv0 1)))))) [2018-11-23 11:06:26,905 INFO L273 TraceCheckUtils]: 15: Hoare triple {578#false} assume !false; {578#false} is VALID [2018-11-23 11:06:26,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {626#(= (_ bv1 32) |main_#t~mem4|)} assume 1bv32 != #t~mem4;havoc #t~mem4; {578#false} is VALID [2018-11-23 11:06:26,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {639#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {626#(= (_ bv1 32) |main_#t~mem4|)} is VALID [2018-11-23 11:06:26,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {643#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {639#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:06:26,911 INFO L273 TraceCheckUtils]: 11: Hoare triple {643#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {643#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:26,928 INFO L273 TraceCheckUtils]: 10: Hoare triple {650#(and (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_6)) main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_6)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {643#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:26,929 INFO L273 TraceCheckUtils]: 9: Hoare triple {650#(and (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_6)) main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_6)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {650#(and (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_6)) main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_6)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:26,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {657#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_38 (_ BitVec 32))) (not (= (select |#valid| v_prenex_38) (_ bv0 1))))) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_prenex_37 (_ BitVec 32))) (not (= (select |#valid| v_prenex_37) (_ bv0 1))))))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {650#(and (forall ((v_DerPreprocessor_6 (_ BitVec 32)) (v_prenex_2 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_6)) main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_6)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:26,937 INFO L273 TraceCheckUtils]: 7: Hoare triple {661#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {657#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_38 (_ BitVec 32))) (not (= (select |#valid| v_prenex_38) (_ bv0 1))))) (or (= main_~a~0.offset main_~p~0.offset) (forall ((v_prenex_37 (_ BitVec 32))) (not (= (select |#valid| v_prenex_37) (_ bv0 1))))))} is VALID [2018-11-23 11:06:26,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {661#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {661#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:06:26,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {577#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {661#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:06:26,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {577#true} call #t~ret6 := main(); {577#true} is VALID [2018-11-23 11:06:26,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {577#true} {577#true} #65#return; {577#true} is VALID [2018-11-23 11:06:26,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {577#true} assume true; {577#true} is VALID [2018-11-23 11:06:26,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {577#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {577#true} is VALID [2018-11-23 11:06:26,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {577#true} call ULTIMATE.init(); {577#true} is VALID [2018-11-23 11:06:26,941 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:06:26,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:06:26,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 11:06:26,943 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-11-23 11:06:26,944 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:06:26,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:06:27,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:27,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:06:27,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:06:27,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2018-11-23 11:06:27,024 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 13 states. [2018-11-23 11:06:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:30,567 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:06:30,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:06:30,567 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-11-23 11:06:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:06:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:06:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-23 11:06:30,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:06:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-23 11:06:30,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2018-11-23 11:06:30,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:06:30,636 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:06:30,636 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:06:30,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=81, Invalid=224, Unknown=1, NotChecked=0, Total=306 [2018-11-23 11:06:30,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:06:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-23 11:06:30,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:06:30,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 20 states. [2018-11-23 11:06:30,655 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 20 states. [2018-11-23 11:06:30,655 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 20 states. [2018-11-23 11:06:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:30,657 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:06:30,657 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:06:30,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:30,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:30,658 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 23 states. [2018-11-23 11:06:30,658 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 23 states. [2018-11-23 11:06:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:06:30,660 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:06:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:06:30,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:06:30,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:06:30,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:06:30,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:06:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:06:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 11:06:30,662 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-11-23 11:06:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:06:30,663 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 11:06:30,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:06:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:06:30,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:06:30,664 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:06:30,664 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:06:30,664 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:06:30,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:06:30,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1021548576, now seen corresponding path program 1 times [2018-11-23 11:06:30,665 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:06:30,665 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:06:30,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:06:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:06:30,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:06:30,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-11-23 11:06:30,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:30,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:30,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:06:30,788 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:30,788 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_21|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_21| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:06:30,788 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:06:30,843 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:30,844 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:30,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:06:30,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:30,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:30,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-11-23 11:06:30,899 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:30,899 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_22|]. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (_ bv0 1) (select |v_#valid_22| main_~t~0.base)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (= (_ bv0 1) (bvadd (select |v_#valid_22| main_~a~0.base) (_ bv1 1)))) [2018-11-23 11:06:30,899 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base))) [2018-11-23 11:06:31,158 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 11:06:31,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:31,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 11:06:31,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 11:06:31,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-23 11:06:31,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:41 [2018-11-23 11:06:31,545 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:31,545 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_19|, main_~t~0.base, |v_#memory_$Pointer$.offset_18|]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= |#memory_$Pointer$.offset| (store |v_#memory_$Pointer$.offset_18| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_18| main_~a~0.base) .cse0 (_ bv0 32)))) (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_19| main_~a~0.base (store (select |v_#memory_$Pointer$.base_19| main_~a~0.base) .cse0 main_~t~0.base))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (not (= main_~t~0.base main_~a~0.base)))) [2018-11-23 11:06:31,546 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse2))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= (_ bv0 32) .cse1) (= main_~p~0.offset .cse1)))) [2018-11-23 11:06:31,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 171 [2018-11-23 11:06:31,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-23 11:06:31,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:31,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,228 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 139 treesize of output 140 [2018-11-23 11:06:32,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 1 [2018-11-23 11:06:32,241 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,441 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 39 [2018-11-23 11:06:32,448 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 39 treesize of output 42 [2018-11-23 11:06:32,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:06:32,466 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 42 treesize of output 30 [2018-11-23 11:06:32,468 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,482 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,489 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,555 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 73 treesize of output 74 [2018-11-23 11:06:32,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 11:06:32,564 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-11-23 11:06:32,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-11-23 11:06:32,635 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,671 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:32,705 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:185, output treesize:68 [2018-11-23 11:06:34,712 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:34,712 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.offset_17|, |v_#memory_int_19|]. (let ((.cse4 (select (select |v_#memory_$Pointer$.offset_19| main_~p~0.base) (_ bv4 32))) (.cse0 (select (select |v_#memory_$Pointer$.base_20| main_~p~0.base) (_ bv4 32)))) (let ((.cse3 (select |v_#memory_$Pointer$.offset_17| .cse0)) (.cse1 (select |v_#memory_$Pointer$.base_18| .cse0)) (.cse2 (bvadd .cse4 (_ bv4 32)))) (and (= (store |v_#memory_$Pointer$.base_18| .cse0 (store .cse1 .cse2 (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.offset_17| .cse0 (store .cse3 .cse2 (_ bv0 32))) |#memory_$Pointer$.offset|) (= |v_#memory_$Pointer$.offset_17| (store |v_#memory_$Pointer$.offset_19| .cse0 (store (select |v_#memory_$Pointer$.offset_19| .cse0) .cse4 (select .cse3 .cse4)))) (= main_~p~0.offset (_ bv0 32)) (= |v_#memory_$Pointer$.base_18| (store |v_#memory_$Pointer$.base_20| .cse0 (store (select |v_#memory_$Pointer$.base_20| .cse0) .cse4 (select .cse1 .cse4)))) (not (= .cse0 main_~p~0.base)) (= (store |v_#memory_int_19| .cse0 (store (store (select |v_#memory_int_19| .cse0) .cse4 (_ bv1 32)) .cse2 (select (select |#memory_int| .cse0) .cse2))) |#memory_int|) (= (_ bv0 32) .cse4)))) [2018-11-23 11:06:34,712 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (.cse1 (bvadd .cse2 (_ bv4 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= main_~p~0.offset (_ bv0 32)) (= .cse2 (_ bv0 32)) (= (select (select |#memory_int| .cse0) .cse2) (_ bv1 32)) (not (= .cse0 main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) [2018-11-23 11:06:34,931 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 66 treesize of output 58 [2018-11-23 11:06:34,938 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 9 treesize of output 1 [2018-11-23 11:06:34,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:34,960 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 41 treesize of output 30 [2018-11-23 11:06:34,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:34,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,008 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 42 treesize of output 30 [2018-11-23 11:06:35,014 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:06:35,016 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 11:06:35,030 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,037 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,051 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:06:35,051 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:24 [2018-11-23 11:06:35,059 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:35,060 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_24, |#memory_$Pointer$.offset|]. (let ((.cse2 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_24) (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_24) (_ bv4 32))) (.cse1 (bvadd .cse2 (_ bv4 32)))) (and (= .cse0 main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= (_ bv0 32) .cse2) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))) (not (= v_main_~p~0.base_24 .cse0)) (= (_ bv0 32) (bvadd (select (select |#memory_int| .cse0) .cse2) (_ bv4294967295 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= main_~p~0.offset .cse2)))) [2018-11-23 11:06:35,060 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_24]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:06:35,185 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 22 treesize of output 20 [2018-11-23 11:06:35,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:06:35,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:35,202 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-23 11:06:35,206 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:06:35,206 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_24]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (not (= v_main_~p~0.base_24 main_~p~0.base)) (= .cse0 |main_#t~mem4|) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))) (= (_ bv1 32) .cse0))) [2018-11-23 11:06:35,206 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (_ bv1 32) |main_#t~mem4|) [2018-11-23 11:06:35,228 INFO L256 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2018-11-23 11:06:35,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {802#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {802#true} is VALID [2018-11-23 11:06:35,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-23 11:06:35,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #65#return; {802#true} is VALID [2018-11-23 11:06:35,229 INFO L256 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret6 := main(); {802#true} is VALID [2018-11-23 11:06:35,230 INFO L273 TraceCheckUtils]: 5: Hoare triple {802#true} call #t~malloc0.base, #t~malloc0.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc0.base, #t~malloc0.offset; {822#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:35,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {822#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:06:35,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {822#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {829#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:06:35,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {829#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet1);havoc #t~nondet1;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc2.base, #t~malloc2.offset; {833#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:35,235 INFO L273 TraceCheckUtils]: 9: Hoare triple {833#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {833#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:06:35,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {833#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem3.base, #t~mem3.offset;havoc #t~mem3.base, #t~mem3.offset; {840#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:06:35,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {840#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet1);havoc #t~nondet1; {840#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:06:35,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {840#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {847#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,246 INFO L273 TraceCheckUtils]: 13: Hoare triple {847#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {851#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem4|) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {851#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem4|) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !(1bv32 != #t~mem4);havoc #t~mem4; {855#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:06:35,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {855#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset; {859#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_24 (_ BitVec 32))) (and (not (= v_main_~p~0.base_24 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))))) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:06:35,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {859#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_24 (_ BitVec 32))) (and (not (= v_main_~p~0.base_24 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))))) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem4 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {863#(= (_ bv1 32) |main_#t~mem4|)} is VALID [2018-11-23 11:06:35,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {863#(= (_ bv1 32) |main_#t~mem4|)} assume 1bv32 != #t~mem4;havoc #t~mem4; {803#false} is VALID [2018-11-23 11:06:35,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {803#false} assume !false; {803#false} is VALID [2018-11-23 11:06:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:06:35,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:06:38,503 WARN L180 SmtUtils]: Spent 434.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2018-11-23 11:06:38,558 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:38,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:38,621 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:38,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:38,811 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:38,888 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:38,919 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:38,982 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:06:39,381 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 59 treesize of output 47 [2018-11-23 11:06:39,392 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 14 treesize of output 18 [2018-11-23 11:06:39,404 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:39,414 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 24 [2018-11-23 11:06:39,416 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:39,448 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:39,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 65 [2018-11-23 11:06:39,606 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 55 treesize of output 47 [2018-11-23 11:06:39,608 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:39,878 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:39,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-23 11:06:39,916 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:40,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-11-23 11:06:40,152 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:40,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-23 11:06:40,364 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:40,580 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:40,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 55 [2018-11-23 11:06:40,638 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 4 xjuncts. [2018-11-23 11:06:40,936 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:40,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-11-23 11:06:40,946 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:41,177 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 45 treesize of output 37 [2018-11-23 11:06:41,179 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:41,430 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:41,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 45 [2018-11-23 11:06:41,465 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-11-23 11:06:41,636 INFO L267 ElimStorePlain]: Start of recursive call 13: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:41,794 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:06:41,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 49 [2018-11-23 11:06:41,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-11-23 11:06:41,845 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:41,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 24 [2018-11-23 11:06:41,859 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:41,889 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:06:42,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 72 [2018-11-23 11:06:42,094 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:42,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-11-23 11:06:42,107 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:42,762 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:42,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 67 [2018-11-23 11:06:42,834 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-11-23 11:06:43,688 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 48 treesize of output 40 [2018-11-23 11:06:43,691 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:44,451 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:44,481 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2018-11-23 11:06:44,491 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-11-23 11:06:57,351 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 54 treesize of output 46 [2018-11-23 11:06:57,353 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:57,879 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 57 treesize of output 49 [2018-11-23 11:06:57,881 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 11:06:58,471 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:06:58,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2018-11-23 11:06:58,500 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-11-23 11:06:59,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-11-23 11:06:59,040 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:00,251 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:07:00,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2018-11-23 11:07:00,303 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 4 xjuncts. [2018-11-23 11:07:00,736 INFO L267 ElimStorePlain]: Start of recursive call 25: 13 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:07:01,312 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 11:07:01,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 49 [2018-11-23 11:07:01,344 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 14 treesize of output 18 [2018-11-23 11:07:01,354 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:07:01,363 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 24 [2018-11-23 11:07:01,389 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:01,518 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:01,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 103 [2018-11-23 11:07:01,778 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 11:07:02,496 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:07:02,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 89 [2018-11-23 11:07:02,616 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 16 xjuncts. [2018-11-23 11:08:20,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-11-23 11:08:20,283 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:41,222 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:41,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-23 11:08:41,231 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:19,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2018-11-23 11:09:19,678 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts.