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/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:30:52,680 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:30:52,682 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:30:52,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:30:52,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:30:52,698 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:30:52,699 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:30:52,701 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:30:52,702 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:30:52,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:30:52,704 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:30:52,705 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:30:52,706 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:30:52,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:30:52,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:30:52,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:30:52,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:30:52,711 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:30:52,714 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:30:52,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:30:52,717 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:30:52,718 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:30:52,721 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:30:52,721 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:30:52,721 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:30:52,722 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:30:52,724 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:30:52,725 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:30:52,728 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:30:52,729 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:30:52,729 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:30:52,730 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:30:52,730 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:30:52,732 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:30:52,733 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:30:52,735 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:30:52,735 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:30:52,766 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:30:52,766 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:30:52,767 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:30:52,767 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:30:52,770 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:30:52,770 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:30:52,770 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:30:52,771 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:30:52,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:30:52,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:30:52,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:30:52,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:30:52,772 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:30:52,772 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:30:52,772 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:30:52,773 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:30:52,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:30:52,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:30:52,773 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:30:52,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:30:52,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:30:52,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:30:52,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:30:52,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:30:52,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:30:52,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:30:52,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:30:52,775 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:30:52,775 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:30:52,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:30:52,776 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:30:52,776 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:30:52,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:30:52,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:30:52,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:30:52,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:30:52,864 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:30:52,864 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:30:52,865 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-23 11:30:52,926 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5fdff749/003600d75649409797cac1604501a412/FLAG4b5070d7f [2018-11-23 11:30:53,390 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:30:53,391 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-23 11:30:53,397 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5fdff749/003600d75649409797cac1604501a412/FLAG4b5070d7f [2018-11-23 11:30:53,774 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5fdff749/003600d75649409797cac1604501a412 [2018-11-23 11:30:53,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:30:53,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:30:53,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:53,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:30:53,792 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:30:53,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:53" (1/1) ... [2018-11-23 11:30:53,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b87042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:53, skipping insertion in model container [2018-11-23 11:30:53,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:30:53" (1/1) ... [2018-11-23 11:30:53,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:30:53,832 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:30:54,087 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:54,094 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:30:54,126 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:30:54,150 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:30:54,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54 WrapperNode [2018-11-23 11:30:54,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:30:54,151 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:54,151 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:30:54,151 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:30:54,160 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:30:54" (1/1) ... [2018-11-23 11:30:54,169 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:30:54" (1/1) ... [2018-11-23 11:30:54,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:30:54,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:30:54,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:30:54,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:30:54,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2018-11-23 11:30:54,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2018-11-23 11:30:54,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2018-11-23 11:30:54,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2018-11-23 11:30:54,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2018-11-23 11:30:54,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2018-11-23 11:30:54,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (1/1) ... [2018-11-23 11:30:54,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:30:54,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:30:54,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:30:54,211 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:30:54,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (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:30:54,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:30:54,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:30:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:30:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:30:54,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:30:54,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:30:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:30:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:30:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:30:54,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:30:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:30:54,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:30:54,889 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:30:54,889 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:30:54,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:54 BoogieIcfgContainer [2018-11-23 11:30:54,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:30:54,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:30:54,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:30:54,894 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:30:54,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:30:53" (1/3) ... [2018-11-23 11:30:54,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2086550a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:54, skipping insertion in model container [2018-11-23 11:30:54,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:30:54" (2/3) ... [2018-11-23 11:30:54,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2086550a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:30:54, skipping insertion in model container [2018-11-23 11:30:54,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:30:54" (3/3) ... [2018-11-23 11:30:54,898 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-23 11:30:54,908 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:30:54,916 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:30:54,935 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:30:54,969 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:30:54,970 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:30:54,970 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:30:54,970 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:30:54,971 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:30:54,971 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:30:54,971 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:30:54,972 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:30:54,972 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:30:54,990 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2018-11-23 11:30:54,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:30:54,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:54,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:55,001 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:55,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:55,008 INFO L82 PathProgramCache]: Analyzing trace with hash -956066777, now seen corresponding path program 1 times [2018-11-23 11:30:55,012 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:55,012 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:30:55,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:55,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:55,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {30#true} call ULTIMATE.init(); {30#true} is VALID [2018-11-23 11:30:55,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {30#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {30#true} is VALID [2018-11-23 11:30:55,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#true} assume true; {30#true} is VALID [2018-11-23 11:30:55,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#true} {30#true} #56#return; {30#true} is VALID [2018-11-23 11:30:55,203 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#true} call #t~ret4 := main(); {30#true} is VALID [2018-11-23 11:30:55,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {30#true} is VALID [2018-11-23 11:30:55,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {30#true} assume !true; {31#false} is VALID [2018-11-23 11:30:55,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#false} ~index~0 := 0bv32; {31#false} is VALID [2018-11-23 11:30:55,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {31#false} assume !!~bvult32(~index~0, 1000bv32); {31#false} is VALID [2018-11-23 11:30:55,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {31#false} assume !(0bv32 == ~bvurem32(~index~0, 2bv32));call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {31#false} is VALID [2018-11-23 11:30:55,213 INFO L256 TraceCheckUtils]: 10: Hoare triple {31#false} call __VERIFIER_assert((if 0bv32 != #t~mem3 then 1bv32 else 0bv32)); {31#false} is VALID [2018-11-23 11:30:55,213 INFO L273 TraceCheckUtils]: 11: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2018-11-23 11:30:55,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0bv32 == ~cond; {31#false} is VALID [2018-11-23 11:30:55,214 INFO L273 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2018-11-23 11:30:55,217 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:30:55,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:55,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:55,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:30:55,230 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:30:55,233 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:55,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:30:55,360 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:55,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:30:55,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:30:55,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:30:55,374 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2018-11-23 11:30:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:55,678 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2018-11-23 11:30:55,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:30:55,678 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:30:55,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:30:55,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2018-11-23 11:30:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:30:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 58 transitions. [2018-11-23 11:30:55,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 58 transitions. [2018-11-23 11:30:55,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:55,930 INFO L225 Difference]: With dead ends: 46 [2018-11-23 11:30:55,931 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 11:30:55,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:30:55,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 11:30:55,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 11:30:55,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:55,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 11:30:55,987 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:30:55,987 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:30:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:55,992 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 11:30:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 11:30:55,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:55,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:55,994 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 11:30:55,994 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 11:30:55,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:55,999 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-11-23 11:30:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 11:30:56,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:56,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:56,000 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:56,000 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:30:56,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-11-23 11:30:56,006 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 14 [2018-11-23 11:30:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:56,006 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-11-23 11:30:56,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:30:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-11-23 11:30:56,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:30:56,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:56,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:56,008 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:56,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1471973101, now seen corresponding path program 1 times [2018-11-23 11:30:56,009 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:56,009 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:30:56,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:56,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:56,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {207#true} call ULTIMATE.init(); {207#true} is VALID [2018-11-23 11:30:56,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {207#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {207#true} is VALID [2018-11-23 11:30:56,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {207#true} assume true; {207#true} is VALID [2018-11-23 11:30:56,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {207#true} {207#true} #56#return; {207#true} is VALID [2018-11-23 11:30:56,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {207#true} call #t~ret4 := main(); {207#true} is VALID [2018-11-23 11:30:56,168 INFO L273 TraceCheckUtils]: 5: Hoare triple {207#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {207#true} is VALID [2018-11-23 11:30:56,168 INFO L273 TraceCheckUtils]: 6: Hoare triple {207#true} assume !~bvult32(~index~0, 1000bv32); {207#true} is VALID [2018-11-23 11:30:56,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {207#true} ~index~0 := 0bv32; {233#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:56,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32); {233#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:56,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {233#(= (_ bv0 32) main_~index~0)} assume !(0bv32 == ~bvurem32(~index~0, 2bv32));call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {208#false} is VALID [2018-11-23 11:30:56,204 INFO L256 TraceCheckUtils]: 10: Hoare triple {208#false} call __VERIFIER_assert((if 0bv32 != #t~mem3 then 1bv32 else 0bv32)); {208#false} is VALID [2018-11-23 11:30:56,204 INFO L273 TraceCheckUtils]: 11: Hoare triple {208#false} ~cond := #in~cond; {208#false} is VALID [2018-11-23 11:30:56,205 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#false} assume 0bv32 == ~cond; {208#false} is VALID [2018-11-23 11:30:56,205 INFO L273 TraceCheckUtils]: 13: Hoare triple {208#false} assume !false; {208#false} is VALID [2018-11-23 11:30:56,206 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:30:56,207 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:30:56,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:30:56,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:30:56,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:30:56,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:56,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:30:56,247 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:56,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:30:56,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:30:56,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:30:56,249 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 3 states. [2018-11-23 11:30:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:56,910 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 11:30:56,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:30:56,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 11:30:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2018-11-23 11:30:56,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:30:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2018-11-23 11:30:56,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2018-11-23 11:30:57,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:57,076 INFO L225 Difference]: With dead ends: 43 [2018-11-23 11:30:57,076 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:30:57,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:30:57,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:30:57,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-11-23 11:30:57,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:57,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 25 states. [2018-11-23 11:30:57,098 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 25 states. [2018-11-23 11:30:57,098 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 25 states. [2018-11-23 11:30:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:57,102 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 11:30:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 11:30:57,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:57,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:57,103 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 29 states. [2018-11-23 11:30:57,104 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 29 states. [2018-11-23 11:30:57,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:57,107 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 11:30:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 11:30:57,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:57,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:57,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:57,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:30:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-23 11:30:57,112 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 14 [2018-11-23 11:30:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:57,112 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-23 11:30:57,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:30:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-23 11:30:57,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:30:57,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:57,113 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:57,114 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:57,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:57,114 INFO L82 PathProgramCache]: Analyzing trace with hash 534952077, now seen corresponding path program 1 times [2018-11-23 11:30:57,115 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:57,115 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:30:57,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:30:57,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:57,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:57,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {404#true} call ULTIMATE.init(); {404#true} is VALID [2018-11-23 11:30:57,296 INFO L273 TraceCheckUtils]: 1: Hoare triple {404#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {404#true} is VALID [2018-11-23 11:30:57,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#true} assume true; {404#true} is VALID [2018-11-23 11:30:57,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {404#true} {404#true} #56#return; {404#true} is VALID [2018-11-23 11:30:57,298 INFO L256 TraceCheckUtils]: 4: Hoare triple {404#true} call #t~ret4 := main(); {404#true} is VALID [2018-11-23 11:30:57,299 INFO L273 TraceCheckUtils]: 5: Hoare triple {404#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {424#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:57,299 INFO L273 TraceCheckUtils]: 6: Hoare triple {424#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {424#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:57,310 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#(= (_ bv0 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {431#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-23 11:30:57,311 INFO L273 TraceCheckUtils]: 8: Hoare triple {431#(= (_ bv1 32) main_~index~0)} assume !~bvult32(~index~0, 1000bv32); {405#false} is VALID [2018-11-23 11:30:57,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {405#false} ~index~0 := 0bv32; {405#false} is VALID [2018-11-23 11:30:57,311 INFO L273 TraceCheckUtils]: 10: Hoare triple {405#false} assume !!~bvult32(~index~0, 1000bv32); {405#false} is VALID [2018-11-23 11:30:57,311 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#false} assume 0bv32 == ~bvurem32(~index~0, 2bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {405#false} is VALID [2018-11-23 11:30:57,312 INFO L256 TraceCheckUtils]: 12: Hoare triple {405#false} call __VERIFIER_assert((if 0bv32 == #t~mem2 then 1bv32 else 0bv32)); {405#false} is VALID [2018-11-23 11:30:57,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#false} ~cond := #in~cond; {405#false} is VALID [2018-11-23 11:30:57,312 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#false} assume 0bv32 == ~cond; {405#false} is VALID [2018-11-23 11:30:57,313 INFO L273 TraceCheckUtils]: 15: Hoare triple {405#false} assume !false; {405#false} is VALID [2018-11-23 11:30:57,319 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:30:57,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:57,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {405#false} assume !false; {405#false} is VALID [2018-11-23 11:30:57,470 INFO L273 TraceCheckUtils]: 14: Hoare triple {405#false} assume 0bv32 == ~cond; {405#false} is VALID [2018-11-23 11:30:57,470 INFO L273 TraceCheckUtils]: 13: Hoare triple {405#false} ~cond := #in~cond; {405#false} is VALID [2018-11-23 11:30:57,471 INFO L256 TraceCheckUtils]: 12: Hoare triple {405#false} call __VERIFIER_assert((if 0bv32 == #t~mem2 then 1bv32 else 0bv32)); {405#false} is VALID [2018-11-23 11:30:57,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#false} assume 0bv32 == ~bvurem32(~index~0, 2bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {405#false} is VALID [2018-11-23 11:30:57,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {405#false} assume !!~bvult32(~index~0, 1000bv32); {405#false} is VALID [2018-11-23 11:30:57,471 INFO L273 TraceCheckUtils]: 9: Hoare triple {405#false} ~index~0 := 0bv32; {405#false} is VALID [2018-11-23 11:30:57,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {477#(bvult main_~index~0 (_ bv1000 32))} assume !~bvult32(~index~0, 1000bv32); {405#false} is VALID [2018-11-23 11:30:57,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {481#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {477#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-23 11:30:57,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {481#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {481#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:57,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {404#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {481#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:57,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {404#true} call #t~ret4 := main(); {404#true} is VALID [2018-11-23 11:30:57,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {404#true} {404#true} #56#return; {404#true} is VALID [2018-11-23 11:30:57,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {404#true} assume true; {404#true} is VALID [2018-11-23 11:30:57,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {404#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {404#true} is VALID [2018-11-23 11:30:57,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {404#true} call ULTIMATE.init(); {404#true} is VALID [2018-11-23 11:30:57,491 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:30:57,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:57,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:30:57,493 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:30:57,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:57,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:30:57,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:57,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:30:57,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:30:57,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:30:57,547 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2018-11-23 11:30:58,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:58,200 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-11-23 11:30:58,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:30:58,200 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 11:30:58,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:30:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-23 11:30:58,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:30:58,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-23 11:30:58,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2018-11-23 11:30:58,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:58,411 INFO L225 Difference]: With dead ends: 61 [2018-11-23 11:30:58,412 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:30:58,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:30:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:30:58,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2018-11-23 11:30:58,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:30:58,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 36 states. [2018-11-23 11:30:58,445 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 36 states. [2018-11-23 11:30:58,445 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 36 states. [2018-11-23 11:30:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:58,451 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 11:30:58,451 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 11:30:58,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:58,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:58,452 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 45 states. [2018-11-23 11:30:58,452 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 45 states. [2018-11-23 11:30:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:30:58,458 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2018-11-23 11:30:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 11:30:58,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:30:58,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:30:58,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:30:58,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:30:58,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:30:58,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-23 11:30:58,463 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 16 [2018-11-23 11:30:58,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:30:58,463 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-23 11:30:58,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:30:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-23 11:30:58,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:30:58,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:30:58,465 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:30:58,465 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:30:58,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:30:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1620459187, now seen corresponding path program 2 times [2018-11-23 11:30:58,466 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:30:58,466 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:30:58,485 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:30:58,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:30:58,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:30:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:30:58,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:30:58,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2018-11-23 11:30:58,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {735#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {735#true} is VALID [2018-11-23 11:30:58,736 INFO L273 TraceCheckUtils]: 2: Hoare triple {735#true} assume true; {735#true} is VALID [2018-11-23 11:30:58,737 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {735#true} {735#true} #56#return; {735#true} is VALID [2018-11-23 11:30:58,737 INFO L256 TraceCheckUtils]: 4: Hoare triple {735#true} call #t~ret4 := main(); {735#true} is VALID [2018-11-23 11:30:58,740 INFO L273 TraceCheckUtils]: 5: Hoare triple {735#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {755#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:58,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {755#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {755#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:30:58,744 INFO L273 TraceCheckUtils]: 7: Hoare triple {755#(= (_ bv0 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {762#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-23 11:30:58,745 INFO L273 TraceCheckUtils]: 8: Hoare triple {762#(= (_ bv1 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {762#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-23 11:30:58,747 INFO L273 TraceCheckUtils]: 9: Hoare triple {762#(= (_ bv1 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {769#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-23 11:30:58,747 INFO L273 TraceCheckUtils]: 10: Hoare triple {769#(= (_ bv2 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {769#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-23 11:30:58,749 INFO L273 TraceCheckUtils]: 11: Hoare triple {769#(= (_ bv2 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {776#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:30:58,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {776#(= (_ bv3 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {776#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:30:58,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {776#(= (_ bv3 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {783#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-23 11:30:58,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {783#(= (_ bv4 32) main_~index~0)} assume !~bvult32(~index~0, 1000bv32); {736#false} is VALID [2018-11-23 11:30:58,752 INFO L273 TraceCheckUtils]: 15: Hoare triple {736#false} ~index~0 := 0bv32; {736#false} is VALID [2018-11-23 11:30:58,752 INFO L273 TraceCheckUtils]: 16: Hoare triple {736#false} assume !!~bvult32(~index~0, 1000bv32); {736#false} is VALID [2018-11-23 11:30:58,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {736#false} assume 0bv32 == ~bvurem32(~index~0, 2bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {736#false} is VALID [2018-11-23 11:30:58,753 INFO L256 TraceCheckUtils]: 18: Hoare triple {736#false} call __VERIFIER_assert((if 0bv32 == #t~mem2 then 1bv32 else 0bv32)); {736#false} is VALID [2018-11-23 11:30:58,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2018-11-23 11:30:58,753 INFO L273 TraceCheckUtils]: 20: Hoare triple {736#false} assume 0bv32 == ~cond; {736#false} is VALID [2018-11-23 11:30:58,753 INFO L273 TraceCheckUtils]: 21: Hoare triple {736#false} assume !false; {736#false} is VALID [2018-11-23 11:30:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:58,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:30:58,898 INFO L273 TraceCheckUtils]: 21: Hoare triple {736#false} assume !false; {736#false} is VALID [2018-11-23 11:30:58,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {736#false} assume 0bv32 == ~cond; {736#false} is VALID [2018-11-23 11:30:58,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2018-11-23 11:30:58,900 INFO L256 TraceCheckUtils]: 18: Hoare triple {736#false} call __VERIFIER_assert((if 0bv32 == #t~mem2 then 1bv32 else 0bv32)); {736#false} is VALID [2018-11-23 11:30:58,901 INFO L273 TraceCheckUtils]: 17: Hoare triple {736#false} assume 0bv32 == ~bvurem32(~index~0, 2bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {736#false} is VALID [2018-11-23 11:30:58,901 INFO L273 TraceCheckUtils]: 16: Hoare triple {736#false} assume !!~bvult32(~index~0, 1000bv32); {736#false} is VALID [2018-11-23 11:30:58,902 INFO L273 TraceCheckUtils]: 15: Hoare triple {736#false} ~index~0 := 0bv32; {736#false} is VALID [2018-11-23 11:30:58,902 INFO L273 TraceCheckUtils]: 14: Hoare triple {829#(bvult main_~index~0 (_ bv1000 32))} assume !~bvult32(~index~0, 1000bv32); {736#false} is VALID [2018-11-23 11:30:58,906 INFO L273 TraceCheckUtils]: 13: Hoare triple {833#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {829#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-23 11:30:58,907 INFO L273 TraceCheckUtils]: 12: Hoare triple {833#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {833#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:58,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {840#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {833#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:58,914 INFO L273 TraceCheckUtils]: 10: Hoare triple {840#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {840#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:58,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {847#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {840#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:58,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {847#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {847#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:58,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {854#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {847#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:58,930 INFO L273 TraceCheckUtils]: 6: Hoare triple {854#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {854#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:58,931 INFO L273 TraceCheckUtils]: 5: Hoare triple {735#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {854#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-23 11:30:58,931 INFO L256 TraceCheckUtils]: 4: Hoare triple {735#true} call #t~ret4 := main(); {735#true} is VALID [2018-11-23 11:30:58,931 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {735#true} {735#true} #56#return; {735#true} is VALID [2018-11-23 11:30:58,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {735#true} assume true; {735#true} is VALID [2018-11-23 11:30:58,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {735#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {735#true} is VALID [2018-11-23 11:30:58,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2018-11-23 11:30:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:30:58,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:30:58,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:30:58,938 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 11:30:58,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:30:58,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:30:59,011 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:30:59,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:30:59,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:30:59,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:30:59,013 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 12 states. [2018-11-23 11:31:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:01,240 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2018-11-23 11:31:01,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:31:01,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 11:31:01,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:01,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:31:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2018-11-23 11:31:01,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:31:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 128 transitions. [2018-11-23 11:31:01,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 128 transitions. [2018-11-23 11:31:01,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:01,530 INFO L225 Difference]: With dead ends: 108 [2018-11-23 11:31:01,531 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 11:31:01,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:31:01,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 11:31:01,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 63. [2018-11-23 11:31:01,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:01,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 63 states. [2018-11-23 11:31:01,650 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 63 states. [2018-11-23 11:31:01,650 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 63 states. [2018-11-23 11:31:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:01,656 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2018-11-23 11:31:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2018-11-23 11:31:01,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:01,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:01,659 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 87 states. [2018-11-23 11:31:01,659 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 87 states. [2018-11-23 11:31:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:01,668 INFO L93 Difference]: Finished difference Result 87 states and 103 transitions. [2018-11-23 11:31:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2018-11-23 11:31:01,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:01,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:01,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:01,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 11:31:01,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-23 11:31:01,680 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 22 [2018-11-23 11:31:01,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:01,680 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-23 11:31:01,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:31:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-23 11:31:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:31:01,681 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:01,682 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:01,682 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:01,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash 893881727, now seen corresponding path program 3 times [2018-11-23 11:31:01,683 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:01,683 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:31:01,700 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:31:02,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 11:31:02,135 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:31:02,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:02,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:31:02,396 INFO L256 TraceCheckUtils]: 0: Hoare triple {1304#true} call ULTIMATE.init(); {1304#true} is VALID [2018-11-23 11:31:02,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {1304#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1304#true} is VALID [2018-11-23 11:31:02,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:31:02,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1304#true} {1304#true} #56#return; {1304#true} is VALID [2018-11-23 11:31:02,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {1304#true} call #t~ret4 := main(); {1304#true} is VALID [2018-11-23 11:31:02,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {1304#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {1324#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:31:02,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {1324#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1324#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:31:02,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {1324#(= (_ bv0 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1331#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-23 11:31:02,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {1331#(= (_ bv1 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1331#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-23 11:31:02,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {1331#(= (_ bv1 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1338#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-23 11:31:02,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {1338#(= (_ bv2 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1338#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-23 11:31:02,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {1338#(= (_ bv2 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1345#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:31:02,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {1345#(= (_ bv3 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1345#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:31:02,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {1345#(= (_ bv3 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1352#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-23 11:31:02,410 INFO L273 TraceCheckUtils]: 14: Hoare triple {1352#(= (_ bv4 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1352#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-23 11:31:02,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {1352#(= (_ bv4 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1359#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-23 11:31:02,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {1359#(= (_ bv5 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1359#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-23 11:31:02,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {1359#(= (_ bv5 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1366#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-23 11:31:02,428 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#(= (_ bv6 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1366#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-23 11:31:02,432 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#(= (_ bv6 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1373#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-23 11:31:02,433 INFO L273 TraceCheckUtils]: 20: Hoare triple {1373#(= (_ bv7 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1373#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-23 11:31:02,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {1373#(= (_ bv7 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1380#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-23 11:31:02,435 INFO L273 TraceCheckUtils]: 22: Hoare triple {1380#(= (_ bv8 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1380#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-23 11:31:02,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {1380#(= (_ bv8 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1387#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-23 11:31:02,442 INFO L273 TraceCheckUtils]: 24: Hoare triple {1387#(= (_ bv9 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1387#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-23 11:31:02,447 INFO L273 TraceCheckUtils]: 25: Hoare triple {1387#(= (_ bv9 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1394#(= (_ bv10 32) main_~index~0)} is VALID [2018-11-23 11:31:02,447 INFO L273 TraceCheckUtils]: 26: Hoare triple {1394#(= (_ bv10 32) main_~index~0)} assume !~bvult32(~index~0, 1000bv32); {1305#false} is VALID [2018-11-23 11:31:02,448 INFO L273 TraceCheckUtils]: 27: Hoare triple {1305#false} ~index~0 := 0bv32; {1305#false} is VALID [2018-11-23 11:31:02,448 INFO L273 TraceCheckUtils]: 28: Hoare triple {1305#false} assume !!~bvult32(~index~0, 1000bv32); {1305#false} is VALID [2018-11-23 11:31:02,448 INFO L273 TraceCheckUtils]: 29: Hoare triple {1305#false} assume 0bv32 == ~bvurem32(~index~0, 2bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1305#false} is VALID [2018-11-23 11:31:02,448 INFO L256 TraceCheckUtils]: 30: Hoare triple {1305#false} call __VERIFIER_assert((if 0bv32 == #t~mem2 then 1bv32 else 0bv32)); {1305#false} is VALID [2018-11-23 11:31:02,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {1305#false} ~cond := #in~cond; {1305#false} is VALID [2018-11-23 11:31:02,449 INFO L273 TraceCheckUtils]: 32: Hoare triple {1305#false} assume 0bv32 == ~cond; {1305#false} is VALID [2018-11-23 11:31:02,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {1305#false} assume !false; {1305#false} is VALID [2018-11-23 11:31:02,451 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:02,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:31:03,232 INFO L273 TraceCheckUtils]: 33: Hoare triple {1305#false} assume !false; {1305#false} is VALID [2018-11-23 11:31:03,233 INFO L273 TraceCheckUtils]: 32: Hoare triple {1305#false} assume 0bv32 == ~cond; {1305#false} is VALID [2018-11-23 11:31:03,233 INFO L273 TraceCheckUtils]: 31: Hoare triple {1305#false} ~cond := #in~cond; {1305#false} is VALID [2018-11-23 11:31:03,233 INFO L256 TraceCheckUtils]: 30: Hoare triple {1305#false} call __VERIFIER_assert((if 0bv32 == #t~mem2 then 1bv32 else 0bv32)); {1305#false} is VALID [2018-11-23 11:31:03,234 INFO L273 TraceCheckUtils]: 29: Hoare triple {1305#false} assume 0bv32 == ~bvurem32(~index~0, 2bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1305#false} is VALID [2018-11-23 11:31:03,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {1305#false} assume !!~bvult32(~index~0, 1000bv32); {1305#false} is VALID [2018-11-23 11:31:03,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {1305#false} ~index~0 := 0bv32; {1305#false} is VALID [2018-11-23 11:31:03,235 INFO L273 TraceCheckUtils]: 26: Hoare triple {1440#(bvult main_~index~0 (_ bv1000 32))} assume !~bvult32(~index~0, 1000bv32); {1305#false} is VALID [2018-11-23 11:31:03,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {1444#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1440#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-23 11:31:03,240 INFO L273 TraceCheckUtils]: 24: Hoare triple {1448#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1444#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:03,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {1452#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1448#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,243 INFO L273 TraceCheckUtils]: 22: Hoare triple {1452#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1452#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,248 INFO L273 TraceCheckUtils]: 21: Hoare triple {1459#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1452#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,248 INFO L273 TraceCheckUtils]: 20: Hoare triple {1459#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1459#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {1466#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1459#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,253 INFO L273 TraceCheckUtils]: 18: Hoare triple {1466#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1466#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} is VALID [2018-11-23 11:31:03,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {1473#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1466#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} is VALID [2018-11-23 11:31:03,258 INFO L273 TraceCheckUtils]: 16: Hoare triple {1473#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1473#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} is VALID [2018-11-23 11:31:03,262 INFO L273 TraceCheckUtils]: 15: Hoare triple {1480#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1473#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} is VALID [2018-11-23 11:31:03,263 INFO L273 TraceCheckUtils]: 14: Hoare triple {1480#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1480#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {1487#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1480#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {1487#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1487#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {1494#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1487#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,279 INFO L273 TraceCheckUtils]: 10: Hoare triple {1494#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1494#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {1501#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1494#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {1501#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1501#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {1508#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1501#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,288 INFO L273 TraceCheckUtils]: 6: Hoare triple {1508#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1508#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,289 INFO L273 TraceCheckUtils]: 5: Hoare triple {1304#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {1508#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} is VALID [2018-11-23 11:31:03,289 INFO L256 TraceCheckUtils]: 4: Hoare triple {1304#true} call #t~ret4 := main(); {1304#true} is VALID [2018-11-23 11:31:03,289 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1304#true} {1304#true} #56#return; {1304#true} is VALID [2018-11-23 11:31:03,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {1304#true} assume true; {1304#true} is VALID [2018-11-23 11:31:03,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {1304#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1304#true} is VALID [2018-11-23 11:31:03,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {1304#true} call ULTIMATE.init(); {1304#true} is VALID [2018-11-23 11:31:03,295 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:03,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:31:03,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-11-23 11:31:03,301 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-11-23 11:31:03,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:03,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:31:03,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:03,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:31:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:31:03,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:31:03,487 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 25 states. [2018-11-23 11:31:05,140 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 11:31:05,412 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 7 [2018-11-23 11:31:05,678 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 7 [2018-11-23 11:31:05,916 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 7 [2018-11-23 11:31:06,152 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 7 [2018-11-23 11:31:07,370 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-23 11:31:11,741 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 15 [2018-11-23 11:31:12,361 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 15 [2018-11-23 11:31:12,906 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 15 [2018-11-23 11:31:13,287 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-11-23 11:31:13,983 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2018-11-23 11:31:14,638 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2018-11-23 11:31:15,103 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2018-11-23 11:31:15,762 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-11-23 11:31:16,562 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-23 11:31:17,033 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-11-23 11:31:19,166 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2018-11-23 11:31:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:19,205 INFO L93 Difference]: Finished difference Result 207 states and 265 transitions. [2018-11-23 11:31:19,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:31:19,206 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-11-23 11:31:19,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:19,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:31:19,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 239 transitions. [2018-11-23 11:31:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:31:19,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 239 transitions. [2018-11-23 11:31:19,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 239 transitions. [2018-11-23 11:31:19,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:19,910 INFO L225 Difference]: With dead ends: 207 [2018-11-23 11:31:19,911 INFO L226 Difference]: Without dead ends: 171 [2018-11-23 11:31:19,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=864, Invalid=1586, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 11:31:19,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-23 11:31:20,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 117. [2018-11-23 11:31:20,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:31:20,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand 117 states. [2018-11-23 11:31:20,057 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand 117 states. [2018-11-23 11:31:20,057 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 117 states. [2018-11-23 11:31:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:20,067 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2018-11-23 11:31:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2018-11-23 11:31:20,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:20,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:20,068 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 171 states. [2018-11-23 11:31:20,068 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 171 states. [2018-11-23 11:31:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:20,077 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2018-11-23 11:31:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 205 transitions. [2018-11-23 11:31:20,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:31:20,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:31:20,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:31:20,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:31:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-11-23 11:31:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2018-11-23 11:31:20,085 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 34 [2018-11-23 11:31:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:31:20,085 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2018-11-23 11:31:20,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:31:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2018-11-23 11:31:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 11:31:20,087 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:31:20,087 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:31:20,087 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:31:20,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:31:20,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1535003369, now seen corresponding path program 4 times [2018-11-23 11:31:20,088 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:31:20,088 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:31:20,113 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:31:20,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:31:20,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:31:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:31:20,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:31:20,660 INFO L256 TraceCheckUtils]: 0: Hoare triple {2387#true} call ULTIMATE.init(); {2387#true} is VALID [2018-11-23 11:31:20,660 INFO L273 TraceCheckUtils]: 1: Hoare triple {2387#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2387#true} is VALID [2018-11-23 11:31:20,661 INFO L273 TraceCheckUtils]: 2: Hoare triple {2387#true} assume true; {2387#true} is VALID [2018-11-23 11:31:20,661 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2387#true} {2387#true} #56#return; {2387#true} is VALID [2018-11-23 11:31:20,661 INFO L256 TraceCheckUtils]: 4: Hoare triple {2387#true} call #t~ret4 := main(); {2387#true} is VALID [2018-11-23 11:31:20,662 INFO L273 TraceCheckUtils]: 5: Hoare triple {2387#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {2407#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:31:20,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {2407#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2407#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-23 11:31:20,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {2407#(= (_ bv0 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2414#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-23 11:31:20,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {2414#(= (_ bv1 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2414#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-23 11:31:20,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {2414#(= (_ bv1 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2421#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-23 11:31:20,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {2421#(= (_ bv2 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2421#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-23 11:31:20,665 INFO L273 TraceCheckUtils]: 11: Hoare triple {2421#(= (_ bv2 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2428#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:31:20,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {2428#(= (_ bv3 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2428#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-23 11:31:20,666 INFO L273 TraceCheckUtils]: 13: Hoare triple {2428#(= (_ bv3 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2435#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-23 11:31:20,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {2435#(= (_ bv4 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2435#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-23 11:31:20,667 INFO L273 TraceCheckUtils]: 15: Hoare triple {2435#(= (_ bv4 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2442#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-23 11:31:20,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {2442#(= (_ bv5 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2442#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-23 11:31:20,694 INFO L273 TraceCheckUtils]: 17: Hoare triple {2442#(= (_ bv5 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2449#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-23 11:31:20,706 INFO L273 TraceCheckUtils]: 18: Hoare triple {2449#(= (_ bv6 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2449#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-23 11:31:20,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {2449#(= (_ bv6 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2456#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-23 11:31:20,714 INFO L273 TraceCheckUtils]: 20: Hoare triple {2456#(= (_ bv7 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2456#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-23 11:31:20,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {2456#(= (_ bv7 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2463#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-23 11:31:20,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {2463#(= (_ bv8 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2463#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-23 11:31:20,715 INFO L273 TraceCheckUtils]: 23: Hoare triple {2463#(= (_ bv8 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2470#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-23 11:31:20,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {2470#(= (_ bv9 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2470#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-23 11:31:20,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {2470#(= (_ bv9 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2477#(= (_ bv10 32) main_~index~0)} is VALID [2018-11-23 11:31:20,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {2477#(= (_ bv10 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2477#(= (_ bv10 32) main_~index~0)} is VALID [2018-11-23 11:31:20,717 INFO L273 TraceCheckUtils]: 27: Hoare triple {2477#(= (_ bv10 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2484#(= (_ bv11 32) main_~index~0)} is VALID [2018-11-23 11:31:20,717 INFO L273 TraceCheckUtils]: 28: Hoare triple {2484#(= (_ bv11 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2484#(= (_ bv11 32) main_~index~0)} is VALID [2018-11-23 11:31:20,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {2484#(= (_ bv11 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2491#(= (_ bv12 32) main_~index~0)} is VALID [2018-11-23 11:31:20,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {2491#(= (_ bv12 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2491#(= (_ bv12 32) main_~index~0)} is VALID [2018-11-23 11:31:20,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {2491#(= (_ bv12 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2498#(= (_ bv13 32) main_~index~0)} is VALID [2018-11-23 11:31:20,727 INFO L273 TraceCheckUtils]: 32: Hoare triple {2498#(= (_ bv13 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2498#(= (_ bv13 32) main_~index~0)} is VALID [2018-11-23 11:31:20,728 INFO L273 TraceCheckUtils]: 33: Hoare triple {2498#(= (_ bv13 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2505#(= (_ bv14 32) main_~index~0)} is VALID [2018-11-23 11:31:20,728 INFO L273 TraceCheckUtils]: 34: Hoare triple {2505#(= (_ bv14 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2505#(= (_ bv14 32) main_~index~0)} is VALID [2018-11-23 11:31:20,728 INFO L273 TraceCheckUtils]: 35: Hoare triple {2505#(= (_ bv14 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2512#(= (_ bv15 32) main_~index~0)} is VALID [2018-11-23 11:31:20,729 INFO L273 TraceCheckUtils]: 36: Hoare triple {2512#(= (_ bv15 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2512#(= (_ bv15 32) main_~index~0)} is VALID [2018-11-23 11:31:20,729 INFO L273 TraceCheckUtils]: 37: Hoare triple {2512#(= (_ bv15 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2519#(= (_ bv16 32) main_~index~0)} is VALID [2018-11-23 11:31:20,730 INFO L273 TraceCheckUtils]: 38: Hoare triple {2519#(= (_ bv16 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2519#(= (_ bv16 32) main_~index~0)} is VALID [2018-11-23 11:31:20,730 INFO L273 TraceCheckUtils]: 39: Hoare triple {2519#(= (_ bv16 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2526#(= (_ bv17 32) main_~index~0)} is VALID [2018-11-23 11:31:20,730 INFO L273 TraceCheckUtils]: 40: Hoare triple {2526#(= (_ bv17 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2526#(= (_ bv17 32) main_~index~0)} is VALID [2018-11-23 11:31:20,731 INFO L273 TraceCheckUtils]: 41: Hoare triple {2526#(= (_ bv17 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2533#(= (_ bv18 32) main_~index~0)} is VALID [2018-11-23 11:31:20,731 INFO L273 TraceCheckUtils]: 42: Hoare triple {2533#(= (_ bv18 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2533#(= (_ bv18 32) main_~index~0)} is VALID [2018-11-23 11:31:20,732 INFO L273 TraceCheckUtils]: 43: Hoare triple {2533#(= (_ bv18 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2540#(= (_ bv19 32) main_~index~0)} is VALID [2018-11-23 11:31:20,733 INFO L273 TraceCheckUtils]: 44: Hoare triple {2540#(= (_ bv19 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2540#(= (_ bv19 32) main_~index~0)} is VALID [2018-11-23 11:31:20,733 INFO L273 TraceCheckUtils]: 45: Hoare triple {2540#(= (_ bv19 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2547#(= (_ bv20 32) main_~index~0)} is VALID [2018-11-23 11:31:20,734 INFO L273 TraceCheckUtils]: 46: Hoare triple {2547#(= (_ bv20 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2547#(= (_ bv20 32) main_~index~0)} is VALID [2018-11-23 11:31:20,735 INFO L273 TraceCheckUtils]: 47: Hoare triple {2547#(= (_ bv20 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2554#(= (_ bv21 32) main_~index~0)} is VALID [2018-11-23 11:31:20,735 INFO L273 TraceCheckUtils]: 48: Hoare triple {2554#(= (_ bv21 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2554#(= (_ bv21 32) main_~index~0)} is VALID [2018-11-23 11:31:20,736 INFO L273 TraceCheckUtils]: 49: Hoare triple {2554#(= (_ bv21 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2561#(= (_ bv22 32) main_~index~0)} is VALID [2018-11-23 11:31:20,737 INFO L273 TraceCheckUtils]: 50: Hoare triple {2561#(= (_ bv22 32) main_~index~0)} assume !~bvult32(~index~0, 1000bv32); {2388#false} is VALID [2018-11-23 11:31:20,737 INFO L273 TraceCheckUtils]: 51: Hoare triple {2388#false} ~index~0 := 0bv32; {2388#false} is VALID [2018-11-23 11:31:20,737 INFO L273 TraceCheckUtils]: 52: Hoare triple {2388#false} assume !!~bvult32(~index~0, 1000bv32); {2388#false} is VALID [2018-11-23 11:31:20,738 INFO L273 TraceCheckUtils]: 53: Hoare triple {2388#false} assume 0bv32 == ~bvurem32(~index~0, 2bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2388#false} is VALID [2018-11-23 11:31:20,738 INFO L256 TraceCheckUtils]: 54: Hoare triple {2388#false} call __VERIFIER_assert((if 0bv32 == #t~mem2 then 1bv32 else 0bv32)); {2388#false} is VALID [2018-11-23 11:31:20,738 INFO L273 TraceCheckUtils]: 55: Hoare triple {2388#false} ~cond := #in~cond; {2388#false} is VALID [2018-11-23 11:31:20,738 INFO L273 TraceCheckUtils]: 56: Hoare triple {2388#false} assume 0bv32 == ~cond; {2388#false} is VALID [2018-11-23 11:31:20,739 INFO L273 TraceCheckUtils]: 57: Hoare triple {2388#false} assume !false; {2388#false} is VALID [2018-11-23 11:31:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:20,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:31:22,648 INFO L273 TraceCheckUtils]: 57: Hoare triple {2388#false} assume !false; {2388#false} is VALID [2018-11-23 11:31:22,649 INFO L273 TraceCheckUtils]: 56: Hoare triple {2388#false} assume 0bv32 == ~cond; {2388#false} is VALID [2018-11-23 11:31:22,649 INFO L273 TraceCheckUtils]: 55: Hoare triple {2388#false} ~cond := #in~cond; {2388#false} is VALID [2018-11-23 11:31:22,650 INFO L256 TraceCheckUtils]: 54: Hoare triple {2388#false} call __VERIFIER_assert((if 0bv32 == #t~mem2 then 1bv32 else 0bv32)); {2388#false} is VALID [2018-11-23 11:31:22,650 INFO L273 TraceCheckUtils]: 53: Hoare triple {2388#false} assume 0bv32 == ~bvurem32(~index~0, 2bv32);call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2388#false} is VALID [2018-11-23 11:31:22,650 INFO L273 TraceCheckUtils]: 52: Hoare triple {2388#false} assume !!~bvult32(~index~0, 1000bv32); {2388#false} is VALID [2018-11-23 11:31:22,650 INFO L273 TraceCheckUtils]: 51: Hoare triple {2388#false} ~index~0 := 0bv32; {2388#false} is VALID [2018-11-23 11:31:22,651 INFO L273 TraceCheckUtils]: 50: Hoare triple {2607#(bvult main_~index~0 (_ bv1000 32))} assume !~bvult32(~index~0, 1000bv32); {2388#false} is VALID [2018-11-23 11:31:22,655 INFO L273 TraceCheckUtils]: 49: Hoare triple {2611#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2607#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-23 11:31:22,656 INFO L273 TraceCheckUtils]: 48: Hoare triple {2611#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2611#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,661 INFO L273 TraceCheckUtils]: 47: Hoare triple {2618#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2611#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,661 INFO L273 TraceCheckUtils]: 46: Hoare triple {2618#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2618#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,668 INFO L273 TraceCheckUtils]: 45: Hoare triple {2625#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2618#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,669 INFO L273 TraceCheckUtils]: 44: Hoare triple {2625#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2625#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,674 INFO L273 TraceCheckUtils]: 43: Hoare triple {2632#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2625#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {2632#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2632#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,680 INFO L273 TraceCheckUtils]: 41: Hoare triple {2639#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2632#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,681 INFO L273 TraceCheckUtils]: 40: Hoare triple {2639#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2639#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,688 INFO L273 TraceCheckUtils]: 39: Hoare triple {2646#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2639#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,690 INFO L273 TraceCheckUtils]: 38: Hoare triple {2646#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2646#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,694 INFO L273 TraceCheckUtils]: 37: Hoare triple {2653#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2646#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {2653#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2653#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,698 INFO L273 TraceCheckUtils]: 35: Hoare triple {2660#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2653#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {2660#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2660#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,706 INFO L273 TraceCheckUtils]: 33: Hoare triple {2667#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2660#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,709 INFO L273 TraceCheckUtils]: 32: Hoare triple {2667#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2667#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,716 INFO L273 TraceCheckUtils]: 31: Hoare triple {2674#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2667#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,716 INFO L273 TraceCheckUtils]: 30: Hoare triple {2674#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2674#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,721 INFO L273 TraceCheckUtils]: 29: Hoare triple {2681#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2674#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,722 INFO L273 TraceCheckUtils]: 28: Hoare triple {2681#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2681#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {2688#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2681#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,728 INFO L273 TraceCheckUtils]: 26: Hoare triple {2688#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2688#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,734 INFO L273 TraceCheckUtils]: 25: Hoare triple {2695#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2688#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {2695#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2695#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,742 INFO L273 TraceCheckUtils]: 23: Hoare triple {2702#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2695#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,743 INFO L273 TraceCheckUtils]: 22: Hoare triple {2702#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2702#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,748 INFO L273 TraceCheckUtils]: 21: Hoare triple {2709#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2702#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,748 INFO L273 TraceCheckUtils]: 20: Hoare triple {2709#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2709#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,753 INFO L273 TraceCheckUtils]: 19: Hoare triple {2716#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2709#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,754 INFO L273 TraceCheckUtils]: 18: Hoare triple {2716#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2716#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,758 INFO L273 TraceCheckUtils]: 17: Hoare triple {2723#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2716#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {2723#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2723#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {2730#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2723#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,765 INFO L273 TraceCheckUtils]: 14: Hoare triple {2730#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2730#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {2737#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2730#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,771 INFO L273 TraceCheckUtils]: 12: Hoare triple {2737#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2737#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,777 INFO L273 TraceCheckUtils]: 11: Hoare triple {2744#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2737#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {2744#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2744#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,783 INFO L273 TraceCheckUtils]: 9: Hoare triple {2751#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2744#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,784 INFO L273 TraceCheckUtils]: 8: Hoare triple {2751#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2751#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {2758#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2751#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,789 INFO L273 TraceCheckUtils]: 6: Hoare triple {2758#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2758#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {2387#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {2758#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} is VALID [2018-11-23 11:31:22,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {2387#true} call #t~ret4 := main(); {2387#true} is VALID [2018-11-23 11:31:22,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2387#true} {2387#true} #56#return; {2387#true} is VALID [2018-11-23 11:31:22,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {2387#true} assume true; {2387#true} is VALID [2018-11-23 11:31:22,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {2387#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2387#true} is VALID [2018-11-23 11:31:22,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {2387#true} call ULTIMATE.init(); {2387#true} is VALID [2018-11-23 11:31:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:31:22,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:31:22,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:31:22,800 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 58 [2018-11-23 11:31:22,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:31:22,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:31:23,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:31:23,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:31:23,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:31:23,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:31:23,079 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand 48 states. [2018-11-23 11:31:28,230 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 11:31:28,756 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 11:31:29,323 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 11:31:29,881 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 11:31:30,428 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 11:31:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:59,245 INFO L93 Difference]: Finished difference Result 405 states and 523 transitions. [2018-11-23 11:31:59,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 11:31:59,245 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 58 [2018-11-23 11:31:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:31:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 461 transitions. [2018-11-23 11:31:59,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:31:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 461 transitions. [2018-11-23 11:31:59,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 461 transitions. [2018-11-23 11:32:00,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:00,294 INFO L225 Difference]: With dead ends: 405 [2018-11-23 11:32:00,294 INFO L226 Difference]: Without dead ends: 339 [2018-11-23 11:32:00,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 11:32:00,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-11-23 11:32:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 225. [2018-11-23 11:32:00,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:00,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand 225 states. [2018-11-23 11:32:00,584 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand 225 states. [2018-11-23 11:32:00,584 INFO L87 Difference]: Start difference. First operand 339 states. Second operand 225 states. [2018-11-23 11:32:00,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:00,603 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2018-11-23 11:32:00,604 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 409 transitions. [2018-11-23 11:32:00,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:00,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:00,606 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 339 states. [2018-11-23 11:32:00,606 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 339 states. [2018-11-23 11:32:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:00,625 INFO L93 Difference]: Finished difference Result 339 states and 409 transitions. [2018-11-23 11:32:00,625 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 409 transitions. [2018-11-23 11:32:00,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:00,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:00,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:00,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-11-23 11:32:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 250 transitions. [2018-11-23 11:32:00,637 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 250 transitions. Word has length 58 [2018-11-23 11:32:00,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:00,638 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 250 transitions. [2018-11-23 11:32:00,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:32:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 250 transitions. [2018-11-23 11:32:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-11-23 11:32:00,641 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:00,642 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:00,642 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:00,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:00,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1636314183, now seen corresponding path program 5 times [2018-11-23 11:32:00,644 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:00,644 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:00,673 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1