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/loops/insertion_sort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:25:10,126 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:25:10,128 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:25:10,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:25:10,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:25:10,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:25:10,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:25:10,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:25:10,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:25:10,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:25:10,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:25:10,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:25:10,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:25:10,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:25:10,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:25:10,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:25:10,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:25:10,161 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:25:10,169 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:25:10,172 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:25:10,174 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:25:10,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:25:10,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:25:10,181 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:25:10,181 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:25:10,182 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:25:10,183 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:25:10,183 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:25:10,184 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:25:10,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:25:10,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:25:10,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:25:10,186 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:25:10,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:25:10,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:25:10,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:25:10,189 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:25:10,204 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:25:10,204 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:25:10,205 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:25:10,206 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:25:10,206 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:25:10,206 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:25:10,207 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:25:10,207 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:25:10,207 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:25:10,207 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:25:10,207 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:25:10,208 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:25:10,208 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:25:10,208 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:25:10,208 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:25:10,208 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:25:10,209 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:25:10,209 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:25:10,209 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:25:10,209 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:25:10,209 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:25:10,210 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:25:10,210 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:25:10,210 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:25:10,210 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:25:10,210 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:25:10,211 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:25:10,211 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:25:10,211 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:25:10,211 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:25:10,211 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:25:10,212 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:25:10,212 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:25:10,275 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:25:10,292 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:25:10,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:25:10,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:25:10,299 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:25:10,300 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-23 11:25:10,366 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4915cb664/3479de04c391479395136ef509844658/FLAG858221b1f [2018-11-23 11:25:10,816 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:25:10,817 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_true-unreach-call_true-termination.i [2018-11-23 11:25:10,823 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4915cb664/3479de04c391479395136ef509844658/FLAG858221b1f [2018-11-23 11:25:11,185 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4915cb664/3479de04c391479395136ef509844658 [2018-11-23 11:25:11,198 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:25:11,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:25:11,201 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:11,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:25:11,206 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:25:11,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5780fa1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11, skipping insertion in model container [2018-11-23 11:25:11,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,221 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:25:11,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:25:11,506 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:11,512 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:25:11,542 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:25:11,571 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:25:11,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11 WrapperNode [2018-11-23 11:25:11,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:25:11,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:11,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:25:11,573 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:25:11,584 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:25:11" (1/1) ... [2018-11-23 11:25:11,597 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:25:11" (1/1) ... [2018-11-23 11:25:11,607 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:25:11,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:25:11,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:25:11,608 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:25:11,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,636 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11" (1/1) ... [2018-11-23 11:25:11,649 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:25:11,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:25:11,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:25:11,653 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:25:11,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11" (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:25:11,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:25:11,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:25:11,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:25:11,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:25:11,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:25:11,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:25:11,779 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:25:11,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:25:11,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:25:11,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:25:11,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:25:11,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:25:12,395 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:25:12,395 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:25:12,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:12 BoogieIcfgContainer [2018-11-23 11:25:12,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:25:12,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:25:12,398 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:25:12,401 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:25:12,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:25:11" (1/3) ... [2018-11-23 11:25:12,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516d2d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:12, skipping insertion in model container [2018-11-23 11:25:12,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:25:11" (2/3) ... [2018-11-23 11:25:12,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516d2d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:25:12, skipping insertion in model container [2018-11-23 11:25:12,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:25:12" (3/3) ... [2018-11-23 11:25:12,405 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_true-unreach-call_true-termination.i [2018-11-23 11:25:12,416 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:25:12,425 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:25:12,445 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:25:12,479 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:25:12,480 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:25:12,480 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:25:12,480 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:25:12,480 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:25:12,481 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:25:12,481 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:25:12,481 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:25:12,481 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:25:12,506 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 11:25:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:25:12,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:12,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:12,523 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:12,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:12,533 INFO L82 PathProgramCache]: Analyzing trace with hash 637757472, now seen corresponding path program 1 times [2018-11-23 11:25:12,537 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:12,538 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:25:12,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:12,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:12,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:12,709 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 11:25:12,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {31#true} is VALID [2018-11-23 11:25:12,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 11:25:12,714 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #69#return; {31#true} is VALID [2018-11-23 11:25:12,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2018-11-23 11:25:12,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {31#true} is VALID [2018-11-23 11:25:12,717 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 11:25:12,717 INFO L273 TraceCheckUtils]: 7: Hoare triple {32#false} ~k~0 := 1bv32; {32#false} is VALID [2018-11-23 11:25:12,717 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {32#false} is VALID [2018-11-23 11:25:12,718 INFO L256 TraceCheckUtils]: 9: Hoare triple {32#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {32#false} is VALID [2018-11-23 11:25:12,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 11:25:12,718 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} assume 0bv32 == ~cond; {32#false} is VALID [2018-11-23 11:25:12,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 11:25:12,721 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:25:12,722 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:12,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:12,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:25:12,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:25:12,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:12,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:25:12,904 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:12,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:25:12,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:25:12,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:12,919 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 11:25:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:13,200 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2018-11-23 11:25:13,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:25:13,200 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:25:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:13,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 11:25:13,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:25:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 65 transitions. [2018-11-23 11:25:13,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 65 transitions. [2018-11-23 11:25:13,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:13,520 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:25:13,520 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:25:13,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:25:13,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:25:13,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:25:13,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:13,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:25:13,565 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:25:13,565 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:25:13,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:13,570 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:25:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:25:13,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:13,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:13,571 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:25:13,571 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:25:13,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:13,576 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 11:25:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:25:13,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:13,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:13,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:13,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:25:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-11-23 11:25:13,582 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2018-11-23 11:25:13,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:13,582 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-11-23 11:25:13,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:25:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 11:25:13,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:25:13,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:13,584 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:13,584 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:13,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:13,585 INFO L82 PathProgramCache]: Analyzing trace with hash -962501754, now seen corresponding path program 1 times [2018-11-23 11:25:13,585 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:13,586 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:25:13,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:13,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:13,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {213#true} call ULTIMATE.init(); {213#true} is VALID [2018-11-23 11:25:13,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {213#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {213#true} is VALID [2018-11-23 11:25:13,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {213#true} assume true; {213#true} is VALID [2018-11-23 11:25:13,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {213#true} {213#true} #69#return; {213#true} is VALID [2018-11-23 11:25:13,832 INFO L256 TraceCheckUtils]: 4: Hoare triple {213#true} call #t~ret9 := main(); {213#true} is VALID [2018-11-23 11:25:13,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {213#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {233#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:13,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {233#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvult32(~j~0, ~SIZE~0); {237#(not (bvult (_ bv1 32) main_~SIZE~0))} is VALID [2018-11-23 11:25:13,839 INFO L273 TraceCheckUtils]: 7: Hoare triple {237#(not (bvult (_ bv1 32) main_~SIZE~0))} ~k~0 := 1bv32; {241#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:13,844 INFO L273 TraceCheckUtils]: 8: Hoare triple {241#(and (not (bvult (_ bv1 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {214#false} is VALID [2018-11-23 11:25:13,844 INFO L256 TraceCheckUtils]: 9: Hoare triple {214#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {214#false} is VALID [2018-11-23 11:25:13,845 INFO L273 TraceCheckUtils]: 10: Hoare triple {214#false} ~cond := #in~cond; {214#false} is VALID [2018-11-23 11:25:13,845 INFO L273 TraceCheckUtils]: 11: Hoare triple {214#false} assume 0bv32 == ~cond; {214#false} is VALID [2018-11-23 11:25:13,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {214#false} assume !false; {214#false} is VALID [2018-11-23 11:25:13,847 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:25:13,847 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:25:13,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:25:13,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:25:13,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:25:13,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:13,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:25:13,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:13,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:25:13,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:25:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:25:13,892 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 5 states. [2018-11-23 11:25:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:14,753 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 11:25:14,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:25:14,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-23 11:25:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:25:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-23 11:25:14,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:25:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2018-11-23 11:25:14,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2018-11-23 11:25:14,885 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:25:14,887 INFO L225 Difference]: With dead ends: 41 [2018-11-23 11:25:14,887 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:25:14,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:25:14,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:25:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2018-11-23 11:25:14,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:14,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 24 states. [2018-11-23 11:25:14,932 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 24 states. [2018-11-23 11:25:14,932 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 24 states. [2018-11-23 11:25:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:14,936 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:25:14,936 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 11:25:14,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:14,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:14,937 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 29 states. [2018-11-23 11:25:14,937 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 29 states. [2018-11-23 11:25:14,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:14,940 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:25:14,941 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-23 11:25:14,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:14,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:14,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:14,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:25:14,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 11:25:14,944 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2018-11-23 11:25:14,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:14,945 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 11:25:14,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:25:14,945 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 11:25:14,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:25:14,946 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:14,946 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:14,947 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:14,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:14,947 INFO L82 PathProgramCache]: Analyzing trace with hash 513665657, now seen corresponding path program 1 times [2018-11-23 11:25:14,948 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:14,948 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:25:14,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:15,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:15,468 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 11:25:15,613 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 34 treesize of output 25 [2018-11-23 11:25:15,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:25:15,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-23 11:25:15,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:15,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:15,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:15,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:18 [2018-11-23 11:25:16,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 27 treesize of output 19 [2018-11-23 11:25:16,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 4 [2018-11-23 11:25:16,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:16,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:25:16,244 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:25:16,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:4 [2018-11-23 11:25:16,259 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:25:16,259 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#v~0.base|]. (let ((.cse2 (select |#memory_int| |main_~#v~0.base|))) (let ((.cse1 (select .cse2 (_ bv0 32))) (.cse0 (select .cse2 (_ bv4 32)))) (and (= |main_#t~mem8| .cse0) (= .cse1 |main_#t~mem7|) (not (bvsgt .cse1 .cse0))))) [2018-11-23 11:25:16,260 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (not (bvsgt |main_#t~mem7| |main_#t~mem8|)) [2018-11-23 11:25:16,346 INFO L256 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {408#true} is VALID [2018-11-23 11:25:16,346 INFO L273 TraceCheckUtils]: 1: Hoare triple {408#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {408#true} is VALID [2018-11-23 11:25:16,347 INFO L273 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-23 11:25:16,347 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #69#return; {408#true} is VALID [2018-11-23 11:25:16,348 INFO L256 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret9 := main(); {408#true} is VALID [2018-11-23 11:25:16,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {428#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:25:16,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {428#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {432#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:25:16,353 INFO L273 TraceCheckUtils]: 7: Hoare triple {432#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {432#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:25:16,355 INFO L273 TraceCheckUtils]: 8: Hoare triple {432#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {439#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:25:16,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {439#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (or (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) |main_#t~short4|) (and (not |main_#t~short4|) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {443#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-23 11:25:16,373 INFO L273 TraceCheckUtils]: 10: Hoare triple {443#(and (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) main_~key~0) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {447#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:25:16,374 INFO L273 TraceCheckUtils]: 11: Hoare triple {447#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {447#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:25:16,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {447#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !~bvult32(~j~0, ~SIZE~0); {447#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:25:16,375 INFO L273 TraceCheckUtils]: 13: Hoare triple {447#(and (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} ~k~0 := 1bv32; {457#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:25:16,384 INFO L273 TraceCheckUtils]: 14: Hoare triple {457#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {461#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} is VALID [2018-11-23 11:25:16,385 INFO L256 TraceCheckUtils]: 15: Hoare triple {461#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {465#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {465#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {469#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:16,386 INFO L273 TraceCheckUtils]: 17: Hoare triple {469#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {409#false} is VALID [2018-11-23 11:25:16,386 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#false} assume !false; {409#false} is VALID [2018-11-23 11:25:16,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:16,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:17,190 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 65 treesize of output 53 [2018-11-23 11:25:44,083 WARN L180 SmtUtils]: Spent 26.82 s on a formula simplification. DAG size of input: 35 DAG size of output: 31 [2018-11-23 11:25:44,093 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,094 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,095 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,102 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2018-11-23 11:25:44,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:44,122 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:25:44,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:25:44,171 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,172 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,172 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,174 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,175 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,186 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:25:44,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 79 [2018-11-23 11:25:44,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 11:25:44,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:25:44,289 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:25:44,290 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:8 [2018-11-23 11:25:44,301 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:25:44,301 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#v~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#v~0.base|)) (.cse1 (bvmul (_ bv4 32) main_~j~0))) (let ((.cse2 (select .cse0 (bvadd |main_~#v~0.offset| .cse1)))) (or (bvsgt (select .cse0 (bvadd .cse1 |main_~#v~0.offset| (_ bv4294967292 32))) .cse2) (not (let ((.cse3 (store .cse0 (bvadd .cse1 |main_~#v~0.offset|) .cse2))) (bvsgt (select .cse3 |main_~#v~0.offset|) (select .cse3 (bvadd |main_~#v~0.offset| (_ bv4 32))))))))) [2018-11-23 11:25:44,301 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:25:44,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {409#false} assume !false; {409#false} is VALID [2018-11-23 11:25:44,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {479#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {409#false} is VALID [2018-11-23 11:25:44,380 INFO L273 TraceCheckUtils]: 16: Hoare triple {483#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {479#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:25:44,382 INFO L256 TraceCheckUtils]: 15: Hoare triple {461#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {483#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:25:44,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {490#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {461#(not (bvsgt |main_#t~mem7| |main_#t~mem8|))} is VALID [2018-11-23 11:25:44,385 INFO L273 TraceCheckUtils]: 13: Hoare triple {494#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} ~k~0 := 1bv32; {490#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset| (_ bv4294967292 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~k~0) |main_~#v~0.offset|))))} is VALID [2018-11-23 11:25:44,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {494#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} assume !~bvult32(~j~0, ~SIZE~0); {494#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 11:25:44,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {494#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {494#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 11:25:44,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {504#(not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {494#(not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 11:25:44,460 INFO L273 TraceCheckUtils]: 9: Hoare triple {508#(or (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))) |main_#t~short4|)} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {504#(not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 11:25:44,461 INFO L273 TraceCheckUtils]: 8: Hoare triple {512#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {508#(or (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))) |main_#t~short4|)} is VALID [2018-11-23 11:25:44,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {512#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~short4 := ~bvsge32(~i~0, 0bv32); {512#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:25:46,610 INFO L273 TraceCheckUtils]: 6: Hoare triple {519#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {512#(or (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (not (bvsgt (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) |main_~#v~0.offset|) (select (store (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32)) main_~key~0) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is UNKNOWN [2018-11-23 11:25:46,611 INFO L273 TraceCheckUtils]: 5: Hoare triple {408#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {519#(= (_ bv4 32) (bvmul (_ bv4 32) main_~j~0))} is VALID [2018-11-23 11:25:46,612 INFO L256 TraceCheckUtils]: 4: Hoare triple {408#true} call #t~ret9 := main(); {408#true} is VALID [2018-11-23 11:25:46,612 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {408#true} {408#true} #69#return; {408#true} is VALID [2018-11-23 11:25:46,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {408#true} assume true; {408#true} is VALID [2018-11-23 11:25:46,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {408#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {408#true} is VALID [2018-11-23 11:25:46,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {408#true} call ULTIMATE.init(); {408#true} is VALID [2018-11-23 11:25:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:46,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:46,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-23 11:25:46,623 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-23 11:25:46,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:46,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:25:48,916 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:48,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:25:48,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:25:48,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:25:48,918 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 19 states. [2018-11-23 11:25:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:55,003 INFO L93 Difference]: Finished difference Result 86 states and 107 transitions. [2018-11-23 11:25:55,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:25:55,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-11-23 11:25:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:25:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2018-11-23 11:25:55,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:25:55,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 107 transitions. [2018-11-23 11:25:55,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 107 transitions. [2018-11-23 11:25:56,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:56,485 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:25:56,485 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:25:56,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=186, Invalid=744, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:25:56,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:25:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 41. [2018-11-23 11:25:56,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:56,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 41 states. [2018-11-23 11:25:56,588 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 41 states. [2018-11-23 11:25:56,589 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 41 states. [2018-11-23 11:25:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:56,597 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 11:25:56,598 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-23 11:25:56,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:56,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:56,599 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 69 states. [2018-11-23 11:25:56,599 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 69 states. [2018-11-23 11:25:56,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:56,605 INFO L93 Difference]: Finished difference Result 69 states and 85 transitions. [2018-11-23 11:25:56,605 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-11-23 11:25:56,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:56,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:56,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:56,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:56,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:25:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 11:25:56,610 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 19 [2018-11-23 11:25:56,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:56,611 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 11:25:56,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:25:56,611 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 11:25:56,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:25:56,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:56,612 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:56,612 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:56,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:56,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1350570617, now seen corresponding path program 1 times [2018-11-23 11:25:56,614 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:56,614 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:25:56,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:56,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:56,792 INFO L256 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2018-11-23 11:25:56,792 INFO L273 TraceCheckUtils]: 1: Hoare triple {875#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {875#true} is VALID [2018-11-23 11:25:56,793 INFO L273 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2018-11-23 11:25:56,793 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #69#return; {875#true} is VALID [2018-11-23 11:25:56,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret9 := main(); {875#true} is VALID [2018-11-23 11:25:56,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {875#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {895#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:56,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {895#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {899#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:56,798 INFO L273 TraceCheckUtils]: 7: Hoare triple {899#(= main_~i~0 (_ bv0 32))} #t~short4 := ~bvsge32(~i~0, 0bv32); {899#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:56,798 INFO L273 TraceCheckUtils]: 8: Hoare triple {899#(= main_~i~0 (_ bv0 32))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {899#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:25:56,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {899#(= main_~i~0 (_ bv0 32))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {909#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:56,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {909#(= (bvadd main_~i~0 (_ bv1 32)) (_ bv0 32))} #t~short4 := ~bvsge32(~i~0, 0bv32); {913#(not |main_#t~short4|)} is VALID [2018-11-23 11:25:56,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {913#(not |main_#t~short4|)} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {876#false} is VALID [2018-11-23 11:25:56,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {876#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {876#false} is VALID [2018-11-23 11:25:56,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {876#false} #t~short4 := ~bvsge32(~i~0, 0bv32); {876#false} is VALID [2018-11-23 11:25:56,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {876#false} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {876#false} is VALID [2018-11-23 11:25:56,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {876#false} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {876#false} is VALID [2018-11-23 11:25:56,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {876#false} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {876#false} is VALID [2018-11-23 11:25:56,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {876#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {876#false} is VALID [2018-11-23 11:25:56,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {876#false} assume !~bvult32(~j~0, ~SIZE~0); {876#false} is VALID [2018-11-23 11:25:56,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {876#false} ~k~0 := 1bv32; {876#false} is VALID [2018-11-23 11:25:56,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {876#false} is VALID [2018-11-23 11:25:56,803 INFO L256 TraceCheckUtils]: 21: Hoare triple {876#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {876#false} is VALID [2018-11-23 11:25:56,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {876#false} ~cond := #in~cond; {876#false} is VALID [2018-11-23 11:25:56,804 INFO L273 TraceCheckUtils]: 23: Hoare triple {876#false} assume 0bv32 == ~cond; {876#false} is VALID [2018-11-23 11:25:56,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {876#false} assume !false; {876#false} is VALID [2018-11-23 11:25:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:25:56,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:57,004 INFO L273 TraceCheckUtils]: 24: Hoare triple {876#false} assume !false; {876#false} is VALID [2018-11-23 11:25:57,005 INFO L273 TraceCheckUtils]: 23: Hoare triple {876#false} assume 0bv32 == ~cond; {876#false} is VALID [2018-11-23 11:25:57,005 INFO L273 TraceCheckUtils]: 22: Hoare triple {876#false} ~cond := #in~cond; {876#false} is VALID [2018-11-23 11:25:57,005 INFO L256 TraceCheckUtils]: 21: Hoare triple {876#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {876#false} is VALID [2018-11-23 11:25:57,006 INFO L273 TraceCheckUtils]: 20: Hoare triple {876#false} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {876#false} is VALID [2018-11-23 11:25:57,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {876#false} ~k~0 := 1bv32; {876#false} is VALID [2018-11-23 11:25:57,006 INFO L273 TraceCheckUtils]: 18: Hoare triple {876#false} assume !~bvult32(~j~0, ~SIZE~0); {876#false} is VALID [2018-11-23 11:25:57,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {876#false} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {876#false} is VALID [2018-11-23 11:25:57,007 INFO L273 TraceCheckUtils]: 16: Hoare triple {876#false} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {876#false} is VALID [2018-11-23 11:25:57,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {876#false} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {876#false} is VALID [2018-11-23 11:25:57,007 INFO L273 TraceCheckUtils]: 14: Hoare triple {876#false} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {876#false} is VALID [2018-11-23 11:25:57,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {876#false} #t~short4 := ~bvsge32(~i~0, 0bv32); {876#false} is VALID [2018-11-23 11:25:57,008 INFO L273 TraceCheckUtils]: 12: Hoare triple {876#false} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {876#false} is VALID [2018-11-23 11:25:57,010 INFO L273 TraceCheckUtils]: 11: Hoare triple {913#(not |main_#t~short4|)} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {876#false} is VALID [2018-11-23 11:25:57,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {998#(not (bvsge main_~i~0 (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {913#(not |main_#t~short4|)} is VALID [2018-11-23 11:25:57,011 INFO L273 TraceCheckUtils]: 9: Hoare triple {1002#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {998#(not (bvsge main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 11:25:57,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {1002#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1002#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:57,017 INFO L273 TraceCheckUtils]: 7: Hoare triple {1002#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1002#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:57,021 INFO L273 TraceCheckUtils]: 6: Hoare triple {1012#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1002#(not (bvsge (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:57,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {875#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1012#(not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:57,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {875#true} call #t~ret9 := main(); {875#true} is VALID [2018-11-23 11:25:57,023 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {875#true} {875#true} #69#return; {875#true} is VALID [2018-11-23 11:25:57,023 INFO L273 TraceCheckUtils]: 2: Hoare triple {875#true} assume true; {875#true} is VALID [2018-11-23 11:25:57,023 INFO L273 TraceCheckUtils]: 1: Hoare triple {875#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {875#true} is VALID [2018-11-23 11:25:57,023 INFO L256 TraceCheckUtils]: 0: Hoare triple {875#true} call ULTIMATE.init(); {875#true} is VALID [2018-11-23 11:25:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:25:57,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:57,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-11-23 11:25:57,027 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 11:25:57,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:57,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:25:57,076 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:25:57,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:25:57,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:25:57,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:25:57,077 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 9 states. [2018-11-23 11:25:58,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:58,072 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2018-11-23 11:25:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:25:58,072 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 11:25:58,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:25:58,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:25:58,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 11:25:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:25:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 80 transitions. [2018-11-23 11:25:58,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 80 transitions. [2018-11-23 11:25:58,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:58,256 INFO L225 Difference]: With dead ends: 96 [2018-11-23 11:25:58,256 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 11:25:58,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:25:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 11:25:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 44. [2018-11-23 11:25:58,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:25:58,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 44 states. [2018-11-23 11:25:58,319 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 44 states. [2018-11-23 11:25:58,320 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 44 states. [2018-11-23 11:25:58,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:58,325 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 11:25:58,325 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 11:25:58,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:58,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:58,326 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 66 states. [2018-11-23 11:25:58,326 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 66 states. [2018-11-23 11:25:58,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:25:58,333 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 11:25:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 11:25:58,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:25:58,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:25:58,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:25:58,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:25:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 11:25:58,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2018-11-23 11:25:58,339 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 25 [2018-11-23 11:25:58,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:25:58,339 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2018-11-23 11:25:58,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:25:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2018-11-23 11:25:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:25:58,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:25:58,341 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:25:58,341 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:25:58,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:25:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1757940304, now seen corresponding path program 1 times [2018-11-23 11:25:58,342 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:25:58,342 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:25:58,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:25:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:25:58,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:25:59,001 INFO L256 TraceCheckUtils]: 0: Hoare triple {1367#true} call ULTIMATE.init(); {1367#true} is VALID [2018-11-23 11:25:59,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {1367#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1367#true} is VALID [2018-11-23 11:25:59,002 INFO L273 TraceCheckUtils]: 2: Hoare triple {1367#true} assume true; {1367#true} is VALID [2018-11-23 11:25:59,002 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1367#true} {1367#true} #69#return; {1367#true} is VALID [2018-11-23 11:25:59,002 INFO L256 TraceCheckUtils]: 4: Hoare triple {1367#true} call #t~ret9 := main(); {1367#true} is VALID [2018-11-23 11:25:59,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {1367#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1387#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:25:59,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {1387#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:59,013 INFO L273 TraceCheckUtils]: 7: Hoare triple {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:59,019 INFO L273 TraceCheckUtils]: 8: Hoare triple {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:59,020 INFO L273 TraceCheckUtils]: 9: Hoare triple {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:59,021 INFO L273 TraceCheckUtils]: 10: Hoare triple {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:59,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {1391#(and (bvult main_~j~0 main_~SIZE~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1407#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {1407#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (bvult (bvadd main_~j~0 (_ bv4294967295 32)) main_~SIZE~0))} assume !~bvult32(~j~0, ~SIZE~0); {1411#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)))} is VALID [2018-11-23 11:25:59,029 INFO L273 TraceCheckUtils]: 13: Hoare triple {1411#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)))} ~k~0 := 1bv32; {1415#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:59,033 INFO L273 TraceCheckUtils]: 14: Hoare triple {1415#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1415#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:59,033 INFO L256 TraceCheckUtils]: 15: Hoare triple {1415#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1367#true} is VALID [2018-11-23 11:25:59,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {1367#true} ~cond := #in~cond; {1367#true} is VALID [2018-11-23 11:25:59,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {1367#true} assume !(0bv32 == ~cond); {1367#true} is VALID [2018-11-23 11:25:59,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {1367#true} assume true; {1367#true} is VALID [2018-11-23 11:25:59,039 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1367#true} {1415#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #73#return; {1415#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:59,039 INFO L273 TraceCheckUtils]: 20: Hoare triple {1415#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem7;havoc #t~mem8; {1415#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:25:59,040 INFO L273 TraceCheckUtils]: 21: Hoare triple {1415#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1440#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 11:25:59,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {1440#(and (bvult (_ bv1 32) main_~SIZE~0) (not (bvult (_ bv2 32) main_~SIZE~0)) (= (_ bv2 32) main_~k~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1368#false} is VALID [2018-11-23 11:25:59,043 INFO L256 TraceCheckUtils]: 23: Hoare triple {1368#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1368#false} is VALID [2018-11-23 11:25:59,043 INFO L273 TraceCheckUtils]: 24: Hoare triple {1368#false} ~cond := #in~cond; {1368#false} is VALID [2018-11-23 11:25:59,043 INFO L273 TraceCheckUtils]: 25: Hoare triple {1368#false} assume 0bv32 == ~cond; {1368#false} is VALID [2018-11-23 11:25:59,044 INFO L273 TraceCheckUtils]: 26: Hoare triple {1368#false} assume !false; {1368#false} is VALID [2018-11-23 11:25:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:59,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:25:59,295 INFO L273 TraceCheckUtils]: 26: Hoare triple {1368#false} assume !false; {1368#false} is VALID [2018-11-23 11:25:59,295 INFO L273 TraceCheckUtils]: 25: Hoare triple {1368#false} assume 0bv32 == ~cond; {1368#false} is VALID [2018-11-23 11:25:59,296 INFO L273 TraceCheckUtils]: 24: Hoare triple {1368#false} ~cond := #in~cond; {1368#false} is VALID [2018-11-23 11:25:59,296 INFO L256 TraceCheckUtils]: 23: Hoare triple {1368#false} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1368#false} is VALID [2018-11-23 11:25:59,296 INFO L273 TraceCheckUtils]: 22: Hoare triple {1468#(not (bvult main_~k~0 main_~SIZE~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1368#false} is VALID [2018-11-23 11:25:59,297 INFO L273 TraceCheckUtils]: 21: Hoare triple {1472#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} #t~post6 := ~k~0;~k~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1468#(not (bvult main_~k~0 main_~SIZE~0))} is VALID [2018-11-23 11:25:59,297 INFO L273 TraceCheckUtils]: 20: Hoare triple {1472#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} havoc #t~mem7;havoc #t~mem8; {1472#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,298 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {1367#true} {1472#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} #73#return; {1472#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {1367#true} assume true; {1367#true} is VALID [2018-11-23 11:25:59,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {1367#true} assume !(0bv32 == ~cond); {1367#true} is VALID [2018-11-23 11:25:59,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {1367#true} ~cond := #in~cond; {1367#true} is VALID [2018-11-23 11:25:59,299 INFO L256 TraceCheckUtils]: 15: Hoare triple {1472#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1367#true} is VALID [2018-11-23 11:25:59,299 INFO L273 TraceCheckUtils]: 14: Hoare triple {1472#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1472#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,300 INFO L273 TraceCheckUtils]: 13: Hoare triple {1497#(not (bvult (_ bv2 32) main_~SIZE~0))} ~k~0 := 1bv32; {1472#(not (bvult (bvadd main_~k~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {1501#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} assume !~bvult32(~j~0, ~SIZE~0); {1497#(not (bvult (_ bv2 32) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1501#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult main_~j~0 main_~SIZE~0))} is VALID [2018-11-23 11:25:59,303 INFO L273 TraceCheckUtils]: 10: Hoare triple {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,304 INFO L273 TraceCheckUtils]: 8: Hoare triple {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {1521#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1505#(or (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0))} is VALID [2018-11-23 11:25:59,310 INFO L273 TraceCheckUtils]: 5: Hoare triple {1367#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1521#(forall ((main_~SIZE~0 (_ BitVec 32))) (or (not (bvult main_~j~0 main_~SIZE~0)) (not (bvult (_ bv2 32) main_~SIZE~0)) (bvult (bvadd main_~j~0 (_ bv1 32)) main_~SIZE~0)))} is VALID [2018-11-23 11:25:59,311 INFO L256 TraceCheckUtils]: 4: Hoare triple {1367#true} call #t~ret9 := main(); {1367#true} is VALID [2018-11-23 11:25:59,311 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1367#true} {1367#true} #69#return; {1367#true} is VALID [2018-11-23 11:25:59,311 INFO L273 TraceCheckUtils]: 2: Hoare triple {1367#true} assume true; {1367#true} is VALID [2018-11-23 11:25:59,311 INFO L273 TraceCheckUtils]: 1: Hoare triple {1367#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1367#true} is VALID [2018-11-23 11:25:59,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {1367#true} call ULTIMATE.init(); {1367#true} is VALID [2018-11-23 11:25:59,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:25:59,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:25:59,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 11:25:59,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-11-23 11:25:59,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:25:59,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:25:59,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:25:59,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:25:59,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:25:59,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:25:59,389 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand 14 states. [2018-11-23 11:26:00,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:00,293 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2018-11-23 11:26:00,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:26:00,294 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-11-23 11:26:00,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:26:00,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:26:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2018-11-23 11:26:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:26:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 60 transitions. [2018-11-23 11:26:00,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 60 transitions. [2018-11-23 11:26:00,498 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:26:00,500 INFO L225 Difference]: With dead ends: 76 [2018-11-23 11:26:00,501 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 11:26:00,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:26:00,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 11:26:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2018-11-23 11:26:00,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:26:00,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 48 states. [2018-11-23 11:26:00,564 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 48 states. [2018-11-23 11:26:00,565 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 48 states. [2018-11-23 11:26:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:00,567 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-23 11:26:00,567 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-23 11:26:00,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:00,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:00,568 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 60 states. [2018-11-23 11:26:00,568 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 60 states. [2018-11-23 11:26:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:26:00,571 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-23 11:26:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-23 11:26:00,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:26:00,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:26:00,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:26:00,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:26:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:26:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-23 11:26:00,574 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 27 [2018-11-23 11:26:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:26:00,575 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-23 11:26:00,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:26:00,575 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-23 11:26:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 11:26:00,575 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:26:00,576 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:26:00,576 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:26:00,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:26:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1735507290, now seen corresponding path program 2 times [2018-11-23 11:26:00,577 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:26:00,577 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:26:00,594 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:26:00,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:26:00,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:26:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:26:00,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:26:00,795 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 15 treesize of output 12 [2018-11-23 11:26:00,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:26:00,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:26:00,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:26:00,920 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:26:00,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-23 11:26:00,930 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:26:00,931 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, main_~key~0]. (and (= (store |v_#memory_int_16| |main_~#v~0.base| (store (select |v_#memory_int_16| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|) main_~key~0)) |#memory_int|) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32))) [2018-11-23 11:26:00,931 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32))) [2018-11-23 11:26:01,140 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2018-11-23 11:26:01,201 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 35 treesize of output 28 [2018-11-23 11:26:01,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:26:01,213 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:01,223 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 0 case distinctions, treesize of input 28 treesize of output 43 [2018-11-23 11:26:01,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:26:01,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:26:01,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:26:01,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:31 [2018-11-23 11:26:01,279 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:26:01,280 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|, |main_#t~mem3|]. (let ((.cse0 (select |v_#memory_int_17| |main_~#v~0.base|))) (and (bvsgt |main_#t~mem3| main_~key~0) (= (store |v_#memory_int_17| |main_~#v~0.base| (let ((.cse1 (bvmul (_ bv4 32) main_~i~0))) (store .cse0 (bvadd .cse1 |main_~#v~0.offset| (_ bv8 32)) (select .cse0 (bvadd .cse1 |main_~#v~0.offset| (_ bv4 32)))))) |#memory_int|) (= main_~i~0 (_ bv0 32)) (= main_~key~0 (select .cse0 (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)))) [2018-11-23 11:26:01,280 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~mem3|]. (and (bvsgt |main_#t~mem3| main_~key~0) (let ((.cse0 (select |#memory_int| |main_~#v~0.base|)) (.cse1 (bvmul (_ bv4 32) main_~i~0))) (= (select .cse0 (bvadd .cse1 |main_~#v~0.offset| (_ bv4 32))) (select .cse0 (bvadd .cse1 |main_~#v~0.offset| (_ bv8 32))))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32))) [2018-11-23 11:26:01,700 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2018-11-23 11:26:01,913 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 37 treesize of output 28 [2018-11-23 11:26:01,923 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:26:01,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:26:01,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:26:01,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 47 [2018-11-23 11:26:01,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:26:01,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:26:01,995 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:26:01,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2018-11-23 11:26:02,015 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:26:02,015 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, main_~key~0, |main_#t~mem3|]. (let ((.cse1 (bvadd |main_~#v~0.offset| (_ bv4 32))) (.cse0 (select |v_#memory_int_18| |main_~#v~0.base|))) (and (bvsgt |main_#t~mem3| main_~key~0) (= (store |v_#memory_int_18| |main_~#v~0.base| (store .cse0 .cse1 main_~key~0)) |#memory_int|) (not (bvsgt (select .cse0 |main_~#v~0.offset|) main_~key~0)) (= (select .cse0 .cse1) (select .cse0 (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)))) [2018-11-23 11:26:02,016 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~mem3|]. (let ((.cse1 (select |#memory_int| |main_~#v~0.base|))) (let ((.cse0 (select .cse1 (bvadd |main_~#v~0.offset| (_ bv4 32))))) (and (bvsgt |main_#t~mem3| .cse0) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select .cse1 |main_~#v~0.offset|) .cse0))))) [2018-11-23 11:26:02,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 34 treesize of output 24 [2018-11-23 11:26:02,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 8 [2018-11-23 11:26:02,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:26:02,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:26:02,260 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:26:02,261 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:8 [2018-11-23 11:26:02,269 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:26:02,269 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#v~0.base|, |main_#t~mem3|]. (let ((.cse2 (select |#memory_int| |main_~#v~0.base|))) (let ((.cse1 (select .cse2 (_ bv0 32))) (.cse0 (select .cse2 (_ bv4 32)))) (and (bvsgt |main_#t~mem3| .cse0) (= |main_#t~mem8| .cse0) (= .cse1 |main_#t~mem7|) (not (bvsgt .cse1 .cse0))))) [2018-11-23 11:26:02,269 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_#t~mem3|]. (and (bvsgt |main_#t~mem3| |main_#t~mem8|) (not (bvsgt |main_#t~mem7| |main_#t~mem8|))) [2018-11-23 11:26:02,434 INFO L256 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2018-11-23 11:26:02,434 INFO L273 TraceCheckUtils]: 1: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1836#true} is VALID [2018-11-23 11:26:02,434 INFO L273 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2018-11-23 11:26:02,435 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #69#return; {1836#true} is VALID [2018-11-23 11:26:02,435 INFO L256 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret9 := main(); {1836#true} is VALID [2018-11-23 11:26:02,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {1836#true} ~SIZE~0 := #t~nondet0;havoc #t~nondet0;havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~key~0;call ~#v~0.base, ~#v~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~j~0 := 1bv32; {1856#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {1856#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1860#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {1860#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1860#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {1860#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1860#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,438 INFO L273 TraceCheckUtils]: 9: Hoare triple {1860#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1860#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,438 INFO L273 TraceCheckUtils]: 10: Hoare triple {1860#(and (= (bvadd main_~i~0 (_ bv1 32)) main_~j~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1856#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,439 INFO L273 TraceCheckUtils]: 11: Hoare triple {1856#(and (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1876#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {1876#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume !!~bvult32(~j~0, ~SIZE~0);call #t~mem2 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);~key~0 := #t~mem2;havoc #t~mem2;~i~0 := ~bvsub32(~j~0, 1bv32); {1880#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:02,442 INFO L273 TraceCheckUtils]: 13: Hoare triple {1880#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1880#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:26:02,453 INFO L273 TraceCheckUtils]: 14: Hoare triple {1880#(and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1887#(or (and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))} is VALID [2018-11-23 11:26:02,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {1887#(or (and (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= main_~key~0 (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv8 32)))) (= |main_~#v~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))} assume !!#t~short4;havoc #t~mem3;havoc #t~short4;call #t~mem5 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);havoc #t~mem5;~i~0 := ~bvsub32(~i~0, 1bv32); {1891#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,474 INFO L273 TraceCheckUtils]: 16: Hoare triple {1891#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} #t~short4 := ~bvsge32(~i~0, 0bv32); {1891#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} is VALID [2018-11-23 11:26:02,487 INFO L273 TraceCheckUtils]: 17: Hoare triple {1891#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)))} assume #t~short4;call #t~mem3 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);#t~short4 := ~bvsgt32(#t~mem3, ~key~0); {1898#(or (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0))) (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) |main_#t~short4| (= |main_~#v~0.offset| (_ bv0 32))))} is VALID [2018-11-23 11:26:02,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {1898#(or (and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (not |main_#t~short4|) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0))) (and (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) |main_#t~short4| (= |main_~#v~0.offset| (_ bv0 32))))} assume !#t~short4;havoc #t~mem3;havoc #t~short4; {1902#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} is VALID [2018-11-23 11:26:02,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {1902#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| main_~key~0)) (= (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv8 32)))) (= main_~i~0 (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset|)) main_~key~0)))} call write~intINTTYPE4(~key~0, ~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32); {1906#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:26:02,520 INFO L273 TraceCheckUtils]: 20: Hoare triple {1906#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} #t~post1 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1906#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:26:02,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {1906#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !~bvult32(~j~0, ~SIZE~0); {1906#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:26:02,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {1906#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} ~k~0 := 1bv32; {1916#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 11:26:02,541 INFO L273 TraceCheckUtils]: 23: Hoare triple {1916#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#v~0.offset| (_ bv0 32)) (not (bvsgt (select (select |#memory_int| |main_~#v~0.base|) |main_~#v~0.offset|) (select (select |#memory_int| |main_~#v~0.base|) (bvadd |main_~#v~0.offset| (_ bv4 32))))))} assume !!~bvult32(~k~0, ~SIZE~0);call #t~mem7 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~bvsub32(~k~0, 1bv32))), 4bv32);call #t~mem8 := read~intINTTYPE4(~#v~0.base, ~bvadd32(~#v~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32); {1920#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| |main_#t~mem8|)) (not (bvsgt |main_#t~mem7| |main_#t~mem8|)))} is VALID [2018-11-23 11:26:02,543 INFO L256 TraceCheckUtils]: 24: Hoare triple {1920#(and (exists ((|main_#t~mem3| (_ BitVec 32))) (bvsgt |main_#t~mem3| |main_#t~mem8|)) (not (bvsgt |main_#t~mem7| |main_#t~mem8|)))} call __VERIFIER_assert((if ~bvsle32(#t~mem7, #t~mem8) then 1bv32 else 0bv32)); {1924#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:02,543 INFO L273 TraceCheckUtils]: 25: Hoare triple {1924#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1928#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:26:02,544 INFO L273 TraceCheckUtils]: 26: Hoare triple {1928#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1837#false} is VALID [2018-11-23 11:26:02,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2018-11-23 11:26:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:26:02,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:26:05,974 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 11:26:08,527 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:26:09,087 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 11:26:09,148 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 208 treesize of output 188 [2018-11-23 11:26:10,165 WARN L180 SmtUtils]: Spent 637.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 55 [2018-11-23 11:26:10,185 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:10,185 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:10,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 301 treesize of output 267 [2018-11-23 11:26:11,980 WARN L180 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2018-11-23 11:26:12,017 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:12,017 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:12,018 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:12,031 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:12,105 INFO L303 Elim1Store]: Index analysis took 118 ms [2018-11-23 11:26:13,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 167 [2018-11-23 11:26:49,919 WARN L180 SmtUtils]: Spent 36.74 s on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-11-23 11:26:49,980 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:49,994 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:50,003 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:50,041 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:50,057 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:50,058 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:50,075 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:50,076 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:50,086 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:50,129 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:50,161 INFO L303 Elim1Store]: Index analysis took 210 ms [2018-11-23 11:26:50,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 212 [2018-11-23 11:26:50,262 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 11:26:50,350 INFO L267 ElimStorePlain]: Start of recursive call 5: 26 dim-0 vars, End of recursive call: 26 dim-0 vars, and 22 xjuncts. [2018-11-23 11:26:52,413 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4 32)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:26:52,417 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:52,418 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:52,430 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:52,444 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:52,446 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:52,452 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:52,460 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:54,531 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|)) [2018-11-23 11:26:54,566 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:54,600 INFO L303 Elim1Store]: Index analysis took 4231 ms [2018-11-23 11:26:54,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 83 treesize of output 227 [2018-11-23 11:26:54,736 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-23 11:26:55,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 51 dim-0 vars, End of recursive call: 51 dim-0 vars, and 39 xjuncts. [2018-11-23 11:26:55,132 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:26:55,132 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:55,133 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:55,134 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:55,151 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:57,157 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:26:57,174 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:57,189 INFO L303 Elim1Store]: Index analysis took 2066 ms [2018-11-23 11:26:57,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 124 [2018-11-23 11:26:57,210 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 11:26:57,235 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:26:57,235 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:26:59,274 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4 32)) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:26:59,277 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:59,278 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:59,284 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:26:59,303 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:01,478 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:27:03,699 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:27:03,702 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:05,763 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|)) [2018-11-23 11:27:05,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:05,847 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:05,868 INFO L303 Elim1Store]: Index analysis took 8627 ms [2018-11-23 11:27:06,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 81 treesize of output 217 [2018-11-23 11:27:06,012 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-23 11:27:06,500 INFO L267 ElimStorePlain]: Start of recursive call 9: 46 dim-0 vars, End of recursive call: 46 dim-0 vars, and 34 xjuncts. [2018-11-23 11:27:06,506 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:27:06,507 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:27:06,548 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:06,550 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:06,550 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:06,592 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:06,647 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:08,718 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset|) (bvadd |main_~#v~0.offset| (_ bv4 32))) [2018-11-23 11:27:10,877 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= |main_~#v~0.offset| (bvadd (bvmul (_ bv4 32) main_~j~0) |main_~#v~0.offset| (_ bv4294967292 32))) [2018-11-23 11:27:10,880 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:10,893 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:10,931 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:10,982 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:27:11,005 INFO L303 Elim1Store]: Index analysis took 4482 ms [2018-11-23 11:27:11,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 79 treesize of output 202 [2018-11-23 11:27:11,126 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 11:27:11,739 INFO L267 ElimStorePlain]: Start of recursive call 11: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 20 xjuncts.