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/heap-data/min_max_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:19:35,011 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:19:35,015 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:19:35,032 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:19:35,032 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:19:35,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:19:35,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:19:35,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:19:35,038 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:19:35,039 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:19:35,040 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:19:35,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:19:35,041 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:19:35,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:19:35,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:19:35,045 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:19:35,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:19:35,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:19:35,049 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:19:35,051 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:19:35,052 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:19:35,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:19:35,056 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:19:35,056 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:19:35,056 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:19:35,057 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:19:35,058 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:19:35,059 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:19:35,060 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:19:35,061 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:19:35,061 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:19:35,065 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:19:35,066 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:19:35,066 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:19:35,067 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:19:35,068 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:19:35,068 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:19:35,100 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:19:35,100 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:19:35,101 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:19:35,101 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:19:35,102 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:19:35,102 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:19:35,102 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:19:35,103 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:19:35,103 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:19:35,103 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:19:35,103 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:19:35,103 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:19:35,103 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:19:35,104 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:19:35,104 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:19:35,104 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:19:35,104 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:19:35,104 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:19:35,105 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:19:35,105 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:19:35,105 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:19:35,105 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:19:35,105 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:19:35,106 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:19:35,106 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:19:35,106 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:19:35,106 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:19:35,106 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:19:35,107 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:19:35,107 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:19:35,107 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:19:35,107 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:19:35,107 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:19:35,151 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:19:35,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:19:35,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:19:35,169 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:19:35,169 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:19:35,170 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/min_max_true-unreach-call.i [2018-11-23 11:19:35,235 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4900ab9/75b19d0844c44a8eb733b615a35905d2/FLAGabdfab0a7 [2018-11-23 11:19:35,741 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:19:35,741 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/min_max_true-unreach-call.i [2018-11-23 11:19:35,755 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4900ab9/75b19d0844c44a8eb733b615a35905d2/FLAGabdfab0a7 [2018-11-23 11:19:36,021 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce4900ab9/75b19d0844c44a8eb733b615a35905d2 [2018-11-23 11:19:36,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:19:36,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:19:36,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:36,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:19:36,040 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:19:36,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:36" (1/1) ... [2018-11-23 11:19:36,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11b123b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36, skipping insertion in model container [2018-11-23 11:19:36,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:19:36" (1/1) ... [2018-11-23 11:19:36,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:19:36,119 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:19:36,545 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:36,563 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:19:36,640 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:19:36,772 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:19:36,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36 WrapperNode [2018-11-23 11:19:36,773 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:19:36,774 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:36,774 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:19:36,774 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:19:36,784 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:19:36" (1/1) ... [2018-11-23 11:19:36,815 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:19:36" (1/1) ... [2018-11-23 11:19:36,824 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:19:36,824 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:19:36,824 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:19:36,824 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:19:36,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36" (1/1) ... [2018-11-23 11:19:36,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36" (1/1) ... [2018-11-23 11:19:36,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36" (1/1) ... [2018-11-23 11:19:36,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36" (1/1) ... [2018-11-23 11:19:36,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36" (1/1) ... [2018-11-23 11:19:36,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36" (1/1) ... [2018-11-23 11:19:36,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36" (1/1) ... [2018-11-23 11:19:36,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:19:36,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:19:36,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:19:36,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:19:36,866 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36" (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:19:36,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:19:36,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:19:36,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:19:36,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:19:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:19:36,920 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:19:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:19:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:19:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:19:36,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:19:36,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:19:37,556 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:19:37,556 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:19:37,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:37 BoogieIcfgContainer [2018-11-23 11:19:37,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:19:37,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:19:37,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:19:37,563 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:19:37,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:19:36" (1/3) ... [2018-11-23 11:19:37,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58689e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:37, skipping insertion in model container [2018-11-23 11:19:37,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:19:36" (2/3) ... [2018-11-23 11:19:37,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58689e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:19:37, skipping insertion in model container [2018-11-23 11:19:37,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:19:37" (3/3) ... [2018-11-23 11:19:37,568 INFO L112 eAbstractionObserver]: Analyzing ICFG min_max_true-unreach-call.i [2018-11-23 11:19:37,580 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:19:37,589 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-11-23 11:19:37,607 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-11-23 11:19:37,639 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:19:37,640 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:19:37,640 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:19:37,640 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:19:37,640 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:19:37,640 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:19:37,641 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:19:37,641 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:19:37,641 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:19:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 11:19:37,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:19:37,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:37,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:37,668 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:37,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1338090159, now seen corresponding path program 1 times [2018-11-23 11:19:37,678 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:37,679 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:19:37,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:37,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:37,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:38,160 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 11:19:38,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 11:19:38,165 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 11:19:38,165 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #64#return; {27#true} is VALID [2018-11-23 11:19:38,165 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret12 := main(); {27#true} is VALID [2018-11-23 11:19:38,167 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {47#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:38,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {47#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {47#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:19:38,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {54#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:38,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {54#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {28#false} is VALID [2018-11-23 11:19:38,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {28#false} is VALID [2018-11-23 11:19:38,180 INFO L273 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 11:19:38,183 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:19:38,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:38,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:38,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:19:38,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 11:19:38,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:38,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:19:38,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:38,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:19:38,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:19:38,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:19:38,259 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2018-11-23 11:19:39,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:39,059 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2018-11-23 11:19:39,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:19:39,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-11-23 11:19:39,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:39,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2018-11-23 11:19:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:19:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2018-11-23 11:19:39,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2018-11-23 11:19:39,276 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:39,286 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:19:39,286 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:19:39,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:19:39,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:19:39,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:19:39,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:39,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:39,436 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:39,436 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:39,440 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 11:19:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:19:39,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:39,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:39,442 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:39,442 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:19:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:39,446 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-23 11:19:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:19:39,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:39,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:39,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:39,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:19:39,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2018-11-23 11:19:39,452 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2018-11-23 11:19:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:39,453 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2018-11-23 11:19:39,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:19:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2018-11-23 11:19:39,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:19:39,454 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:39,454 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:39,455 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:39,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:39,455 INFO L82 PathProgramCache]: Analyzing trace with hash -281083925, now seen corresponding path program 1 times [2018-11-23 11:19:39,456 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:39,456 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:19:39,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:39,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:39,742 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 20 treesize of output 17 [2018-11-23 11:19:39,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:19:39,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:39,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:19:39,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:39,866 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:39,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:39,890 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:19:39,890 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:10 [2018-11-23 11:19:39,904 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:39,904 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|, |v_main_#t~nondet4_3|]. (and (= |#memory_int| (store |v_#memory_int_11| main_~p~0.base (store (store (select |v_#memory_int_11| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) |v_main_#t~nondet4_3|) main_~p~0.offset (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))) (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base)) [2018-11-23 11:19:39,905 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base)) [2018-11-23 11:19:40,396 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:19:40,437 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:19:40,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:40,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:40,463 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:19:40,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:19:40,474 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:40,475 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (and (= .cse0 |main_#t~mem9|) (= .cse0 main_~min~0))) [2018-11-23 11:19:40,475 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= main_~min~0 |main_#t~mem9|) [2018-11-23 11:19:40,493 INFO L256 TraceCheckUtils]: 0: Hoare triple {187#true} call ULTIMATE.init(); {187#true} is VALID [2018-11-23 11:19:40,493 INFO L273 TraceCheckUtils]: 1: Hoare triple {187#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {187#true} is VALID [2018-11-23 11:19:40,494 INFO L273 TraceCheckUtils]: 2: Hoare triple {187#true} assume true; {187#true} is VALID [2018-11-23 11:19:40,494 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {187#true} {187#true} #64#return; {187#true} is VALID [2018-11-23 11:19:40,494 INFO L256 TraceCheckUtils]: 4: Hoare triple {187#true} call #t~ret12 := main(); {187#true} is VALID [2018-11-23 11:19:40,495 INFO L273 TraceCheckUtils]: 5: Hoare triple {187#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {187#true} is VALID [2018-11-23 11:19:40,514 INFO L273 TraceCheckUtils]: 6: Hoare triple {187#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {210#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:19:40,528 INFO L273 TraceCheckUtils]: 7: Hoare triple {210#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {214#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:19:40,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {214#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {214#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:19:40,560 INFO L273 TraceCheckUtils]: 9: Hoare triple {214#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {214#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:19:40,575 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {214#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:19:40,577 INFO L273 TraceCheckUtils]: 11: Hoare triple {214#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {227#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:40,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {227#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {231#(= main_~min~0 |main_#t~mem9|)} is VALID [2018-11-23 11:19:40,581 INFO L273 TraceCheckUtils]: 13: Hoare triple {231#(= main_~min~0 |main_#t~mem9|)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {188#false} is VALID [2018-11-23 11:19:40,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {188#false} assume !false; {188#false} is VALID [2018-11-23 11:19:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:40,588 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:40,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:40,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:19:40,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 11:19:40,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:40,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:19:40,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:40,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:19:40,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:19:40,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:19:40,690 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 6 states. [2018-11-23 11:19:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:41,915 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-11-23 11:19:41,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:19:41,915 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 11:19:41,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:19:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2018-11-23 11:19:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:19:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2018-11-23 11:19:41,922 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2018-11-23 11:19:42,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:42,016 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:19:42,017 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:19:42,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:19:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:19:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2018-11-23 11:19:42,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:42,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 27 states. [2018-11-23 11:19:42,047 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 27 states. [2018-11-23 11:19:42,047 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 27 states. [2018-11-23 11:19:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:42,051 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:19:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:19:42,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:42,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:42,052 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 41 states. [2018-11-23 11:19:42,053 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 41 states. [2018-11-23 11:19:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:42,056 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-23 11:19:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 11:19:42,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:42,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:42,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:42,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:42,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:19:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 11:19:42,060 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 15 [2018-11-23 11:19:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:42,061 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 11:19:42,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:19:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 11:19:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:19:42,062 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:42,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:42,062 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:42,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1090430551, now seen corresponding path program 1 times [2018-11-23 11:19:42,063 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:42,064 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:19:42,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:42,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:42,249 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 20 treesize of output 17 [2018-11-23 11:19:42,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:19:42,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:42,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:19:42,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:42,320 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:42,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:42,345 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:19:42,346 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:38, output treesize:18 [2018-11-23 11:19:42,358 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:42,358 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, |v_main_#t~nondet4_4|]. (let ((.cse1 (select |#memory_int| main_~l~0.base)) (.cse0 (bvadd main_~l~0.offset (_ bv4 32)))) (and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (store |v_#memory_int_12| main_~l~0.base (store (store (select |v_#memory_int_12| main_~l~0.base) .cse0 |v_main_#t~nondet4_4|) main_~l~0.offset (select .cse1 main_~l~0.offset))) |#memory_int|) (= |main_#t~mem5| (select .cse1 .cse0)))) [2018-11-23 11:19:42,358 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) [2018-11-23 11:19:42,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:19:42,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 11:19:42,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:42,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:42,562 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:19:42,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-11-23 11:19:42,568 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:42,568 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (and (= .cse0 |main_#t~mem9|) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 .cse0)))) [2018-11-23 11:19:42,569 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|))) [2018-11-23 11:19:42,610 INFO L256 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2018-11-23 11:19:42,610 INFO L273 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {414#true} is VALID [2018-11-23 11:19:42,611 INFO L273 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2018-11-23 11:19:42,611 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #64#return; {414#true} is VALID [2018-11-23 11:19:42,611 INFO L256 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret12 := main(); {414#true} is VALID [2018-11-23 11:19:42,612 INFO L273 TraceCheckUtils]: 5: Hoare triple {414#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {434#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:42,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {434#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {438#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:19:42,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {438#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {442#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:19:42,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {442#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {442#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:19:42,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {442#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {442#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:19:42,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {442#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {442#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:19:42,630 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {455#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:42,631 INFO L273 TraceCheckUtils]: 12: Hoare triple {455#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {459#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} is VALID [2018-11-23 11:19:42,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {459#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {415#false} is VALID [2018-11-23 11:19:42,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {415#false} assume !false; {415#false} is VALID [2018-11-23 11:19:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:42,634 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:42,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:42,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 11:19:42,638 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 11:19:42,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:42,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:19:42,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:42,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:19:42,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:19:42,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:19:42,691 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 7 states. [2018-11-23 11:19:43,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:43,583 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-23 11:19:43,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:19:43,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-23 11:19:43,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:19:43,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 11:19:43,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:19:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2018-11-23 11:19:43,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2018-11-23 11:19:43,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:43,746 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:19:43,746 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 11:19:43,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:19:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 11:19:43,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2018-11-23 11:19:43,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:43,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 31 states. [2018-11-23 11:19:43,803 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 31 states. [2018-11-23 11:19:43,803 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 31 states. [2018-11-23 11:19:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:43,807 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 11:19:43,807 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 11:19:43,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:43,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:43,808 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 48 states. [2018-11-23 11:19:43,809 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 48 states. [2018-11-23 11:19:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:43,812 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-23 11:19:43,812 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 11:19:43,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:43,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:43,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:43,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:43,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:19:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2018-11-23 11:19:43,816 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 15 [2018-11-23 11:19:43,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:43,816 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2018-11-23 11:19:43,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:19:43,817 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2018-11-23 11:19:43,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:19:43,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:43,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:43,818 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:43,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:43,818 INFO L82 PathProgramCache]: Analyzing trace with hash 461413357, now seen corresponding path program 1 times [2018-11-23 11:19:43,819 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:43,819 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:19:43,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:43,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:43,943 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 20 treesize of output 17 [2018-11-23 11:19:43,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:19:43,963 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:43,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:19:43,969 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:43,983 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:43,993 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,010 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:19:44,011 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:30, output treesize:10 [2018-11-23 11:19:44,023 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:44,023 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, |v_main_#t~nondet4_5|]. (and (= main_~p~0.offset (_ bv0 32)) (= (store |v_#memory_int_13| main_~p~0.base (store (store (select |v_#memory_int_13| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) |v_main_#t~nondet4_5|) main_~p~0.offset (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) |#memory_int|) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base)) [2018-11-23 11:19:44,024 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base)) [2018-11-23 11:19:44,119 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:19:44,125 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:19:44,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:44,133 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:19:44,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:19:44,137 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:44,137 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (and (= .cse0 |main_#t~mem10|) (= .cse0 main_~max~0))) [2018-11-23 11:19:44,137 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem10| main_~max~0) [2018-11-23 11:19:44,153 INFO L256 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {668#true} is VALID [2018-11-23 11:19:44,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {668#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {668#true} is VALID [2018-11-23 11:19:44,154 INFO L273 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2018-11-23 11:19:44,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #64#return; {668#true} is VALID [2018-11-23 11:19:44,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {668#true} call #t~ret12 := main(); {668#true} is VALID [2018-11-23 11:19:44,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {668#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {668#true} is VALID [2018-11-23 11:19:44,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {668#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {691#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:19:44,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {691#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {691#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:19:44,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {691#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {691#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:19:44,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {691#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {701#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:19:44,164 INFO L273 TraceCheckUtils]: 10: Hoare triple {701#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {701#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:19:44,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {701#(and (= (_ bv0 32) main_~l~0.offset) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {708#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-23 11:19:44,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {708#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {708#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-23 11:19:44,167 INFO L273 TraceCheckUtils]: 13: Hoare triple {708#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {708#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} is VALID [2018-11-23 11:19:44,168 INFO L273 TraceCheckUtils]: 14: Hoare triple {708#(and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~max~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {718#(= |main_#t~mem10| main_~max~0)} is VALID [2018-11-23 11:19:44,169 INFO L273 TraceCheckUtils]: 15: Hoare triple {718#(= |main_#t~mem10| main_~max~0)} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {669#false} is VALID [2018-11-23 11:19:44,169 INFO L273 TraceCheckUtils]: 16: Hoare triple {669#false} assume !false; {669#false} is VALID [2018-11-23 11:19:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:44,172 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:44,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:44,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:19:44,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 11:19:44,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:44,175 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:19:44,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:44,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:19:44,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:19:44,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:19:44,221 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand 6 states. [2018-11-23 11:19:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:45,426 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-23 11:19:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:19:45,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 11:19:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:19:45,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-23 11:19:45,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:19:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2018-11-23 11:19:45,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2018-11-23 11:19:45,575 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:19:45,578 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:19:45,578 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 11:19:45,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:19:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 11:19:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 42. [2018-11-23 11:19:45,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:45,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 42 states. [2018-11-23 11:19:45,707 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 42 states. [2018-11-23 11:19:45,707 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 42 states. [2018-11-23 11:19:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:45,711 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 11:19:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 11:19:45,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:45,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:45,713 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 54 states. [2018-11-23 11:19:45,713 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 54 states. [2018-11-23 11:19:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:45,716 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-23 11:19:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-23 11:19:45,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:45,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:45,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:45,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:19:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2018-11-23 11:19:45,721 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 17 [2018-11-23 11:19:45,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:45,721 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2018-11-23 11:19:45,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:19:45,722 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2018-11-23 11:19:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:19:45,723 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:45,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:45,723 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:45,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:45,724 INFO L82 PathProgramCache]: Analyzing trace with hash -347933269, now seen corresponding path program 1 times [2018-11-23 11:19:45,724 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:45,724 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:19:45,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:45,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:45,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:45,867 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 20 treesize of output 17 [2018-11-23 11:19:45,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:19:45,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:45,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:19:45,914 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:45,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:45,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:45,949 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:19:45,950 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:35, output treesize:15 [2018-11-23 11:19:45,963 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:45,963 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|, |v_main_#t~nondet4_6|]. (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (store |v_#memory_int_14| main_~p~0.base (store (store (select |v_#memory_int_14| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) |v_main_#t~nondet4_6|) main_~p~0.offset (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) |#memory_int|) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))) [2018-11-23 11:19:45,963 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))) [2018-11-23 11:19:46,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:19:46,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 11:19:46,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:46,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:46,218 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:19:46,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-11-23 11:19:46,222 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:46,223 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (and (= .cse0 |main_#t~mem10|) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (not (bvslt main_~max~0 .cse0)))) [2018-11-23 11:19:46,223 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (not (bvslt main_~max~0 |main_#t~mem10|))) [2018-11-23 11:19:46,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {967#true} call ULTIMATE.init(); {967#true} is VALID [2018-11-23 11:19:46,248 INFO L273 TraceCheckUtils]: 1: Hoare triple {967#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {967#true} is VALID [2018-11-23 11:19:46,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {967#true} assume true; {967#true} is VALID [2018-11-23 11:19:46,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {967#true} {967#true} #64#return; {967#true} is VALID [2018-11-23 11:19:46,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {967#true} call #t~ret12 := main(); {967#true} is VALID [2018-11-23 11:19:46,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {967#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {987#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-23 11:19:46,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {987#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {991#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:46,256 INFO L273 TraceCheckUtils]: 7: Hoare triple {991#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {991#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:46,257 INFO L273 TraceCheckUtils]: 8: Hoare triple {991#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {998#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:46,258 INFO L273 TraceCheckUtils]: 9: Hoare triple {998#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {1002#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:46,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {1002#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1002#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:46,260 INFO L273 TraceCheckUtils]: 11: Hoare triple {1002#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1009#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-23 11:19:46,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {1009#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1009#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-23 11:19:46,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {1009#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {1009#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} is VALID [2018-11-23 11:19:46,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {1009#(and (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)) (= (_ bv0 32) main_~i~0.offset) (not (bvslt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1019#(and (not (bvslt main_~max~0 |main_#t~mem10|)) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:19:46,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {1019#(and (not (bvslt main_~max~0 |main_#t~mem10|)) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {968#false} is VALID [2018-11-23 11:19:46,265 INFO L273 TraceCheckUtils]: 16: Hoare triple {968#false} assume !false; {968#false} is VALID [2018-11-23 11:19:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:46,269 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:19:46,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:19:46,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:19:46,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:19:46,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:46,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:19:46,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:46,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:19:46,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:19:46,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:19:46,301 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 8 states. [2018-11-23 11:19:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:48,029 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2018-11-23 11:19:48,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:19:48,029 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 11:19:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:19:48,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:19:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-23 11:19:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:19:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 50 transitions. [2018-11-23 11:19:48,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 50 transitions. [2018-11-23 11:19:48,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:48,199 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:19:48,199 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:19:48,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:19:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:19:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2018-11-23 11:19:48,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:19:48,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 53 states. [2018-11-23 11:19:48,299 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 53 states. [2018-11-23 11:19:48,299 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 53 states. [2018-11-23 11:19:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:48,302 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 11:19:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-11-23 11:19:48,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:48,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:48,304 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 73 states. [2018-11-23 11:19:48,304 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 73 states. [2018-11-23 11:19:48,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:19:48,307 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2018-11-23 11:19:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2018-11-23 11:19:48,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:19:48,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:19:48,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:19:48,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:19:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:19:48,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2018-11-23 11:19:48,311 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 17 [2018-11-23 11:19:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:19:48,312 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2018-11-23 11:19:48,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:19:48,312 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2018-11-23 11:19:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:19:48,313 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:19:48,313 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:19:48,313 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:19:48,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:19:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1901797187, now seen corresponding path program 1 times [2018-11-23 11:19:48,314 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:19:48,314 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:19:48,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:19:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:48,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:19:48,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:19:48,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-11-23 11:19:48,716 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 40 treesize of output 42 [2018-11-23 11:19:48,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:48,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:19:48,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:48,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:48,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2018-11-23 11:19:49,025 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:49,030 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 33 treesize of output 40 [2018-11-23 11:19:49,035 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:49,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:19:49,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 66 [2018-11-23 11:19:49,250 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-23 11:19:49,367 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:19:49,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:19:49,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:19:49,578 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:60 [2018-11-23 11:19:49,596 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:49,596 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, |v_main_#t~nondet4_7|, v_prenex_1, v_prenex_2]. (let ((.cse0 (select (select |v_#memory_int_15| v_prenex_1) (bvadd v_prenex_2 (_ bv4 32)))) (.cse2 (bvadd main_~p~0.offset (_ bv4 32))) (.cse1 (select |#memory_int| main_~p~0.base))) (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~max~0 .cse0) (= main_~min~0 .cse0) (= (select .cse1 .cse2) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base) (= (store |v_#memory_int_15| main_~p~0.base (store (store (select |v_#memory_int_15| main_~p~0.base) .cse2 |v_main_#t~nondet4_7|) main_~p~0.offset (select .cse1 main_~p~0.offset))) |#memory_int|))) [2018-11-23 11:19:49,597 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_1, v_prenex_2]. (let ((.cse0 (= main_~p~0.offset (_ bv0 32))) (.cse1 (= main_~p~0.offset main_~l~0.offset)) (.cse2 (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|)) (.cse3 (= main_~p~0.base main_~l~0.base))) (or (and .cse0 .cse1 (= main_~min~0 main_~max~0) .cse2 .cse3) (let ((.cse4 (select (select |#memory_int| v_prenex_1) (bvadd v_prenex_2 (_ bv4 32))))) (and (= main_~min~0 .cse4) .cse0 .cse1 (= main_~max~0 .cse4) .cse2 .cse3)))) [2018-11-23 11:19:49,967 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:19:49,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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:19:49,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:19:49,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:49,982 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:19:49,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:19:49,993 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:19:49,993 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (and (= .cse0 |main_#t~mem9|) (bvslt main_~min~0 .cse0))) [2018-11-23 11:19:49,993 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (bvslt main_~min~0 |main_#t~mem9|) [2018-11-23 11:19:50,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {1346#true} call ULTIMATE.init(); {1346#true} is VALID [2018-11-23 11:19:50,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {1346#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1346#true} is VALID [2018-11-23 11:19:50,025 INFO L273 TraceCheckUtils]: 2: Hoare triple {1346#true} assume true; {1346#true} is VALID [2018-11-23 11:19:50,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1346#true} {1346#true} #64#return; {1346#true} is VALID [2018-11-23 11:19:50,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {1346#true} call #t~ret12 := main(); {1346#true} is VALID [2018-11-23 11:19:50,026 INFO L273 TraceCheckUtils]: 5: Hoare triple {1346#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {1346#true} is VALID [2018-11-23 11:19:50,026 INFO L273 TraceCheckUtils]: 6: Hoare triple {1346#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1346#true} is VALID [2018-11-23 11:19:50,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {1346#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {1372#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-23 11:19:50,064 INFO L273 TraceCheckUtils]: 8: Hoare triple {1372#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1372#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-23 11:19:50,066 INFO L273 TraceCheckUtils]: 9: Hoare triple {1372#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1379#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-23 11:19:50,069 INFO L273 TraceCheckUtils]: 10: Hoare triple {1379#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1383#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:19:50,074 INFO L273 TraceCheckUtils]: 11: Hoare triple {1383#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {1387#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:19:50,075 INFO L273 TraceCheckUtils]: 12: Hoare triple {1387#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1391#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-23 11:19:50,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {1391#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 main_~max~0) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1395#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:19:50,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {1395#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1395#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:19:50,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {1395#(and (= (_ bv0 32) main_~l~0.offset) (bvslt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1402#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:19:50,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {1402#(and (bvslt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1406#(bvslt main_~min~0 |main_#t~mem9|)} is VALID [2018-11-23 11:19:50,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {1406#(bvslt main_~min~0 |main_#t~mem9|)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {1347#false} is VALID [2018-11-23 11:19:50,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {1347#false} assume !false; {1347#false} is VALID [2018-11-23 11:19:50,085 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:19:50,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:19:50,813 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:19:50,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:19:50,821 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:19:50,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:1 [2018-11-23 11:19:50,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {1347#false} assume !false; {1347#false} is VALID [2018-11-23 11:19:50,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {1416#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {1347#false} is VALID [2018-11-23 11:19:50,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {1420#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {1416#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-23 11:19:50,842 INFO L273 TraceCheckUtils]: 15: Hoare triple {1424#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {1420#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:19:50,842 INFO L273 TraceCheckUtils]: 14: Hoare triple {1424#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {1424#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:19:50,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {1431#(or (not (bvslt main_~max~0 |main_#t~mem7|)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1424#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:19:50,846 INFO L273 TraceCheckUtils]: 12: Hoare triple {1435#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1431#(or (not (bvslt main_~max~0 |main_#t~mem7|)) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-23 11:19:50,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {1439#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {1435#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-23 11:19:50,861 INFO L273 TraceCheckUtils]: 10: Hoare triple {1346#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1439#(or (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|))} is VALID [2018-11-23 11:19:50,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {1346#true} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {1346#true} is VALID [2018-11-23 11:19:50,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {1346#true} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1346#true} is VALID [2018-11-23 11:19:50,862 INFO L273 TraceCheckUtils]: 7: Hoare triple {1346#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {1346#true} is VALID [2018-11-23 11:19:50,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {1346#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {1346#true} is VALID [2018-11-23 11:19:50,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {1346#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {1346#true} is VALID [2018-11-23 11:19:50,863 INFO L256 TraceCheckUtils]: 4: Hoare triple {1346#true} call #t~ret12 := main(); {1346#true} is VALID [2018-11-23 11:19:50,863 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1346#true} {1346#true} #64#return; {1346#true} is VALID [2018-11-23 11:19:50,864 INFO L273 TraceCheckUtils]: 2: Hoare triple {1346#true} assume true; {1346#true} is VALID [2018-11-23 11:19:50,864 INFO L273 TraceCheckUtils]: 1: Hoare triple {1346#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1346#true} is VALID [2018-11-23 11:19:50,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {1346#true} call ULTIMATE.init(); {1346#true} is VALID [2018-11-23 11:19:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:19:50,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:19:50,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2018-11-23 11:19:50,870 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-23 11:19:50,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:19:50,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:19:50,944 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:19:50,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:19:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:19:50,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:19:50,945 INFO L87 Difference]: Start difference. First operand 53 states and 73 transitions. Second operand 16 states. [2018-11-23 11:20:02,668 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 27 [2018-11-23 11:20:05,729 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-11-23 11:20:08,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:08,561 INFO L93 Difference]: Finished difference Result 177 states and 206 transitions. [2018-11-23 11:20:08,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:20:08,561 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-23 11:20:08,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:20:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:20:08,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 152 transitions. [2018-11-23 11:20:08,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:20:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 152 transitions. [2018-11-23 11:20:08,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 152 transitions. [2018-11-23 11:20:08,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:08,995 INFO L225 Difference]: With dead ends: 177 [2018-11-23 11:20:08,996 INFO L226 Difference]: Without dead ends: 175 [2018-11-23 11:20:08,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=248, Invalid=743, Unknown=1, NotChecked=0, Total=992 [2018-11-23 11:20:08,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-23 11:20:09,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 57. [2018-11-23 11:20:09,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:20:09,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand 57 states. [2018-11-23 11:20:09,120 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand 57 states. [2018-11-23 11:20:09,120 INFO L87 Difference]: Start difference. First operand 175 states. Second operand 57 states. [2018-11-23 11:20:09,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:09,127 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2018-11-23 11:20:09,127 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2018-11-23 11:20:09,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:09,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:09,128 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 175 states. [2018-11-23 11:20:09,128 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 175 states. [2018-11-23 11:20:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:09,135 INFO L93 Difference]: Finished difference Result 175 states and 202 transitions. [2018-11-23 11:20:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 202 transitions. [2018-11-23 11:20:09,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:09,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:09,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:20:09,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:20:09,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:20:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 80 transitions. [2018-11-23 11:20:09,138 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 80 transitions. Word has length 19 [2018-11-23 11:20:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:20:09,139 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 80 transitions. [2018-11-23 11:20:09,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:20:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 80 transitions. [2018-11-23 11:20:09,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:20:09,139 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:09,140 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:09,140 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:09,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:09,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1566028479, now seen corresponding path program 1 times [2018-11-23 11:20:09,140 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:09,141 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:09,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:20:09,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:09,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:09,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 50 [2018-11-23 11:20:09,608 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 41 treesize of output 43 [2018-11-23 11:20:09,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:09,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:20:09,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:09,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:09,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2018-11-23 11:20:09,962 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:09,967 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 34 treesize of output 41 [2018-11-23 11:20:09,971 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:10,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:10,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 67 [2018-11-23 11:20:10,333 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-23 11:20:10,439 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:20:10,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:20:10,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:10,628 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:63, output treesize:72 [2018-11-23 11:20:10,649 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:10,649 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, |v_main_#t~nondet4_9|, v_prenex_5, v_prenex_6]. (let ((.cse2 (select |#memory_int| main_~p~0.base)) (.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse0 (select (select |v_#memory_int_17| v_prenex_5) (bvadd v_prenex_6 (_ bv4 32))))) (and (not (bvslt main_~max~0 .cse0)) (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (store |v_#memory_int_17| main_~p~0.base (store (store (select |v_#memory_int_17| main_~p~0.base) .cse1 |v_main_#t~nondet4_9|) main_~p~0.offset (select .cse2 main_~p~0.offset))) |#memory_int|) (= (select .cse2 .cse1) |main_#t~mem5|) (= main_~min~0 .cse0) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))) [2018-11-23 11:20:10,650 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_5, v_prenex_6]. (let ((.cse0 (= main_~p~0.offset (_ bv0 32))) (.cse1 (= main_~p~0.offset main_~l~0.offset)) (.cse2 (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|)) (.cse3 (= main_~p~0.base main_~l~0.base)) (.cse4 (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))) (or (and .cse0 .cse1 .cse2 (not (bvslt main_~max~0 main_~min~0)) .cse3 .cse4) (let ((.cse5 (select (select |#memory_int| v_prenex_5) (bvadd v_prenex_6 (_ bv4 32))))) (and .cse0 .cse1 (= .cse5 main_~min~0) .cse2 (not (bvslt main_~max~0 .cse5)) .cse3 .cse4)))) [2018-11-23 11:20:11,097 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 24 treesize of output 18 [2018-11-23 11:20:11,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 9 [2018-11-23 11:20:11,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,123 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:20:11,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-23 11:20:11,132 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:11,133 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (and (= .cse0 |main_#t~mem9|) (not (bvsgt main_~min~0 .cse0)) (not (bvslt (_ bv2147483649 32) .cse0)))) [2018-11-23 11:20:11,133 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (bvslt (_ bv2147483649 32) |main_#t~mem9|)) (not (bvsgt main_~min~0 |main_#t~mem9|))) [2018-11-23 11:20:11,169 INFO L256 TraceCheckUtils]: 0: Hoare triple {2151#true} call ULTIMATE.init(); {2151#true} is VALID [2018-11-23 11:20:11,169 INFO L273 TraceCheckUtils]: 1: Hoare triple {2151#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2151#true} is VALID [2018-11-23 11:20:11,170 INFO L273 TraceCheckUtils]: 2: Hoare triple {2151#true} assume true; {2151#true} is VALID [2018-11-23 11:20:11,170 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2151#true} {2151#true} #64#return; {2151#true} is VALID [2018-11-23 11:20:11,171 INFO L256 TraceCheckUtils]: 4: Hoare triple {2151#true} call #t~ret12 := main(); {2151#true} is VALID [2018-11-23 11:20:11,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {2151#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {2171#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-23 11:20:11,172 INFO L273 TraceCheckUtils]: 6: Hoare triple {2171#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2171#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} is VALID [2018-11-23 11:20:11,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {2171#(= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {2178#(and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:11,189 INFO L273 TraceCheckUtils]: 8: Hoare triple {2178#(and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2182#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem7|) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:11,191 INFO L273 TraceCheckUtils]: 9: Hoare triple {2182#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem7|) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2186#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:11,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {2186#(and (exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (not (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2190#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (not (bvslt main_~max~0 main_~min~0)) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:11,199 INFO L273 TraceCheckUtils]: 11: Hoare triple {2190#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (not (bvslt main_~max~0 main_~min~0)) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {2194#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:11,200 INFO L273 TraceCheckUtils]: 12: Hoare triple {2194#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (= main_~p~0.base main_~l~0.base) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2198#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} is VALID [2018-11-23 11:20:11,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {2198#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (not (bvslt main_~max~0 main_~min~0)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (= (bvadd main_~max~0 (_ bv2147483647 32)) (_ bv0 32)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2202#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-23 11:20:11,204 INFO L273 TraceCheckUtils]: 14: Hoare triple {2202#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2202#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} is VALID [2018-11-23 11:20:11,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {2202#(and (= (_ bv0 32) main_~l~0.offset) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32)))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2209#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:11,210 INFO L273 TraceCheckUtils]: 16: Hoare triple {2209#(and (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (not (bvslt (_ bv2147483649 32) (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2213#(and (not (bvslt (_ bv2147483649 32) |main_#t~mem9|)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} is VALID [2018-11-23 11:20:11,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {2213#(and (not (bvslt (_ bv2147483649 32) |main_#t~mem9|)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {2152#false} is VALID [2018-11-23 11:20:11,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {2152#false} assume !false; {2152#false} is VALID [2018-11-23 11:20:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:11,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:11,745 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:20:11,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:11,747 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:20:11,747 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:1 [2018-11-23 11:20:11,780 INFO L273 TraceCheckUtils]: 18: Hoare triple {2152#false} assume !false; {2152#false} is VALID [2018-11-23 11:20:11,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {2223#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {2152#false} is VALID [2018-11-23 11:20:11,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {2227#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2223#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-23 11:20:11,785 INFO L273 TraceCheckUtils]: 15: Hoare triple {2231#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2227#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:11,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {2231#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2231#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:11,786 INFO L273 TraceCheckUtils]: 13: Hoare triple {2238#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2231#(not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:11,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {2242#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2238#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} is VALID [2018-11-23 11:20:11,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {2246#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {2242#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:20:11,803 INFO L273 TraceCheckUtils]: 10: Hoare triple {2151#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2246#(or (not (bvslt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (bvsgt main_~min~0 |main_#t~mem5|) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:20:11,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {2151#true} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {2151#true} is VALID [2018-11-23 11:20:11,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {2151#true} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2151#true} is VALID [2018-11-23 11:20:11,804 INFO L273 TraceCheckUtils]: 7: Hoare triple {2151#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {2151#true} is VALID [2018-11-23 11:20:11,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {2151#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2151#true} is VALID [2018-11-23 11:20:11,804 INFO L273 TraceCheckUtils]: 5: Hoare triple {2151#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {2151#true} is VALID [2018-11-23 11:20:11,805 INFO L256 TraceCheckUtils]: 4: Hoare triple {2151#true} call #t~ret12 := main(); {2151#true} is VALID [2018-11-23 11:20:11,805 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2151#true} {2151#true} #64#return; {2151#true} is VALID [2018-11-23 11:20:11,805 INFO L273 TraceCheckUtils]: 2: Hoare triple {2151#true} assume true; {2151#true} is VALID [2018-11-23 11:20:11,805 INFO L273 TraceCheckUtils]: 1: Hoare triple {2151#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2151#true} is VALID [2018-11-23 11:20:11,805 INFO L256 TraceCheckUtils]: 0: Hoare triple {2151#true} call ULTIMATE.init(); {2151#true} is VALID [2018-11-23 11:20:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:20:11,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:20:11,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2018-11-23 11:20:11,817 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-11-23 11:20:11,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:11,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:20:11,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:11,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:20:11,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:20:11,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:20:11,899 INFO L87 Difference]: Start difference. First operand 57 states and 80 transitions. Second operand 18 states. [2018-11-23 11:20:15,788 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2018-11-23 11:20:16,531 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-11-23 11:20:19,499 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2018-11-23 11:20:20,447 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 35 [2018-11-23 11:20:20,820 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2018-11-23 11:20:22,829 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2018-11-23 11:20:24,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:24,597 INFO L93 Difference]: Finished difference Result 188 states and 234 transitions. [2018-11-23 11:20:24,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 11:20:24,597 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 19 [2018-11-23 11:20:24,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:20:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:20:24,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 165 transitions. [2018-11-23 11:20:24,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:20:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 165 transitions. [2018-11-23 11:20:24,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 165 transitions. [2018-11-23 11:20:25,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:25,028 INFO L225 Difference]: With dead ends: 188 [2018-11-23 11:20:25,028 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 11:20:25,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=563, Invalid=1693, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:20:25,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 11:20:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 39. [2018-11-23 11:20:25,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:20:25,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 39 states. [2018-11-23 11:20:25,125 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 39 states. [2018-11-23 11:20:25,125 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 39 states. [2018-11-23 11:20:25,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:25,131 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2018-11-23 11:20:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2018-11-23 11:20:25,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:25,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:25,132 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 157 states. [2018-11-23 11:20:25,132 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 157 states. [2018-11-23 11:20:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:25,138 INFO L93 Difference]: Finished difference Result 157 states and 190 transitions. [2018-11-23 11:20:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 190 transitions. [2018-11-23 11:20:25,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:25,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:25,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:20:25,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:20:25,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:20:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2018-11-23 11:20:25,140 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 19 [2018-11-23 11:20:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:20:25,141 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-23 11:20:25,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:20:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 11:20:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:20:25,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:25,142 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:25,142 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:25,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:25,142 INFO L82 PathProgramCache]: Analyzing trace with hash 2073854043, now seen corresponding path program 1 times [2018-11-23 11:20:25,143 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:25,143 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:25,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:20:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:25,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:25,272 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:20:25,277 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:20:25,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,303 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:20:25,307 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:20:25,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,312 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 11:20:25,403 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:20:25,413 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:20:25,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,422 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,435 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:20:25,444 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:20:25,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:25,454 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:20:25,454 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:20:25,460 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:25,460 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~i~0.base_9, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_9) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_9) (_ bv0 32)))) (and (= (_ bv0 32) .cse0) (= .cse0 main_~i~0.offset) (= .cse1 main_~i~0.base) (= .cse1 (_ bv0 32)))) [2018-11-23 11:20:25,460 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset)) [2018-11-23 11:20:25,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {2949#true} call ULTIMATE.init(); {2949#true} is VALID [2018-11-23 11:20:25,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {2949#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2949#true} is VALID [2018-11-23 11:20:25,478 INFO L273 TraceCheckUtils]: 2: Hoare triple {2949#true} assume true; {2949#true} is VALID [2018-11-23 11:20:25,478 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2949#true} {2949#true} #64#return; {2949#true} is VALID [2018-11-23 11:20:25,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {2949#true} call #t~ret12 := main(); {2949#true} is VALID [2018-11-23 11:20:25,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {2949#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {2969#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:25,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {2969#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {2973#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:25,488 INFO L273 TraceCheckUtils]: 12: Hoare triple {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:25,489 INFO L273 TraceCheckUtils]: 13: Hoare triple {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:25,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:25,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:25,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {2989#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {3005#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:25,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {3005#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2950#false} is VALID [2018-11-23 11:20:25,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {2950#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {2950#false} is VALID [2018-11-23 11:20:25,493 INFO L273 TraceCheckUtils]: 19: Hoare triple {2950#false} assume !false; {2950#false} is VALID [2018-11-23 11:20:25,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:25,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:25,630 INFO L273 TraceCheckUtils]: 19: Hoare triple {2950#false} assume !false; {2950#false} is VALID [2018-11-23 11:20:25,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {2950#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {2950#false} is VALID [2018-11-23 11:20:25,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {3005#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {2950#false} is VALID [2018-11-23 11:20:25,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {3005#(and (= (_ bv0 32) main_~i~0.base) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:25,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:20:25,632 INFO L273 TraceCheckUtils]: 14: Hoare triple {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:20:25,632 INFO L273 TraceCheckUtils]: 13: Hoare triple {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:20:25,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:20:25,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {3024#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset)))} is VALID [2018-11-23 11:20:25,635 INFO L273 TraceCheckUtils]: 10: Hoare triple {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,636 INFO L273 TraceCheckUtils]: 9: Hoare triple {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,642 INFO L273 TraceCheckUtils]: 6: Hoare triple {2969#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3040#(and (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:25,643 INFO L273 TraceCheckUtils]: 5: Hoare triple {2949#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {2969#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) main_~l~0.base))} is VALID [2018-11-23 11:20:25,643 INFO L256 TraceCheckUtils]: 4: Hoare triple {2949#true} call #t~ret12 := main(); {2949#true} is VALID [2018-11-23 11:20:25,644 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2949#true} {2949#true} #64#return; {2949#true} is VALID [2018-11-23 11:20:25,644 INFO L273 TraceCheckUtils]: 2: Hoare triple {2949#true} assume true; {2949#true} is VALID [2018-11-23 11:20:25,644 INFO L273 TraceCheckUtils]: 1: Hoare triple {2949#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2949#true} is VALID [2018-11-23 11:20:25,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {2949#true} call ULTIMATE.init(); {2949#true} is VALID [2018-11-23 11:20:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:25,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:20:25,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-23 11:20:25,648 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 11:20:25,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:25,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:20:25,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:25,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:20:25,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:20:25,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:20:25,698 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 8 states. [2018-11-23 11:20:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:26,584 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2018-11-23 11:20:26,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:20:26,585 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 11:20:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:20:26,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:20:26,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-23 11:20:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:20:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-23 11:20:26,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 47 transitions. [2018-11-23 11:20:26,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:26,658 INFO L225 Difference]: With dead ends: 63 [2018-11-23 11:20:26,658 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:20:26,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:20:26,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:20:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 11:20:26,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:20:26,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 11:20:26,824 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 11:20:26,825 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 11:20:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:26,827 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-23 11:20:26,828 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-23 11:20:26,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:26,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:26,828 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 11:20:26,828 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 11:20:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:26,830 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-11-23 11:20:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-23 11:20:26,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:26,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:26,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:20:26,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:20:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 11:20:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2018-11-23 11:20:26,832 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 20 [2018-11-23 11:20:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:20:26,833 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-11-23 11:20:26,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:20:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2018-11-23 11:20:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:20:26,833 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:26,834 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:26,834 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:26,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:26,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1849801925, now seen corresponding path program 1 times [2018-11-23 11:20:26,835 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:26,835 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:26,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:20:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:26,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:27,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 49 [2018-11-23 11:20:27,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 40 treesize of output 42 [2018-11-23 11:20:27,181 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:27,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:20:27,190 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,223 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2018-11-23 11:20:27,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:27,404 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 33 treesize of output 40 [2018-11-23 11:20:27,409 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:27,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:27,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 66 [2018-11-23 11:20:27,607 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-23 11:20:27,780 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:20:27,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:20:27,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:27,998 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:60 [2018-11-23 11:20:28,013 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:28,014 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_20|, |v_main_#t~nondet4_12|, v_prenex_8, v_prenex_9]. (let ((.cse2 (select |#memory_int| main_~p~0.base)) (.cse1 (bvadd main_~p~0.offset (_ bv4 32))) (.cse0 (select (select |v_#memory_int_20| v_prenex_8) (bvadd v_prenex_9 (_ bv4 32))))) (and (= main_~p~0.offset (_ bv0 32)) (= main_~min~0 .cse0) (= main_~p~0.offset main_~l~0.offset) (= (store |v_#memory_int_20| main_~p~0.base (store (store (select |v_#memory_int_20| main_~p~0.base) .cse1 |v_main_#t~nondet4_12|) main_~p~0.offset (select .cse2 main_~p~0.offset))) |#memory_int|) (= (select .cse2 .cse1) |main_#t~mem5|) (= main_~max~0 .cse0) (= main_~p~0.base main_~l~0.base))) [2018-11-23 11:20:28,014 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_8, v_prenex_9]. (let ((.cse0 (= main_~p~0.offset (_ bv0 32))) (.cse1 (= main_~p~0.offset main_~l~0.offset)) (.cse2 (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|)) (.cse3 (= main_~p~0.base main_~l~0.base))) (or (and .cse0 .cse1 (= main_~min~0 main_~max~0) .cse2 .cse3) (let ((.cse4 (select (select |#memory_int| v_prenex_8) (bvadd v_prenex_9 (_ bv4 32))))) (and .cse0 (= .cse4 main_~max~0) .cse1 (= .cse4 main_~min~0) .cse2 .cse3)))) [2018-11-23 11:20:28,293 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:20:28,300 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:20:28,301 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:28,315 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:20:28,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:20:28,326 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:28,326 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (and (bvsgt main_~max~0 .cse0) (= .cse0 |main_#t~mem10|))) [2018-11-23 11:20:28,326 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (bvsgt main_~max~0 |main_#t~mem10|) [2018-11-23 11:20:28,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2018-11-23 11:20:28,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {3317#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3317#true} is VALID [2018-11-23 11:20:28,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2018-11-23 11:20:28,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #64#return; {3317#true} is VALID [2018-11-23 11:20:28,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret12 := main(); {3317#true} is VALID [2018-11-23 11:20:28,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {3317#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {3317#true} is VALID [2018-11-23 11:20:28,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {3317#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3317#true} is VALID [2018-11-23 11:20:28,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {3317#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {3343#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-23 11:20:28,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {3343#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3343#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} is VALID [2018-11-23 11:20:28,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {3343#(= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {3350#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} is VALID [2018-11-23 11:20:28,378 INFO L273 TraceCheckUtils]: 10: Hoare triple {3350#(exists ((main_~p~0.base (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (and (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3354#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:20:28,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {3354#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= main_~min~0 main_~max~0) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {3358#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:20:28,396 INFO L273 TraceCheckUtils]: 12: Hoare triple {3358#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3362#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:20:28,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {3362#(and (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {3366#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:20:28,397 INFO L273 TraceCheckUtils]: 14: Hoare triple {3366#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {3366#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:20:28,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {3366#(and (= (_ bv0 32) main_~l~0.offset) (bvsgt main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {3373#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:28,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {3373#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3373#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:28,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {3373#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3373#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:28,401 INFO L273 TraceCheckUtils]: 18: Hoare triple {3373#(and (bvsgt main_~max~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3383#(bvsgt main_~max~0 |main_#t~mem10|)} is VALID [2018-11-23 11:20:28,405 INFO L273 TraceCheckUtils]: 19: Hoare triple {3383#(bvsgt main_~max~0 |main_#t~mem10|)} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {3318#false} is VALID [2018-11-23 11:20:28,405 INFO L273 TraceCheckUtils]: 20: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2018-11-23 11:20:28,406 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:28,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:29,003 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:20:29,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:29,005 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:20:29,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:1 [2018-11-23 11:20:29,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2018-11-23 11:20:29,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {3393#(not (bvsgt |main_#t~mem10| main_~max~0))} assume ~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {3318#false} is VALID [2018-11-23 11:20:29,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {3397#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3393#(not (bvsgt |main_#t~mem10| main_~max~0))} is VALID [2018-11-23 11:20:29,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {3397#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3397#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-23 11:20:29,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {3397#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {3397#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-23 11:20:29,022 INFO L273 TraceCheckUtils]: 15: Hoare triple {3407#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {3397#(not (bvsgt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-23 11:20:29,022 INFO L273 TraceCheckUtils]: 14: Hoare triple {3407#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {3407#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-23 11:20:29,023 INFO L273 TraceCheckUtils]: 13: Hoare triple {3414#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 |main_#t~mem7|))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {3407#(not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0))} is VALID [2018-11-23 11:20:29,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {3418#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3414#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 |main_#t~mem7|))} is VALID [2018-11-23 11:20:29,028 INFO L273 TraceCheckUtils]: 11: Hoare triple {3422#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {3418#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:20:29,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {3317#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3422#(or (not (bvsgt (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~max~0)) (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:20:29,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {3317#true} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {3317#true} is VALID [2018-11-23 11:20:29,039 INFO L273 TraceCheckUtils]: 8: Hoare triple {3317#true} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3317#true} is VALID [2018-11-23 11:20:29,039 INFO L273 TraceCheckUtils]: 7: Hoare triple {3317#true} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {3317#true} is VALID [2018-11-23 11:20:29,039 INFO L273 TraceCheckUtils]: 6: Hoare triple {3317#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {3317#true} is VALID [2018-11-23 11:20:29,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {3317#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {3317#true} is VALID [2018-11-23 11:20:29,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret12 := main(); {3317#true} is VALID [2018-11-23 11:20:29,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #64#return; {3317#true} is VALID [2018-11-23 11:20:29,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2018-11-23 11:20:29,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {3317#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3317#true} is VALID [2018-11-23 11:20:29,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2018-11-23 11:20:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:20:29,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 11:20:29,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2018-11-23 11:20:29,043 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-11-23 11:20:29,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:29,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:20:29,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:29,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:20:29,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:20:29,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:20:29,115 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 16 states. [2018-11-23 11:20:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:38,292 INFO L93 Difference]: Finished difference Result 147 states and 175 transitions. [2018-11-23 11:20:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:20:38,292 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-11-23 11:20:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:20:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:20:38,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 114 transitions. [2018-11-23 11:20:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:20:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 114 transitions. [2018-11-23 11:20:38,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 114 transitions. [2018-11-23 11:20:38,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:38,615 INFO L225 Difference]: With dead ends: 147 [2018-11-23 11:20:38,615 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:20:38,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=202, Invalid=609, Unknown=1, NotChecked=0, Total=812 [2018-11-23 11:20:38,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:20:39,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 52. [2018-11-23 11:20:39,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:20:39,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 52 states. [2018-11-23 11:20:39,086 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 52 states. [2018-11-23 11:20:39,086 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 52 states. [2018-11-23 11:20:39,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:39,090 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-23 11:20:39,091 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-11-23 11:20:39,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:39,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:39,091 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 125 states. [2018-11-23 11:20:39,091 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 125 states. [2018-11-23 11:20:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:20:39,095 INFO L93 Difference]: Finished difference Result 125 states and 145 transitions. [2018-11-23 11:20:39,095 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 145 transitions. [2018-11-23 11:20:39,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:20:39,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:20:39,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:20:39,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:20:39,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 11:20:39,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2018-11-23 11:20:39,097 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 21 [2018-11-23 11:20:39,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:20:39,097 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2018-11-23 11:20:39,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:20:39,098 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2018-11-23 11:20:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:20:39,098 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:20:39,098 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:20:39,099 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:20:39,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:20:39,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1272344445, now seen corresponding path program 1 times [2018-11-23 11:20:39,099 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:20:39,099 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:20:39,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:20:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:20:39,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:20:39,276 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:20:39,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,326 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 20 treesize of output 17 [2018-11-23 11:20:39,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:20:39,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:39,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:20:39,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,366 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,372 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-11-23 11:20:39,405 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:39,405 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, |v_main_#t~nondet4_14|, |v_#valid_25|]. (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= |#memory_int| (store |v_#memory_int_22| main_~p~0.base (store (store (select |v_#memory_int_22| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) |v_main_#t~nondet4_14|) main_~p~0.offset (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)))) (= main_~p~0.base main_~l~0.base) (= (store |v_#valid_25| main_~p~0.base (_ bv1 1)) |#valid|)) [2018-11-23 11:20:39,405 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base)) [2018-11-23 11:20:39,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:39,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:39,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:20:39,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,752 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 11 treesize of output 8 [2018-11-23 11:20:39,763 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:20:39,764 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,776 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,908 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 35 treesize of output 36 [2018-11-23 11:20:39,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:20:39,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:39,938 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:20:39,940 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,957 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:39,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,060 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 11 treesize of output 8 [2018-11-23 11:20:40,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:20:40,074 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,081 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,141 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:85, output treesize:56 [2018-11-23 11:20:40,211 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:40,212 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_13|, v_main_~l~0.base_11, |v_#memory_int_23|, |v_#valid_26|, |v_#memory_$Pointer$.offset_13|, |v_main_#t~nondet4_15|]. (let ((.cse0 (select (select |v_#memory_int_23| v_main_~l~0.base_11) (_ bv4 32))) (.cse2 (bvadd main_~p~0.offset (_ bv4 32))) (.cse1 (select |#memory_int| main_~p~0.base))) (and (= main_~p~0.offset (_ bv0 32)) (= main_~max~0 .cse0) (= main_~min~0 .cse0) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |v_#valid_26| v_main_~l~0.base_11)) (= (store |v_#memory_$Pointer$.offset_13| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_13| main_~p~0.base) main_~p~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= (select |v_#valid_26| main_~p~0.base) (_ bv0 1)) (= (select .cse1 .cse2) |main_#t~mem5|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_13| main_~p~0.base (store (select |v_#memory_$Pointer$.base_13| main_~p~0.base) main_~p~0.offset v_main_~l~0.base_11))) (= (store |v_#memory_int_23| main_~p~0.base (store (store (select |v_#memory_int_23| main_~p~0.base) .cse2 |v_main_#t~nondet4_15|) main_~p~0.offset (select .cse1 main_~p~0.offset))) |#memory_int|) (= main_~p~0.base main_~l~0.base))) [2018-11-23 11:20:40,212 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset))) (let ((.cse1 (select (select |#memory_int| .cse0) (_ bv4 32)))) (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (= .cse0 main_~p~0.base)) (= main_~max~0 .cse1) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base) (= main_~min~0 .cse1)))) [2018-11-23 11:20:40,689 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:20:40,695 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:20:40,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-23 11:20:40,729 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-11-23 11:20:40,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,749 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:20:40,749 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2018-11-23 11:20:40,765 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:40,765 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~i~0.base_13, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (.cse2 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_13) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_13) (_ bv0 32)))) (and (bvsgt (select (select |#memory_int| .cse0) (_ bv4 32)) .cse1) (= main_~min~0 .cse1) (= .cse2 main_~i~0.offset) (= (_ bv0 32) .cse2) (= .cse0 main_~i~0.base))) [2018-11-23 11:20:40,765 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0.base_13]. (let ((.cse0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32)))) (and (= main_~min~0 .cse0) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) .cse0) (= (_ bv0 32) main_~i~0.offset))) [2018-11-23 11:20:40,834 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:40,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:20:40,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2018-11-23 11:20:40,866 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:20:40,875 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:20:40,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:20:40,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:20:40,921 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:20:40,922 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-23 11:20:40,932 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:40,933 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~i~0.base_13, main_~i~0.base]. (let ((.cse1 (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (.cse0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32)))) (and (= main_~min~0 .cse0) (= .cse1 |main_#t~mem9|) (bvsgt .cse1 .cse0))) [2018-11-23 11:20:40,933 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (bvsgt |main_#t~mem9| main_~min~0) [2018-11-23 11:20:40,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-23 11:20:40,973 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3984#true} is VALID [2018-11-23 11:20:40,973 INFO L273 TraceCheckUtils]: 2: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-23 11:20:40,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3984#true} {3984#true} #64#return; {3984#true} is VALID [2018-11-23 11:20:40,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {3984#true} call #t~ret12 := main(); {3984#true} is VALID [2018-11-23 11:20:40,973 INFO L273 TraceCheckUtils]: 5: Hoare triple {3984#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {3984#true} is VALID [2018-11-23 11:20:40,976 INFO L273 TraceCheckUtils]: 6: Hoare triple {3984#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4007#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:20:40,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {4007#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4011#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:20:40,978 INFO L273 TraceCheckUtils]: 8: Hoare triple {4011#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4011#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:20:40,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {4011#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4018#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} is VALID [2018-11-23 11:20:40,986 INFO L273 TraceCheckUtils]: 10: Hoare triple {4018#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~max~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4022#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~p~0.base)) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-23 11:20:40,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {4022#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~p~0.base)) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|) (= main_~p~0.base main_~l~0.base) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4026#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:20:40,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {4026#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) main_~min~0) (= main_~p~0.base main_~l~0.base))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4030#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:40,997 INFO L273 TraceCheckUtils]: 13: Hoare triple {4030#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= |main_#t~mem7| (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= main_~max~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4034#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:40,998 INFO L273 TraceCheckUtils]: 14: Hoare triple {4034#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {4034#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} is VALID [2018-11-23 11:20:41,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {4034#(and (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)) (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:41,007 INFO L273 TraceCheckUtils]: 16: Hoare triple {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:41,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:41,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:41,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:41,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {4041#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (bvsgt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)) (select (select |#memory_int| main_~i~0.base) (_ bv4 32))) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {4057#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:20:41,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {4057#(and (exists ((v_main_~i~0.base_13 (_ BitVec 32))) (and (= main_~min~0 (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))) (bvsgt (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) (select (select |#memory_int| v_main_~i~0.base_13) (_ bv4 32))))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4061#(bvsgt |main_#t~mem9| main_~min~0)} is VALID [2018-11-23 11:20:41,028 INFO L273 TraceCheckUtils]: 22: Hoare triple {4061#(bvsgt |main_#t~mem9| main_~min~0)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3985#false} is VALID [2018-11-23 11:20:41,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-23 11:20:41,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:41,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:20:44,102 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:20:44,138 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:20:44,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:20:44,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:65 [2018-11-23 11:20:44,225 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:20:44,226 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_main_~l~0.base_12, |main_#t~nondet4|, |v_#memory_int_24|]. (let ((.cse0 (select |v_#memory_int_24| v_main_~l~0.base_12))) (let ((.cse1 (select .cse0 (_ bv4 32)))) (or (not (= (store |#memory_int| v_main_~l~0.base_12 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) (select .cse0 (_ bv0 32)))) |v_#memory_int_24|)) (not (bvsgt main_~min~0 .cse1)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (not (bvslt (select (select |v_#memory_int_24| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) .cse1)) (bvslt main_~max~0 .cse1)))) [2018-11-23 11:20:44,226 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~l~0.base_12, |main_#t~nondet4|, v_DerPreprocessor_8]. (let ((.cse0 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8))) (let ((.cse1 (select .cse0 (_ bv4 32)))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 .cse0) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) .cse1)) (not (bvsgt main_~min~0 .cse1)) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (bvslt main_~max~0 .cse1)))) [2018-11-23 11:20:45,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {3985#false} assume !false; {3985#false} is VALID [2018-11-23 11:20:45,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {4071#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {3985#false} is VALID [2018-11-23 11:20:45,259 INFO L273 TraceCheckUtils]: 21: Hoare triple {4075#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4071#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-23 11:20:45,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {4075#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:45,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:45,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:45,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:45,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:45,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {4095#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {4079#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:45,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {4095#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {4095#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:45,263 INFO L273 TraceCheckUtils]: 13: Hoare triple {4102#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {4095#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:20:45,266 INFO L273 TraceCheckUtils]: 12: Hoare triple {4106#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4102#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 |main_#t~mem7|))} is VALID [2018-11-23 11:20:45,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {4110#(or (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4106#(or (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:20:47,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {4114#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (bvslt main_~max~0 (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1)))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4110#(or (not (bvsgt main_~min~0 |main_#t~mem5|)) (bvslt main_~max~0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} is UNKNOWN [2018-11-23 11:20:47,302 INFO L273 TraceCheckUtils]: 9: Hoare triple {4118#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4114#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (bvslt main_~max~0 (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1)))))} is VALID [2018-11-23 11:20:47,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {4118#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4118#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))))} is VALID [2018-11-23 11:20:47,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {4125#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4118#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (bvsgt main_~min~0 (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))))} is VALID [2018-11-23 11:20:47,321 INFO L273 TraceCheckUtils]: 6: Hoare triple {3984#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4125#(forall ((|main_#t~nondet4| (_ BitVec 32)) (v_main_~l~0.base_12 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_12 (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (bvsgt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))) (not (= (select |#valid| v_main_~l~0.base_12) (_ bv0 1))) (bvslt (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (select (store (store (select |#memory_int| v_main_~l~0.base_12) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_8) (_ bv4 32)))))} is VALID [2018-11-23 11:20:47,322 INFO L273 TraceCheckUtils]: 5: Hoare triple {3984#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {3984#true} is VALID [2018-11-23 11:20:47,322 INFO L256 TraceCheckUtils]: 4: Hoare triple {3984#true} call #t~ret12 := main(); {3984#true} is VALID [2018-11-23 11:20:47,322 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3984#true} {3984#true} #64#return; {3984#true} is VALID [2018-11-23 11:20:47,322 INFO L273 TraceCheckUtils]: 2: Hoare triple {3984#true} assume true; {3984#true} is VALID [2018-11-23 11:20:47,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {3984#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3984#true} is VALID [2018-11-23 11:20:47,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {3984#true} call ULTIMATE.init(); {3984#true} is VALID [2018-11-23 11:20:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:20:47,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:20:47,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 11:20:47,332 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-11-23 11:20:47,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:20:47,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:20:49,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:20:49,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:20:49,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:20:49,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:20:49,485 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand 22 states. [2018-11-23 11:20:53,355 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-23 11:20:56,134 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-23 11:20:56,491 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2018-11-23 11:21:01,372 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2018-11-23 11:21:06,778 WARN L180 SmtUtils]: Spent 780.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2018-11-23 11:21:07,238 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2018-11-23 11:21:08,364 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:21:09,542 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2018-11-23 11:21:09,879 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-11-23 11:21:19,694 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 38 [2018-11-23 11:21:21,422 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2018-11-23 11:21:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:25,289 INFO L93 Difference]: Finished difference Result 199 states and 234 transitions. [2018-11-23 11:21:25,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:21:25,289 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 24 [2018-11-23 11:21:25,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:21:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 182 transitions. [2018-11-23 11:21:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:21:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 182 transitions. [2018-11-23 11:21:25,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 182 transitions. [2018-11-23 11:21:44,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 173 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:44,544 INFO L225 Difference]: With dead ends: 199 [2018-11-23 11:21:44,544 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 11:21:44,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=599, Invalid=2052, Unknown=1, NotChecked=0, Total=2652 [2018-11-23 11:21:44,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 11:21:45,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 81. [2018-11-23 11:21:45,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:21:45,030 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 81 states. [2018-11-23 11:21:45,030 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 81 states. [2018-11-23 11:21:45,030 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 81 states. [2018-11-23 11:21:45,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:45,034 INFO L93 Difference]: Finished difference Result 197 states and 229 transitions. [2018-11-23 11:21:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2018-11-23 11:21:45,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:45,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:45,035 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 197 states. [2018-11-23 11:21:45,035 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 197 states. [2018-11-23 11:21:45,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:45,040 INFO L93 Difference]: Finished difference Result 197 states and 229 transitions. [2018-11-23 11:21:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 229 transitions. [2018-11-23 11:21:45,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:21:45,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:21:45,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:21:45,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:21:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:21:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2018-11-23 11:21:45,043 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 24 [2018-11-23 11:21:45,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:21:45,043 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2018-11-23 11:21:45,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:21:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2018-11-23 11:21:45,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:21:45,044 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:21:45,044 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:21:45,044 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:21:45,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:21:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1734752259, now seen corresponding path program 1 times [2018-11-23 11:21:45,045 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:21:45,045 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:21:45,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:21:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:21:45,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:21:45,194 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:21:45,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,239 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 20 treesize of output 17 [2018-11-23 11:21:45,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:21:45,257 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:45,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-11-23 11:21:45,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:15 [2018-11-23 11:21:45,318 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:45,318 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_26|, |v_main_#t~nondet4_18|, |v_#valid_32|]. (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (store |v_#memory_int_26| main_~p~0.base (store (store (select |v_#memory_int_26| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) |v_main_#t~nondet4_18|) main_~p~0.offset (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) |#memory_int|) (= |#valid| (store |v_#valid_32| main_~p~0.base (_ bv1 1))) (= main_~p~0.base main_~l~0.base)) [2018-11-23 11:21:45,318 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base)) [2018-11-23 11:21:45,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:45,471 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:45,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:21:45,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,624 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 11 treesize of output 8 [2018-11-23 11:21:45,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:21:45,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,715 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 11 treesize of output 8 [2018-11-23 11:21:45,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:21:45,725 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,806 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 28 treesize of output 33 [2018-11-23 11:21:45,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:21:45,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:21:45,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:21:45,827 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,837 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,851 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:45,884 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:63, output treesize:30 [2018-11-23 11:21:45,929 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:45,929 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_16|, v_main_~l~0.base_14, |v_#memory_$Pointer$.offset_16|, |v_#memory_int_27|, |v_main_#t~nondet4_19|, |v_#valid_33|]. (and (= (store |v_#memory_$Pointer$.offset_16| main_~l~0.base (store (select |v_#memory_$Pointer$.offset_16| main_~l~0.base) main_~l~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_16| main_~l~0.base (store (select |v_#memory_$Pointer$.base_16| main_~l~0.base) main_~l~0.offset v_main_~l~0.base_14))) (= (_ bv0 32) main_~l~0.offset) (= (store |v_#memory_int_27| main_~l~0.base (store (store (select |v_#memory_int_27| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)) |v_main_#t~nondet4_19|) main_~l~0.offset (select (select |#memory_int| main_~l~0.base) main_~l~0.offset))) |#memory_int|) (= main_~min~0 (select (select |v_#memory_int_27| v_main_~l~0.base_14) (_ bv4 32))) (= (_ bv0 1) (select |v_#valid_33| main_~l~0.base)) (= (_ bv1 1) (select |v_#valid_33| v_main_~l~0.base_14))) [2018-11-23 11:21:45,929 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset))) (and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= .cse0 main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| .cse0) (_ bv4 32))))) [2018-11-23 11:21:46,047 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:21:46,053 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:21:46,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:46,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:46,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2018-11-23 11:21:46,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 12 [2018-11-23 11:21:46,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:46,096 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:46,110 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:21:46,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:41, output treesize:11 [2018-11-23 11:21:46,117 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:46,118 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~i~0.base_16, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_16) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_16) (_ bv0 32)))) (and (= main_~min~0 (select (select |#memory_int| .cse0) (_ bv4 32))) (= .cse1 main_~i~0.offset) (= .cse1 (_ bv0 32)) (= .cse0 main_~i~0.base) (not (= .cse0 v_main_~i~0.base_16)))) [2018-11-23 11:21:46,118 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) main_~i~0.offset) (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0)) [2018-11-23 11:21:46,153 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:21:46,157 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:21:46,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:21:46,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:21:46,163 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:21:46,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 11:21:46,167 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:46,168 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (and (= .cse0 |main_#t~mem9|) (= .cse0 main_~min~0))) [2018-11-23 11:21:46,168 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= main_~min~0 |main_#t~mem9|) [2018-11-23 11:21:46,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {4950#true} call ULTIMATE.init(); {4950#true} is VALID [2018-11-23 11:21:46,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {4950#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4950#true} is VALID [2018-11-23 11:21:46,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {4950#true} assume true; {4950#true} is VALID [2018-11-23 11:21:46,189 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4950#true} {4950#true} #64#return; {4950#true} is VALID [2018-11-23 11:21:46,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {4950#true} call #t~ret12 := main(); {4950#true} is VALID [2018-11-23 11:21:46,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {4950#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4950#true} is VALID [2018-11-23 11:21:46,192 INFO L273 TraceCheckUtils]: 6: Hoare triple {4950#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4973#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} is VALID [2018-11-23 11:21:46,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {4973#(and (= main_~p~0.offset (_ bv0 32)) (= main_~p~0.offset main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= main_~p~0.base main_~l~0.base))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {4977#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-23 11:21:46,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {4977#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4977#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-23 11:21:46,195 INFO L273 TraceCheckUtils]: 9: Hoare triple {4977#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4977#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-23 11:21:46,200 INFO L273 TraceCheckUtils]: 10: Hoare triple {4977#(and (= (_ bv0 32) main_~l~0.offset) (= main_~min~0 (select (select |#memory_int| main_~l~0.base) (_ bv4 32))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-23 11:21:46,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-23 11:21:46,201 INFO L273 TraceCheckUtils]: 12: Hoare triple {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-23 11:21:46,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-23 11:21:46,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} is VALID [2018-11-23 11:21:46,204 INFO L273 TraceCheckUtils]: 15: Hoare triple {4987#(and (= (_ bv0 32) main_~l~0.offset) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32))))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:21:46,205 INFO L273 TraceCheckUtils]: 16: Hoare triple {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:21:46,206 INFO L273 TraceCheckUtils]: 17: Hoare triple {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:21:46,207 INFO L273 TraceCheckUtils]: 18: Hoare triple {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:21:46,207 INFO L273 TraceCheckUtils]: 19: Hoare triple {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:21:46,208 INFO L273 TraceCheckUtils]: 20: Hoare triple {5003#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32))) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {5019#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:21:46,209 INFO L273 TraceCheckUtils]: 21: Hoare triple {5019#(and (= (select (select |#memory_int| main_~i~0.base) (_ bv4 32)) main_~min~0) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5023#(= main_~min~0 |main_#t~mem9|)} is VALID [2018-11-23 11:21:46,210 INFO L273 TraceCheckUtils]: 22: Hoare triple {5023#(= main_~min~0 |main_#t~mem9|)} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4951#false} is VALID [2018-11-23 11:21:46,210 INFO L273 TraceCheckUtils]: 23: Hoare triple {4951#false} assume !false; {4951#false} is VALID [2018-11-23 11:21:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:21:46,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:21:48,778 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:21:48,788 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:21:48,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:21:48,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:28 [2018-11-23 11:21:48,846 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:21:48,847 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_28|, v_main_~p~0.base_11, |main_#t~nondet4|]. (or (not (bvslt (select (select |v_#memory_int_28| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (= |v_#memory_int_28| (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) (select (select |v_#memory_int_28| v_main_~p~0.base_11) (_ bv0 32))))))) [2018-11-23 11:21:48,847 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~p~0.base_11, |main_#t~nondet4|, v_DerPreprocessor_10]. (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_10)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))) [2018-11-23 11:21:51,085 INFO L273 TraceCheckUtils]: 23: Hoare triple {4951#false} assume !false; {4951#false} is VALID [2018-11-23 11:21:51,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {5033#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {4951#false} is VALID [2018-11-23 11:21:51,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {5037#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5033#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-23 11:21:51,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {5037#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:51,089 INFO L273 TraceCheckUtils]: 19: Hoare triple {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:51,089 INFO L273 TraceCheckUtils]: 18: Hoare triple {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:51,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:51,090 INFO L273 TraceCheckUtils]: 16: Hoare triple {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:51,091 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {5041#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:51,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:51,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:51,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:51,092 INFO L273 TraceCheckUtils]: 11: Hoare triple {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:21:53,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {5073#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_10)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5057#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is UNKNOWN [2018-11-23 11:21:53,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {5073#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_10)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {5073#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_10)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} is VALID [2018-11-23 11:21:53,164 INFO L273 TraceCheckUtils]: 8: Hoare triple {5073#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_10)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5073#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_10)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} is VALID [2018-11-23 11:21:53,164 INFO L273 TraceCheckUtils]: 7: Hoare triple {5083#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_10)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {5073#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_10)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0))))} is VALID [2018-11-23 11:21:53,173 INFO L273 TraceCheckUtils]: 6: Hoare triple {4950#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5083#(forall ((v_DerPreprocessor_10 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32)) (v_main_~p~0.base_11 (_ BitVec 32))) (or (not (= (select |#valid| v_main_~p~0.base_11) (_ bv0 1))) (not (bvslt (select (select (store |#memory_int| v_main_~p~0.base_11 (store (store (select |#memory_int| v_main_~p~0.base_11) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_10)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))))} is VALID [2018-11-23 11:21:53,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {4950#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {4950#true} is VALID [2018-11-23 11:21:53,174 INFO L256 TraceCheckUtils]: 4: Hoare triple {4950#true} call #t~ret12 := main(); {4950#true} is VALID [2018-11-23 11:21:53,174 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4950#true} {4950#true} #64#return; {4950#true} is VALID [2018-11-23 11:21:53,174 INFO L273 TraceCheckUtils]: 2: Hoare triple {4950#true} assume true; {4950#true} is VALID [2018-11-23 11:21:53,174 INFO L273 TraceCheckUtils]: 1: Hoare triple {4950#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4950#true} is VALID [2018-11-23 11:21:53,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {4950#true} call ULTIMATE.init(); {4950#true} is VALID [2018-11-23 11:21:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (12)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:21:53,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:21:53,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:21:53,181 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 11:21:53,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:21:53,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:21:55,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:21:55,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:21:55,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:21:55,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=150, Unknown=1, NotChecked=0, Total=182 [2018-11-23 11:21:55,316 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand 14 states. [2018-11-23 11:21:57,924 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2018-11-23 11:21:59,167 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-11-23 11:21:59,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:21:59,863 INFO L93 Difference]: Finished difference Result 129 states and 161 transitions. [2018-11-23 11:21:59,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:21:59,863 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-23 11:21:59,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:21:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:21:59,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-23 11:21:59,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:21:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-23 11:21:59,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2018-11-23 11:22:00,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:00,354 INFO L225 Difference]: With dead ends: 129 [2018-11-23 11:22:00,354 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 11:22:00,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=94, Invalid=325, Unknown=1, NotChecked=0, Total=420 [2018-11-23 11:22:00,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 11:22:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 81. [2018-11-23 11:22:00,702 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:00,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 81 states. [2018-11-23 11:22:00,702 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 81 states. [2018-11-23 11:22:00,703 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 81 states. [2018-11-23 11:22:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:00,707 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2018-11-23 11:22:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2018-11-23 11:22:00,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:00,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:00,707 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 127 states. [2018-11-23 11:22:00,708 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 127 states. [2018-11-23 11:22:00,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:00,711 INFO L93 Difference]: Finished difference Result 127 states and 159 transitions. [2018-11-23 11:22:00,711 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 159 transitions. [2018-11-23 11:22:00,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:00,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:00,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:00,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 11:22:00,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2018-11-23 11:22:00,714 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 24 [2018-11-23 11:22:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:00,714 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2018-11-23 11:22:00,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:22:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2018-11-23 11:22:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:22:00,715 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:00,715 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:00,715 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:00,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:00,716 INFO L82 PathProgramCache]: Analyzing trace with hash 733210371, now seen corresponding path program 2 times [2018-11-23 11:22:00,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:00,716 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:00,746 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:22:00,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:22:00,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:22:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:00,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:01,215 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 20 treesize of output 16 [2018-11-23 11:22:01,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-11-23 11:22:01,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:01,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:4 [2018-11-23 11:22:01,233 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:01,234 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, main_~p~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))) (and (= .cse0 main_~max~0) (not (bvsgt (_ bv2147483647 32) .cse0)))) [2018-11-23 11:22:01,234 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (bvsgt (_ bv2147483647 32) main_~max~0)) [2018-11-23 11:22:01,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {5643#true} call ULTIMATE.init(); {5643#true} is VALID [2018-11-23 11:22:01,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {5643#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5643#true} is VALID [2018-11-23 11:22:01,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {5643#true} assume true; {5643#true} is VALID [2018-11-23 11:22:01,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5643#true} {5643#true} #64#return; {5643#true} is VALID [2018-11-23 11:22:01,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {5643#true} call #t~ret12 := main(); {5643#true} is VALID [2018-11-23 11:22:01,254 INFO L273 TraceCheckUtils]: 5: Hoare triple {5643#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {5663#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:01,255 INFO L273 TraceCheckUtils]: 6: Hoare triple {5663#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5667#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|))} is VALID [2018-11-23 11:22:01,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {5667#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) |main_#t~mem5|))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {5671#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:22:01,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {5671#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5671#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:22:01,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {5671#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-23 11:22:01,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-23 11:22:01,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-23 11:22:01,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-23 11:22:01,259 INFO L273 TraceCheckUtils]: 13: Hoare triple {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {5644#false} is VALID [2018-11-23 11:22:01,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {5644#false} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {5644#false} is VALID [2018-11-23 11:22:01,259 INFO L273 TraceCheckUtils]: 15: Hoare triple {5644#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {5644#false} is VALID [2018-11-23 11:22:01,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {5644#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5644#false} is VALID [2018-11-23 11:22:01,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {5644#false} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {5644#false} is VALID [2018-11-23 11:22:01,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {5644#false} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5644#false} is VALID [2018-11-23 11:22:01,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {5644#false} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {5644#false} is VALID [2018-11-23 11:22:01,260 INFO L273 TraceCheckUtils]: 20: Hoare triple {5644#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {5644#false} is VALID [2018-11-23 11:22:01,261 INFO L273 TraceCheckUtils]: 21: Hoare triple {5644#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5644#false} is VALID [2018-11-23 11:22:01,261 INFO L273 TraceCheckUtils]: 22: Hoare triple {5644#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {5644#false} is VALID [2018-11-23 11:22:01,261 INFO L273 TraceCheckUtils]: 23: Hoare triple {5644#false} assume !false; {5644#false} is VALID [2018-11-23 11:22:01,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:22:01,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:01,349 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 20 treesize of output 16 [2018-11-23 11:22:01,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-11-23 11:22:01,360 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:22:01,368 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:22:01,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:01,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:20, output treesize:8 [2018-11-23 11:22:01,381 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:01,382 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_31|, v_main_~p~0.base_14, v_main_~p~0.offset_14]. (let ((.cse0 (select (select |v_#memory_int_31| v_main_~p~0.base_14) (bvadd v_main_~p~0.offset_14 (_ bv4 32))))) (or (not (bvsgt (_ bv2147483647 32) .cse0)) (bvsgt main_~min~0 .cse0))) [2018-11-23 11:22:01,382 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_arrayElimCell_40]. (or (not (bvsgt (_ bv2147483647 32) v_arrayElimCell_40)) (bvsgt main_~min~0 v_arrayElimCell_40)) [2018-11-23 11:22:01,395 INFO L273 TraceCheckUtils]: 23: Hoare triple {5644#false} assume !false; {5644#false} is VALID [2018-11-23 11:22:01,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {5644#false} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {5644#false} is VALID [2018-11-23 11:22:01,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {5644#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5644#false} is VALID [2018-11-23 11:22:01,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {5644#false} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {5644#false} is VALID [2018-11-23 11:22:01,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {5644#false} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {5644#false} is VALID [2018-11-23 11:22:01,396 INFO L273 TraceCheckUtils]: 18: Hoare triple {5644#false} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5644#false} is VALID [2018-11-23 11:22:01,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {5644#false} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {5644#false} is VALID [2018-11-23 11:22:01,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {5644#false} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {5644#false} is VALID [2018-11-23 11:22:01,396 INFO L273 TraceCheckUtils]: 15: Hoare triple {5644#false} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {5644#false} is VALID [2018-11-23 11:22:01,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {5644#false} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {5644#false} is VALID [2018-11-23 11:22:01,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {5644#false} is VALID [2018-11-23 11:22:01,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-23 11:22:01,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume ~bvsgt32(~min~0, #t~mem5);havoc #t~mem5;call #t~mem6 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~min~0 := #t~mem6;havoc #t~mem6; {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-23 11:22:01,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-23 11:22:01,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {5671#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {5678#(not (bvsgt (_ bv2147483647 32) main_~max~0))} is VALID [2018-11-23 11:22:01,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {5671#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5671#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:22:01,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {5769#(or (bvsgt main_~min~0 |main_#t~mem5|) (not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {5671#(not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:22:01,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {5663#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {5769#(or (bvsgt main_~min~0 |main_#t~mem5|) (not (bvsgt (_ bv2147483647 32) (select (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))))))} is VALID [2018-11-23 11:22:01,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {5643#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {5663#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:01,401 INFO L256 TraceCheckUtils]: 4: Hoare triple {5643#true} call #t~ret12 := main(); {5643#true} is VALID [2018-11-23 11:22:01,401 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5643#true} {5643#true} #64#return; {5643#true} is VALID [2018-11-23 11:22:01,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {5643#true} assume true; {5643#true} is VALID [2018-11-23 11:22:01,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {5643#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5643#true} is VALID [2018-11-23 11:22:01,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {5643#true} call ULTIMATE.init(); {5643#true} is VALID [2018-11-23 11:22:01,403 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:22:01,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:01,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 11:22:01,406 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 11:22:01,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:01,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:22:01,439 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:22:01,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:22:01,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:22:01,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:22:01,440 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand 7 states. [2018-11-23 11:22:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:03,411 INFO L93 Difference]: Finished difference Result 192 states and 256 transitions. [2018-11-23 11:22:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:22:03,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 11:22:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:22:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:22:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2018-11-23 11:22:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:22:03,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2018-11-23 11:22:03,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2018-11-23 11:22:03,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:03,971 INFO L225 Difference]: With dead ends: 192 [2018-11-23 11:22:03,971 INFO L226 Difference]: Without dead ends: 147 [2018-11-23 11:22:03,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:22:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-23 11:22:04,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 111. [2018-11-23 11:22:04,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:22:04,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand 111 states. [2018-11-23 11:22:04,695 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand 111 states. [2018-11-23 11:22:04,695 INFO L87 Difference]: Start difference. First operand 147 states. Second operand 111 states. [2018-11-23 11:22:04,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:04,699 INFO L93 Difference]: Finished difference Result 147 states and 188 transitions. [2018-11-23 11:22:04,699 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 188 transitions. [2018-11-23 11:22:04,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:04,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:04,700 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 147 states. [2018-11-23 11:22:04,700 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 147 states. [2018-11-23 11:22:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:22:04,703 INFO L93 Difference]: Finished difference Result 147 states and 188 transitions. [2018-11-23 11:22:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 188 transitions. [2018-11-23 11:22:04,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:22:04,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:22:04,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:22:04,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:22:04,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-23 11:22:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2018-11-23 11:22:04,706 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 24 [2018-11-23 11:22:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:22:04,706 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2018-11-23 11:22:04,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:22:04,707 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2018-11-23 11:22:04,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:22:04,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:22:04,707 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:22:04,708 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:22:04,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:22:04,708 INFO L82 PathProgramCache]: Analyzing trace with hash 847468935, now seen corresponding path program 1 times [2018-11-23 11:22:04,708 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:22:04,708 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 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 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:22:04,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:22:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:22:04,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:22:05,160 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:22:05,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,205 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 20 treesize of output 17 [2018-11-23 11:22:05,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:22:05,224 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:05,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:22:05,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,245 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:44, output treesize:23 [2018-11-23 11:22:05,285 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:05,285 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_32|, |v_main_#t~nondet4_24|, |v_#valid_44|]. (let ((.cse1 (select |#memory_int| main_~l~0.base)) (.cse0 (bvadd main_~l~0.offset (_ bv4 32)))) (and (= |#valid| (store |v_#valid_44| main_~l~0.base (_ bv1 1))) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (store |v_#memory_int_32| main_~l~0.base (store (store (select |v_#memory_int_32| main_~l~0.base) .cse0 |v_main_#t~nondet4_24|) main_~l~0.offset (select .cse1 main_~l~0.offset))) |#memory_int|) (= |main_#t~mem5| (select .cse1 .cse0)))) [2018-11-23 11:22:05,285 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) [2018-11-23 11:22:05,393 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:05,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:05,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-23 11:22:05,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,568 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 29 treesize of output 30 [2018-11-23 11:22:05,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-11-23 11:22:05,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:22:05,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 11:22:05,599 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,629 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,698 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 11 treesize of output 8 [2018-11-23 11:22:05,706 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:22:05,708 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,714 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,761 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 11 treesize of output 8 [2018-11-23 11:22:05,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:22:05,769 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,776 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:05,818 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:69, output treesize:36 [2018-11-23 11:22:05,883 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:05,883 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_21|, v_main_~l~0.base_20, |v_#valid_45|, |v_#memory_int_33|, |v_main_#t~nondet4_25|, |v_#memory_$Pointer$.offset_21|]. (and (= (select |v_#valid_45| main_~l~0.base) (_ bv0 1)) (= (select |v_#valid_45| v_main_~l~0.base_20) (_ bv1 1)) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_21| main_~l~0.base (store (select |v_#memory_$Pointer$.base_21| main_~l~0.base) main_~l~0.offset v_main_~l~0.base_20))) (= (store |v_#memory_int_33| main_~l~0.base (store (store (select |v_#memory_int_33| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)) |v_main_#t~nondet4_25|) main_~l~0.offset (select (select |#memory_int| main_~l~0.base) main_~l~0.offset))) |#memory_int|) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |v_#memory_int_33| v_main_~l~0.base_20) (_ bv4 32)))) (= (store |v_#memory_$Pointer$.offset_21| main_~l~0.base (store (select |v_#memory_$Pointer$.offset_21| main_~l~0.base) main_~l~0.offset (_ bv0 32))) |#memory_$Pointer$.offset|)) [2018-11-23 11:22:05,883 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset))) (and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| .cse0) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= .cse0 main_~l~0.base)))) [2018-11-23 11:22:06,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 11:22:06,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-23 11:22:06,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:06,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:06,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-11-23 11:22:06,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 11:22:06,154 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:06,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:06,183 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:22:06,183 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:17 [2018-11-23 11:22:06,192 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:06,192 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~i~0.base_21, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.offset| v_main_~i~0.base_21) (_ bv0 32))) (.cse0 (select (select |#memory_$Pointer$.base| v_main_~i~0.base_21) (_ bv0 32)))) (and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| .cse0) (_ bv4 32)))) (= .cse1 main_~i~0.offset) (= .cse0 main_~i~0.base) (= (_ bv0 32) .cse1) (not (= .cse0 v_main_~i~0.base_21)))) [2018-11-23 11:22:06,192 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset)) [2018-11-23 11:22:06,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-11-23 11:22:06,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-11-23 11:22:06,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:06,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:06,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:22:06,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:10 [2018-11-23 11:22:06,253 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:06,253 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~i~0.base]. (let ((.cse0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (and (= .cse0 |main_#t~mem9|) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 .cse0)))) [2018-11-23 11:22:06,254 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|))) [2018-11-23 11:22:06,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {6479#true} call ULTIMATE.init(); {6479#true} is VALID [2018-11-23 11:22:06,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {6479#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6479#true} is VALID [2018-11-23 11:22:06,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {6479#true} assume true; {6479#true} is VALID [2018-11-23 11:22:06,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6479#true} {6479#true} #64#return; {6479#true} is VALID [2018-11-23 11:22:06,284 INFO L256 TraceCheckUtils]: 4: Hoare triple {6479#true} call #t~ret12 := main(); {6479#true} is VALID [2018-11-23 11:22:06,285 INFO L273 TraceCheckUtils]: 5: Hoare triple {6479#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {6499#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} is VALID [2018-11-23 11:22:06,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {6499#(= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6503#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:22:06,290 INFO L273 TraceCheckUtils]: 7: Hoare triple {6503#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (= (_ bv1 1) (select |#valid| main_~l~0.base)) (= |main_#t~mem5| (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32)))))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {6507#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-23 11:22:06,291 INFO L273 TraceCheckUtils]: 8: Hoare triple {6507#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6507#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-23 11:22:06,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {6507#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6507#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} is VALID [2018-11-23 11:22:06,298 INFO L273 TraceCheckUtils]: 10: Hoare triple {6507#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))))) (= (_ bv1 1) (select |#valid| main_~l~0.base)))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-23 11:22:06,299 INFO L273 TraceCheckUtils]: 11: Hoare triple {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-23 11:22:06,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-23 11:22:06,302 INFO L273 TraceCheckUtils]: 13: Hoare triple {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-23 11:22:06,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} is VALID [2018-11-23 11:22:06,305 INFO L273 TraceCheckUtils]: 15: Hoare triple {6517#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (= (_ bv0 32) main_~l~0.offset) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (_ bv4 32)))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset)) (not (= (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset) main_~l~0.base)))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:22:06,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:22:06,307 INFO L273 TraceCheckUtils]: 17: Hoare triple {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:22:06,308 INFO L273 TraceCheckUtils]: 18: Hoare triple {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:22:06,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:22:06,310 INFO L273 TraceCheckUtils]: 20: Hoare triple {6533#(and (= (select (select |#memory_$Pointer$.offset| main_~i~0.base) (_ bv0 32)) (_ bv0 32)) (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32))) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~i~0.base) (_ bv0 32)) main_~i~0.base)) (= (_ bv0 32) main_~i~0.offset))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {6549#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} is VALID [2018-11-23 11:22:06,312 INFO L273 TraceCheckUtils]: 21: Hoare triple {6549#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 (select (select |#memory_int| main_~i~0.base) (_ bv4 32)))) (= (_ bv0 32) main_~i~0.offset))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6553#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} is VALID [2018-11-23 11:22:06,312 INFO L273 TraceCheckUtils]: 22: Hoare triple {6553#(and (= (bvadd main_~min~0 (_ bv2147483649 32)) (_ bv0 32)) (not (bvsgt main_~min~0 |main_#t~mem9|)))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6480#false} is VALID [2018-11-23 11:22:06,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {6480#false} assume !false; {6480#false} is VALID [2018-11-23 11:22:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:06,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:22:08,636 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:22:08,644 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:22:08,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 11:22:08,666 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:28 [2018-11-23 11:22:08,722 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:22:08,722 WARN L384 uantifierElimination]: Input elimination task: ∀ [v_main_~l~0.base_21, |main_#t~nondet4|, |v_#memory_int_34|]. (or (not (= (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) (select (select |v_#memory_int_34| v_main_~l~0.base_21) (_ bv0 32)))) |v_#memory_int_34|)) (not (bvslt (select (select |v_#memory_int_34| main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))) [2018-11-23 11:22:08,722 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_main_~l~0.base_21, |main_#t~nondet4|, v_DerPreprocessor_12]. (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_12)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))) [2018-11-23 11:22:11,330 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-11-23 11:22:11,331 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 8 variables, input treesize:55, output treesize:1 [2018-11-23 11:22:11,578 INFO L273 TraceCheckUtils]: 23: Hoare triple {6480#false} assume !false; {6480#false} is VALID [2018-11-23 11:22:11,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {6563#(not (bvslt |main_#t~mem9| main_~min~0))} assume ~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6480#false} is VALID [2018-11-23 11:22:11,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {6567#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6563#(not (bvslt |main_#t~mem9| main_~min~0))} is VALID [2018-11-23 11:22:11,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~i~0.base, ~i~0.offset, 4bv32);~i~0.base, ~i~0.offset := #t~mem11.base, #t~mem11.offset;havoc #t~mem11.base, #t~mem11.offset; {6567#(not (bvslt (select (select |#memory_int| main_~i~0.base) (bvadd main_~i~0.offset (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:11,582 INFO L273 TraceCheckUtils]: 19: Hoare triple {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(#t~mem10, ~max~0);havoc #t~mem10; {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:11,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem10 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:11,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvslt32(#t~mem9, ~min~0);havoc #t~mem9; {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:11,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} assume !!(~i~0.base != 0bv32 || ~i~0.offset != 0bv32);call #t~mem9 := read~intINTTYPE4(~i~0.base, ~bvadd32(4bv32, ~i~0.offset), 4bv32); {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:11,585 INFO L273 TraceCheckUtils]: 15: Hoare triple {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} ~i~0.base, ~i~0.offset := ~l~0.base, ~l~0.offset; {6571#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~i~0.base) main_~i~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~i~0.base) main_~i~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:11,585 INFO L273 TraceCheckUtils]: 14: Hoare triple {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !(0bv32 != #t~nondet2);havoc #t~nondet2; {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:11,586 INFO L273 TraceCheckUtils]: 13: Hoare triple {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvslt32(~max~0, #t~mem7);havoc #t~mem7; {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:11,586 INFO L273 TraceCheckUtils]: 12: Hoare triple {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:11,586 INFO L273 TraceCheckUtils]: 11: Hoare triple {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is VALID [2018-11-23 11:22:13,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {6603#(forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_12)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6587#(not (bvslt (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~l~0.base) main_~l~0.offset)) (bvadd (select (select |#memory_$Pointer$.offset| main_~l~0.base) main_~l~0.offset) (_ bv4 32))) main_~min~0))} is UNKNOWN [2018-11-23 11:22:13,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {6603#(forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_12)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} assume ~bvslt32(~max~0, #t~mem7);havoc #t~mem7;call #t~mem8 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~max~0 := #t~mem8;havoc #t~mem8; {6603#(forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_12)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} is VALID [2018-11-23 11:22:13,652 INFO L273 TraceCheckUtils]: 8: Hoare triple {6603#(forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_12)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} call #t~mem7 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6603#(forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_12)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} is VALID [2018-11-23 11:22:13,652 INFO L273 TraceCheckUtils]: 7: Hoare triple {6613#(or (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_12)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1))))) (bvsgt main_~min~0 |main_#t~mem5|))} assume !~bvsgt32(~min~0, #t~mem5);havoc #t~mem5; {6603#(forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_12)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1)))))} is VALID [2018-11-23 11:22:13,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {6479#true} assume !!(0bv32 != #t~nondet2);havoc #t~nondet2;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8bv32);~p~0.base, ~p~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(#t~nondet4, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);havoc #t~nondet4;call write~$Pointer$(~l~0.base, ~l~0.offset, ~p~0.base, ~p~0.offset, 4bv32);~l~0.base, ~l~0.offset := ~p~0.base, ~p~0.offset;call #t~mem5 := read~intINTTYPE4(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32); {6613#(or (forall ((v_DerPreprocessor_12 (_ BitVec 32)) (v_main_~l~0.base_21 (_ BitVec 32)) (|main_#t~nondet4| (_ BitVec 32))) (or (not (bvslt (select (select (store |#memory_int| v_main_~l~0.base_21 (store (store (select |#memory_int| v_main_~l~0.base_21) (_ bv4 32) |main_#t~nondet4|) (_ bv0 32) v_DerPreprocessor_12)) main_~l~0.base) (bvadd main_~l~0.offset (_ bv4 32))) main_~min~0)) (not (= (select |#valid| v_main_~l~0.base_21) (_ bv0 1))))) (bvsgt main_~min~0 |main_#t~mem5|))} is VALID [2018-11-23 11:22:13,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {6479#true} ~l~0.base, ~l~0.offset := 0bv32, 0bv32;~min~0 := 2147483647bv32;~max~0 := 2147483649bv32; {6479#true} is VALID [2018-11-23 11:22:13,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {6479#true} call #t~ret12 := main(); {6479#true} is VALID [2018-11-23 11:22:13,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6479#true} {6479#true} #64#return; {6479#true} is VALID [2018-11-23 11:22:13,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {6479#true} assume true; {6479#true} is VALID [2018-11-23 11:22:13,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {6479#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6479#true} is VALID [2018-11-23 11:22:13,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {6479#true} call ULTIMATE.init(); {6479#true} is VALID [2018-11-23 11:22:13,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:22:13,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:22:13,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2018-11-23 11:22:13,671 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 11:22:13,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:22:13,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:22:15,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:22:15,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:22:15,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:22:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=168, Unknown=1, NotChecked=0, Total=210 [2018-11-23 11:22:15,903 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand 15 states. [2018-11-23 11:22:40,030 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:22:52,115 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-11-23 11:23:07,661 WARN L180 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 11:23:12,317 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 47