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/fragtest_simple_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:32:50,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:32:50,489 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:32:50,501 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:32:50,502 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:32:50,503 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:32:50,504 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:32:50,506 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:32:50,508 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:32:50,509 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:32:50,510 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:32:50,511 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:32:50,512 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:32:50,513 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:32:50,514 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:32:50,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:32:50,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:32:50,518 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:32:50,520 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:32:50,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:32:50,523 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:32:50,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:32:50,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:32:50,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:32:50,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:32:50,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:32:50,530 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:32:50,531 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:32:50,532 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:32:50,533 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:32:50,533 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:32:50,534 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:32:50,534 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:32:50,534 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:32:50,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:32:50,536 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:32:50,537 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:50,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:32:50,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:32:50,573 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:32:50,574 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:32:50,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:32:50,578 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:32:50,578 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:32:50,578 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:32:50,579 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:32:50,579 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:32:50,579 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:32:50,579 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:32:50,579 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:32:50,579 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:32:50,580 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:32:50,580 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:32:50,580 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:32:50,580 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:32:50,580 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:32:50,582 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:32:50,582 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:32:50,582 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:32:50,582 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:32:50,583 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:32:50,583 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:32:50,583 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:32:50,584 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:32:50,584 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:32:50,584 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:32:50,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:32:50,584 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:32:50,585 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:32:50,585 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:32:50,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:32:50,652 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:32:50,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:32:50,658 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:32:50,658 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:32:50,659 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i [2018-11-23 11:32:50,735 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f87cc43/d799c6e9ce0a408c9edd6a78da01575d/FLAG46e06719e [2018-11-23 11:32:51,169 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:32:51,170 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/fragtest_simple_true-unreach-call_true-termination.i [2018-11-23 11:32:51,176 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f87cc43/d799c6e9ce0a408c9edd6a78da01575d/FLAG46e06719e [2018-11-23 11:32:51,553 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9f87cc43/d799c6e9ce0a408c9edd6a78da01575d [2018-11-23 11:32:51,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:32:51,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:32:51,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:51,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:32:51,572 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:32:51,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:51" (1/1) ... [2018-11-23 11:32:51,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62da31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:51, skipping insertion in model container [2018-11-23 11:32:51,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:32:51" (1/1) ... [2018-11-23 11:32:51,587 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:32:51,615 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:32:51,876 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:51,883 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:32:51,906 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:32:51,922 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:32:51,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:51 WrapperNode [2018-11-23 11:32:51,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:32:51,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:51,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:32:51,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:32:51,933 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:51" (1/1) ... [2018-11-23 11:32:51,940 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:51" (1/1) ... [2018-11-23 11:32:51,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:32:51,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:32:51,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:32:51,947 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:32:51,955 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:51" (1/1) ... [2018-11-23 11:32:51,955 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:51" (1/1) ... [2018-11-23 11:32:51,956 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:51" (1/1) ... [2018-11-23 11:32:51,957 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:51" (1/1) ... [2018-11-23 11:32:51,967 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:51" (1/1) ... [2018-11-23 11:32:51,975 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:51" (1/1) ... [2018-11-23 11:32:51,978 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:51" (1/1) ... [2018-11-23 11:32:51,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:32:51,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:32:51,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:32:51,981 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:32:51,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:51" (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:52,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:32:52,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:32:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:32:52,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:32:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:32:52,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:32:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:32:52,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:32:52,657 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:32:52,657 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:32:52,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:52 BoogieIcfgContainer [2018-11-23 11:32:52,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:32:52,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:32:52,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:32:52,665 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:32:52,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:32:51" (1/3) ... [2018-11-23 11:32:52,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e59e87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:52, skipping insertion in model container [2018-11-23 11:32:52,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:32:51" (2/3) ... [2018-11-23 11:32:52,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e59e87e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:32:52, skipping insertion in model container [2018-11-23 11:32:52,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:32:52" (3/3) ... [2018-11-23 11:32:52,670 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple_true-unreach-call_true-termination.i [2018-11-23 11:32:52,682 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:32:52,693 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:32:52,710 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:32:52,751 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:32:52,752 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:32:52,752 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:32:52,752 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:32:52,753 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:32:52,753 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:32:52,753 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:32:52,753 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:32:52,753 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:32:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 11:32:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:32:52,777 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:52,779 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:52,781 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:52,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:52,787 INFO L82 PathProgramCache]: Analyzing trace with hash -478766698, now seen corresponding path program 1 times [2018-11-23 11:32:52,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:52,792 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:52,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:52,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:52,933 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 11:32:52,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 11:32:52,937 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #70#return; {28#true} is VALID [2018-11-23 11:32:52,938 INFO L256 TraceCheckUtils]: 3: Hoare triple {28#true} call #t~ret4 := main(); {28#true} is VALID [2018-11-23 11:32:52,938 INFO L273 TraceCheckUtils]: 4: Hoare triple {28#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {28#true} is VALID [2018-11-23 11:32:52,938 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {28#true} is VALID [2018-11-23 11:32:52,939 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {28#true} is VALID [2018-11-23 11:32:52,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#true} ~i~0 := 0bv32; {28#true} is VALID [2018-11-23 11:32:52,940 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 11:32:52,940 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} ~j~0 := 0bv32;~n~0 := ~i~0; {29#false} is VALID [2018-11-23 11:32:52,941 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:32:52,941 INFO L256 TraceCheckUtils]: 11: Hoare triple {29#false} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-23 11:32:52,941 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 11:32:52,942 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2018-11-23 11:32:52,942 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 11:32:52,945 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:52,945 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:52,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:52,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:32:52,955 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:32:52,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:52,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:32:53,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:53,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:32:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:32:53,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:32:53,103 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 11:32:53,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:53,421 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2018-11-23 11:32:53,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:32:53,421 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:32:53,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:32:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-23 11:32:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:32:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 59 transitions. [2018-11-23 11:32:53,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 59 transitions. [2018-11-23 11:32:53,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:53,627 INFO L225 Difference]: With dead ends: 44 [2018-11-23 11:32:53,627 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 11:32:53,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 11:32:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 11:32:53,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:53,702 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 11:32:53,702 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:32:53,703 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:32:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:53,707 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 11:32:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 11:32:53,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:53,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:53,708 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 11:32:53,708 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 11:32:53,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:53,712 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-11-23 11:32:53,712 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 11:32:53,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:53,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:53,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:53,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:32:53,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-11-23 11:32:53,718 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2018-11-23 11:32:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:53,719 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-11-23 11:32:53,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:32:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-11-23 11:32:53,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:32:53,720 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:53,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:53,721 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:53,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:53,722 INFO L82 PathProgramCache]: Analyzing trace with hash 266185874, now seen corresponding path program 1 times [2018-11-23 11:32:53,722 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:53,722 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:53,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:53,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:53,982 INFO L256 TraceCheckUtils]: 0: Hoare triple {200#true} call ULTIMATE.init(); {200#true} is VALID [2018-11-23 11:32:53,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {200#true} assume true; {200#true} is VALID [2018-11-23 11:32:53,983 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {200#true} {200#true} #70#return; {200#true} is VALID [2018-11-23 11:32:53,983 INFO L256 TraceCheckUtils]: 3: Hoare triple {200#true} call #t~ret4 := main(); {200#true} is VALID [2018-11-23 11:32:53,986 INFO L273 TraceCheckUtils]: 4: Hoare triple {200#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {217#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:53,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {217#(= main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {217#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:53,988 INFO L273 TraceCheckUtils]: 6: Hoare triple {217#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {217#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:53,989 INFO L273 TraceCheckUtils]: 7: Hoare triple {217#(= main_~k~0 (_ bv0 32))} ~i~0 := 0bv32; {217#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:53,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {217#(= main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {217#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:53,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {217#(= main_~k~0 (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {217#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:53,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#(= main_~k~0 (_ bv0 32))} assume !false; {217#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:53,997 INFO L256 TraceCheckUtils]: 11: Hoare triple {217#(= main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {239#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:53,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {239#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {243#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:54,001 INFO L273 TraceCheckUtils]: 13: Hoare triple {243#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {201#false} is VALID [2018-11-23 11:32:54,001 INFO L273 TraceCheckUtils]: 14: Hoare triple {201#false} assume !false; {201#false} is VALID [2018-11-23 11:32:54,004 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:54,004 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:32:54,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:32:54,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:32:54,013 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:32:54,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:54,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:32:54,056 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:54,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:32:54,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:32:54,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:32:54,057 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 5 states. [2018-11-23 11:32:54,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:54,835 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 11:32:54,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:32:54,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-11-23 11:32:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:54,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:32:54,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 11:32:54,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:32:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2018-11-23 11:32:54,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 35 transitions. [2018-11-23 11:32:54,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:54,909 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:32:54,910 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:32:54,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:32:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:32:54,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-11-23 11:32:54,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:54,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 28 states. [2018-11-23 11:32:54,934 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 28 states. [2018-11-23 11:32:54,934 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 28 states. [2018-11-23 11:32:54,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:54,937 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 11:32:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 11:32:54,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:54,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:54,939 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 29 states. [2018-11-23 11:32:54,939 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 29 states. [2018-11-23 11:32:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:54,942 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-11-23 11:32:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-11-23 11:32:54,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:54,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:54,943 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:54,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:54,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:32:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-23 11:32:54,946 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 15 [2018-11-23 11:32:54,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:54,947 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-23 11:32:54,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:32:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-23 11:32:54,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:32:54,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:54,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:54,949 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:54,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:54,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1834316418, now seen corresponding path program 1 times [2018-11-23 11:32:54,950 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:54,950 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:32:54,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:32:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:55,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:55,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {394#true} call ULTIMATE.init(); {394#true} is VALID [2018-11-23 11:32:55,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {394#true} assume true; {394#true} is VALID [2018-11-23 11:32:55,138 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {394#true} {394#true} #70#return; {394#true} is VALID [2018-11-23 11:32:55,138 INFO L256 TraceCheckUtils]: 3: Hoare triple {394#true} call #t~ret4 := main(); {394#true} is VALID [2018-11-23 11:32:55,141 INFO L273 TraceCheckUtils]: 4: Hoare triple {394#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {411#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:55,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {411#(= main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {411#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:55,142 INFO L273 TraceCheckUtils]: 6: Hoare triple {411#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {411#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:55,143 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#(= main_~k~0 (_ bv0 32))} ~i~0 := 0bv32; {411#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:55,144 INFO L273 TraceCheckUtils]: 8: Hoare triple {411#(= main_~k~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {424#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,145 INFO L273 TraceCheckUtils]: 9: Hoare triple {424#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {424#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {424#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {424#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,146 INFO L273 TraceCheckUtils]: 11: Hoare triple {424#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !false; {424#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,148 INFO L256 TraceCheckUtils]: 12: Hoare triple {424#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {437#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {437#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {441#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {441#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {395#false} is VALID [2018-11-23 11:32:55,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {395#false} assume !false; {395#false} is VALID [2018-11-23 11:32:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:55,154 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:55,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {395#false} assume !false; {395#false} is VALID [2018-11-23 11:32:55,352 INFO L273 TraceCheckUtils]: 14: Hoare triple {451#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {395#false} is VALID [2018-11-23 11:32:55,366 INFO L273 TraceCheckUtils]: 13: Hoare triple {455#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {451#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:55,368 INFO L256 TraceCheckUtils]: 12: Hoare triple {459#(bvsge main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {455#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:55,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {459#(bvsge main_~k~0 (_ bv0 32))} assume !false; {459#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:55,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {459#(bvsge main_~k~0 (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {459#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:55,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {459#(bvsge main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {459#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:55,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {472#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {459#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:55,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {472#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} ~i~0 := 0bv32; {472#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,381 INFO L273 TraceCheckUtils]: 6: Hoare triple {472#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {472#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,381 INFO L273 TraceCheckUtils]: 5: Hoare triple {472#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {472#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,382 INFO L273 TraceCheckUtils]: 4: Hoare triple {394#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {472#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:55,382 INFO L256 TraceCheckUtils]: 3: Hoare triple {394#true} call #t~ret4 := main(); {394#true} is VALID [2018-11-23 11:32:55,383 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {394#true} {394#true} #70#return; {394#true} is VALID [2018-11-23 11:32:55,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {394#true} assume true; {394#true} is VALID [2018-11-23 11:32:55,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {394#true} call ULTIMATE.init(); {394#true} is VALID [2018-11-23 11:32:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:55,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:55,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:32:55,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 11:32:55,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:55,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:32:55,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:55,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:32:55,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:32:55,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:32:55,463 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 10 states. [2018-11-23 11:32:56,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:56,579 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2018-11-23 11:32:56,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:32:56,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-11-23 11:32:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:32:56,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:32:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2018-11-23 11:32:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:32:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 62 transitions. [2018-11-23 11:32:56,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 62 transitions. [2018-11-23 11:32:56,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:56,721 INFO L225 Difference]: With dead ends: 57 [2018-11-23 11:32:56,722 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 11:32:56,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:32:56,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 11:32:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 43. [2018-11-23 11:32:56,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:56,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 43 states. [2018-11-23 11:32:56,781 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 43 states. [2018-11-23 11:32:56,781 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 43 states. [2018-11-23 11:32:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:56,787 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 11:32:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-11-23 11:32:56,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:56,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:56,789 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 55 states. [2018-11-23 11:32:56,789 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 55 states. [2018-11-23 11:32:56,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:56,794 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2018-11-23 11:32:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-11-23 11:32:56,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:56,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:56,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:56,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:32:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2018-11-23 11:32:56,799 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 16 [2018-11-23 11:32:56,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:56,799 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2018-11-23 11:32:56,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:32:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 11:32:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:32:56,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:56,801 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:56,801 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:56,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:56,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1835554670, now seen corresponding path program 2 times [2018-11-23 11:32:56,802 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:56,802 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:32:56,819 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:32:56,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:32:56,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:32:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:56,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:57,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {761#true} call ULTIMATE.init(); {761#true} is VALID [2018-11-23 11:32:57,234 INFO L273 TraceCheckUtils]: 1: Hoare triple {761#true} assume true; {761#true} is VALID [2018-11-23 11:32:57,235 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {761#true} {761#true} #70#return; {761#true} is VALID [2018-11-23 11:32:57,235 INFO L256 TraceCheckUtils]: 3: Hoare triple {761#true} call #t~ret4 := main(); {761#true} is VALID [2018-11-23 11:32:57,236 INFO L273 TraceCheckUtils]: 4: Hoare triple {761#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {778#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:57,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {778#(= main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {778#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:57,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {778#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {778#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:57,238 INFO L273 TraceCheckUtils]: 7: Hoare triple {778#(= main_~k~0 (_ bv0 32))} ~i~0 := 0bv32; {778#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:57,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {778#(= main_~k~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {791#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {791#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {795#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 11:32:57,242 INFO L273 TraceCheckUtils]: 10: Hoare triple {795#(= (_ bv2 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {799#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,243 INFO L273 TraceCheckUtils]: 11: Hoare triple {799#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {803#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,244 INFO L273 TraceCheckUtils]: 12: Hoare triple {803#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {803#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,245 INFO L273 TraceCheckUtils]: 13: Hoare triple {803#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {803#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {803#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !false; {803#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,247 INFO L256 TraceCheckUtils]: 15: Hoare triple {803#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {816#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {816#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {820#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {820#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {762#false} is VALID [2018-11-23 11:32:57,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {762#false} assume !false; {762#false} is VALID [2018-11-23 11:32:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:57,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:32:57,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {762#false} assume !false; {762#false} is VALID [2018-11-23 11:32:57,499 INFO L273 TraceCheckUtils]: 17: Hoare triple {830#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {762#false} is VALID [2018-11-23 11:32:57,499 INFO L273 TraceCheckUtils]: 16: Hoare triple {834#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {830#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:32:57,501 INFO L256 TraceCheckUtils]: 15: Hoare triple {838#(bvsge main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {834#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:32:57,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {838#(bvsge main_~k~0 (_ bv0 32))} assume !false; {838#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:57,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {838#(bvsge main_~k~0 (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {838#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:57,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {838#(bvsge main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {838#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:57,505 INFO L273 TraceCheckUtils]: 11: Hoare triple {851#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {838#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:32:57,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {855#(bvsge (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {851#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {859#(bvsge (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {855#(bvsge (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {863#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {859#(bvsge (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,519 INFO L273 TraceCheckUtils]: 7: Hoare triple {863#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} ~i~0 := 0bv32; {863#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,519 INFO L273 TraceCheckUtils]: 6: Hoare triple {863#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {863#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,520 INFO L273 TraceCheckUtils]: 5: Hoare triple {863#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {863#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,521 INFO L273 TraceCheckUtils]: 4: Hoare triple {761#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {863#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:57,521 INFO L256 TraceCheckUtils]: 3: Hoare triple {761#true} call #t~ret4 := main(); {761#true} is VALID [2018-11-23 11:32:57,521 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {761#true} {761#true} #70#return; {761#true} is VALID [2018-11-23 11:32:57,521 INFO L273 TraceCheckUtils]: 1: Hoare triple {761#true} assume true; {761#true} is VALID [2018-11-23 11:32:57,522 INFO L256 TraceCheckUtils]: 0: Hoare triple {761#true} call ULTIMATE.init(); {761#true} is VALID [2018-11-23 11:32:57,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:57,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:32:57,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:32:57,525 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-23 11:32:57,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:32:57,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:32:57,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:57,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:32:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:32:57,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:32:57,654 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 16 states. [2018-11-23 11:33:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:01,253 INFO L93 Difference]: Finished difference Result 140 states and 175 transitions. [2018-11-23 11:33:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:33:01,254 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 19 [2018-11-23 11:33:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:01,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:33:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 152 transitions. [2018-11-23 11:33:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:33:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 152 transitions. [2018-11-23 11:33:01,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 152 transitions. [2018-11-23 11:33:01,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:01,681 INFO L225 Difference]: With dead ends: 140 [2018-11-23 11:33:01,682 INFO L226 Difference]: Without dead ends: 138 [2018-11-23 11:33:01,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=515, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:33:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-11-23 11:33:01,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 78. [2018-11-23 11:33:01,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:01,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand 78 states. [2018-11-23 11:33:01,792 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 78 states. [2018-11-23 11:33:01,792 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 78 states. [2018-11-23 11:33:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:01,808 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2018-11-23 11:33:01,809 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2018-11-23 11:33:01,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:01,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:01,816 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 138 states. [2018-11-23 11:33:01,816 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 138 states. [2018-11-23 11:33:01,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:01,835 INFO L93 Difference]: Finished difference Result 138 states and 173 transitions. [2018-11-23 11:33:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 173 transitions. [2018-11-23 11:33:01,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:01,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:01,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:01,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:01,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:33:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 98 transitions. [2018-11-23 11:33:01,852 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 98 transitions. Word has length 19 [2018-11-23 11:33:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:01,853 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 98 transitions. [2018-11-23 11:33:01,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:33:01,853 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 98 transitions. [2018-11-23 11:33:01,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 11:33:01,857 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:01,857 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:01,858 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:01,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:01,858 INFO L82 PathProgramCache]: Analyzing trace with hash 804415235, now seen corresponding path program 1 times [2018-11-23 11:33:01,858 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:01,859 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:33:01,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:33:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:01,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:02,004 INFO L256 TraceCheckUtils]: 0: Hoare triple {1520#true} call ULTIMATE.init(); {1520#true} is VALID [2018-11-23 11:33:02,005 INFO L273 TraceCheckUtils]: 1: Hoare triple {1520#true} assume true; {1520#true} is VALID [2018-11-23 11:33:02,005 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1520#true} {1520#true} #70#return; {1520#true} is VALID [2018-11-23 11:33:02,006 INFO L256 TraceCheckUtils]: 3: Hoare triple {1520#true} call #t~ret4 := main(); {1520#true} is VALID [2018-11-23 11:33:02,006 INFO L273 TraceCheckUtils]: 4: Hoare triple {1520#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {1520#true} is VALID [2018-11-23 11:33:02,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {1520#true} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {1520#true} is VALID [2018-11-23 11:33:02,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {1520#true} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {1520#true} is VALID [2018-11-23 11:33:02,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {1520#true} ~i~0 := 0bv32; {1546#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:33:02,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {1546#(= main_~i~0 (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {1546#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:33:02,014 INFO L273 TraceCheckUtils]: 9: Hoare triple {1546#(= main_~i~0 (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {1553#(and (= main_~j~0 (_ bv0 32)) (= main_~n~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:02,015 INFO L273 TraceCheckUtils]: 10: Hoare triple {1553#(and (= main_~j~0 (_ bv0 32)) (= main_~n~0 (_ bv0 32)))} assume !false; {1553#(and (= main_~j~0 (_ bv0 32)) (= main_~n~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:02,015 INFO L256 TraceCheckUtils]: 11: Hoare triple {1553#(and (= main_~j~0 (_ bv0 32)) (= main_~n~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1520#true} is VALID [2018-11-23 11:33:02,016 INFO L273 TraceCheckUtils]: 12: Hoare triple {1520#true} ~cond := #in~cond; {1520#true} is VALID [2018-11-23 11:33:02,016 INFO L273 TraceCheckUtils]: 13: Hoare triple {1520#true} assume !(0bv32 == ~cond); {1520#true} is VALID [2018-11-23 11:33:02,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {1520#true} assume true; {1520#true} is VALID [2018-11-23 11:33:02,017 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1520#true} {1553#(and (= main_~j~0 (_ bv0 32)) (= main_~n~0 (_ bv0 32)))} #74#return; {1553#(and (= main_~j~0 (_ bv0 32)) (= main_~n~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:02,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {1553#(and (= main_~j~0 (_ bv0 32)) (= main_~n~0 (_ bv0 32)))} ~k~0 := ~bvsub32(~k~0, 1bv32);~i~0 := ~bvsub32(~i~0, 1bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {1575#(and (= main_~n~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:02,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {1575#(and (= main_~n~0 (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsge32(~j~0, ~n~0); {1521#false} is VALID [2018-11-23 11:33:02,019 INFO L273 TraceCheckUtils]: 18: Hoare triple {1521#false} assume !false; {1521#false} is VALID [2018-11-23 11:33:02,019 INFO L256 TraceCheckUtils]: 19: Hoare triple {1521#false} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {1521#false} is VALID [2018-11-23 11:33:02,019 INFO L273 TraceCheckUtils]: 20: Hoare triple {1521#false} ~cond := #in~cond; {1521#false} is VALID [2018-11-23 11:33:02,019 INFO L273 TraceCheckUtils]: 21: Hoare triple {1521#false} assume 0bv32 == ~cond; {1521#false} is VALID [2018-11-23 11:33:02,020 INFO L273 TraceCheckUtils]: 22: Hoare triple {1521#false} assume !false; {1521#false} is VALID [2018-11-23 11:33:02,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:02,022 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:33:02,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:33:02,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:33:02,034 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:33:02,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:02,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:33:02,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:02,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:33:02,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:33:02,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:33:02,071 INFO L87 Difference]: Start difference. First operand 78 states and 98 transitions. Second operand 5 states. [2018-11-23 11:33:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:02,537 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2018-11-23 11:33:02,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:33:02,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-11-23 11:33:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:33:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:33:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2018-11-23 11:33:02,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2018-11-23 11:33:02,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:02,847 INFO L225 Difference]: With dead ends: 93 [2018-11-23 11:33:02,848 INFO L226 Difference]: Without dead ends: 74 [2018-11-23 11:33:02,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:33:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-23 11:33:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-11-23 11:33:02,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:02,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 71 states. [2018-11-23 11:33:02,915 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 71 states. [2018-11-23 11:33:02,915 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 71 states. [2018-11-23 11:33:02,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:02,918 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2018-11-23 11:33:02,919 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2018-11-23 11:33:02,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:02,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:02,919 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 74 states. [2018-11-23 11:33:02,920 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 74 states. [2018-11-23 11:33:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:02,923 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2018-11-23 11:33:02,924 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2018-11-23 11:33:02,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:02,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:02,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:02,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 11:33:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2018-11-23 11:33:02,928 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 23 [2018-11-23 11:33:02,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:02,929 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-11-23 11:33:02,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:33:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-23 11:33:02,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:33:02,930 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:02,930 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:02,930 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:02,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash -246521198, now seen corresponding path program 3 times [2018-11-23 11:33:02,931 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:02,931 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:33:02,955 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:33:03,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:33:03,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:33:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:03,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:03,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {1992#true} call ULTIMATE.init(); {1992#true} is VALID [2018-11-23 11:33:03,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {1992#true} assume true; {1992#true} is VALID [2018-11-23 11:33:03,702 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1992#true} {1992#true} #70#return; {1992#true} is VALID [2018-11-23 11:33:03,703 INFO L256 TraceCheckUtils]: 3: Hoare triple {1992#true} call #t~ret4 := main(); {1992#true} is VALID [2018-11-23 11:33:03,704 INFO L273 TraceCheckUtils]: 4: Hoare triple {1992#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {2009#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:03,707 INFO L273 TraceCheckUtils]: 5: Hoare triple {2009#(= main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {2009#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:03,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {2009#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {2009#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:03,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {2009#(= main_~k~0 (_ bv0 32))} ~i~0 := 0bv32; {2009#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:03,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {2009#(= main_~k~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2022#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {2022#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2026#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {2026#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2030#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,711 INFO L273 TraceCheckUtils]: 11: Hoare triple {2030#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2034#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,712 INFO L273 TraceCheckUtils]: 12: Hoare triple {2034#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2038#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,713 INFO L273 TraceCheckUtils]: 13: Hoare triple {2038#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2042#(= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {2042#(= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2046#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,715 INFO L273 TraceCheckUtils]: 15: Hoare triple {2046#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2050#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,716 INFO L273 TraceCheckUtils]: 16: Hoare triple {2050#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2054#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:33:03,718 INFO L273 TraceCheckUtils]: 17: Hoare triple {2054#(= (_ bv9 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2058#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {2058#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {2058#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {2058#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {2058#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,720 INFO L273 TraceCheckUtils]: 20: Hoare triple {2058#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !false; {2058#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,721 INFO L256 TraceCheckUtils]: 21: Hoare triple {2058#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2071#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,722 INFO L273 TraceCheckUtils]: 22: Hoare triple {2071#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2075#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:03,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {2075#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {1993#false} is VALID [2018-11-23 11:33:03,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {1993#false} assume !false; {1993#false} is VALID [2018-11-23 11:33:03,725 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:03,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:04,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {1993#false} assume !false; {1993#false} is VALID [2018-11-23 11:33:04,202 INFO L273 TraceCheckUtils]: 23: Hoare triple {2085#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {1993#false} is VALID [2018-11-23 11:33:04,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {2089#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2085#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:04,204 INFO L256 TraceCheckUtils]: 21: Hoare triple {2093#(bvsge main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {2089#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:04,205 INFO L273 TraceCheckUtils]: 20: Hoare triple {2093#(bvsge main_~k~0 (_ bv0 32))} assume !false; {2093#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:04,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {2093#(bvsge main_~k~0 (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {2093#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:04,206 INFO L273 TraceCheckUtils]: 18: Hoare triple {2093#(bvsge main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {2093#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:04,207 INFO L273 TraceCheckUtils]: 17: Hoare triple {2106#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2093#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:04,212 INFO L273 TraceCheckUtils]: 16: Hoare triple {2110#(bvsge (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2106#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,215 INFO L273 TraceCheckUtils]: 15: Hoare triple {2114#(bvsge (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2110#(bvsge (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {2118#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2114#(bvsge (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {2122#(bvsge (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2118#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {2126#(bvsge (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2122#(bvsge (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {2130#(bvsge (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2126#(bvsge (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {2134#(bvsge (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2130#(bvsge (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,240 INFO L273 TraceCheckUtils]: 9: Hoare triple {2138#(bvsge (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2134#(bvsge (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {2142#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2138#(bvsge (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {2142#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} ~i~0 := 0bv32; {2142#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {2142#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {2142#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,245 INFO L273 TraceCheckUtils]: 5: Hoare triple {2142#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {2142#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,245 INFO L273 TraceCheckUtils]: 4: Hoare triple {1992#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {2142#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:04,246 INFO L256 TraceCheckUtils]: 3: Hoare triple {1992#true} call #t~ret4 := main(); {1992#true} is VALID [2018-11-23 11:33:04,246 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1992#true} {1992#true} #70#return; {1992#true} is VALID [2018-11-23 11:33:04,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {1992#true} assume true; {1992#true} is VALID [2018-11-23 11:33:04,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {1992#true} call ULTIMATE.init(); {1992#true} is VALID [2018-11-23 11:33:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:04,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:04,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:33:04,251 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 25 [2018-11-23 11:33:04,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:04,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:33:04,315 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:04,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:33:04,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:33:04,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:33:04,316 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 28 states. [2018-11-23 11:33:24,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:24,198 INFO L93 Difference]: Finished difference Result 411 states and 523 transitions. [2018-11-23 11:33:24,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-23 11:33:24,198 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 25 [2018-11-23 11:33:24,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:24,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:33:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 465 transitions. [2018-11-23 11:33:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:33:24,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 465 transitions. [2018-11-23 11:33:24,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 82 states and 465 transitions. [2018-11-23 11:33:25,203 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 465 edges. 465 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:25,221 INFO L225 Difference]: With dead ends: 411 [2018-11-23 11:33:25,221 INFO L226 Difference]: Without dead ends: 409 [2018-11-23 11:33:25,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1621 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1832, Invalid=5140, Unknown=0, NotChecked=0, Total=6972 [2018-11-23 11:33:25,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-23 11:33:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 145. [2018-11-23 11:33:25,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:25,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 409 states. Second operand 145 states. [2018-11-23 11:33:25,696 INFO L74 IsIncluded]: Start isIncluded. First operand 409 states. Second operand 145 states. [2018-11-23 11:33:25,696 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 145 states. [2018-11-23 11:33:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:25,731 INFO L93 Difference]: Finished difference Result 409 states and 521 transitions. [2018-11-23 11:33:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 521 transitions. [2018-11-23 11:33:25,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:25,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:25,738 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 409 states. [2018-11-23 11:33:25,738 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 409 states. [2018-11-23 11:33:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:25,778 INFO L93 Difference]: Finished difference Result 409 states and 521 transitions. [2018-11-23 11:33:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 521 transitions. [2018-11-23 11:33:25,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:25,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:25,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:25,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:25,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-23 11:33:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 191 transitions. [2018-11-23 11:33:25,794 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 191 transitions. Word has length 25 [2018-11-23 11:33:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:25,795 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 191 transitions. [2018-11-23 11:33:25,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:33:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 191 transitions. [2018-11-23 11:33:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:33:25,796 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:25,797 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:25,797 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:25,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 225445476, now seen corresponding path program 1 times [2018-11-23 11:33:25,798 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:25,798 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:33:25,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:33:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:25,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:26,081 INFO L256 TraceCheckUtils]: 0: Hoare triple {3955#true} call ULTIMATE.init(); {3955#true} is VALID [2018-11-23 11:33:26,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {3955#true} assume true; {3955#true} is VALID [2018-11-23 11:33:26,082 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3955#true} {3955#true} #70#return; {3955#true} is VALID [2018-11-23 11:33:26,083 INFO L256 TraceCheckUtils]: 3: Hoare triple {3955#true} call #t~ret4 := main(); {3955#true} is VALID [2018-11-23 11:33:26,083 INFO L273 TraceCheckUtils]: 4: Hoare triple {3955#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {3955#true} is VALID [2018-11-23 11:33:26,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {3955#true} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {3955#true} is VALID [2018-11-23 11:33:26,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {3955#true} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {3955#true} is VALID [2018-11-23 11:33:26,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {3955#true} ~i~0 := 0bv32; {3981#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 11:33:26,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {3981#(= main_~i~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3985#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:26,085 INFO L273 TraceCheckUtils]: 9: Hoare triple {3985#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {3985#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:26,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {3985#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {3992#(and (= (_ bv1 32) main_~n~0) (= main_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:26,086 INFO L273 TraceCheckUtils]: 11: Hoare triple {3992#(and (= (_ bv1 32) main_~n~0) (= main_~j~0 (_ bv0 32)))} assume !false; {3992#(and (= (_ bv1 32) main_~n~0) (= main_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:26,087 INFO L256 TraceCheckUtils]: 12: Hoare triple {3992#(and (= (_ bv1 32) main_~n~0) (= main_~j~0 (_ bv0 32)))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3955#true} is VALID [2018-11-23 11:33:26,087 INFO L273 TraceCheckUtils]: 13: Hoare triple {3955#true} ~cond := #in~cond; {3955#true} is VALID [2018-11-23 11:33:26,087 INFO L273 TraceCheckUtils]: 14: Hoare triple {3955#true} assume !(0bv32 == ~cond); {3955#true} is VALID [2018-11-23 11:33:26,087 INFO L273 TraceCheckUtils]: 15: Hoare triple {3955#true} assume true; {3955#true} is VALID [2018-11-23 11:33:26,089 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {3955#true} {3992#(and (= (_ bv1 32) main_~n~0) (= main_~j~0 (_ bv0 32)))} #74#return; {3992#(and (= (_ bv1 32) main_~n~0) (= main_~j~0 (_ bv0 32)))} is VALID [2018-11-23 11:33:26,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {3992#(and (= (_ bv1 32) main_~n~0) (= main_~j~0 (_ bv0 32)))} ~k~0 := ~bvsub32(~k~0, 1bv32);~i~0 := ~bvsub32(~i~0, 1bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {4014#(and (= (_ bv1 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:33:26,091 INFO L273 TraceCheckUtils]: 18: Hoare triple {4014#(and (= (_ bv1 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsge32(~j~0, ~n~0); {3956#false} is VALID [2018-11-23 11:33:26,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2018-11-23 11:33:26,091 INFO L256 TraceCheckUtils]: 20: Hoare triple {3956#false} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3956#false} is VALID [2018-11-23 11:33:26,092 INFO L273 TraceCheckUtils]: 21: Hoare triple {3956#false} ~cond := #in~cond; {3956#false} is VALID [2018-11-23 11:33:26,092 INFO L273 TraceCheckUtils]: 22: Hoare triple {3956#false} assume !(0bv32 == ~cond); {3956#false} is VALID [2018-11-23 11:33:26,093 INFO L273 TraceCheckUtils]: 23: Hoare triple {3956#false} assume true; {3956#false} is VALID [2018-11-23 11:33:26,093 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3956#false} {3956#false} #74#return; {3956#false} is VALID [2018-11-23 11:33:26,093 INFO L273 TraceCheckUtils]: 25: Hoare triple {3956#false} ~k~0 := ~bvsub32(~k~0, 1bv32);~i~0 := ~bvsub32(~i~0, 1bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {3956#false} is VALID [2018-11-23 11:33:26,093 INFO L273 TraceCheckUtils]: 26: Hoare triple {3956#false} assume !~bvsge32(~j~0, ~n~0); {3956#false} is VALID [2018-11-23 11:33:26,094 INFO L273 TraceCheckUtils]: 27: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2018-11-23 11:33:26,094 INFO L256 TraceCheckUtils]: 28: Hoare triple {3956#false} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3956#false} is VALID [2018-11-23 11:33:26,094 INFO L273 TraceCheckUtils]: 29: Hoare triple {3956#false} ~cond := #in~cond; {3956#false} is VALID [2018-11-23 11:33:26,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {3956#false} assume 0bv32 == ~cond; {3956#false} is VALID [2018-11-23 11:33:26,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2018-11-23 11:33:26,097 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 11:33:26,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:26,252 INFO L273 TraceCheckUtils]: 31: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2018-11-23 11:33:26,253 INFO L273 TraceCheckUtils]: 30: Hoare triple {3956#false} assume 0bv32 == ~cond; {3956#false} is VALID [2018-11-23 11:33:26,253 INFO L273 TraceCheckUtils]: 29: Hoare triple {3956#false} ~cond := #in~cond; {3956#false} is VALID [2018-11-23 11:33:26,253 INFO L256 TraceCheckUtils]: 28: Hoare triple {3956#false} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3956#false} is VALID [2018-11-23 11:33:26,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2018-11-23 11:33:26,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {3956#false} assume !~bvsge32(~j~0, ~n~0); {3956#false} is VALID [2018-11-23 11:33:26,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {3956#false} ~k~0 := ~bvsub32(~k~0, 1bv32);~i~0 := ~bvsub32(~i~0, 1bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {3956#false} is VALID [2018-11-23 11:33:26,254 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {3955#true} {3956#false} #74#return; {3956#false} is VALID [2018-11-23 11:33:26,254 INFO L273 TraceCheckUtils]: 23: Hoare triple {3955#true} assume true; {3955#true} is VALID [2018-11-23 11:33:26,255 INFO L273 TraceCheckUtils]: 22: Hoare triple {3955#true} assume !(0bv32 == ~cond); {3955#true} is VALID [2018-11-23 11:33:26,255 INFO L273 TraceCheckUtils]: 21: Hoare triple {3955#true} ~cond := #in~cond; {3955#true} is VALID [2018-11-23 11:33:26,255 INFO L256 TraceCheckUtils]: 20: Hoare triple {3956#false} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3955#true} is VALID [2018-11-23 11:33:26,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {3956#false} assume !false; {3956#false} is VALID [2018-11-23 11:33:26,256 INFO L273 TraceCheckUtils]: 18: Hoare triple {4096#(bvsge main_~j~0 main_~n~0)} assume !~bvsge32(~j~0, ~n~0); {3956#false} is VALID [2018-11-23 11:33:26,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {4100#(bvsge (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} ~k~0 := ~bvsub32(~k~0, 1bv32);~i~0 := ~bvsub32(~i~0, 1bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {4096#(bvsge main_~j~0 main_~n~0)} is VALID [2018-11-23 11:33:26,260 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {3955#true} {4100#(bvsge (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} #74#return; {4100#(bvsge (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 11:33:26,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {3955#true} assume true; {3955#true} is VALID [2018-11-23 11:33:26,261 INFO L273 TraceCheckUtils]: 14: Hoare triple {3955#true} assume !(0bv32 == ~cond); {3955#true} is VALID [2018-11-23 11:33:26,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {3955#true} ~cond := #in~cond; {3955#true} is VALID [2018-11-23 11:33:26,262 INFO L256 TraceCheckUtils]: 12: Hoare triple {4100#(bvsge (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {3955#true} is VALID [2018-11-23 11:33:26,263 INFO L273 TraceCheckUtils]: 11: Hoare triple {4100#(bvsge (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !false; {4100#(bvsge (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 11:33:26,264 INFO L273 TraceCheckUtils]: 10: Hoare triple {4122#(bvsge (_ bv1 32) main_~i~0)} ~j~0 := 0bv32;~n~0 := ~i~0; {4100#(bvsge (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 11:33:26,264 INFO L273 TraceCheckUtils]: 9: Hoare triple {4122#(bvsge (_ bv1 32) main_~i~0)} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {4122#(bvsge (_ bv1 32) main_~i~0)} is VALID [2018-11-23 11:33:26,265 INFO L273 TraceCheckUtils]: 8: Hoare triple {4129#(bvsge (_ bv1 32) (bvadd main_~i~0 (_ bv1 32)))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4122#(bvsge (_ bv1 32) main_~i~0)} is VALID [2018-11-23 11:33:26,265 INFO L273 TraceCheckUtils]: 7: Hoare triple {3955#true} ~i~0 := 0bv32; {4129#(bvsge (_ bv1 32) (bvadd main_~i~0 (_ bv1 32)))} is VALID [2018-11-23 11:33:26,265 INFO L273 TraceCheckUtils]: 6: Hoare triple {3955#true} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {3955#true} is VALID [2018-11-23 11:33:26,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {3955#true} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {3955#true} is VALID [2018-11-23 11:33:26,266 INFO L273 TraceCheckUtils]: 4: Hoare triple {3955#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {3955#true} is VALID [2018-11-23 11:33:26,266 INFO L256 TraceCheckUtils]: 3: Hoare triple {3955#true} call #t~ret4 := main(); {3955#true} is VALID [2018-11-23 11:33:26,266 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3955#true} {3955#true} #70#return; {3955#true} is VALID [2018-11-23 11:33:26,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {3955#true} assume true; {3955#true} is VALID [2018-11-23 11:33:26,267 INFO L256 TraceCheckUtils]: 0: Hoare triple {3955#true} call ULTIMATE.init(); {3955#true} is VALID [2018-11-23 11:33:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 11:33:26,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:26,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 11:33:26,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:33:26,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:26,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:33:26,386 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:26,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:33:26,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:33:26,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:33:26,387 INFO L87 Difference]: Start difference. First operand 145 states and 191 transitions. Second operand 10 states. [2018-11-23 11:33:27,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:27,366 INFO L93 Difference]: Finished difference Result 165 states and 214 transitions. [2018-11-23 11:33:27,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:33:27,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2018-11-23 11:33:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:33:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 11:33:27,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:33:27,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 11:33:27,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2018-11-23 11:33:27,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:27,494 INFO L225 Difference]: With dead ends: 165 [2018-11-23 11:33:27,494 INFO L226 Difference]: Without dead ends: 144 [2018-11-23 11:33:27,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:33:27,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-23 11:33:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2018-11-23 11:33:27,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:27,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 138 states. [2018-11-23 11:33:27,719 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 138 states. [2018-11-23 11:33:27,719 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 138 states. [2018-11-23 11:33:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:27,725 INFO L93 Difference]: Finished difference Result 144 states and 191 transitions. [2018-11-23 11:33:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2018-11-23 11:33:27,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:27,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:27,726 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 144 states. [2018-11-23 11:33:27,727 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 144 states. [2018-11-23 11:33:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:27,733 INFO L93 Difference]: Finished difference Result 144 states and 191 transitions. [2018-11-23 11:33:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 191 transitions. [2018-11-23 11:33:27,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:27,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:27,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:27,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:27,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 11:33:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 181 transitions. [2018-11-23 11:33:27,741 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 181 transitions. Word has length 32 [2018-11-23 11:33:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:27,741 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 181 transitions. [2018-11-23 11:33:27,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:33:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 181 transitions. [2018-11-23 11:33:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:33:27,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:27,743 INFO L402 BasicCegarLoop]: trace histogram [11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:27,743 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:27,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1023850765, now seen corresponding path program 2 times [2018-11-23 11:33:27,744 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:27,744 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:33:27,769 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:33:27,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:33:27,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:33:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:27,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:28,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {4921#true} call ULTIMATE.init(); {4921#true} is VALID [2018-11-23 11:33:28,229 INFO L273 TraceCheckUtils]: 1: Hoare triple {4921#true} assume true; {4921#true} is VALID [2018-11-23 11:33:28,230 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4921#true} {4921#true} #70#return; {4921#true} is VALID [2018-11-23 11:33:28,230 INFO L256 TraceCheckUtils]: 3: Hoare triple {4921#true} call #t~ret4 := main(); {4921#true} is VALID [2018-11-23 11:33:28,231 INFO L273 TraceCheckUtils]: 4: Hoare triple {4921#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {4938#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:28,231 INFO L273 TraceCheckUtils]: 5: Hoare triple {4938#(= main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {4938#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:28,231 INFO L273 TraceCheckUtils]: 6: Hoare triple {4938#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {4938#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:28,232 INFO L273 TraceCheckUtils]: 7: Hoare triple {4938#(= main_~k~0 (_ bv0 32))} ~i~0 := 0bv32; {4938#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:28,232 INFO L273 TraceCheckUtils]: 8: Hoare triple {4938#(= main_~k~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4951#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {4951#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4955#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {4955#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4959#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {4959#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4963#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {4963#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4967#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,238 INFO L273 TraceCheckUtils]: 13: Hoare triple {4967#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4971#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:33:28,240 INFO L273 TraceCheckUtils]: 14: Hoare triple {4971#(= (_ bv6 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4975#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,240 INFO L273 TraceCheckUtils]: 15: Hoare triple {4975#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4979#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {4979#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4983#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:33:28,244 INFO L273 TraceCheckUtils]: 17: Hoare triple {4983#(= (_ bv9 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4987#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,248 INFO L273 TraceCheckUtils]: 18: Hoare triple {4987#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4991#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:28,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {4991#(= (_ bv11 32) main_~k~0)} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {4991#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:28,250 INFO L273 TraceCheckUtils]: 20: Hoare triple {4991#(= (_ bv11 32) main_~k~0)} ~j~0 := 0bv32;~n~0 := ~i~0; {4991#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:28,251 INFO L273 TraceCheckUtils]: 21: Hoare triple {4991#(= (_ bv11 32) main_~k~0)} assume !false; {4991#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:28,251 INFO L256 TraceCheckUtils]: 22: Hoare triple {4991#(= (_ bv11 32) main_~k~0)} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4921#true} is VALID [2018-11-23 11:33:28,251 INFO L273 TraceCheckUtils]: 23: Hoare triple {4921#true} ~cond := #in~cond; {4921#true} is VALID [2018-11-23 11:33:28,251 INFO L273 TraceCheckUtils]: 24: Hoare triple {4921#true} assume !(0bv32 == ~cond); {4921#true} is VALID [2018-11-23 11:33:28,251 INFO L273 TraceCheckUtils]: 25: Hoare triple {4921#true} assume true; {4921#true} is VALID [2018-11-23 11:33:28,252 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4921#true} {4991#(= (_ bv11 32) main_~k~0)} #74#return; {4991#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 11:33:28,253 INFO L273 TraceCheckUtils]: 27: Hoare triple {4991#(= (_ bv11 32) main_~k~0)} ~k~0 := ~bvsub32(~k~0, 1bv32);~i~0 := ~bvsub32(~i~0, 1bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {4987#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {4987#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvsge32(~j~0, ~n~0); {4987#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {4987#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !false; {4987#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,255 INFO L256 TraceCheckUtils]: 30: Hoare triple {4987#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {5028#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {5028#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {5032#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,256 INFO L273 TraceCheckUtils]: 32: Hoare triple {5032#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {4922#false} is VALID [2018-11-23 11:33:28,256 INFO L273 TraceCheckUtils]: 33: Hoare triple {4922#false} assume !false; {4922#false} is VALID [2018-11-23 11:33:28,258 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:28,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:33:28,796 INFO L273 TraceCheckUtils]: 33: Hoare triple {4922#false} assume !false; {4922#false} is VALID [2018-11-23 11:33:28,797 INFO L273 TraceCheckUtils]: 32: Hoare triple {5042#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {4922#false} is VALID [2018-11-23 11:33:28,798 INFO L273 TraceCheckUtils]: 31: Hoare triple {5046#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {5042#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:33:28,799 INFO L256 TraceCheckUtils]: 30: Hoare triple {5050#(bvsge main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {5046#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:33:28,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {5050#(bvsge main_~k~0 (_ bv0 32))} assume !false; {5050#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:28,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {5050#(bvsge main_~k~0 (_ bv0 32))} assume !~bvsge32(~j~0, ~n~0); {5050#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:28,800 INFO L273 TraceCheckUtils]: 27: Hoare triple {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvsub32(~k~0, 1bv32);~i~0 := ~bvsub32(~i~0, 1bv32);~j~0 := ~bvadd32(1bv32, ~j~0); {5050#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:28,801 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {4921#true} {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} #74#return; {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {4921#true} assume true; {4921#true} is VALID [2018-11-23 11:33:28,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {4921#true} assume !(0bv32 == ~cond); {4921#true} is VALID [2018-11-23 11:33:28,801 INFO L273 TraceCheckUtils]: 23: Hoare triple {4921#true} ~cond := #in~cond; {4921#true} is VALID [2018-11-23 11:33:28,802 INFO L256 TraceCheckUtils]: 22: Hoare triple {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {4921#true} is VALID [2018-11-23 11:33:28,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !false; {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,808 INFO L273 TraceCheckUtils]: 18: Hoare triple {5050#(bvsge main_~k~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5060#(bvsge (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,809 INFO L273 TraceCheckUtils]: 17: Hoare triple {5091#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5050#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:28,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {5095#(bvsge (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5091#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,821 INFO L273 TraceCheckUtils]: 15: Hoare triple {5099#(bvsge (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5095#(bvsge (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,825 INFO L273 TraceCheckUtils]: 14: Hoare triple {5103#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5099#(bvsge (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,829 INFO L273 TraceCheckUtils]: 13: Hoare triple {5107#(bvsge (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5103#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {5111#(bvsge (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5107#(bvsge (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {5115#(bvsge (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5111#(bvsge (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,840 INFO L273 TraceCheckUtils]: 10: Hoare triple {5119#(bvsge (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5115#(bvsge (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,845 INFO L273 TraceCheckUtils]: 9: Hoare triple {5123#(bvsge (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5119#(bvsge (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {5127#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5123#(bvsge (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {5127#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} ~i~0 := 0bv32; {5127#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {5127#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {5127#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {5127#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {5127#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,851 INFO L273 TraceCheckUtils]: 4: Hoare triple {4921#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {5127#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:28,851 INFO L256 TraceCheckUtils]: 3: Hoare triple {4921#true} call #t~ret4 := main(); {4921#true} is VALID [2018-11-23 11:33:28,851 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {4921#true} {4921#true} #70#return; {4921#true} is VALID [2018-11-23 11:33:28,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {4921#true} assume true; {4921#true} is VALID [2018-11-23 11:33:28,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {4921#true} call ULTIMATE.init(); {4921#true} is VALID [2018-11-23 11:33:28,853 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 2 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:28,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:33:28,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-11-23 11:33:28,857 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-11-23 11:33:28,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:33:28,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:33:28,936 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:28,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:33:28,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:33:28,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=668, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:33:28,937 INFO L87 Difference]: Start difference. First operand 138 states and 181 transitions. Second operand 30 states. [2018-11-23 11:33:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:54,499 INFO L93 Difference]: Finished difference Result 505 states and 639 transitions. [2018-11-23 11:33:54,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-11-23 11:33:54,499 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-11-23 11:33:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:33:54,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:33:54,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 533 transitions. [2018-11-23 11:33:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:33:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 533 transitions. [2018-11-23 11:33:54,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 95 states and 533 transitions. [2018-11-23 11:33:57,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 533 edges. 533 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:33:57,177 INFO L225 Difference]: With dead ends: 505 [2018-11-23 11:33:57,177 INFO L226 Difference]: Without dead ends: 503 [2018-11-23 11:33:57,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2398 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=2408, Invalid=6904, Unknown=0, NotChecked=0, Total=9312 [2018-11-23 11:33:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2018-11-23 11:33:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 197. [2018-11-23 11:33:58,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:33:58,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 503 states. Second operand 197 states. [2018-11-23 11:33:58,678 INFO L74 IsIncluded]: Start isIncluded. First operand 503 states. Second operand 197 states. [2018-11-23 11:33:58,679 INFO L87 Difference]: Start difference. First operand 503 states. Second operand 197 states. [2018-11-23 11:33:58,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:58,713 INFO L93 Difference]: Finished difference Result 503 states and 637 transitions. [2018-11-23 11:33:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 637 transitions. [2018-11-23 11:33:58,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:58,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:58,716 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 503 states. [2018-11-23 11:33:58,717 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 503 states. [2018-11-23 11:33:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:33:58,747 INFO L93 Difference]: Finished difference Result 503 states and 637 transitions. [2018-11-23 11:33:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 637 transitions. [2018-11-23 11:33:58,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:33:58,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:33:58,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:33:58,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:33:58,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-11-23 11:33:58,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 255 transitions. [2018-11-23 11:33:58,759 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 255 transitions. Word has length 34 [2018-11-23 11:33:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:33:58,760 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 255 transitions. [2018-11-23 11:33:58,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:33:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 255 transitions. [2018-11-23 11:33:58,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 11:33:58,761 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:33:58,762 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:33:58,762 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:33:58,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:33:58,762 INFO L82 PathProgramCache]: Analyzing trace with hash -89716606, now seen corresponding path program 4 times [2018-11-23 11:33:58,763 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:33:58,763 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:33:58,792 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:33:58,973 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:33:58,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:33:59,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:33:59,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:33:59,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {7370#true} call ULTIMATE.init(); {7370#true} is VALID [2018-11-23 11:33:59,601 INFO L273 TraceCheckUtils]: 1: Hoare triple {7370#true} assume true; {7370#true} is VALID [2018-11-23 11:33:59,601 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7370#true} {7370#true} #70#return; {7370#true} is VALID [2018-11-23 11:33:59,601 INFO L256 TraceCheckUtils]: 3: Hoare triple {7370#true} call #t~ret4 := main(); {7370#true} is VALID [2018-11-23 11:33:59,603 INFO L273 TraceCheckUtils]: 4: Hoare triple {7370#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {7387#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:59,604 INFO L273 TraceCheckUtils]: 5: Hoare triple {7387#(= main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {7387#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:59,605 INFO L273 TraceCheckUtils]: 6: Hoare triple {7387#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {7387#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:59,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {7387#(= main_~k~0 (_ bv0 32))} ~i~0 := 0bv32; {7387#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:33:59,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {7387#(= main_~k~0 (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7400#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,606 INFO L273 TraceCheckUtils]: 9: Hoare triple {7400#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7404#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,606 INFO L273 TraceCheckUtils]: 10: Hoare triple {7404#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7408#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,608 INFO L273 TraceCheckUtils]: 11: Hoare triple {7408#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7412#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {7412#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7416#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {7416#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7420#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 11:33:59,613 INFO L273 TraceCheckUtils]: 14: Hoare triple {7420#(= (_ bv6 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7424#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {7424#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7428#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {7428#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7432#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 11:33:59,616 INFO L273 TraceCheckUtils]: 17: Hoare triple {7432#(= (_ bv9 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7436#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,618 INFO L273 TraceCheckUtils]: 18: Hoare triple {7436#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7440#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,619 INFO L273 TraceCheckUtils]: 19: Hoare triple {7440#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7444#(= (_ bv12 32) main_~k~0)} is VALID [2018-11-23 11:33:59,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {7444#(= (_ bv12 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7448#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {7448#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7452#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {7452#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7456#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 11:33:59,625 INFO L273 TraceCheckUtils]: 23: Hoare triple {7456#(= (_ bv15 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7460#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,625 INFO L273 TraceCheckUtils]: 24: Hoare triple {7460#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7464#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 11:33:59,626 INFO L273 TraceCheckUtils]: 25: Hoare triple {7464#(= (_ bv17 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7468#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,628 INFO L273 TraceCheckUtils]: 26: Hoare triple {7468#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7472#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,629 INFO L273 TraceCheckUtils]: 27: Hoare triple {7472#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7476#(= (_ bv20 32) main_~k~0)} is VALID [2018-11-23 11:33:59,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {7476#(= (_ bv20 32) main_~k~0)} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7480#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {7480#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7484#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,632 INFO L273 TraceCheckUtils]: 30: Hoare triple {7484#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7488#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,633 INFO L273 TraceCheckUtils]: 31: Hoare triple {7488#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {7488#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {7488#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {7488#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,634 INFO L273 TraceCheckUtils]: 33: Hoare triple {7488#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} assume !false; {7488#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,635 INFO L256 TraceCheckUtils]: 34: Hoare triple {7488#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7501#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,636 INFO L273 TraceCheckUtils]: 35: Hoare triple {7501#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {7505#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:33:59,643 INFO L273 TraceCheckUtils]: 36: Hoare triple {7505#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {7371#false} is VALID [2018-11-23 11:33:59,644 INFO L273 TraceCheckUtils]: 37: Hoare triple {7371#false} assume !false; {7371#false} is VALID [2018-11-23 11:33:59,646 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:33:59,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:34:01,522 INFO L273 TraceCheckUtils]: 37: Hoare triple {7371#false} assume !false; {7371#false} is VALID [2018-11-23 11:34:01,524 INFO L273 TraceCheckUtils]: 36: Hoare triple {7515#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {7371#false} is VALID [2018-11-23 11:34:01,525 INFO L273 TraceCheckUtils]: 35: Hoare triple {7519#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {7515#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:34:01,525 INFO L256 TraceCheckUtils]: 34: Hoare triple {7523#(bvsge main_~k~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsge32(~k~0, 0bv32) then 1bv32 else 0bv32)); {7519#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:34:01,526 INFO L273 TraceCheckUtils]: 33: Hoare triple {7523#(bvsge main_~k~0 (_ bv0 32))} assume !false; {7523#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:01,526 INFO L273 TraceCheckUtils]: 32: Hoare triple {7523#(bvsge main_~k~0 (_ bv0 32))} ~j~0 := 0bv32;~n~0 := ~i~0; {7523#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:01,526 INFO L273 TraceCheckUtils]: 31: Hoare triple {7523#(bvsge main_~k~0 (_ bv0 32))} assume !(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3; {7523#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:01,527 INFO L273 TraceCheckUtils]: 30: Hoare triple {7536#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7523#(bvsge main_~k~0 (_ bv0 32))} is VALID [2018-11-23 11:34:01,532 INFO L273 TraceCheckUtils]: 29: Hoare triple {7540#(bvsge (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7536#(bvsge (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {7544#(bvsge (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7540#(bvsge (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,540 INFO L273 TraceCheckUtils]: 27: Hoare triple {7548#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7544#(bvsge (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,543 INFO L273 TraceCheckUtils]: 26: Hoare triple {7552#(bvsge (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7548#(bvsge (bvadd main_~k~0 (_ bv4 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,546 INFO L273 TraceCheckUtils]: 25: Hoare triple {7556#(bvsge (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7552#(bvsge (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,551 INFO L273 TraceCheckUtils]: 24: Hoare triple {7560#(bvsge (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7556#(bvsge (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,554 INFO L273 TraceCheckUtils]: 23: Hoare triple {7564#(bvsge (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7560#(bvsge (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,558 INFO L273 TraceCheckUtils]: 22: Hoare triple {7568#(bvsge (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7564#(bvsge (bvadd main_~k~0 (_ bv8 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {7572#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7568#(bvsge (bvadd main_~k~0 (_ bv9 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,566 INFO L273 TraceCheckUtils]: 20: Hoare triple {7576#(bvsge (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7572#(bvsge (bvadd main_~k~0 (_ bv10 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,570 INFO L273 TraceCheckUtils]: 19: Hoare triple {7580#(bvsge (bvadd main_~k~0 (_ bv12 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7576#(bvsge (bvadd main_~k~0 (_ bv11 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {7584#(bvsge (bvadd main_~k~0 (_ bv13 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7580#(bvsge (bvadd main_~k~0 (_ bv12 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,578 INFO L273 TraceCheckUtils]: 17: Hoare triple {7588#(bvsge (bvadd main_~k~0 (_ bv14 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7584#(bvsge (bvadd main_~k~0 (_ bv13 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,582 INFO L273 TraceCheckUtils]: 16: Hoare triple {7592#(bvsge (bvadd main_~k~0 (_ bv15 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7588#(bvsge (bvadd main_~k~0 (_ bv14 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,587 INFO L273 TraceCheckUtils]: 15: Hoare triple {7596#(bvsge (bvadd main_~k~0 (_ bv16 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7592#(bvsge (bvadd main_~k~0 (_ bv15 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {7600#(bvsge (bvadd main_~k~0 (_ bv17 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7596#(bvsge (bvadd main_~k~0 (_ bv16 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {7604#(bvsge (bvadd main_~k~0 (_ bv18 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7600#(bvsge (bvadd main_~k~0 (_ bv17 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {7608#(bvsge (bvadd main_~k~0 (_ bv19 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7604#(bvsge (bvadd main_~k~0 (_ bv18 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {7612#(bvsge (bvadd main_~k~0 (_ bv20 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7608#(bvsge (bvadd main_~k~0 (_ bv19 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {7616#(bvsge (bvadd main_~k~0 (_ bv21 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7612#(bvsge (bvadd main_~k~0 (_ bv20 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,610 INFO L273 TraceCheckUtils]: 9: Hoare triple {7620#(bvsge (bvadd main_~k~0 (_ bv22 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7616#(bvsge (bvadd main_~k~0 (_ bv21 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {7624#(bvsge (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} assume !!(0bv32 != #t~nondet3 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet3;~tmp___1~0 := ~i~0;~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {7620#(bvsge (bvadd main_~k~0 (_ bv22 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,614 INFO L273 TraceCheckUtils]: 7: Hoare triple {7624#(bvsge (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} ~i~0 := 0bv32; {7624#(bvsge (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,614 INFO L273 TraceCheckUtils]: 6: Hoare triple {7624#(bvsge (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} assume ~bvsgt32(~i~0, ~pvlen~0);~pvlen~0 := ~i~0; {7624#(bvsge (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,615 INFO L273 TraceCheckUtils]: 5: Hoare triple {7624#(bvsge (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} assume !(0bv32 != #t~nondet2 && ~bvsle32(~i~0, 1000000bv32));havoc #t~nondet2; {7624#(bvsge (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,615 INFO L273 TraceCheckUtils]: 4: Hoare triple {7370#true} havoc ~i~0;havoc ~pvlen~0;havoc ~tmp___1~0;~k~0 := 0bv32;havoc ~n~0;~i~0 := 0bv32;~pvlen~0 := #t~nondet1;havoc #t~nondet1; {7624#(bvsge (bvadd main_~k~0 (_ bv23 32)) (_ bv0 32))} is VALID [2018-11-23 11:34:01,616 INFO L256 TraceCheckUtils]: 3: Hoare triple {7370#true} call #t~ret4 := main(); {7370#true} is VALID [2018-11-23 11:34:01,616 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {7370#true} {7370#true} #70#return; {7370#true} is VALID [2018-11-23 11:34:01,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {7370#true} assume true; {7370#true} is VALID [2018-11-23 11:34:01,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {7370#true} call ULTIMATE.init(); {7370#true} is VALID [2018-11-23 11:34:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:34:01,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:34:01,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2018-11-23 11:34:01,622 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 38 [2018-11-23 11:34:01,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:34:01,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 11:34:01,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:34:01,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 11:34:01,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 11:34:01,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 11:34:01,713 INFO L87 Difference]: Start difference. First operand 197 states and 255 transitions. Second operand 54 states. [2018-11-23 11:35:20,042 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 9