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-invgen/heapsort_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:32:53,676 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:32:53,678 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:32:53,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:32:53,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:32:53,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:32:53,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:32:53,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:32:53,701 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:32:53,701 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:32:53,702 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:32:53,703 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:32:53,704 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:32:53,705 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:32:53,706 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:32:53,708 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:32:53,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:32:53,715 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:32:53,720 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:32:53,722 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:32:53,723 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:32:53,724 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:32:53,732 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:32:53,732 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:32:53,732 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:32:53,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:32:53,737 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:32:53,737 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:32:53,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:32:53,742 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:32:53,742 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:32:53,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:32:53,743 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:32:53,743 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:32:53,746 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:32:53,747 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:32:53,747 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:32:53,773 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:32:53,774 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:32:53,775 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:32:53,775 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:32:53,776 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:32:53,776 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:32:53,776 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:32:53,776 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:32:53,778 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:32:53,778 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:32:53,778 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:32:53,778 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:32:53,778 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:32:53,779 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:32:53,779 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:32:53,779 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:32:53,779 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:32:53,779 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:32:53,779 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:32:53,781 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:32:53,781 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:32:53,781 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:32:53,781 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:32:53,781 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:32:53,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:32:53,782 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:32:53,782 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:32:53,782 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:32:53,783 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:32:53,783 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:32:53,783 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:32:53,783 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:32:53,783 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:32:53,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:32:53,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:32:53,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:32:53,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:32:53,860 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:32:53,861 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-23 11:32:53,918 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bab34947d/fcdf85c7e3394a4cb1183922c5e0733d/FLAGe05972e0d [2018-11-23 11:32:54,381 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:32:54,382 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort_true-unreach-call_true-termination.i [2018-11-23 11:32:54,388 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bab34947d/fcdf85c7e3394a4cb1183922c5e0733d/FLAGe05972e0d [2018-11-23 11:32:54,737 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bab34947d/fcdf85c7e3394a4cb1183922c5e0733d [2018-11-23 11:32:54,746 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:32:54,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:32:54,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:54,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:32:54,752 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:32:54,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6462a6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:54, skipping insertion in model container [2018-11-23 11:32:54,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:54" (1/1) ... [2018-11-23 11:32:54,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:32:54,792 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:32:55,073 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:55,083 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:32:55,124 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:55,142 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:32:55,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:55 WrapperNode [2018-11-23 11:32:55,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:55,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:55,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:32:55,145 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:32:55,155 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:32:55" (1/1) ... [2018-11-23 11:32:55,165 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:32:55" (1/1) ... [2018-11-23 11:32:55,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:55,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:32:55,173 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:32:55,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:32:55,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:55" (1/1) ... [2018-11-23 11:32:55,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:55" (1/1) ... [2018-11-23 11:32:55,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:32:55" (1/1) ... [2018-11-23 11:32:55,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:55" (1/1) ... [2018-11-23 11:32:55,202 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:55" (1/1) ... [2018-11-23 11:32:55,213 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:55" (1/1) ... [2018-11-23 11:32:55,216 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:55" (1/1) ... [2018-11-23 11:32:55,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:32:55,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:32:55,219 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:32:55,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:32:55,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:55" (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:32:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:32:55,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:32:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:32:55,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:32:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:32:55,354 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:32:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:32:55,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:32:56,137 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:32:56,137 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:32:56,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:56 BoogieIcfgContainer [2018-11-23 11:32:56,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:32:56,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:32:56,140 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:32:56,143 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:32:56,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:54" (1/3) ... [2018-11-23 11:32:56,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696f26ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:56, skipping insertion in model container [2018-11-23 11:32:56,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:55" (2/3) ... [2018-11-23 11:32:56,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696f26ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:56, skipping insertion in model container [2018-11-23 11:32:56,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:56" (3/3) ... [2018-11-23 11:32:56,146 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort_true-unreach-call_true-termination.i [2018-11-23 11:32:56,156 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:32:56,163 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:32:56,182 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:32:56,215 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:32:56,216 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:32:56,216 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:32:56,216 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:32:56,218 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:32:56,218 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:32:56,218 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:32:56,219 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:32:56,219 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:32:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 11:32:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:32:56,245 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:56,246 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:56,249 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:56,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:56,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1614727353, now seen corresponding path program 1 times [2018-11-23 11:32:56,258 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:56,259 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:32:56,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:56,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:56,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2018-11-23 11:32:56,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 11:32:56,570 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {44#true} {44#true} #92#return; {44#true} is VALID [2018-11-23 11:32:56,570 INFO L256 TraceCheckUtils]: 3: Hoare triple {44#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {44#true} is VALID [2018-11-23 11:32:56,570 INFO L273 TraceCheckUtils]: 4: Hoare triple {44#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {44#true} is VALID [2018-11-23 11:32:56,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {44#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {44#true} is VALID [2018-11-23 11:32:56,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {44#true} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {44#true} is VALID [2018-11-23 11:32:56,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#true} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {44#true} is VALID [2018-11-23 11:32:56,572 INFO L273 TraceCheckUtils]: 8: Hoare triple {44#true} assume !true; {45#false} is VALID [2018-11-23 11:32:56,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {45#false} assume ~bvsgt32(~l~0, 1bv32); {45#false} is VALID [2018-11-23 11:32:56,573 INFO L256 TraceCheckUtils]: 10: Hoare triple {45#false} call __VERIFIER_assert((if ~bvsle32(1bv32, ~l~0) then 1bv32 else 0bv32)); {45#false} is VALID [2018-11-23 11:32:56,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {45#false} ~cond := #in~cond; {45#false} is VALID [2018-11-23 11:32:56,573 INFO L273 TraceCheckUtils]: 12: Hoare triple {45#false} assume 0bv32 == ~cond; {45#false} is VALID [2018-11-23 11:32:56,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {45#false} assume !false; {45#false} is VALID [2018-11-23 11:32:56,577 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:32:56,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:56,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:56,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:32:56,592 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:32:56,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:56,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:32:56,715 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:32:56,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:32:56,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:32:56,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:32:56,728 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-11-23 11:32:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:57,016 INFO L93 Difference]: Finished difference Result 75 states and 133 transitions. [2018-11-23 11:32:57,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:32:57,016 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 11:32:57,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:57,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:32:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 133 transitions. [2018-11-23 11:32:57,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:32:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 133 transitions. [2018-11-23 11:32:57,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 133 transitions. [2018-11-23 11:32:58,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:58,036 INFO L225 Difference]: With dead ends: 75 [2018-11-23 11:32:58,036 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 11:32:58,040 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:32:58,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 11:32:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 11:32:58,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:58,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 11:32:58,103 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:32:58,103 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:32:58,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:58,111 INFO L93 Difference]: Finished difference Result 36 states and 55 transitions. [2018-11-23 11:32:58,112 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2018-11-23 11:32:58,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:58,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:58,114 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 11:32:58,114 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 11:32:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:58,121 INFO L93 Difference]: Finished difference Result 36 states and 55 transitions. [2018-11-23 11:32:58,121 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2018-11-23 11:32:58,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:58,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:58,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:58,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:58,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:32:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2018-11-23 11:32:58,131 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 55 transitions. Word has length 14 [2018-11-23 11:32:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:58,131 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 55 transitions. [2018-11-23 11:32:58,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:32:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2018-11-23 11:32:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:32:58,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:58,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:58,133 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:58,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash 698594521, now seen corresponding path program 1 times [2018-11-23 11:32:58,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:58,134 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:32:58,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:58,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:58,759 INFO L256 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {326#true} is VALID [2018-11-23 11:32:58,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {326#true} assume true; {326#true} is VALID [2018-11-23 11:32:58,759 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {326#true} {326#true} #92#return; {326#true} is VALID [2018-11-23 11:32:58,760 INFO L256 TraceCheckUtils]: 3: Hoare triple {326#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {326#true} is VALID [2018-11-23 11:32:58,760 INFO L273 TraceCheckUtils]: 4: Hoare triple {326#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {326#true} is VALID [2018-11-23 11:32:58,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {326#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {346#(bvsle (_ bv1 32) main_~r~0)} is VALID [2018-11-23 11:32:58,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {346#(bvsle (_ bv1 32) main_~r~0)} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {350#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-23 11:32:58,782 INFO L273 TraceCheckUtils]: 7: Hoare triple {350#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) main_~r~0))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {354#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-23 11:32:58,790 INFO L273 TraceCheckUtils]: 8: Hoare triple {354#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)) (bvsle (_ bv1 32) main_~r~0))} assume !~bvsle32(~j~0, ~r~0); {358#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvsle (bvmul (_ bv2 32) main_~l~0) main_~r~0)) (bvsle (_ bv1 32) main_~r~0))))} is VALID [2018-11-23 11:32:58,794 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvsle (bvmul (_ bv2 32) main_~l~0) main_~r~0)) (bvsle (_ bv1 32) main_~r~0))))} assume ~bvsgt32(~l~0, 1bv32); {362#(and (bvsgt main_~l~0 (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvsle (bvmul (_ bv2 32) main_~l~0) main_~r~0)) (bvsle (_ bv1 32) main_~r~0))))} is VALID [2018-11-23 11:32:58,796 INFO L256 TraceCheckUtils]: 10: Hoare triple {362#(and (bvsgt main_~l~0 (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvsle (bvmul (_ bv2 32) main_~l~0) main_~r~0)) (bvsle (_ bv1 32) main_~r~0))))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~l~0) then 1bv32 else 0bv32)); {366#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:58,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {366#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {370#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:58,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {370#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {327#false} is VALID [2018-11-23 11:32:58,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {327#false} assume !false; {327#false} is VALID [2018-11-23 11:32:58,808 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:32:58,809 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:58,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:58,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:32:58,814 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-11-23 11:32:58,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:58,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:32:58,875 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:32:58,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:32:58,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:32:58,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:32:58,876 INFO L87 Difference]: Start difference. First operand 36 states and 55 transitions. Second operand 9 states. [2018-11-23 11:33:02,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:02,514 INFO L93 Difference]: Finished difference Result 65 states and 102 transitions. [2018-11-23 11:33:02,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:33:02,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-11-23 11:33:02,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:33:02,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2018-11-23 11:33:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:33:02,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 102 transitions. [2018-11-23 11:33:02,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 102 transitions. [2018-11-23 11:33:02,968 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:02,972 INFO L225 Difference]: With dead ends: 65 [2018-11-23 11:33:02,973 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 11:33:02,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:33:02,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 11:33:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2018-11-23 11:33:03,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:03,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 53 states. [2018-11-23 11:33:03,080 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 53 states. [2018-11-23 11:33:03,080 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 53 states. [2018-11-23 11:33:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:03,089 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2018-11-23 11:33:03,089 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 100 transitions. [2018-11-23 11:33:03,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:03,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:03,092 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 63 states. [2018-11-23 11:33:03,092 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 63 states. [2018-11-23 11:33:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:03,100 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2018-11-23 11:33:03,101 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 100 transitions. [2018-11-23 11:33:03,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:03,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:03,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:03,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 11:33:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 84 transitions. [2018-11-23 11:33:03,109 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 84 transitions. Word has length 14 [2018-11-23 11:33:03,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:03,110 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 84 transitions. [2018-11-23 11:33:03,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:33:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 84 transitions. [2018-11-23 11:33:03,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:33:03,111 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:03,111 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:03,112 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:03,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:03,112 INFO L82 PathProgramCache]: Analyzing trace with hash 377019064, now seen corresponding path program 1 times [2018-11-23 11:33:03,113 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:03,113 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:33:03,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:03,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:03,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:03,736 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-23 11:33:04,022 INFO L256 TraceCheckUtils]: 0: Hoare triple {697#true} call ULTIMATE.init(); {697#true} is VALID [2018-11-23 11:33:04,023 INFO L273 TraceCheckUtils]: 1: Hoare triple {697#true} assume true; {697#true} is VALID [2018-11-23 11:33:04,023 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {697#true} {697#true} #92#return; {697#true} is VALID [2018-11-23 11:33:04,024 INFO L256 TraceCheckUtils]: 3: Hoare triple {697#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {697#true} is VALID [2018-11-23 11:33:04,024 INFO L273 TraceCheckUtils]: 4: Hoare triple {697#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {697#true} is VALID [2018-11-23 11:33:04,027 INFO L273 TraceCheckUtils]: 5: Hoare triple {697#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {717#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:04,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {717#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32)))} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {721#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:04,100 INFO L273 TraceCheckUtils]: 7: Hoare triple {721#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {725#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:04,168 INFO L273 TraceCheckUtils]: 8: Hoare triple {725#(and (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (= main_~j~0 (bvmul (_ bv2 32) main_~l~0)) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))} assume !~bvsle32(~j~0, ~r~0); {698#false} is VALID [2018-11-23 11:33:04,169 INFO L273 TraceCheckUtils]: 9: Hoare triple {698#false} assume ~bvsgt32(~l~0, 1bv32); {698#false} is VALID [2018-11-23 11:33:04,169 INFO L256 TraceCheckUtils]: 10: Hoare triple {698#false} call __VERIFIER_assert((if ~bvsle32(1bv32, ~l~0) then 1bv32 else 0bv32)); {698#false} is VALID [2018-11-23 11:33:04,169 INFO L273 TraceCheckUtils]: 11: Hoare triple {698#false} ~cond := #in~cond; {698#false} is VALID [2018-11-23 11:33:04,169 INFO L273 TraceCheckUtils]: 12: Hoare triple {698#false} assume !(0bv32 == ~cond); {698#false} is VALID [2018-11-23 11:33:04,170 INFO L273 TraceCheckUtils]: 13: Hoare triple {698#false} assume true; {698#false} is VALID [2018-11-23 11:33:04,170 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {698#false} {698#false} #116#return; {698#false} is VALID [2018-11-23 11:33:04,170 INFO L256 TraceCheckUtils]: 15: Hoare triple {698#false} call __VERIFIER_assert((if ~bvsle32(~l~0, ~n~0) then 1bv32 else 0bv32)); {698#false} is VALID [2018-11-23 11:33:04,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {698#false} ~cond := #in~cond; {698#false} is VALID [2018-11-23 11:33:04,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {698#false} assume 0bv32 == ~cond; {698#false} is VALID [2018-11-23 11:33:04,171 INFO L273 TraceCheckUtils]: 18: Hoare triple {698#false} assume !false; {698#false} is VALID [2018-11-23 11:33:04,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:33:04,173 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:04,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:04,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:33:04,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:33:04,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:04,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:33:04,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:04,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:33:04,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:33:04,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:33:04,353 INFO L87 Difference]: Start difference. First operand 53 states and 84 transitions. Second operand 5 states. [2018-11-23 11:33:12,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:12,508 INFO L93 Difference]: Finished difference Result 144 states and 243 transitions. [2018-11-23 11:33:12,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:33:12,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:33:12,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:12,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:12,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2018-11-23 11:33:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:12,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 185 transitions. [2018-11-23 11:33:12,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 185 transitions. [2018-11-23 11:33:14,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:14,117 INFO L225 Difference]: With dead ends: 144 [2018-11-23 11:33:14,118 INFO L226 Difference]: Without dead ends: 98 [2018-11-23 11:33:14,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:33:14,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-23 11:33:14,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 55. [2018-11-23 11:33:14,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:14,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 55 states. [2018-11-23 11:33:14,399 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 55 states. [2018-11-23 11:33:14,399 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 55 states. [2018-11-23 11:33:14,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:14,411 INFO L93 Difference]: Finished difference Result 98 states and 166 transitions. [2018-11-23 11:33:14,411 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 166 transitions. [2018-11-23 11:33:14,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:14,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:14,414 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 98 states. [2018-11-23 11:33:14,414 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 98 states. [2018-11-23 11:33:14,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:14,424 INFO L93 Difference]: Finished difference Result 98 states and 166 transitions. [2018-11-23 11:33:14,424 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 166 transitions. [2018-11-23 11:33:14,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:14,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:14,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:14,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:14,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 11:33:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 86 transitions. [2018-11-23 11:33:14,431 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 86 transitions. Word has length 19 [2018-11-23 11:33:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:14,432 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 86 transitions. [2018-11-23 11:33:14,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:33:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 86 transitions. [2018-11-23 11:33:14,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:33:14,433 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:14,433 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:14,433 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:14,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:14,434 INFO L82 PathProgramCache]: Analyzing trace with hash 350352357, now seen corresponding path program 1 times [2018-11-23 11:33:14,434 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:14,434 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:33:14,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:33:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:14,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:15,063 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 11:33:16,720 WARN L180 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-23 11:33:17,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {1273#true} call ULTIMATE.init(); {1273#true} is VALID [2018-11-23 11:33:17,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {1273#true} assume true; {1273#true} is VALID [2018-11-23 11:33:17,324 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1273#true} {1273#true} #92#return; {1273#true} is VALID [2018-11-23 11:33:17,324 INFO L256 TraceCheckUtils]: 3: Hoare triple {1273#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1273#true} is VALID [2018-11-23 11:33:17,324 INFO L273 TraceCheckUtils]: 4: Hoare triple {1273#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1273#true} is VALID [2018-11-23 11:33:17,329 INFO L273 TraceCheckUtils]: 5: Hoare triple {1273#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {1293#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:17,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {1293#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32)))} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1297#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))} is VALID [2018-11-23 11:33:17,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {1297#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {1301#(and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:17,393 INFO L273 TraceCheckUtils]: 8: Hoare triple {1301#(and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvsle32(~j~0, ~r~0); {1301#(and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:17,407 INFO L273 TraceCheckUtils]: 9: Hoare triple {1301#(and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume ~bvslt32(~j~0, ~r~0); {1308#(and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvslt main_~j~0 main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:17,407 INFO L256 TraceCheckUtils]: 10: Hoare triple {1308#(and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvslt main_~j~0 main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~j~0) then 1bv32 else 0bv32)); {1273#true} is VALID [2018-11-23 11:33:17,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {1273#true} ~cond := #in~cond; {1273#true} is VALID [2018-11-23 11:33:17,408 INFO L273 TraceCheckUtils]: 12: Hoare triple {1273#true} assume !(0bv32 == ~cond); {1273#true} is VALID [2018-11-23 11:33:17,408 INFO L273 TraceCheckUtils]: 13: Hoare triple {1273#true} assume true; {1273#true} is VALID [2018-11-23 11:33:17,410 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1273#true} {1308#(and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvslt main_~j~0 main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} #96#return; {1308#(and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvslt main_~j~0 main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:33:17,470 INFO L256 TraceCheckUtils]: 15: Hoare triple {1308#(and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvslt main_~j~0 main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(~j~0, ~n~0) then 1bv32 else 0bv32)); {1327#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {1327#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1331#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:17,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {1331#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1274#false} is VALID [2018-11-23 11:33:17,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {1274#false} assume !false; {1274#false} is VALID [2018-11-23 11:33:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:17,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:17,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:17,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:33:17,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:33:17,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:17,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:33:17,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:17,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:33:17,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:33:17,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:33:17,681 INFO L87 Difference]: Start difference. First operand 55 states and 86 transitions. Second operand 8 states. [2018-11-23 11:33:19,108 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 11:33:21,334 WARN L180 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2018-11-23 11:34:03,364 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-11-23 11:34:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:11,192 INFO L93 Difference]: Finished difference Result 126 states and 204 transitions. [2018-11-23 11:34:11,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:34:11,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 11:34:11,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:34:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2018-11-23 11:34:11,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:34:11,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 172 transitions. [2018-11-23 11:34:11,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 172 transitions. [2018-11-23 11:34:15,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:15,385 INFO L225 Difference]: With dead ends: 126 [2018-11-23 11:34:15,386 INFO L226 Difference]: Without dead ends: 124 [2018-11-23 11:34:15,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:34:15,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-23 11:34:15,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 96. [2018-11-23 11:34:15,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:15,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 96 states. [2018-11-23 11:34:15,789 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 96 states. [2018-11-23 11:34:15,789 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 96 states. [2018-11-23 11:34:15,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:15,799 INFO L93 Difference]: Finished difference Result 124 states and 202 transitions. [2018-11-23 11:34:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 202 transitions. [2018-11-23 11:34:15,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:15,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:15,801 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 124 states. [2018-11-23 11:34:15,801 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 124 states. [2018-11-23 11:34:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:15,810 INFO L93 Difference]: Finished difference Result 124 states and 202 transitions. [2018-11-23 11:34:15,810 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 202 transitions. [2018-11-23 11:34:15,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:15,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:15,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:15,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:15,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:34:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 157 transitions. [2018-11-23 11:34:15,819 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 157 transitions. Word has length 19 [2018-11-23 11:34:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:15,819 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 157 transitions. [2018-11-23 11:34:15,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:34:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 157 transitions. [2018-11-23 11:34:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:34:15,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:15,820 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:15,821 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:15,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -209786950, now seen corresponding path program 1 times [2018-11-23 11:34:15,821 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:15,821 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:34:15,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:15,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:15,914 INFO L256 TraceCheckUtils]: 0: Hoare triple {1947#true} call ULTIMATE.init(); {1947#true} is VALID [2018-11-23 11:34:15,915 INFO L273 TraceCheckUtils]: 1: Hoare triple {1947#true} assume true; {1947#true} is VALID [2018-11-23 11:34:15,915 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1947#true} {1947#true} #92#return; {1947#true} is VALID [2018-11-23 11:34:15,915 INFO L256 TraceCheckUtils]: 3: Hoare triple {1947#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {1947#true} is VALID [2018-11-23 11:34:15,915 INFO L273 TraceCheckUtils]: 4: Hoare triple {1947#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {1947#true} is VALID [2018-11-23 11:34:15,915 INFO L273 TraceCheckUtils]: 5: Hoare triple {1947#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {1947#true} is VALID [2018-11-23 11:34:15,916 INFO L273 TraceCheckUtils]: 6: Hoare triple {1947#true} assume !~bvsgt32(~l~0, 1bv32);#t~post3 := ~r~0;~r~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {1970#(not (bvsgt main_~l~0 (_ bv1 32)))} is VALID [2018-11-23 11:34:15,916 INFO L273 TraceCheckUtils]: 7: Hoare triple {1970#(not (bvsgt main_~l~0 (_ bv1 32)))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {1970#(not (bvsgt main_~l~0 (_ bv1 32)))} is VALID [2018-11-23 11:34:15,917 INFO L273 TraceCheckUtils]: 8: Hoare triple {1970#(not (bvsgt main_~l~0 (_ bv1 32)))} assume !~bvsle32(~j~0, ~r~0); {1970#(not (bvsgt main_~l~0 (_ bv1 32)))} is VALID [2018-11-23 11:34:15,917 INFO L273 TraceCheckUtils]: 9: Hoare triple {1970#(not (bvsgt main_~l~0 (_ bv1 32)))} assume ~bvsgt32(~l~0, 1bv32); {1948#false} is VALID [2018-11-23 11:34:15,917 INFO L256 TraceCheckUtils]: 10: Hoare triple {1948#false} call __VERIFIER_assert((if ~bvsle32(1bv32, ~l~0) then 1bv32 else 0bv32)); {1948#false} is VALID [2018-11-23 11:34:15,918 INFO L273 TraceCheckUtils]: 11: Hoare triple {1948#false} ~cond := #in~cond; {1948#false} is VALID [2018-11-23 11:34:15,918 INFO L273 TraceCheckUtils]: 12: Hoare triple {1948#false} assume !(0bv32 == ~cond); {1948#false} is VALID [2018-11-23 11:34:15,918 INFO L273 TraceCheckUtils]: 13: Hoare triple {1948#false} assume true; {1948#false} is VALID [2018-11-23 11:34:15,918 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1948#false} {1948#false} #116#return; {1948#false} is VALID [2018-11-23 11:34:15,918 INFO L256 TraceCheckUtils]: 15: Hoare triple {1948#false} call __VERIFIER_assert((if ~bvsle32(~l~0, ~n~0) then 1bv32 else 0bv32)); {1948#false} is VALID [2018-11-23 11:34:15,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {1948#false} ~cond := #in~cond; {1948#false} is VALID [2018-11-23 11:34:15,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {1948#false} assume 0bv32 == ~cond; {1948#false} is VALID [2018-11-23 11:34:15,920 INFO L273 TraceCheckUtils]: 18: Hoare triple {1948#false} assume !false; {1948#false} is VALID [2018-11-23 11:34:15,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:34:15,921 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:34:15,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:34:15,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:34:15,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:34:15,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:15,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:34:15,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:15,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:34:15,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:34:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:34:15,965 INFO L87 Difference]: Start difference. First operand 96 states and 157 transitions. Second operand 3 states. [2018-11-23 11:34:16,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:16,601 INFO L93 Difference]: Finished difference Result 172 states and 291 transitions. [2018-11-23 11:34:16,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:34:16,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 11:34:16,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:16,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:34:16,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 11:34:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:34:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 11:34:16,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2018-11-23 11:34:16,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:16,851 INFO L225 Difference]: With dead ends: 172 [2018-11-23 11:34:16,851 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 11:34:16,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:34:16,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 11:34:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-23 11:34:17,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:17,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:17,173 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:17,173 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:17,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:17,182 INFO L93 Difference]: Finished difference Result 126 states and 214 transitions. [2018-11-23 11:34:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 214 transitions. [2018-11-23 11:34:17,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:17,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:17,184 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:17,184 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:17,193 INFO L93 Difference]: Finished difference Result 126 states and 214 transitions. [2018-11-23 11:34:17,194 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 214 transitions. [2018-11-23 11:34:17,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:17,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:17,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:17,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:34:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 214 transitions. [2018-11-23 11:34:17,204 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 214 transitions. Word has length 19 [2018-11-23 11:34:17,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:17,204 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 214 transitions. [2018-11-23 11:34:17,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:34:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 214 transitions. [2018-11-23 11:34:17,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:34:17,205 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:17,205 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:17,206 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:17,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:17,206 INFO L82 PathProgramCache]: Analyzing trace with hash 171575513, now seen corresponding path program 1 times [2018-11-23 11:34:17,206 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:17,207 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:34:17,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:17,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:17,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {2743#true} call ULTIMATE.init(); {2743#true} is VALID [2018-11-23 11:34:17,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {2743#true} assume true; {2743#true} is VALID [2018-11-23 11:34:17,810 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2743#true} {2743#true} #92#return; {2743#true} is VALID [2018-11-23 11:34:17,811 INFO L256 TraceCheckUtils]: 3: Hoare triple {2743#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {2743#true} is VALID [2018-11-23 11:34:17,811 INFO L273 TraceCheckUtils]: 4: Hoare triple {2743#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {2743#true} is VALID [2018-11-23 11:34:17,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {2743#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {2763#(exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:34:17,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {2763#(exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32))))} assume !~bvsgt32(~l~0, 1bv32);#t~post3 := ~r~0;~r~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {2767#(and (exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32)))) (not (bvsgt main_~l~0 (_ bv1 32))))} is VALID [2018-11-23 11:34:17,850 INFO L273 TraceCheckUtils]: 7: Hoare triple {2767#(and (exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32)))) (not (bvsgt main_~l~0 (_ bv1 32))))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {2771#(and (bvsgt main_~r~0 (_ bv1 32)) (exists ((main_~n~0 (_ BitVec 32))) (and (= (bvadd (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) (_ bv2 32)) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (not (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32))))))} is VALID [2018-11-23 11:34:17,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {2771#(and (bvsgt main_~r~0 (_ bv1 32)) (exists ((main_~n~0 (_ BitVec 32))) (and (= (bvadd (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) (_ bv2 32)) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (not (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32))))))} assume !~bvsle32(~j~0, ~r~0); {2744#false} is VALID [2018-11-23 11:34:17,870 INFO L273 TraceCheckUtils]: 9: Hoare triple {2744#false} assume !~bvsgt32(~l~0, 1bv32); {2744#false} is VALID [2018-11-23 11:34:17,870 INFO L256 TraceCheckUtils]: 10: Hoare triple {2744#false} call __VERIFIER_assert((if ~bvsle32(1bv32, ~r~0) then 1bv32 else 0bv32)); {2744#false} is VALID [2018-11-23 11:34:17,870 INFO L273 TraceCheckUtils]: 11: Hoare triple {2744#false} ~cond := #in~cond; {2744#false} is VALID [2018-11-23 11:34:17,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {2744#false} assume !(0bv32 == ~cond); {2744#false} is VALID [2018-11-23 11:34:17,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {2744#false} assume true; {2744#false} is VALID [2018-11-23 11:34:17,871 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {2744#false} {2744#false} #120#return; {2744#false} is VALID [2018-11-23 11:34:17,871 INFO L256 TraceCheckUtils]: 15: Hoare triple {2744#false} call __VERIFIER_assert((if ~bvsle32(~r~0, ~n~0) then 1bv32 else 0bv32)); {2744#false} is VALID [2018-11-23 11:34:17,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {2744#false} ~cond := #in~cond; {2744#false} is VALID [2018-11-23 11:34:17,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {2744#false} assume 0bv32 == ~cond; {2744#false} is VALID [2018-11-23 11:34:17,872 INFO L273 TraceCheckUtils]: 18: Hoare triple {2744#false} assume !false; {2744#false} is VALID [2018-11-23 11:34:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:34:17,874 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:34:17,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:34:17,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:34:17,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:34:17,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:17,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:34:17,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:17,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:34:17,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:34:17,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:34:17,997 INFO L87 Difference]: Start difference. First operand 126 states and 214 transitions. Second operand 5 states. [2018-11-23 11:34:22,894 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 11:34:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:31,375 INFO L93 Difference]: Finished difference Result 208 states and 355 transitions. [2018-11-23 11:34:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:34:31,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 11:34:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:34:31,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2018-11-23 11:34:31,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:34:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2018-11-23 11:34:31,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 167 transitions. [2018-11-23 11:34:33,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:33,447 INFO L225 Difference]: With dead ends: 208 [2018-11-23 11:34:33,448 INFO L226 Difference]: Without dead ends: 165 [2018-11-23 11:34:33,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:34:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-23 11:34:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2018-11-23 11:34:34,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:34,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 159 states. [2018-11-23 11:34:34,148 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 159 states. [2018-11-23 11:34:34,148 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 159 states. [2018-11-23 11:34:34,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:34,161 INFO L93 Difference]: Finished difference Result 165 states and 284 transitions. [2018-11-23 11:34:34,161 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 284 transitions. [2018-11-23 11:34:34,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:34,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:34,163 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 165 states. [2018-11-23 11:34:34,164 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 165 states. [2018-11-23 11:34:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:34,176 INFO L93 Difference]: Finished difference Result 165 states and 284 transitions. [2018-11-23 11:34:34,176 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 284 transitions. [2018-11-23 11:34:34,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:34,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:34,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:34,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-11-23 11:34:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 275 transitions. [2018-11-23 11:34:34,190 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 275 transitions. Word has length 19 [2018-11-23 11:34:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:34,190 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 275 transitions. [2018-11-23 11:34:34,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:34:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 275 transitions. [2018-11-23 11:34:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:34:34,191 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:34,191 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:34,191 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:34,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash -236453657, now seen corresponding path program 1 times [2018-11-23 11:34:34,192 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:34,192 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:34:34,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:34,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:34,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:34,467 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-11-23 11:34:34,833 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-23 11:34:34,895 INFO L256 TraceCheckUtils]: 0: Hoare triple {3737#true} call ULTIMATE.init(); {3737#true} is VALID [2018-11-23 11:34:34,895 INFO L273 TraceCheckUtils]: 1: Hoare triple {3737#true} assume true; {3737#true} is VALID [2018-11-23 11:34:34,896 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3737#true} {3737#true} #92#return; {3737#true} is VALID [2018-11-23 11:34:34,896 INFO L256 TraceCheckUtils]: 3: Hoare triple {3737#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {3737#true} is VALID [2018-11-23 11:34:34,896 INFO L273 TraceCheckUtils]: 4: Hoare triple {3737#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {3737#true} is VALID [2018-11-23 11:34:34,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {3737#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {3757#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:34,915 INFO L273 TraceCheckUtils]: 6: Hoare triple {3757#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32)))} assume !~bvsgt32(~l~0, 1bv32);#t~post3 := ~r~0;~r~0 := ~bvsub32(#t~post3, 1bv32);havoc #t~post3; {3761#(and (= (bvadd main_~r~0 (_ bv1 32)) main_~n~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (not (bvsgt main_~l~0 (_ bv1 32))))} is VALID [2018-11-23 11:34:34,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {3761#(and (= (bvadd main_~r~0 (_ bv1 32)) main_~n~0) (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (not (bvsgt main_~l~0 (_ bv1 32))))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {3738#false} is VALID [2018-11-23 11:34:34,942 INFO L273 TraceCheckUtils]: 8: Hoare triple {3738#false} assume !!~bvsle32(~j~0, ~r~0); {3738#false} is VALID [2018-11-23 11:34:34,943 INFO L273 TraceCheckUtils]: 9: Hoare triple {3738#false} assume ~bvslt32(~j~0, ~r~0); {3738#false} is VALID [2018-11-23 11:34:34,943 INFO L256 TraceCheckUtils]: 10: Hoare triple {3738#false} call __VERIFIER_assert((if ~bvsle32(1bv32, ~j~0) then 1bv32 else 0bv32)); {3738#false} is VALID [2018-11-23 11:34:34,943 INFO L273 TraceCheckUtils]: 11: Hoare triple {3738#false} ~cond := #in~cond; {3738#false} is VALID [2018-11-23 11:34:34,943 INFO L273 TraceCheckUtils]: 12: Hoare triple {3738#false} assume !(0bv32 == ~cond); {3738#false} is VALID [2018-11-23 11:34:34,943 INFO L273 TraceCheckUtils]: 13: Hoare triple {3738#false} assume true; {3738#false} is VALID [2018-11-23 11:34:34,944 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {3738#false} {3738#false} #96#return; {3738#false} is VALID [2018-11-23 11:34:34,944 INFO L256 TraceCheckUtils]: 15: Hoare triple {3738#false} call __VERIFIER_assert((if ~bvsle32(~j~0, ~n~0) then 1bv32 else 0bv32)); {3738#false} is VALID [2018-11-23 11:34:34,944 INFO L273 TraceCheckUtils]: 16: Hoare triple {3738#false} ~cond := #in~cond; {3738#false} is VALID [2018-11-23 11:34:34,944 INFO L273 TraceCheckUtils]: 17: Hoare triple {3738#false} assume 0bv32 == ~cond; {3738#false} is VALID [2018-11-23 11:34:34,945 INFO L273 TraceCheckUtils]: 18: Hoare triple {3738#false} assume !false; {3738#false} is VALID [2018-11-23 11:34:34,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:34:34,946 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:34:34,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:34:34,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 11:34:34,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 11:34:34,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:34,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:34:35,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:35,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:34:35,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:34:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:34:35,039 INFO L87 Difference]: Start difference. First operand 159 states and 275 transitions. Second operand 4 states. [2018-11-23 11:34:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:37,935 INFO L93 Difference]: Finished difference Result 170 states and 284 transitions. [2018-11-23 11:34:37,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:34:37,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 11:34:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:34:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2018-11-23 11:34:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:34:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2018-11-23 11:34:37,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 97 transitions. [2018-11-23 11:34:38,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:38,133 INFO L225 Difference]: With dead ends: 170 [2018-11-23 11:34:38,133 INFO L226 Difference]: Without dead ends: 126 [2018-11-23 11:34:38,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:34:38,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-11-23 11:34:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-11-23 11:34:38,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:38,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:38,763 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:38,763 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:38,772 INFO L93 Difference]: Finished difference Result 126 states and 213 transitions. [2018-11-23 11:34:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 213 transitions. [2018-11-23 11:34:38,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:38,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:38,774 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:38,774 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 126 states. [2018-11-23 11:34:38,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:38,782 INFO L93 Difference]: Finished difference Result 126 states and 213 transitions. [2018-11-23 11:34:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 213 transitions. [2018-11-23 11:34:38,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:38,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:38,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:38,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:38,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:34:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 213 transitions. [2018-11-23 11:34:38,792 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 213 transitions. Word has length 19 [2018-11-23 11:34:38,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:38,792 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 213 transitions. [2018-11-23 11:34:38,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:34:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 213 transitions. [2018-11-23 11:34:38,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:34:38,793 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:38,793 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:38,794 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:38,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:38,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2003244468, now seen corresponding path program 1 times [2018-11-23 11:34:38,794 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:38,794 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:38,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:38,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:39,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {4530#true} call ULTIMATE.init(); {4530#true} is VALID [2018-11-23 11:34:39,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {4530#true} assume true; {4530#true} is VALID [2018-11-23 11:34:39,109 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4530#true} {4530#true} #92#return; {4530#true} is VALID [2018-11-23 11:34:39,109 INFO L256 TraceCheckUtils]: 3: Hoare triple {4530#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {4530#true} is VALID [2018-11-23 11:34:39,109 INFO L273 TraceCheckUtils]: 4: Hoare triple {4530#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {4530#true} is VALID [2018-11-23 11:34:39,126 INFO L273 TraceCheckUtils]: 5: Hoare triple {4530#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {4550#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-23 11:34:39,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {4550#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {4554#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-23 11:34:39,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {4554#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)) (bvsle (_ bv1 32) main_~r~0))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {4558#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-23 11:34:39,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {4558#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (bvsle (_ bv1 32) main_~r~0))} assume !!~bvsle32(~j~0, ~r~0); {4562#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (bvsle main_~j~0 main_~r~0) (bvsle (_ bv1 32) main_~r~0))} is VALID [2018-11-23 11:34:39,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {4562#(and (bvsle main_~r~0 (_ bv1000000 32)) (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (bvsle main_~j~0 main_~r~0) (bvsle (_ bv1 32) main_~r~0))} assume !~bvslt32(~j~0, ~r~0); {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} is VALID [2018-11-23 11:34:39,139 INFO L256 TraceCheckUtils]: 10: Hoare triple {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~j~0) then 1bv32 else 0bv32)); {4530#true} is VALID [2018-11-23 11:34:39,139 INFO L273 TraceCheckUtils]: 11: Hoare triple {4530#true} ~cond := #in~cond; {4530#true} is VALID [2018-11-23 11:34:39,140 INFO L273 TraceCheckUtils]: 12: Hoare triple {4530#true} assume !(0bv32 == ~cond); {4530#true} is VALID [2018-11-23 11:34:39,140 INFO L273 TraceCheckUtils]: 13: Hoare triple {4530#true} assume true; {4530#true} is VALID [2018-11-23 11:34:39,140 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {4530#true} {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} #104#return; {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} is VALID [2018-11-23 11:34:39,140 INFO L256 TraceCheckUtils]: 15: Hoare triple {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} call __VERIFIER_assert((if ~bvsle32(~j~0, ~n~0) then 1bv32 else 0bv32)); {4530#true} is VALID [2018-11-23 11:34:39,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {4530#true} ~cond := #in~cond; {4530#true} is VALID [2018-11-23 11:34:39,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {4530#true} assume !(0bv32 == ~cond); {4530#true} is VALID [2018-11-23 11:34:39,141 INFO L273 TraceCheckUtils]: 18: Hoare triple {4530#true} assume true; {4530#true} is VALID [2018-11-23 11:34:39,142 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {4530#true} {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} #106#return; {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} is VALID [2018-11-23 11:34:39,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} is VALID [2018-11-23 11:34:39,146 INFO L256 TraceCheckUtils]: 21: Hoare triple {4566#(and (bvsgt (bvadd main_~i~0 (_ bv1 32)) (_ bv1 32)) (exists ((main_~r~0 (_ BitVec 32))) (and (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~r~0)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~r~0) (bvsle main_~r~0 (_ bv1000000 32)) (bvsle (_ bv1 32) main_~r~0))))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~i~0) then 1bv32 else 0bv32)); {4603#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:39,146 INFO L273 TraceCheckUtils]: 22: Hoare triple {4603#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4607#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:39,146 INFO L273 TraceCheckUtils]: 23: Hoare triple {4607#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {4531#false} is VALID [2018-11-23 11:34:39,147 INFO L273 TraceCheckUtils]: 24: Hoare triple {4531#false} assume !false; {4531#false} is VALID [2018-11-23 11:34:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:34:39,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:34:39,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:34:39,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 11:34:39,151 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 11:34:39,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:39,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:34:39,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:39,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:34:39,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:34:39,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:34:39,212 INFO L87 Difference]: Start difference. First operand 126 states and 213 transitions. Second operand 9 states. [2018-11-23 11:34:46,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:46,070 INFO L93 Difference]: Finished difference Result 269 states and 460 transitions. [2018-11-23 11:34:46,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:34:46,070 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-23 11:34:46,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:46,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:34:46,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 221 transitions. [2018-11-23 11:34:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:34:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 221 transitions. [2018-11-23 11:34:46,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 221 transitions. [2018-11-23 11:34:47,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:47,043 INFO L225 Difference]: With dead ends: 269 [2018-11-23 11:34:47,043 INFO L226 Difference]: Without dead ends: 267 [2018-11-23 11:34:47,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:34:47,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-11-23 11:34:47,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 227. [2018-11-23 11:34:47,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:47,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand 227 states. [2018-11-23 11:34:47,988 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand 227 states. [2018-11-23 11:34:47,988 INFO L87 Difference]: Start difference. First operand 267 states. Second operand 227 states. [2018-11-23 11:34:48,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:48,007 INFO L93 Difference]: Finished difference Result 267 states and 458 transitions. [2018-11-23 11:34:48,007 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 458 transitions. [2018-11-23 11:34:48,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:48,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:48,010 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 267 states. [2018-11-23 11:34:48,010 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 267 states. [2018-11-23 11:34:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:48,027 INFO L93 Difference]: Finished difference Result 267 states and 458 transitions. [2018-11-23 11:34:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 458 transitions. [2018-11-23 11:34:48,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:48,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:48,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:48,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:48,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-11-23 11:34:48,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 393 transitions. [2018-11-23 11:34:48,045 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 393 transitions. Word has length 25 [2018-11-23 11:34:48,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:48,046 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 393 transitions. [2018-11-23 11:34:48,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:34:48,046 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 393 transitions. [2018-11-23 11:34:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:34:48,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:48,047 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:48,047 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:48,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash 823290813, now seen corresponding path program 1 times [2018-11-23 11:34:48,048 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:48,048 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:48,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:48,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:34:48,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {5974#true} call ULTIMATE.init(); {5974#true} is VALID [2018-11-23 11:34:48,449 INFO L273 TraceCheckUtils]: 1: Hoare triple {5974#true} assume true; {5974#true} is VALID [2018-11-23 11:34:48,449 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {5974#true} {5974#true} #92#return; {5974#true} is VALID [2018-11-23 11:34:48,449 INFO L256 TraceCheckUtils]: 3: Hoare triple {5974#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {5974#true} is VALID [2018-11-23 11:34:48,449 INFO L273 TraceCheckUtils]: 4: Hoare triple {5974#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {5974#true} is VALID [2018-11-23 11:34:48,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {5974#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {5994#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:48,450 INFO L273 TraceCheckUtils]: 6: Hoare triple {5994#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {5994#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:48,451 INFO L273 TraceCheckUtils]: 7: Hoare triple {5994#(and (bvsle (_ bv1 32) main_~n~0) (= main_~n~0 main_~r~0) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {6001#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~n~0 main_~r~0) (bvsgt main_~r~0 (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:48,452 INFO L273 TraceCheckUtils]: 8: Hoare triple {6001#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~n~0 main_~r~0) (bvsgt main_~r~0 (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !!~bvsle32(~j~0, ~r~0); {6005#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~n~0 main_~r~0) (bvsgt main_~r~0 (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvsle main_~j~0 main_~r~0))} is VALID [2018-11-23 11:34:48,454 INFO L273 TraceCheckUtils]: 9: Hoare triple {6005#(and (= (bvmul (_ bv2 32) main_~i~0) main_~j~0) (= main_~n~0 main_~r~0) (bvsgt main_~r~0 (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32)) (bvsle main_~j~0 main_~r~0))} assume !~bvslt32(~j~0, ~r~0); {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:48,454 INFO L256 TraceCheckUtils]: 10: Hoare triple {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~j~0) then 1bv32 else 0bv32)); {5974#true} is VALID [2018-11-23 11:34:48,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {5974#true} ~cond := #in~cond; {5974#true} is VALID [2018-11-23 11:34:48,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {5974#true} assume !(0bv32 == ~cond); {5974#true} is VALID [2018-11-23 11:34:48,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {5974#true} assume true; {5974#true} is VALID [2018-11-23 11:34:48,456 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {5974#true} {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} #104#return; {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:48,456 INFO L256 TraceCheckUtils]: 15: Hoare triple {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(~j~0, ~n~0) then 1bv32 else 0bv32)); {5974#true} is VALID [2018-11-23 11:34:48,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {5974#true} ~cond := #in~cond; {5974#true} is VALID [2018-11-23 11:34:48,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {5974#true} assume !(0bv32 == ~cond); {5974#true} is VALID [2018-11-23 11:34:48,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {5974#true} assume true; {5974#true} is VALID [2018-11-23 11:34:48,458 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {5974#true} {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} #106#return; {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:48,458 INFO L273 TraceCheckUtils]: 20: Hoare triple {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} assume !(0bv32 != #t~nondet5);havoc #t~nondet5; {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:48,459 INFO L256 TraceCheckUtils]: 21: Hoare triple {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~i~0) then 1bv32 else 0bv32)); {5974#true} is VALID [2018-11-23 11:34:48,459 INFO L273 TraceCheckUtils]: 22: Hoare triple {5974#true} ~cond := #in~cond; {5974#true} is VALID [2018-11-23 11:34:48,459 INFO L273 TraceCheckUtils]: 23: Hoare triple {5974#true} assume !(0bv32 == ~cond); {5974#true} is VALID [2018-11-23 11:34:48,460 INFO L273 TraceCheckUtils]: 24: Hoare triple {5974#true} assume true; {5974#true} is VALID [2018-11-23 11:34:48,460 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {5974#true} {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} #108#return; {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} is VALID [2018-11-23 11:34:48,463 INFO L256 TraceCheckUtils]: 26: Hoare triple {6009#(and (bvsgt main_~n~0 (_ bv1 32)) (bvsle (bvmul (_ bv2 32) main_~i~0) main_~n~0) (not (bvslt (bvmul (_ bv2 32) main_~i~0) main_~n~0)) (bvsle main_~n~0 (_ bv1000000 32)))} call __VERIFIER_assert((if ~bvsle32(~i~0, ~n~0) then 1bv32 else 0bv32)); {6061#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:48,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {6061#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {6065#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:48,464 INFO L273 TraceCheckUtils]: 28: Hoare triple {6065#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {5975#false} is VALID [2018-11-23 11:34:48,464 INFO L273 TraceCheckUtils]: 29: Hoare triple {5975#false} assume !false; {5975#false} is VALID [2018-11-23 11:34:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 11:34:48,466 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:34:48,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:34:48,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:34:48,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-23 11:34:48,469 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:48,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:34:48,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:48,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:34:48,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:34:48,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:34:48,524 INFO L87 Difference]: Start difference. First operand 227 states and 393 transitions. Second operand 8 states. [2018-11-23 11:34:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:53,150 INFO L93 Difference]: Finished difference Result 346 states and 587 transitions. [2018-11-23 11:34:53,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:34:53,150 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-23 11:34:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:34:53,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:34:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2018-11-23 11:34:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:34:53,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 179 transitions. [2018-11-23 11:34:53,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 179 transitions. [2018-11-23 11:34:53,905 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:53,919 INFO L225 Difference]: With dead ends: 346 [2018-11-23 11:34:53,919 INFO L226 Difference]: Without dead ends: 344 [2018-11-23 11:34:53,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:34:53,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-11-23 11:34:55,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 297. [2018-11-23 11:34:55,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:34:55,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand 297 states. [2018-11-23 11:34:55,366 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand 297 states. [2018-11-23 11:34:55,366 INFO L87 Difference]: Start difference. First operand 344 states. Second operand 297 states. [2018-11-23 11:34:55,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:55,388 INFO L93 Difference]: Finished difference Result 344 states and 585 transitions. [2018-11-23 11:34:55,388 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 585 transitions. [2018-11-23 11:34:55,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:55,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:55,392 INFO L74 IsIncluded]: Start isIncluded. First operand 297 states. Second operand 344 states. [2018-11-23 11:34:55,392 INFO L87 Difference]: Start difference. First operand 297 states. Second operand 344 states. [2018-11-23 11:34:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:34:55,414 INFO L93 Difference]: Finished difference Result 344 states and 585 transitions. [2018-11-23 11:34:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 585 transitions. [2018-11-23 11:34:55,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:34:55,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:34:55,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:34:55,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:34:55,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-11-23 11:34:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 506 transitions. [2018-11-23 11:34:55,436 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 506 transitions. Word has length 30 [2018-11-23 11:34:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:34:55,437 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 506 transitions. [2018-11-23 11:34:55,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:34:55,437 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 506 transitions. [2018-11-23 11:34:55,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 11:34:55,438 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:34:55,438 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:34:55,438 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:34:55,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:34:55,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1103312083, now seen corresponding path program 1 times [2018-11-23 11:34:55,439 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:34:55,439 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:34:55,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:34:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:34:55,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:35:01,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {7816#true} call ULTIMATE.init(); {7816#true} is VALID [2018-11-23 11:35:01,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {7816#true} assume true; {7816#true} is VALID [2018-11-23 11:35:01,635 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7816#true} {7816#true} #92#return; {7816#true} is VALID [2018-11-23 11:35:01,636 INFO L256 TraceCheckUtils]: 3: Hoare triple {7816#true} call #t~ret8 := main(#in~argc, #in~argv.base, #in~argv.offset); {7816#true} is VALID [2018-11-23 11:35:01,636 INFO L273 TraceCheckUtils]: 4: Hoare triple {7816#true} ~argc := #in~argc;~argv.base, ~argv.offset := #in~argv.base, #in~argv.offset;havoc ~n~0;havoc ~l~0;havoc ~r~0;havoc ~i~0;havoc ~j~0;~n~0 := #t~nondet1;havoc #t~nondet1; {7816#true} is VALID [2018-11-23 11:35:01,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {7816#true} assume !!(~bvsle32(1bv32, ~n~0) && ~bvsle32(~n~0, 1000000bv32));~l~0 := ~bvadd32(1bv32, ~bvsdiv32(~n~0, 2bv32));~r~0 := ~n~0; {7836#(exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:35:01,709 INFO L273 TraceCheckUtils]: 6: Hoare triple {7836#(exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (= (bvadd main_~l~0 (_ bv4294967295 32)) (bvsdiv main_~n~0 (_ bv2 32))) (bvsle main_~n~0 (_ bv1000000 32))))} assume ~bvsgt32(~l~0, 1bv32);#t~post2 := ~l~0;~l~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {7840#(and (exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2018-11-23 11:35:01,729 INFO L273 TraceCheckUtils]: 7: Hoare triple {7840#(and (exists ((main_~n~0 (_ BitVec 32))) (and (bvsle (_ bv1 32) main_~n~0) (bvsle main_~n~0 (_ bv1000000 32)) (= main_~l~0 (bvsdiv main_~n~0 (_ bv2 32))))) (bvsgt (bvadd main_~l~0 (_ bv1 32)) (_ bv1 32)))} assume !!~bvsgt32(~r~0, 1bv32);~i~0 := ~l~0;~j~0 := ~bvmul32(2bv32, ~l~0); {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:35:01,729 INFO L273 TraceCheckUtils]: 8: Hoare triple {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} assume !!~bvsle32(~j~0, ~r~0); {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:35:01,730 INFO L273 TraceCheckUtils]: 9: Hoare triple {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} assume ~bvslt32(~j~0, ~r~0); {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:35:01,730 INFO L256 TraceCheckUtils]: 10: Hoare triple {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~j~0) then 1bv32 else 0bv32)); {7816#true} is VALID [2018-11-23 11:35:01,730 INFO L273 TraceCheckUtils]: 11: Hoare triple {7816#true} ~cond := #in~cond; {7816#true} is VALID [2018-11-23 11:35:01,731 INFO L273 TraceCheckUtils]: 12: Hoare triple {7816#true} assume !(0bv32 == ~cond); {7816#true} is VALID [2018-11-23 11:35:01,731 INFO L273 TraceCheckUtils]: 13: Hoare triple {7816#true} assume true; {7816#true} is VALID [2018-11-23 11:35:01,751 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {7816#true} {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} #96#return; {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:35:01,751 INFO L256 TraceCheckUtils]: 15: Hoare triple {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} call __VERIFIER_assert((if ~bvsle32(~j~0, ~n~0) then 1bv32 else 0bv32)); {7816#true} is VALID [2018-11-23 11:35:01,751 INFO L273 TraceCheckUtils]: 16: Hoare triple {7816#true} ~cond := #in~cond; {7816#true} is VALID [2018-11-23 11:35:01,752 INFO L273 TraceCheckUtils]: 17: Hoare triple {7816#true} assume !(0bv32 == ~cond); {7816#true} is VALID [2018-11-23 11:35:01,752 INFO L273 TraceCheckUtils]: 18: Hoare triple {7816#true} assume true; {7816#true} is VALID [2018-11-23 11:35:01,767 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {7816#true} {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} #98#return; {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:35:01,767 INFO L256 TraceCheckUtils]: 20: Hoare triple {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~bvadd32(1bv32, ~j~0)) then 1bv32 else 0bv32)); {7816#true} is VALID [2018-11-23 11:35:01,767 INFO L273 TraceCheckUtils]: 21: Hoare triple {7816#true} ~cond := #in~cond; {7816#true} is VALID [2018-11-23 11:35:01,767 INFO L273 TraceCheckUtils]: 22: Hoare triple {7816#true} assume !(0bv32 == ~cond); {7816#true} is VALID [2018-11-23 11:35:01,768 INFO L273 TraceCheckUtils]: 23: Hoare triple {7816#true} assume true; {7816#true} is VALID [2018-11-23 11:35:01,776 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {7816#true} {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} #100#return; {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:35:01,777 INFO L256 TraceCheckUtils]: 25: Hoare triple {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} call __VERIFIER_assert((if ~bvsle32(~bvadd32(1bv32, ~j~0), ~n~0) then 1bv32 else 0bv32)); {7816#true} is VALID [2018-11-23 11:35:01,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {7816#true} ~cond := #in~cond; {7816#true} is VALID [2018-11-23 11:35:01,777 INFO L273 TraceCheckUtils]: 27: Hoare triple {7816#true} assume !(0bv32 == ~cond); {7816#true} is VALID [2018-11-23 11:35:01,778 INFO L273 TraceCheckUtils]: 28: Hoare triple {7816#true} assume true; {7816#true} is VALID [2018-11-23 11:35:01,778 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {7816#true} {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} #102#return; {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:35:01,814 INFO L273 TraceCheckUtils]: 30: Hoare triple {7844#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} assume 0bv32 != #t~nondet4;havoc #t~nondet4;~j~0 := ~bvadd32(1bv32, ~j~0); {7914#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvadd (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) (_ bv1 32)) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} is VALID [2018-11-23 11:35:01,832 INFO L256 TraceCheckUtils]: 31: Hoare triple {7914#(exists ((main_~n~0 (_ BitVec 32))) (and (= (bvadd (bvmul (_ bv2 32) (bvsdiv main_~n~0 (_ bv2 32))) (_ bv1 32)) main_~j~0) (bvsle (_ bv1 32) main_~n~0) (bvsgt (bvadd (bvsdiv main_~n~0 (_ bv2 32)) (_ bv1 32)) (_ bv1 32)) (bvsle main_~n~0 (_ bv1000000 32))))} call __VERIFIER_assert((if ~bvsle32(1bv32, ~j~0) then 1bv32 else 0bv32)); {7918#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:01,833 INFO L273 TraceCheckUtils]: 32: Hoare triple {7918#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {7922#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:35:01,834 INFO L273 TraceCheckUtils]: 33: Hoare triple {7922#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {7817#false} is VALID [2018-11-23 11:35:01,834 INFO L273 TraceCheckUtils]: 34: Hoare triple {7817#false} assume !false; {7817#false} is VALID [2018-11-23 11:35:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 11:35:01,836 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:35:01,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:35:01,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:35:01,839 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-11-23 11:35:01,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:35:01,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:35:02,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:35:02,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:35:02,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:35:02,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=41, Unknown=2, NotChecked=0, Total=56 [2018-11-23 11:35:02,165 INFO L87 Difference]: Start difference. First operand 297 states and 506 transitions. Second operand 8 states. [2018-11-23 11:35:17,714 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-23 11:36:12,344 WARN L180 SmtUtils]: Spent 4.72 s on a formula simplification. DAG size of input: 26 DAG size of output: 24