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-acceleration/simple_false-unreach-call4.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:28:52,631 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:28:52,633 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:28:52,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:28:52,644 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:28:52,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:28:52,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:28:52,648 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:28:52,650 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:28:52,651 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:28:52,652 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:28:52,652 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:28:52,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:28:52,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:28:52,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:28:52,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:28:52,657 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:28:52,659 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:28:52,661 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:28:52,663 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:28:52,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:28:52,665 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:28:52,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:28:52,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:28:52,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:28:52,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:28:52,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:28:52,677 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:28:52,678 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:28:52,679 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:28:52,679 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:28:52,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:28:52,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:28:52,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:28:52,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:28:52,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:28:52,688 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:28:52,713 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:28:52,714 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:28:52,717 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:28:52,717 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:28:52,718 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:28:52,718 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:28:52,718 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:28:52,718 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:28:52,718 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:28:52,722 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:28:52,722 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:28:52,722 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:28:52,723 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:28:52,723 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:28:52,723 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:28:52,723 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:28:52,723 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:28:52,725 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:28:52,725 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:28:52,725 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:28:52,725 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:28:52,726 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:28:52,726 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:28:52,726 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:28:52,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:28:52,727 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:28:52,727 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:28:52,727 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:28:52,727 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:28:52,727 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:28:52,729 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:28:52,729 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:28:52,729 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:28:52,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:28:52,815 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:28:52,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:28:52,821 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:28:52,821 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:28:52,822 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call4.i [2018-11-23 11:28:52,888 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398aad085/7c492d3e017d4071818fdf9e2d68f401/FLAGe6e5e4e72 [2018-11-23 11:28:53,377 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:28:53,378 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_false-unreach-call4.i [2018-11-23 11:28:53,385 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398aad085/7c492d3e017d4071818fdf9e2d68f401/FLAGe6e5e4e72 [2018-11-23 11:28:53,699 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/398aad085/7c492d3e017d4071818fdf9e2d68f401 [2018-11-23 11:28:53,711 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:28:53,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:28:53,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:28:53,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:28:53,718 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:28:53,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:28:53" (1/1) ... [2018-11-23 11:28:53,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56fd4649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:53, skipping insertion in model container [2018-11-23 11:28:53,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:28:53" (1/1) ... [2018-11-23 11:28:53,735 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:28:53,760 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:28:53,999 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:28:54,008 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:28:54,028 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:28:54,044 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:28:54,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54 WrapperNode [2018-11-23 11:28:54,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:28:54,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:28:54,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:28:54,046 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:28:54,056 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:28:54" (1/1) ... [2018-11-23 11:28:54,062 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:28:54" (1/1) ... [2018-11-23 11:28:54,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:28:54,068 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:28:54,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:28:54,068 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:28:54,077 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54" (1/1) ... [2018-11-23 11:28:54,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54" (1/1) ... [2018-11-23 11:28:54,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54" (1/1) ... [2018-11-23 11:28:54,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54" (1/1) ... [2018-11-23 11:28:54,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54" (1/1) ... [2018-11-23 11:28:54,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54" (1/1) ... [2018-11-23 11:28:54,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54" (1/1) ... [2018-11-23 11:28:54,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:28:54,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:28:54,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:28:54,094 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:28:54,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:28:54,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:28:54,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:28:54,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:28:54,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:28:54,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:28:54,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:28:54,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:28:54,216 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:28:54,558 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:28:54,559 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:28:54,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:28:54 BoogieIcfgContainer [2018-11-23 11:28:54,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:28:54,565 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:28:54,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:28:54,571 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:28:54,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:28:53" (1/3) ... [2018-11-23 11:28:54,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfe98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:28:54, skipping insertion in model container [2018-11-23 11:28:54,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:28:54" (2/3) ... [2018-11-23 11:28:54,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cfe98a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:28:54, skipping insertion in model container [2018-11-23 11:28:54,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:28:54" (3/3) ... [2018-11-23 11:28:54,581 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_false-unreach-call4.i [2018-11-23 11:28:54,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:28:54,604 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:28:54,633 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:28:54,667 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:28:54,668 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:28:54,668 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:28:54,668 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:28:54,668 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:28:54,669 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:28:54,669 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:28:54,669 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:28:54,669 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:28:54,688 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 11:28:54,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:28:54,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:54,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:54,698 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:54,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:54,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 11:28:54,709 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:54,710 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:28:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:28:54,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:54,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:28:54,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 11:28:54,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 11:28:54,901 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 11:28:54,901 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret0 := main(); {20#true} is VALID [2018-11-23 11:28:54,904 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~x~0 := 268435441bv32; {37#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:54,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} assume !~bvugt32(~x~0, 1bv32); {21#false} is VALID [2018-11-23 11:28:54,906 INFO L256 TraceCheckUtils]: 6: Hoare triple {21#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {21#false} is VALID [2018-11-23 11:28:54,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {21#false} ~cond := #in~cond; {21#false} is VALID [2018-11-23 11:28:54,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {21#false} assume 0bv32 == ~cond; {21#false} is VALID [2018-11-23 11:28:54,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 11:28:54,910 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:28:54,910 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:28:54,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:28:54,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:28:54,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:28:54,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:28:54,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:28:54,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:54,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:28:54,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:28:54,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:28:54,968 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-11-23 11:28:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:55,165 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-23 11:28:55,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:28:55,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 11:28:55,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:28:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:28:55,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:28:55,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:28:55,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:28:55,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 11:28:55,348 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:55,360 INFO L225 Difference]: With dead ends: 29 [2018-11-23 11:28:55,360 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 11:28:55,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:28:55,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 11:28:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 11:28:55,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:28:55,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:55,521 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:55,521 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:55,524 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:28:55,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:28:55,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:55,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:55,526 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:55,526 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 11:28:55,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:55,529 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 11:28:55,530 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:28:55,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:55,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:55,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:28:55,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:28:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:28:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 11:28:55,535 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 11:28:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:28:55,535 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 11:28:55,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:28:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 11:28:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 11:28:55,536 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:55,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:55,537 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:55,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 11:28:55,538 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:55,538 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:28:55,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:28:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:55,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:28:55,662 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:28:55,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:28:55,663 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:28:55,663 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret0 := main(); {135#true} is VALID [2018-11-23 11:28:55,664 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 268435441bv32; {152#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:55,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {152#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {156#(= (bvadd main_~x~0 (_ bv4026531857 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:55,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {156#(= (bvadd main_~x~0 (_ bv4026531857 32)) (_ bv0 32))} assume !~bvugt32(~x~0, 1bv32); {136#false} is VALID [2018-11-23 11:28:55,666 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:28:55,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:28:55,666 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:28:55,667 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:28:55,668 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:28:55,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:28:55,841 INFO L273 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2018-11-23 11:28:55,842 INFO L273 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0bv32 == ~cond; {136#false} is VALID [2018-11-23 11:28:55,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2018-11-23 11:28:55,842 INFO L256 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {136#false} is VALID [2018-11-23 11:28:55,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {184#(bvugt main_~x~0 (_ bv1 32))} assume !~bvugt32(~x~0, 1bv32); {136#false} is VALID [2018-11-23 11:28:55,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {184#(bvugt main_~x~0 (_ bv1 32))} is VALID [2018-11-23 11:28:55,848 INFO L273 TraceCheckUtils]: 4: Hoare triple {135#true} ~x~0 := 268435441bv32; {188#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:55,848 INFO L256 TraceCheckUtils]: 3: Hoare triple {135#true} call #t~ret0 := main(); {135#true} is VALID [2018-11-23 11:28:55,848 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #31#return; {135#true} is VALID [2018-11-23 11:28:55,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2018-11-23 11:28:55,849 INFO L256 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {135#true} is VALID [2018-11-23 11:28:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 11:28:55,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:28:55,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:28:55,855 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:28:55,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:28:55,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:28:55,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:55,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:28:55,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:28:55,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:28:55,881 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 6 states. [2018-11-23 11:28:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:56,072 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 11:28:56,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:28:56,072 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-11-23 11:28:56,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:28:56,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:28:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 11:28:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:28:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 11:28:56,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2018-11-23 11:28:56,177 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:56,180 INFO L225 Difference]: With dead ends: 20 [2018-11-23 11:28:56,180 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:28:56,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:28:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:28:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:28:56,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:28:56,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:28:56,352 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:28:56,352 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:28:56,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:56,356 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:28:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:28:56,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:56,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:56,358 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:28:56,358 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:28:56,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:56,360 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-11-23 11:28:56,360 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:28:56,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:56,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:56,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:28:56,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:28:56,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:28:56,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 11:28:56,367 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2018-11-23 11:28:56,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:28:56,367 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 11:28:56,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:28:56,368 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 11:28:56,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:28:56,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:56,369 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:56,369 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:56,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:56,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1031021570, now seen corresponding path program 2 times [2018-11-23 11:28:56,371 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:56,372 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:28:56,402 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:28:56,437 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:28:56,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:28:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:56,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:28:56,800 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:28:56,801 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:28:56,801 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:28:56,801 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret0 := main(); {297#true} is VALID [2018-11-23 11:28:56,802 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 268435441bv32; {314#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:56,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {314#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {318#(= (bvadd main_~x~0 (_ bv4026531857 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:56,804 INFO L273 TraceCheckUtils]: 6: Hoare triple {318#(= (bvadd main_~x~0 (_ bv4026531857 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {322#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:56,805 INFO L273 TraceCheckUtils]: 7: Hoare triple {322#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {326#(= (_ bv268435435 32) main_~x~0)} is VALID [2018-11-23 11:28:56,805 INFO L273 TraceCheckUtils]: 8: Hoare triple {326#(= (_ bv268435435 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {330#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:56,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} assume !~bvugt32(~x~0, 1bv32); {298#false} is VALID [2018-11-23 11:28:56,806 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {298#false} is VALID [2018-11-23 11:28:56,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:28:56,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:28:56,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:28:56,808 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:28:56,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:28:56,981 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-23 11:28:56,982 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume 0bv32 == ~cond; {298#false} is VALID [2018-11-23 11:28:56,982 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-23 11:28:56,983 INFO L256 TraceCheckUtils]: 10: Hoare triple {298#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {298#false} is VALID [2018-11-23 11:28:56,984 INFO L273 TraceCheckUtils]: 9: Hoare triple {358#(bvugt main_~x~0 (_ bv1 32))} assume !~bvugt32(~x~0, 1bv32); {298#false} is VALID [2018-11-23 11:28:56,990 INFO L273 TraceCheckUtils]: 8: Hoare triple {362#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {358#(bvugt main_~x~0 (_ bv1 32))} is VALID [2018-11-23 11:28:56,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {366#(bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {362#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:56,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {370#(bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {366#(bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:56,999 INFO L273 TraceCheckUtils]: 5: Hoare triple {374#(bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {370#(bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:57,001 INFO L273 TraceCheckUtils]: 4: Hoare triple {297#true} ~x~0 := 268435441bv32; {374#(bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:57,001 INFO L256 TraceCheckUtils]: 3: Hoare triple {297#true} call #t~ret0 := main(); {297#true} is VALID [2018-11-23 11:28:57,002 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {297#true} {297#true} #31#return; {297#true} is VALID [2018-11-23 11:28:57,002 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-23 11:28:57,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-23 11:28:57,003 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:28:57,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:28:57,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:28:57,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:28:57,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:28:57,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:28:57,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:57,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:28:57,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:28:57,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:28:57,038 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 12 states. [2018-11-23 11:28:57,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:57,760 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 11:28:57,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:28:57,761 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-11-23 11:28:57,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:28:57,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:28:57,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-11-23 11:28:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:28:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 31 transitions. [2018-11-23 11:28:57,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 31 transitions. [2018-11-23 11:28:57,829 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:57,831 INFO L225 Difference]: With dead ends: 26 [2018-11-23 11:28:57,831 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:28:57,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:28:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:28:57,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 11:28:57,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:28:57,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 11:28:57,854 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:28:57,854 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:28:57,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:57,857 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:28:57,857 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:28:57,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:57,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:57,858 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 11:28:57,858 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 11:28:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:28:57,860 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 11:28:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:28:57,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:28:57,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:28:57,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:28:57,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:28:57,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:28:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 11:28:57,864 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 11:28:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:28:57,864 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 11:28:57,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:28:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 11:28:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 11:28:57,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:28:57,865 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:28:57,866 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:28:57,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:28:57,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1348629730, now seen corresponding path program 3 times [2018-11-23 11:28:57,867 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:28:57,867 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:28:57,886 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:28:57,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 11:28:57,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:28:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:28:57,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:28:58,265 INFO L256 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2018-11-23 11:28:58,266 INFO L273 TraceCheckUtils]: 1: Hoare triple {527#true} assume true; {527#true} is VALID [2018-11-23 11:28:58,266 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {527#true} {527#true} #31#return; {527#true} is VALID [2018-11-23 11:28:58,267 INFO L256 TraceCheckUtils]: 3: Hoare triple {527#true} call #t~ret0 := main(); {527#true} is VALID [2018-11-23 11:28:58,269 INFO L273 TraceCheckUtils]: 4: Hoare triple {527#true} ~x~0 := 268435441bv32; {544#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:58,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {544#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {548#(= (_ bv268435439 32) main_~x~0)} is VALID [2018-11-23 11:28:58,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {548#(= (_ bv268435439 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {552#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:58,272 INFO L273 TraceCheckUtils]: 7: Hoare triple {552#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {556#(= (bvadd main_~x~0 (_ bv4026531861 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:58,293 INFO L273 TraceCheckUtils]: 8: Hoare triple {556#(= (bvadd main_~x~0 (_ bv4026531861 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {560#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:58,295 INFO L273 TraceCheckUtils]: 9: Hoare triple {560#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {564#(= (_ bv268435431 32) main_~x~0)} is VALID [2018-11-23 11:28:58,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {564#(= (_ bv268435431 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {568#(= (bvadd main_~x~0 (_ bv4026531867 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:58,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {568#(= (bvadd main_~x~0 (_ bv4026531867 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {572#(= (bvadd main_~x~0 (_ bv4026531869 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:58,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {572#(= (bvadd main_~x~0 (_ bv4026531869 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {576#(= (bvadd main_~x~0 (_ bv4026531871 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:58,298 INFO L273 TraceCheckUtils]: 13: Hoare triple {576#(= (bvadd main_~x~0 (_ bv4026531871 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {580#(= (bvadd main_~x~0 (_ bv4026531873 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:58,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {580#(= (bvadd main_~x~0 (_ bv4026531873 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {584#(= (bvadd main_~x~0 (_ bv4026531875 32)) (_ bv0 32))} is VALID [2018-11-23 11:28:58,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {584#(= (bvadd main_~x~0 (_ bv4026531875 32)) (_ bv0 32))} assume !~bvugt32(~x~0, 1bv32); {528#false} is VALID [2018-11-23 11:28:58,299 INFO L256 TraceCheckUtils]: 16: Hoare triple {528#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {528#false} is VALID [2018-11-23 11:28:58,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {528#false} ~cond := #in~cond; {528#false} is VALID [2018-11-23 11:28:58,300 INFO L273 TraceCheckUtils]: 18: Hoare triple {528#false} assume 0bv32 == ~cond; {528#false} is VALID [2018-11-23 11:28:58,301 INFO L273 TraceCheckUtils]: 19: Hoare triple {528#false} assume !false; {528#false} is VALID [2018-11-23 11:28:58,302 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:28:58,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:28:58,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {528#false} assume !false; {528#false} is VALID [2018-11-23 11:28:58,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {528#false} assume 0bv32 == ~cond; {528#false} is VALID [2018-11-23 11:28:58,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {528#false} ~cond := #in~cond; {528#false} is VALID [2018-11-23 11:28:58,867 INFO L256 TraceCheckUtils]: 16: Hoare triple {528#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {528#false} is VALID [2018-11-23 11:28:58,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {612#(bvugt main_~x~0 (_ bv1 32))} assume !~bvugt32(~x~0, 1bv32); {528#false} is VALID [2018-11-23 11:28:58,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {616#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {612#(bvugt main_~x~0 (_ bv1 32))} is VALID [2018-11-23 11:28:58,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {620#(bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {616#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {624#(bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {620#(bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {628#(bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {624#(bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,880 INFO L273 TraceCheckUtils]: 10: Hoare triple {632#(bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {628#(bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,883 INFO L273 TraceCheckUtils]: 9: Hoare triple {636#(bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {632#(bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {640#(bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {636#(bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {644#(bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {640#(bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,891 INFO L273 TraceCheckUtils]: 6: Hoare triple {648#(bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {644#(bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,894 INFO L273 TraceCheckUtils]: 5: Hoare triple {652#(bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {648#(bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,902 INFO L273 TraceCheckUtils]: 4: Hoare triple {527#true} ~x~0 := 268435441bv32; {652#(bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv1 32))} is VALID [2018-11-23 11:28:58,903 INFO L256 TraceCheckUtils]: 3: Hoare triple {527#true} call #t~ret0 := main(); {527#true} is VALID [2018-11-23 11:28:58,903 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {527#true} {527#true} #31#return; {527#true} is VALID [2018-11-23 11:28:58,903 INFO L273 TraceCheckUtils]: 1: Hoare triple {527#true} assume true; {527#true} is VALID [2018-11-23 11:28:58,904 INFO L256 TraceCheckUtils]: 0: Hoare triple {527#true} call ULTIMATE.init(); {527#true} is VALID [2018-11-23 11:28:58,905 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:28:58,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:28:58,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 11:28:58,907 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 20 [2018-11-23 11:28:58,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:28:58,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:28:58,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:28:58,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:28:58,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:28:58,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:28:58,957 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 24 states. [2018-11-23 11:28:59,755 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:29:01,216 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-23 11:29:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:01,422 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2018-11-23 11:29:01,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:29:01,422 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 20 [2018-11-23 11:29:01,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:01,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:29:01,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-11-23 11:29:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:29:01,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 49 transitions. [2018-11-23 11:29:01,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 49 transitions. [2018-11-23 11:29:02,051 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:02,053 INFO L225 Difference]: With dead ends: 38 [2018-11-23 11:29:02,053 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:29:02,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=430, Invalid=760, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:29:02,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:29:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 11:29:02,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:02,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:02,098 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:02,098 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:02,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:02,104 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:29:02,104 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:29:02,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:02,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:02,105 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:02,105 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 11:29:02,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:02,107 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 11:29:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:29:02,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:02,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:02,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:02,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:29:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-11-23 11:29:02,111 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2018-11-23 11:29:02,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:02,112 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-11-23 11:29:02,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:29:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-11-23 11:29:02,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 11:29:02,113 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:02,113 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:02,114 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:02,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:02,114 INFO L82 PathProgramCache]: Analyzing trace with hash 144400734, now seen corresponding path program 4 times [2018-11-23 11:29:02,115 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:02,115 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:29:02,131 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:29:02,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:29:02,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:02,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:02,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:02,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {889#true} call ULTIMATE.init(); {889#true} is VALID [2018-11-23 11:29:02,840 INFO L273 TraceCheckUtils]: 1: Hoare triple {889#true} assume true; {889#true} is VALID [2018-11-23 11:29:02,840 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {889#true} {889#true} #31#return; {889#true} is VALID [2018-11-23 11:29:02,840 INFO L256 TraceCheckUtils]: 3: Hoare triple {889#true} call #t~ret0 := main(); {889#true} is VALID [2018-11-23 11:29:02,841 INFO L273 TraceCheckUtils]: 4: Hoare triple {889#true} ~x~0 := 268435441bv32; {906#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,846 INFO L273 TraceCheckUtils]: 5: Hoare triple {906#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {910#(= (bvadd main_~x~0 (_ bv4026531857 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,847 INFO L273 TraceCheckUtils]: 6: Hoare triple {910#(= (bvadd main_~x~0 (_ bv4026531857 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {914#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {914#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {918#(= (_ bv268435435 32) main_~x~0)} is VALID [2018-11-23 11:29:02,849 INFO L273 TraceCheckUtils]: 8: Hoare triple {918#(= (_ bv268435435 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {922#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,850 INFO L273 TraceCheckUtils]: 9: Hoare triple {922#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {926#(= (_ bv268435431 32) main_~x~0)} is VALID [2018-11-23 11:29:02,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {926#(= (_ bv268435431 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {930#(= (bvadd main_~x~0 (_ bv4026531867 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {930#(= (bvadd main_~x~0 (_ bv4026531867 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {934#(= (_ bv268435427 32) main_~x~0)} is VALID [2018-11-23 11:29:02,852 INFO L273 TraceCheckUtils]: 12: Hoare triple {934#(= (_ bv268435427 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {938#(= (bvadd main_~x~0 (_ bv4026531871 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,852 INFO L273 TraceCheckUtils]: 13: Hoare triple {938#(= (bvadd main_~x~0 (_ bv4026531871 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {942#(= (bvadd main_~x~0 (_ bv4026531873 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,853 INFO L273 TraceCheckUtils]: 14: Hoare triple {942#(= (bvadd main_~x~0 (_ bv4026531873 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {946#(= (bvadd main_~x~0 (_ bv4026531875 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {946#(= (bvadd main_~x~0 (_ bv4026531875 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {950#(= (_ bv268435419 32) main_~x~0)} is VALID [2018-11-23 11:29:02,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {950#(= (_ bv268435419 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {954#(= (bvadd main_~x~0 (_ bv4026531879 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {954#(= (bvadd main_~x~0 (_ bv4026531879 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {958#(= (_ bv268435415 32) main_~x~0)} is VALID [2018-11-23 11:29:02,857 INFO L273 TraceCheckUtils]: 18: Hoare triple {958#(= (_ bv268435415 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {962#(= (bvadd main_~x~0 (_ bv4026531883 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {962#(= (bvadd main_~x~0 (_ bv4026531883 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {966#(= (bvadd main_~x~0 (_ bv4026531885 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {966#(= (bvadd main_~x~0 (_ bv4026531885 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {970#(= (bvadd main_~x~0 (_ bv4026531887 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,876 INFO L273 TraceCheckUtils]: 21: Hoare triple {970#(= (bvadd main_~x~0 (_ bv4026531887 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {974#(= (bvadd main_~x~0 (_ bv4026531889 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,877 INFO L273 TraceCheckUtils]: 22: Hoare triple {974#(= (bvadd main_~x~0 (_ bv4026531889 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {978#(= (bvadd main_~x~0 (_ bv4026531891 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,877 INFO L273 TraceCheckUtils]: 23: Hoare triple {978#(= (bvadd main_~x~0 (_ bv4026531891 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {982#(= (_ bv268435403 32) main_~x~0)} is VALID [2018-11-23 11:29:02,881 INFO L273 TraceCheckUtils]: 24: Hoare triple {982#(= (_ bv268435403 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {986#(= (bvadd main_~x~0 (_ bv4026531895 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,881 INFO L273 TraceCheckUtils]: 25: Hoare triple {986#(= (bvadd main_~x~0 (_ bv4026531895 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {990#(= (bvadd main_~x~0 (_ bv4026531897 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,882 INFO L273 TraceCheckUtils]: 26: Hoare triple {990#(= (bvadd main_~x~0 (_ bv4026531897 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {994#(= (bvadd main_~x~0 (_ bv4026531899 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:02,883 INFO L273 TraceCheckUtils]: 27: Hoare triple {994#(= (bvadd main_~x~0 (_ bv4026531899 32)) (_ bv0 32))} assume !~bvugt32(~x~0, 1bv32); {890#false} is VALID [2018-11-23 11:29:02,883 INFO L256 TraceCheckUtils]: 28: Hoare triple {890#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {890#false} is VALID [2018-11-23 11:29:02,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {890#false} ~cond := #in~cond; {890#false} is VALID [2018-11-23 11:29:02,884 INFO L273 TraceCheckUtils]: 30: Hoare triple {890#false} assume 0bv32 == ~cond; {890#false} is VALID [2018-11-23 11:29:02,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {890#false} assume !false; {890#false} is VALID [2018-11-23 11:29:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:02,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:04,510 INFO L273 TraceCheckUtils]: 31: Hoare triple {890#false} assume !false; {890#false} is VALID [2018-11-23 11:29:04,510 INFO L273 TraceCheckUtils]: 30: Hoare triple {890#false} assume 0bv32 == ~cond; {890#false} is VALID [2018-11-23 11:29:04,511 INFO L273 TraceCheckUtils]: 29: Hoare triple {890#false} ~cond := #in~cond; {890#false} is VALID [2018-11-23 11:29:04,511 INFO L256 TraceCheckUtils]: 28: Hoare triple {890#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {890#false} is VALID [2018-11-23 11:29:04,512 INFO L273 TraceCheckUtils]: 27: Hoare triple {1022#(bvugt main_~x~0 (_ bv1 32))} assume !~bvugt32(~x~0, 1bv32); {890#false} is VALID [2018-11-23 11:29:04,512 INFO L273 TraceCheckUtils]: 26: Hoare triple {1026#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1022#(bvugt main_~x~0 (_ bv1 32))} is VALID [2018-11-23 11:29:04,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {1030#(bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1026#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {1034#(bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1030#(bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,519 INFO L273 TraceCheckUtils]: 23: Hoare triple {1038#(bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1034#(bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,521 INFO L273 TraceCheckUtils]: 22: Hoare triple {1042#(bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1038#(bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {1046#(bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1042#(bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,526 INFO L273 TraceCheckUtils]: 20: Hoare triple {1050#(bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1046#(bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,528 INFO L273 TraceCheckUtils]: 19: Hoare triple {1054#(bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1050#(bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {1058#(bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1054#(bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {1062#(bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1058#(bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,538 INFO L273 TraceCheckUtils]: 16: Hoare triple {1066#(bvugt (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1062#(bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {1070#(bvugt (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1066#(bvugt (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,542 INFO L273 TraceCheckUtils]: 14: Hoare triple {1074#(bvugt (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1070#(bvugt (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,545 INFO L273 TraceCheckUtils]: 13: Hoare triple {1078#(bvugt (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1074#(bvugt (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {1082#(bvugt (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1078#(bvugt (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {1086#(bvugt (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1082#(bvugt (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {1090#(bvugt (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1086#(bvugt (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {1094#(bvugt (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1090#(bvugt (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {1098#(bvugt (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1094#(bvugt (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {1102#(bvugt (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1098#(bvugt (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,565 INFO L273 TraceCheckUtils]: 6: Hoare triple {1106#(bvugt (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1102#(bvugt (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {1110#(bvugt (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1106#(bvugt (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,569 INFO L273 TraceCheckUtils]: 4: Hoare triple {889#true} ~x~0 := 268435441bv32; {1110#(bvugt (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:04,569 INFO L256 TraceCheckUtils]: 3: Hoare triple {889#true} call #t~ret0 := main(); {889#true} is VALID [2018-11-23 11:29:04,569 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {889#true} {889#true} #31#return; {889#true} is VALID [2018-11-23 11:29:04,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {889#true} assume true; {889#true} is VALID [2018-11-23 11:29:04,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {889#true} call ULTIMATE.init(); {889#true} is VALID [2018-11-23 11:29:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:04,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:04,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 11:29:04,584 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 32 [2018-11-23 11:29:04,584 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:04,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 11:29:04,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:04,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 11:29:04,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 11:29:04,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 11:29:04,674 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 48 states. [2018-11-23 11:29:07,701 WARN L180 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 11:29:08,395 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-23 11:29:09,065 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-23 11:29:09,696 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 11:29:10,300 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 11:29:10,895 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-23 11:29:11,467 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:29:12,004 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:29:12,578 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:29:13,073 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:29:13,521 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:29:13,921 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:29:14,304 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:29:17,450 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-23 11:29:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:18,022 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2018-11-23 11:29:18,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 11:29:18,023 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 32 [2018-11-23 11:29:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:29:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:29:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 85 transitions. [2018-11-23 11:29:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 11:29:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 85 transitions. [2018-11-23 11:29:18,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 85 transitions. [2018-11-23 11:29:25,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:25,863 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:29:25,864 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:29:25,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1726, Invalid=3244, Unknown=0, NotChecked=0, Total=4970 [2018-11-23 11:29:25,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:29:26,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 11:29:26,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:29:26,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 11:29:26,168 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:29:26,168 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:29:26,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:26,171 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:29:26,172 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:29:26,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:26,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:26,173 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 11:29:26,173 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 11:29:26,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:29:26,175 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-11-23 11:29:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:29:26,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:29:26,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:29:26,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:29:26,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:29:26,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 11:29:26,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-11-23 11:29:26,179 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2018-11-23 11:29:26,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:29:26,180 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-11-23 11:29:26,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 11:29:26,180 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-11-23 11:29:26,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 11:29:26,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:29:26,182 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:29:26,182 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:29:26,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:29:26,182 INFO L82 PathProgramCache]: Analyzing trace with hash -726077986, now seen corresponding path program 5 times [2018-11-23 11:29:26,183 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:29:26,183 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:29:26,211 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 11:29:28,179 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:29:28,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:29:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:29:28,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:29:29,930 INFO L256 TraceCheckUtils]: 0: Hoare triple {1515#true} call ULTIMATE.init(); {1515#true} is VALID [2018-11-23 11:29:29,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {1515#true} assume true; {1515#true} is VALID [2018-11-23 11:29:29,931 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1515#true} {1515#true} #31#return; {1515#true} is VALID [2018-11-23 11:29:29,931 INFO L256 TraceCheckUtils]: 3: Hoare triple {1515#true} call #t~ret0 := main(); {1515#true} is VALID [2018-11-23 11:29:29,931 INFO L273 TraceCheckUtils]: 4: Hoare triple {1515#true} ~x~0 := 268435441bv32; {1532#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,932 INFO L273 TraceCheckUtils]: 5: Hoare triple {1532#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1536#(= (_ bv268435439 32) main_~x~0)} is VALID [2018-11-23 11:29:29,932 INFO L273 TraceCheckUtils]: 6: Hoare triple {1536#(= (_ bv268435439 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1540#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {1540#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1544#(= (_ bv268435435 32) main_~x~0)} is VALID [2018-11-23 11:29:29,933 INFO L273 TraceCheckUtils]: 8: Hoare triple {1544#(= (_ bv268435435 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1548#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {1548#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1552#(= (bvadd main_~x~0 (_ bv4026531865 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {1552#(= (bvadd main_~x~0 (_ bv4026531865 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1556#(= (_ bv268435429 32) main_~x~0)} is VALID [2018-11-23 11:29:29,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {1556#(= (_ bv268435429 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1560#(= (bvadd main_~x~0 (_ bv4026531869 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {1560#(= (bvadd main_~x~0 (_ bv4026531869 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1564#(= (bvadd main_~x~0 (_ bv4026531871 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {1564#(= (bvadd main_~x~0 (_ bv4026531871 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1568#(= (_ bv268435423 32) main_~x~0)} is VALID [2018-11-23 11:29:29,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {1568#(= (_ bv268435423 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1572#(= (bvadd main_~x~0 (_ bv4026531875 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,938 INFO L273 TraceCheckUtils]: 15: Hoare triple {1572#(= (bvadd main_~x~0 (_ bv4026531875 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1576#(= (_ bv268435419 32) main_~x~0)} is VALID [2018-11-23 11:29:29,939 INFO L273 TraceCheckUtils]: 16: Hoare triple {1576#(= (_ bv268435419 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1580#(= (bvadd main_~x~0 (_ bv4026531879 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {1580#(= (bvadd main_~x~0 (_ bv4026531879 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1584#(= (_ bv268435415 32) main_~x~0)} is VALID [2018-11-23 11:29:29,940 INFO L273 TraceCheckUtils]: 18: Hoare triple {1584#(= (_ bv268435415 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1588#(= (bvadd main_~x~0 (_ bv4026531883 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,941 INFO L273 TraceCheckUtils]: 19: Hoare triple {1588#(= (bvadd main_~x~0 (_ bv4026531883 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1592#(= (bvadd main_~x~0 (_ bv4026531885 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,942 INFO L273 TraceCheckUtils]: 20: Hoare triple {1592#(= (bvadd main_~x~0 (_ bv4026531885 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1596#(= (_ bv268435409 32) main_~x~0)} is VALID [2018-11-23 11:29:29,942 INFO L273 TraceCheckUtils]: 21: Hoare triple {1596#(= (_ bv268435409 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1600#(= (bvadd main_~x~0 (_ bv4026531889 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,943 INFO L273 TraceCheckUtils]: 22: Hoare triple {1600#(= (bvadd main_~x~0 (_ bv4026531889 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1604#(= (_ bv268435405 32) main_~x~0)} is VALID [2018-11-23 11:29:29,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {1604#(= (_ bv268435405 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1608#(= (bvadd main_~x~0 (_ bv4026531893 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {1608#(= (bvadd main_~x~0 (_ bv4026531893 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1612#(= (bvadd main_~x~0 (_ bv4026531895 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,946 INFO L273 TraceCheckUtils]: 25: Hoare triple {1612#(= (bvadd main_~x~0 (_ bv4026531895 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1616#(= (bvadd main_~x~0 (_ bv4026531897 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {1616#(= (bvadd main_~x~0 (_ bv4026531897 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1620#(= (_ bv268435397 32) main_~x~0)} is VALID [2018-11-23 11:29:29,979 INFO L273 TraceCheckUtils]: 27: Hoare triple {1620#(= (_ bv268435397 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1624#(= (bvadd main_~x~0 (_ bv4026531901 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,988 INFO L273 TraceCheckUtils]: 28: Hoare triple {1624#(= (bvadd main_~x~0 (_ bv4026531901 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1628#(= (bvadd main_~x~0 (_ bv4026531903 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {1628#(= (bvadd main_~x~0 (_ bv4026531903 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1632#(= (bvadd main_~x~0 (_ bv4026531905 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,990 INFO L273 TraceCheckUtils]: 30: Hoare triple {1632#(= (bvadd main_~x~0 (_ bv4026531905 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1636#(= (bvadd main_~x~0 (_ bv4026531907 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,991 INFO L273 TraceCheckUtils]: 31: Hoare triple {1636#(= (bvadd main_~x~0 (_ bv4026531907 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1640#(= (bvadd main_~x~0 (_ bv4026531909 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,992 INFO L273 TraceCheckUtils]: 32: Hoare triple {1640#(= (bvadd main_~x~0 (_ bv4026531909 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1644#(= (bvadd main_~x~0 (_ bv4026531911 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,992 INFO L273 TraceCheckUtils]: 33: Hoare triple {1644#(= (bvadd main_~x~0 (_ bv4026531911 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1648#(= (bvadd main_~x~0 (_ bv4026531913 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:29,993 INFO L273 TraceCheckUtils]: 34: Hoare triple {1648#(= (bvadd main_~x~0 (_ bv4026531913 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1652#(= (bvadd main_~x~0 (_ bv4026531915 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,004 INFO L273 TraceCheckUtils]: 35: Hoare triple {1652#(= (bvadd main_~x~0 (_ bv4026531915 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1656#(= (_ bv268435379 32) main_~x~0)} is VALID [2018-11-23 11:29:30,005 INFO L273 TraceCheckUtils]: 36: Hoare triple {1656#(= (_ bv268435379 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1660#(= (bvadd main_~x~0 (_ bv4026531919 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,006 INFO L273 TraceCheckUtils]: 37: Hoare triple {1660#(= (bvadd main_~x~0 (_ bv4026531919 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1664#(= (bvadd main_~x~0 (_ bv4026531921 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,007 INFO L273 TraceCheckUtils]: 38: Hoare triple {1664#(= (bvadd main_~x~0 (_ bv4026531921 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1668#(= (bvadd main_~x~0 (_ bv4026531923 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,012 INFO L273 TraceCheckUtils]: 39: Hoare triple {1668#(= (bvadd main_~x~0 (_ bv4026531923 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1672#(= (bvadd main_~x~0 (_ bv4026531925 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,014 INFO L273 TraceCheckUtils]: 40: Hoare triple {1672#(= (bvadd main_~x~0 (_ bv4026531925 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1676#(= (bvadd main_~x~0 (_ bv4026531927 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,014 INFO L273 TraceCheckUtils]: 41: Hoare triple {1676#(= (bvadd main_~x~0 (_ bv4026531927 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1680#(= (bvadd main_~x~0 (_ bv4026531929 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,015 INFO L273 TraceCheckUtils]: 42: Hoare triple {1680#(= (bvadd main_~x~0 (_ bv4026531929 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1684#(= (bvadd main_~x~0 (_ bv4026531931 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,015 INFO L273 TraceCheckUtils]: 43: Hoare triple {1684#(= (bvadd main_~x~0 (_ bv4026531931 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1688#(= (bvadd main_~x~0 (_ bv4026531933 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,016 INFO L273 TraceCheckUtils]: 44: Hoare triple {1688#(= (bvadd main_~x~0 (_ bv4026531933 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1692#(= (bvadd main_~x~0 (_ bv4026531935 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,016 INFO L273 TraceCheckUtils]: 45: Hoare triple {1692#(= (bvadd main_~x~0 (_ bv4026531935 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1696#(= (bvadd main_~x~0 (_ bv4026531937 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,017 INFO L273 TraceCheckUtils]: 46: Hoare triple {1696#(= (bvadd main_~x~0 (_ bv4026531937 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1700#(= (bvadd main_~x~0 (_ bv4026531939 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,017 INFO L273 TraceCheckUtils]: 47: Hoare triple {1700#(= (bvadd main_~x~0 (_ bv4026531939 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1704#(= (bvadd main_~x~0 (_ bv4026531941 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,018 INFO L273 TraceCheckUtils]: 48: Hoare triple {1704#(= (bvadd main_~x~0 (_ bv4026531941 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1708#(= (bvadd main_~x~0 (_ bv4026531943 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,019 INFO L273 TraceCheckUtils]: 49: Hoare triple {1708#(= (bvadd main_~x~0 (_ bv4026531943 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1712#(= (bvadd main_~x~0 (_ bv4026531945 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {1712#(= (bvadd main_~x~0 (_ bv4026531945 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1716#(= (bvadd main_~x~0 (_ bv4026531947 32)) (_ bv0 32))} is VALID [2018-11-23 11:29:30,020 INFO L273 TraceCheckUtils]: 51: Hoare triple {1716#(= (bvadd main_~x~0 (_ bv4026531947 32)) (_ bv0 32))} assume !~bvugt32(~x~0, 1bv32); {1516#false} is VALID [2018-11-23 11:29:30,021 INFO L256 TraceCheckUtils]: 52: Hoare triple {1516#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {1516#false} is VALID [2018-11-23 11:29:30,021 INFO L273 TraceCheckUtils]: 53: Hoare triple {1516#false} ~cond := #in~cond; {1516#false} is VALID [2018-11-23 11:29:30,021 INFO L273 TraceCheckUtils]: 54: Hoare triple {1516#false} assume 0bv32 == ~cond; {1516#false} is VALID [2018-11-23 11:29:30,022 INFO L273 TraceCheckUtils]: 55: Hoare triple {1516#false} assume !false; {1516#false} is VALID [2018-11-23 11:29:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:30,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:29:36,713 INFO L273 TraceCheckUtils]: 55: Hoare triple {1516#false} assume !false; {1516#false} is VALID [2018-11-23 11:29:36,713 INFO L273 TraceCheckUtils]: 54: Hoare triple {1516#false} assume 0bv32 == ~cond; {1516#false} is VALID [2018-11-23 11:29:36,713 INFO L273 TraceCheckUtils]: 53: Hoare triple {1516#false} ~cond := #in~cond; {1516#false} is VALID [2018-11-23 11:29:36,713 INFO L256 TraceCheckUtils]: 52: Hoare triple {1516#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {1516#false} is VALID [2018-11-23 11:29:36,714 INFO L273 TraceCheckUtils]: 51: Hoare triple {1744#(bvugt main_~x~0 (_ bv1 32))} assume !~bvugt32(~x~0, 1bv32); {1516#false} is VALID [2018-11-23 11:29:36,715 INFO L273 TraceCheckUtils]: 50: Hoare triple {1748#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1744#(bvugt main_~x~0 (_ bv1 32))} is VALID [2018-11-23 11:29:36,717 INFO L273 TraceCheckUtils]: 49: Hoare triple {1752#(bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1748#(bvugt (bvadd main_~x~0 (_ bv4294967294 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,720 INFO L273 TraceCheckUtils]: 48: Hoare triple {1756#(bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1752#(bvugt (bvadd main_~x~0 (_ bv4294967292 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,723 INFO L273 TraceCheckUtils]: 47: Hoare triple {1760#(bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1756#(bvugt (bvadd main_~x~0 (_ bv4294967290 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,725 INFO L273 TraceCheckUtils]: 46: Hoare triple {1764#(bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1760#(bvugt (bvadd main_~x~0 (_ bv4294967288 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,727 INFO L273 TraceCheckUtils]: 45: Hoare triple {1768#(bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1764#(bvugt (bvadd main_~x~0 (_ bv4294967286 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,731 INFO L273 TraceCheckUtils]: 44: Hoare triple {1772#(bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1768#(bvugt (bvadd main_~x~0 (_ bv4294967284 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,733 INFO L273 TraceCheckUtils]: 43: Hoare triple {1776#(bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1772#(bvugt (bvadd main_~x~0 (_ bv4294967282 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,735 INFO L273 TraceCheckUtils]: 42: Hoare triple {1780#(bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1776#(bvugt (bvadd main_~x~0 (_ bv4294967280 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {1784#(bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1780#(bvugt (bvadd main_~x~0 (_ bv4294967278 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,741 INFO L273 TraceCheckUtils]: 40: Hoare triple {1788#(bvugt (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1784#(bvugt (bvadd main_~x~0 (_ bv4294967276 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,743 INFO L273 TraceCheckUtils]: 39: Hoare triple {1792#(bvugt (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1788#(bvugt (bvadd main_~x~0 (_ bv4294967274 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,745 INFO L273 TraceCheckUtils]: 38: Hoare triple {1796#(bvugt (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1792#(bvugt (bvadd main_~x~0 (_ bv4294967272 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {1800#(bvugt (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1796#(bvugt (bvadd main_~x~0 (_ bv4294967270 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,750 INFO L273 TraceCheckUtils]: 36: Hoare triple {1804#(bvugt (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1800#(bvugt (bvadd main_~x~0 (_ bv4294967268 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,752 INFO L273 TraceCheckUtils]: 35: Hoare triple {1808#(bvugt (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1804#(bvugt (bvadd main_~x~0 (_ bv4294967266 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,754 INFO L273 TraceCheckUtils]: 34: Hoare triple {1812#(bvugt (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1808#(bvugt (bvadd main_~x~0 (_ bv4294967264 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,756 INFO L273 TraceCheckUtils]: 33: Hoare triple {1816#(bvugt (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1812#(bvugt (bvadd main_~x~0 (_ bv4294967262 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,759 INFO L273 TraceCheckUtils]: 32: Hoare triple {1820#(bvugt (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1816#(bvugt (bvadd main_~x~0 (_ bv4294967260 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,762 INFO L273 TraceCheckUtils]: 31: Hoare triple {1824#(bvugt (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1820#(bvugt (bvadd main_~x~0 (_ bv4294967258 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {1828#(bvugt (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1824#(bvugt (bvadd main_~x~0 (_ bv4294967256 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {1832#(bvugt (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1828#(bvugt (bvadd main_~x~0 (_ bv4294967254 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,770 INFO L273 TraceCheckUtils]: 28: Hoare triple {1836#(bvugt (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1832#(bvugt (bvadd main_~x~0 (_ bv4294967252 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,773 INFO L273 TraceCheckUtils]: 27: Hoare triple {1840#(bvugt (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1836#(bvugt (bvadd main_~x~0 (_ bv4294967250 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,776 INFO L273 TraceCheckUtils]: 26: Hoare triple {1844#(bvugt (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1840#(bvugt (bvadd main_~x~0 (_ bv4294967248 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {1848#(bvugt (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1844#(bvugt (bvadd main_~x~0 (_ bv4294967246 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,780 INFO L273 TraceCheckUtils]: 24: Hoare triple {1852#(bvugt (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1848#(bvugt (bvadd main_~x~0 (_ bv4294967244 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,783 INFO L273 TraceCheckUtils]: 23: Hoare triple {1856#(bvugt (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1852#(bvugt (bvadd main_~x~0 (_ bv4294967242 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {1860#(bvugt (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1856#(bvugt (bvadd main_~x~0 (_ bv4294967240 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {1864#(bvugt (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1860#(bvugt (bvadd main_~x~0 (_ bv4294967238 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,793 INFO L273 TraceCheckUtils]: 20: Hoare triple {1868#(bvugt (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1864#(bvugt (bvadd main_~x~0 (_ bv4294967236 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {1872#(bvugt (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1868#(bvugt (bvadd main_~x~0 (_ bv4294967234 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,797 INFO L273 TraceCheckUtils]: 18: Hoare triple {1876#(bvugt (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1872#(bvugt (bvadd main_~x~0 (_ bv4294967232 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,800 INFO L273 TraceCheckUtils]: 17: Hoare triple {1880#(bvugt (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1876#(bvugt (bvadd main_~x~0 (_ bv4294967230 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {1884#(bvugt (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1880#(bvugt (bvadd main_~x~0 (_ bv4294967228 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,806 INFO L273 TraceCheckUtils]: 15: Hoare triple {1888#(bvugt (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1884#(bvugt (bvadd main_~x~0 (_ bv4294967226 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {1892#(bvugt (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1888#(bvugt (bvadd main_~x~0 (_ bv4294967224 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {1896#(bvugt (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1892#(bvugt (bvadd main_~x~0 (_ bv4294967222 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {1900#(bvugt (bvadd main_~x~0 (_ bv4294967218 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1896#(bvugt (bvadd main_~x~0 (_ bv4294967220 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {1904#(bvugt (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1900#(bvugt (bvadd main_~x~0 (_ bv4294967218 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {1908#(bvugt (bvadd main_~x~0 (_ bv4294967214 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1904#(bvugt (bvadd main_~x~0 (_ bv4294967216 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {1912#(bvugt (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1908#(bvugt (bvadd main_~x~0 (_ bv4294967214 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {1916#(bvugt (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1912#(bvugt (bvadd main_~x~0 (_ bv4294967212 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {1920#(bvugt (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1916#(bvugt (bvadd main_~x~0 (_ bv4294967210 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {1924#(bvugt (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1920#(bvugt (bvadd main_~x~0 (_ bv4294967208 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {1928#(bvugt (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv1 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {1924#(bvugt (bvadd main_~x~0 (_ bv4294967206 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,836 INFO L273 TraceCheckUtils]: 4: Hoare triple {1515#true} ~x~0 := 268435441bv32; {1928#(bvugt (bvadd main_~x~0 (_ bv4294967204 32)) (_ bv1 32))} is VALID [2018-11-23 11:29:36,837 INFO L256 TraceCheckUtils]: 3: Hoare triple {1515#true} call #t~ret0 := main(); {1515#true} is VALID [2018-11-23 11:29:36,837 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1515#true} {1515#true} #31#return; {1515#true} is VALID [2018-11-23 11:29:36,837 INFO L273 TraceCheckUtils]: 1: Hoare triple {1515#true} assume true; {1515#true} is VALID [2018-11-23 11:29:36,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {1515#true} call ULTIMATE.init(); {1515#true} is VALID [2018-11-23 11:29:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:29:36,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:29:36,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2018-11-23 11:29:36,849 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 56 [2018-11-23 11:29:36,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:29:36,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2018-11-23 11:29:36,997 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:29:36,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-23 11:29:36,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-23 11:29:37,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2018-11-23 11:29:37,001 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 96 states. [2018-11-23 11:29:47,531 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 142 [2018-11-23 11:29:50,634 WARN L180 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 139 [2018-11-23 11:29:53,623 WARN L180 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 136 [2018-11-23 11:29:56,512 WARN L180 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 133 [2018-11-23 11:29:59,407 WARN L180 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 130 [2018-11-23 11:30:02,247 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification that was a NOOP. DAG size: 127 [2018-11-23 11:30:04,982 WARN L180 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 124 [2018-11-23 11:30:07,673 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification that was a NOOP. DAG size: 121 [2018-11-23 11:30:10,257 WARN L180 SmtUtils]: Spent 996.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-11-23 11:30:12,773 WARN L180 SmtUtils]: Spent 946.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2018-11-23 11:30:15,400 WARN L180 SmtUtils]: Spent 889.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-11-23 11:30:17,790 WARN L180 SmtUtils]: Spent 858.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-23 11:30:20,134 WARN L180 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-23 11:30:22,408 WARN L180 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-23 11:30:24,633 WARN L180 SmtUtils]: Spent 746.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-11-23 11:30:26,755 WARN L180 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2018-11-23 11:30:28,854 WARN L180 SmtUtils]: Spent 657.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-23 11:30:30,913 WARN L180 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2018-11-23 11:30:32,888 WARN L180 SmtUtils]: Spent 593.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-23 11:30:34,752 WARN L180 SmtUtils]: Spent 532.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2018-11-23 11:30:36,566 WARN L180 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-23 11:30:38,308 WARN L180 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-11-23 11:30:40,025 WARN L180 SmtUtils]: Spent 439.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2018-11-23 11:30:41,665 WARN L180 SmtUtils]: Spent 411.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-23 11:30:43,270 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-23 11:30:44,792 WARN L180 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-11-23 11:30:46,235 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-23 11:30:47,612 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 11:30:48,947 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2018-11-23 11:30:50,307 WARN L180 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2018-11-23 11:30:51,514 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-11-23 11:30:52,636 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:30:53,714 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 11:30:54,699 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2018-11-23 11:30:55,626 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-23 11:30:56,476 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-23 11:30:57,277 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-23 11:31:04,799 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 141 [2018-11-23 11:31:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:31:06,761 INFO L93 Difference]: Finished difference Result 110 states and 157 transitions. [2018-11-23 11:31:06,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-11-23 11:31:06,761 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 56 [2018-11-23 11:31:06,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:31:06,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:31:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 157 transitions. [2018-11-23 11:31:06,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 11:31:06,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 157 transitions. [2018-11-23 11:31:06,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 97 states and 157 transitions. [2018-11-23 11:32:00,872 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 140 inductive. 0 not inductive. 17 times theorem prover too weak to decide inductivity. [2018-11-23 11:32:00,875 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:32:00,875 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 11:32:00,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 86.1s TimeCoverageRelationStatistics Valid=6910, Invalid=13396, Unknown=0, NotChecked=0, Total=20306 [2018-11-23 11:32:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 11:32:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-11-23 11:32:01,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:32:01,123 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 105 states. [2018-11-23 11:32:01,123 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-23 11:32:01,123 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-23 11:32:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:01,128 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-23 11:32:01,128 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:32:01,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:01,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:01,129 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 105 states. [2018-11-23 11:32:01,130 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 105 states. [2018-11-23 11:32:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:32:01,133 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-11-23 11:32:01,133 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:32:01,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:32:01,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:32:01,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:32:01,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:32:01,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-23 11:32:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-11-23 11:32:01,138 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2018-11-23 11:32:01,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:32:01,138 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-11-23 11:32:01,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-23 11:32:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-11-23 11:32:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 11:32:01,142 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:32:01,142 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:32:01,142 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:32:01,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:32:01,142 INFO L82 PathProgramCache]: Analyzing trace with hash 523994846, now seen corresponding path program 6 times [2018-11-23 11:32:01,143 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:32:01,143 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:32:01,165 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-23 11:32:08,433 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 48 check-sat command(s) [2018-11-23 11:32:08,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:32:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:32:08,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:32:14,492 INFO L256 TraceCheckUtils]: 0: Hoare triple {2669#true} call ULTIMATE.init(); {2669#true} is VALID [2018-11-23 11:32:14,492 INFO L273 TraceCheckUtils]: 1: Hoare triple {2669#true} assume true; {2669#true} is VALID [2018-11-23 11:32:14,493 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2669#true} {2669#true} #31#return; {2669#true} is VALID [2018-11-23 11:32:14,493 INFO L256 TraceCheckUtils]: 3: Hoare triple {2669#true} call #t~ret0 := main(); {2669#true} is VALID [2018-11-23 11:32:14,494 INFO L273 TraceCheckUtils]: 4: Hoare triple {2669#true} ~x~0 := 268435441bv32; {2686#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,494 INFO L273 TraceCheckUtils]: 5: Hoare triple {2686#(= (bvadd main_~x~0 (_ bv4026531855 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2690#(= (bvadd main_~x~0 (_ bv4026531857 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,495 INFO L273 TraceCheckUtils]: 6: Hoare triple {2690#(= (bvadd main_~x~0 (_ bv4026531857 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2694#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,495 INFO L273 TraceCheckUtils]: 7: Hoare triple {2694#(= (bvadd main_~x~0 (_ bv4026531859 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2698#(= (_ bv268435435 32) main_~x~0)} is VALID [2018-11-23 11:32:14,497 INFO L273 TraceCheckUtils]: 8: Hoare triple {2698#(= (_ bv268435435 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2702#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,497 INFO L273 TraceCheckUtils]: 9: Hoare triple {2702#(= (bvadd main_~x~0 (_ bv4026531863 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2706#(= (_ bv268435431 32) main_~x~0)} is VALID [2018-11-23 11:32:14,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {2706#(= (_ bv268435431 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2710#(= (bvadd main_~x~0 (_ bv4026531867 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,499 INFO L273 TraceCheckUtils]: 11: Hoare triple {2710#(= (bvadd main_~x~0 (_ bv4026531867 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2714#(= (bvadd main_~x~0 (_ bv4026531869 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,501 INFO L273 TraceCheckUtils]: 12: Hoare triple {2714#(= (bvadd main_~x~0 (_ bv4026531869 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2718#(= (bvadd main_~x~0 (_ bv4026531871 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {2718#(= (bvadd main_~x~0 (_ bv4026531871 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2722#(= (bvadd main_~x~0 (_ bv4026531873 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,503 INFO L273 TraceCheckUtils]: 14: Hoare triple {2722#(= (bvadd main_~x~0 (_ bv4026531873 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2726#(= (bvadd main_~x~0 (_ bv4026531875 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,503 INFO L273 TraceCheckUtils]: 15: Hoare triple {2726#(= (bvadd main_~x~0 (_ bv4026531875 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2730#(= (_ bv268435419 32) main_~x~0)} is VALID [2018-11-23 11:32:14,505 INFO L273 TraceCheckUtils]: 16: Hoare triple {2730#(= (_ bv268435419 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2734#(= (bvadd main_~x~0 (_ bv4026531879 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,505 INFO L273 TraceCheckUtils]: 17: Hoare triple {2734#(= (bvadd main_~x~0 (_ bv4026531879 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2738#(= (bvadd main_~x~0 (_ bv4026531881 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,506 INFO L273 TraceCheckUtils]: 18: Hoare triple {2738#(= (bvadd main_~x~0 (_ bv4026531881 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2742#(= (_ bv268435413 32) main_~x~0)} is VALID [2018-11-23 11:32:14,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {2742#(= (_ bv268435413 32) main_~x~0)} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2746#(= (bvadd main_~x~0 (_ bv4026531885 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {2746#(= (bvadd main_~x~0 (_ bv4026531885 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2750#(= (bvadd main_~x~0 (_ bv4026531887 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,510 INFO L273 TraceCheckUtils]: 21: Hoare triple {2750#(= (bvadd main_~x~0 (_ bv4026531887 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2754#(= (bvadd main_~x~0 (_ bv4026531889 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,517 INFO L273 TraceCheckUtils]: 22: Hoare triple {2754#(= (bvadd main_~x~0 (_ bv4026531889 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2758#(= (bvadd main_~x~0 (_ bv4026531891 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,518 INFO L273 TraceCheckUtils]: 23: Hoare triple {2758#(= (bvadd main_~x~0 (_ bv4026531891 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2762#(= (bvadd main_~x~0 (_ bv4026531893 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,522 INFO L273 TraceCheckUtils]: 24: Hoare triple {2762#(= (bvadd main_~x~0 (_ bv4026531893 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2766#(= (bvadd main_~x~0 (_ bv4026531895 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,522 INFO L273 TraceCheckUtils]: 25: Hoare triple {2766#(= (bvadd main_~x~0 (_ bv4026531895 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2770#(= (bvadd main_~x~0 (_ bv4026531897 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,524 INFO L273 TraceCheckUtils]: 26: Hoare triple {2770#(= (bvadd main_~x~0 (_ bv4026531897 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2774#(= (bvadd main_~x~0 (_ bv4026531899 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {2774#(= (bvadd main_~x~0 (_ bv4026531899 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2778#(= (bvadd main_~x~0 (_ bv4026531901 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {2778#(= (bvadd main_~x~0 (_ bv4026531901 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2782#(= (bvadd main_~x~0 (_ bv4026531903 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,529 INFO L273 TraceCheckUtils]: 29: Hoare triple {2782#(= (bvadd main_~x~0 (_ bv4026531903 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2786#(= (bvadd main_~x~0 (_ bv4026531905 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,529 INFO L273 TraceCheckUtils]: 30: Hoare triple {2786#(= (bvadd main_~x~0 (_ bv4026531905 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2790#(= (bvadd main_~x~0 (_ bv4026531907 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,530 INFO L273 TraceCheckUtils]: 31: Hoare triple {2790#(= (bvadd main_~x~0 (_ bv4026531907 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2794#(= (bvadd main_~x~0 (_ bv4026531909 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,532 INFO L273 TraceCheckUtils]: 32: Hoare triple {2794#(= (bvadd main_~x~0 (_ bv4026531909 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2798#(= (bvadd main_~x~0 (_ bv4026531911 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,532 INFO L273 TraceCheckUtils]: 33: Hoare triple {2798#(= (bvadd main_~x~0 (_ bv4026531911 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2802#(= (bvadd main_~x~0 (_ bv4026531913 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,535 INFO L273 TraceCheckUtils]: 34: Hoare triple {2802#(= (bvadd main_~x~0 (_ bv4026531913 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2806#(= (bvadd main_~x~0 (_ bv4026531915 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,535 INFO L273 TraceCheckUtils]: 35: Hoare triple {2806#(= (bvadd main_~x~0 (_ bv4026531915 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2810#(= (bvadd main_~x~0 (_ bv4026531917 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,537 INFO L273 TraceCheckUtils]: 36: Hoare triple {2810#(= (bvadd main_~x~0 (_ bv4026531917 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2814#(= (bvadd main_~x~0 (_ bv4026531919 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,537 INFO L273 TraceCheckUtils]: 37: Hoare triple {2814#(= (bvadd main_~x~0 (_ bv4026531919 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2818#(= (bvadd main_~x~0 (_ bv4026531921 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,540 INFO L273 TraceCheckUtils]: 38: Hoare triple {2818#(= (bvadd main_~x~0 (_ bv4026531921 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2822#(= (bvadd main_~x~0 (_ bv4026531923 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,540 INFO L273 TraceCheckUtils]: 39: Hoare triple {2822#(= (bvadd main_~x~0 (_ bv4026531923 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2826#(= (bvadd main_~x~0 (_ bv4026531925 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,542 INFO L273 TraceCheckUtils]: 40: Hoare triple {2826#(= (bvadd main_~x~0 (_ bv4026531925 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2830#(= (bvadd main_~x~0 (_ bv4026531927 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,542 INFO L273 TraceCheckUtils]: 41: Hoare triple {2830#(= (bvadd main_~x~0 (_ bv4026531927 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2834#(= (bvadd main_~x~0 (_ bv4026531929 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,544 INFO L273 TraceCheckUtils]: 42: Hoare triple {2834#(= (bvadd main_~x~0 (_ bv4026531929 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2838#(= (bvadd main_~x~0 (_ bv4026531931 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,544 INFO L273 TraceCheckUtils]: 43: Hoare triple {2838#(= (bvadd main_~x~0 (_ bv4026531931 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2842#(= (bvadd main_~x~0 (_ bv4026531933 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,546 INFO L273 TraceCheckUtils]: 44: Hoare triple {2842#(= (bvadd main_~x~0 (_ bv4026531933 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2846#(= (bvadd main_~x~0 (_ bv4026531935 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,546 INFO L273 TraceCheckUtils]: 45: Hoare triple {2846#(= (bvadd main_~x~0 (_ bv4026531935 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2850#(= (bvadd main_~x~0 (_ bv4026531937 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,548 INFO L273 TraceCheckUtils]: 46: Hoare triple {2850#(= (bvadd main_~x~0 (_ bv4026531937 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2854#(= (bvadd main_~x~0 (_ bv4026531939 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,548 INFO L273 TraceCheckUtils]: 47: Hoare triple {2854#(= (bvadd main_~x~0 (_ bv4026531939 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2858#(= (bvadd main_~x~0 (_ bv4026531941 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,550 INFO L273 TraceCheckUtils]: 48: Hoare triple {2858#(= (bvadd main_~x~0 (_ bv4026531941 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2862#(= (bvadd main_~x~0 (_ bv4026531943 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,550 INFO L273 TraceCheckUtils]: 49: Hoare triple {2862#(= (bvadd main_~x~0 (_ bv4026531943 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2866#(= (bvadd main_~x~0 (_ bv4026531945 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,552 INFO L273 TraceCheckUtils]: 50: Hoare triple {2866#(= (bvadd main_~x~0 (_ bv4026531945 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2870#(= (bvadd main_~x~0 (_ bv4026531947 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,552 INFO L273 TraceCheckUtils]: 51: Hoare triple {2870#(= (bvadd main_~x~0 (_ bv4026531947 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2874#(= (bvadd main_~x~0 (_ bv4026531949 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,559 INFO L273 TraceCheckUtils]: 52: Hoare triple {2874#(= (bvadd main_~x~0 (_ bv4026531949 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2878#(= (bvadd main_~x~0 (_ bv4026531951 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,560 INFO L273 TraceCheckUtils]: 53: Hoare triple {2878#(= (bvadd main_~x~0 (_ bv4026531951 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2882#(= (bvadd main_~x~0 (_ bv4026531953 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,564 INFO L273 TraceCheckUtils]: 54: Hoare triple {2882#(= (bvadd main_~x~0 (_ bv4026531953 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2886#(= (bvadd main_~x~0 (_ bv4026531955 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,564 INFO L273 TraceCheckUtils]: 55: Hoare triple {2886#(= (bvadd main_~x~0 (_ bv4026531955 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2890#(= (bvadd main_~x~0 (_ bv4026531957 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,566 INFO L273 TraceCheckUtils]: 56: Hoare triple {2890#(= (bvadd main_~x~0 (_ bv4026531957 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2894#(= (bvadd main_~x~0 (_ bv4026531959 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,566 INFO L273 TraceCheckUtils]: 57: Hoare triple {2894#(= (bvadd main_~x~0 (_ bv4026531959 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2898#(= (bvadd main_~x~0 (_ bv4026531961 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,568 INFO L273 TraceCheckUtils]: 58: Hoare triple {2898#(= (bvadd main_~x~0 (_ bv4026531961 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2902#(= (bvadd main_~x~0 (_ bv4026531963 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,568 INFO L273 TraceCheckUtils]: 59: Hoare triple {2902#(= (bvadd main_~x~0 (_ bv4026531963 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2906#(= (bvadd main_~x~0 (_ bv4026531965 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,570 INFO L273 TraceCheckUtils]: 60: Hoare triple {2906#(= (bvadd main_~x~0 (_ bv4026531965 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2910#(= (bvadd main_~x~0 (_ bv4026531967 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,572 INFO L273 TraceCheckUtils]: 61: Hoare triple {2910#(= (bvadd main_~x~0 (_ bv4026531967 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2914#(= (bvadd main_~x~0 (_ bv4026531969 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,574 INFO L273 TraceCheckUtils]: 62: Hoare triple {2914#(= (bvadd main_~x~0 (_ bv4026531969 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2918#(= (bvadd main_~x~0 (_ bv4026531971 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,574 INFO L273 TraceCheckUtils]: 63: Hoare triple {2918#(= (bvadd main_~x~0 (_ bv4026531971 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2922#(= (bvadd main_~x~0 (_ bv4026531973 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,576 INFO L273 TraceCheckUtils]: 64: Hoare triple {2922#(= (bvadd main_~x~0 (_ bv4026531973 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2926#(= (bvadd main_~x~0 (_ bv4026531975 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,576 INFO L273 TraceCheckUtils]: 65: Hoare triple {2926#(= (bvadd main_~x~0 (_ bv4026531975 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2930#(= (bvadd main_~x~0 (_ bv4026531977 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,578 INFO L273 TraceCheckUtils]: 66: Hoare triple {2930#(= (bvadd main_~x~0 (_ bv4026531977 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2934#(= (bvadd main_~x~0 (_ bv4026531979 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,578 INFO L273 TraceCheckUtils]: 67: Hoare triple {2934#(= (bvadd main_~x~0 (_ bv4026531979 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2938#(= (bvadd main_~x~0 (_ bv4026531981 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,580 INFO L273 TraceCheckUtils]: 68: Hoare triple {2938#(= (bvadd main_~x~0 (_ bv4026531981 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2942#(= (bvadd main_~x~0 (_ bv4026531983 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,580 INFO L273 TraceCheckUtils]: 69: Hoare triple {2942#(= (bvadd main_~x~0 (_ bv4026531983 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2946#(= (bvadd main_~x~0 (_ bv4026531985 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,583 INFO L273 TraceCheckUtils]: 70: Hoare triple {2946#(= (bvadd main_~x~0 (_ bv4026531985 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2950#(= (bvadd main_~x~0 (_ bv4026531987 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,583 INFO L273 TraceCheckUtils]: 71: Hoare triple {2950#(= (bvadd main_~x~0 (_ bv4026531987 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2954#(= (bvadd main_~x~0 (_ bv4026531989 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,585 INFO L273 TraceCheckUtils]: 72: Hoare triple {2954#(= (bvadd main_~x~0 (_ bv4026531989 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2958#(= (bvadd main_~x~0 (_ bv4026531991 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,585 INFO L273 TraceCheckUtils]: 73: Hoare triple {2958#(= (bvadd main_~x~0 (_ bv4026531991 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2962#(= (bvadd main_~x~0 (_ bv4026531993 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,587 INFO L273 TraceCheckUtils]: 74: Hoare triple {2962#(= (bvadd main_~x~0 (_ bv4026531993 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2966#(= (bvadd main_~x~0 (_ bv4026531995 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,587 INFO L273 TraceCheckUtils]: 75: Hoare triple {2966#(= (bvadd main_~x~0 (_ bv4026531995 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2970#(= (bvadd main_~x~0 (_ bv4026531997 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,589 INFO L273 TraceCheckUtils]: 76: Hoare triple {2970#(= (bvadd main_~x~0 (_ bv4026531997 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2974#(= (bvadd main_~x~0 (_ bv4026531999 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,589 INFO L273 TraceCheckUtils]: 77: Hoare triple {2974#(= (bvadd main_~x~0 (_ bv4026531999 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2978#(= (bvadd main_~x~0 (_ bv4026532001 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,592 INFO L273 TraceCheckUtils]: 78: Hoare triple {2978#(= (bvadd main_~x~0 (_ bv4026532001 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2982#(= (bvadd main_~x~0 (_ bv4026532003 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,592 INFO L273 TraceCheckUtils]: 79: Hoare triple {2982#(= (bvadd main_~x~0 (_ bv4026532003 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2986#(= (bvadd main_~x~0 (_ bv4026532005 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,594 INFO L273 TraceCheckUtils]: 80: Hoare triple {2986#(= (bvadd main_~x~0 (_ bv4026532005 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2990#(= (bvadd main_~x~0 (_ bv4026532007 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,594 INFO L273 TraceCheckUtils]: 81: Hoare triple {2990#(= (bvadd main_~x~0 (_ bv4026532007 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2994#(= (bvadd main_~x~0 (_ bv4026532009 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,596 INFO L273 TraceCheckUtils]: 82: Hoare triple {2994#(= (bvadd main_~x~0 (_ bv4026532009 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {2998#(= (bvadd main_~x~0 (_ bv4026532011 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,596 INFO L273 TraceCheckUtils]: 83: Hoare triple {2998#(= (bvadd main_~x~0 (_ bv4026532011 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3002#(= (bvadd main_~x~0 (_ bv4026532013 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,598 INFO L273 TraceCheckUtils]: 84: Hoare triple {3002#(= (bvadd main_~x~0 (_ bv4026532013 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3006#(= (bvadd main_~x~0 (_ bv4026532015 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,598 INFO L273 TraceCheckUtils]: 85: Hoare triple {3006#(= (bvadd main_~x~0 (_ bv4026532015 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3010#(= (bvadd main_~x~0 (_ bv4026532017 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,600 INFO L273 TraceCheckUtils]: 86: Hoare triple {3010#(= (bvadd main_~x~0 (_ bv4026532017 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3014#(= (bvadd main_~x~0 (_ bv4026532019 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,600 INFO L273 TraceCheckUtils]: 87: Hoare triple {3014#(= (bvadd main_~x~0 (_ bv4026532019 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3018#(= (bvadd main_~x~0 (_ bv4026532021 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,601 INFO L273 TraceCheckUtils]: 88: Hoare triple {3018#(= (bvadd main_~x~0 (_ bv4026532021 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3022#(= (bvadd main_~x~0 (_ bv4026532023 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,602 INFO L273 TraceCheckUtils]: 89: Hoare triple {3022#(= (bvadd main_~x~0 (_ bv4026532023 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3026#(= (bvadd main_~x~0 (_ bv4026532025 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,602 INFO L273 TraceCheckUtils]: 90: Hoare triple {3026#(= (bvadd main_~x~0 (_ bv4026532025 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3030#(= (bvadd main_~x~0 (_ bv4026532027 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,604 INFO L273 TraceCheckUtils]: 91: Hoare triple {3030#(= (bvadd main_~x~0 (_ bv4026532027 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3034#(= (bvadd main_~x~0 (_ bv4026532029 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,604 INFO L273 TraceCheckUtils]: 92: Hoare triple {3034#(= (bvadd main_~x~0 (_ bv4026532029 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3038#(= (bvadd main_~x~0 (_ bv4026532031 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,606 INFO L273 TraceCheckUtils]: 93: Hoare triple {3038#(= (bvadd main_~x~0 (_ bv4026532031 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3042#(= (bvadd main_~x~0 (_ bv4026532033 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,606 INFO L273 TraceCheckUtils]: 94: Hoare triple {3042#(= (bvadd main_~x~0 (_ bv4026532033 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3046#(= (bvadd main_~x~0 (_ bv4026532035 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,608 INFO L273 TraceCheckUtils]: 95: Hoare triple {3046#(= (bvadd main_~x~0 (_ bv4026532035 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3050#(= (bvadd main_~x~0 (_ bv4026532037 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,608 INFO L273 TraceCheckUtils]: 96: Hoare triple {3050#(= (bvadd main_~x~0 (_ bv4026532037 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3054#(= (bvadd main_~x~0 (_ bv4026532039 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,610 INFO L273 TraceCheckUtils]: 97: Hoare triple {3054#(= (bvadd main_~x~0 (_ bv4026532039 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3058#(= (bvadd main_~x~0 (_ bv4026532041 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,610 INFO L273 TraceCheckUtils]: 98: Hoare triple {3058#(= (bvadd main_~x~0 (_ bv4026532041 32)) (_ bv0 32))} assume !!~bvugt32(~x~0, 1bv32);~x~0 := ~bvsub32(~x~0, 2bv32); {3062#(= (bvadd main_~x~0 (_ bv4026532043 32)) (_ bv0 32))} is VALID [2018-11-23 11:32:14,612 INFO L273 TraceCheckUtils]: 99: Hoare triple {3062#(= (bvadd main_~x~0 (_ bv4026532043 32)) (_ bv0 32))} assume !~bvugt32(~x~0, 1bv32); {2670#false} is VALID [2018-11-23 11:32:14,612 INFO L256 TraceCheckUtils]: 100: Hoare triple {2670#false} call __VERIFIER_assert((if 0bv32 == ~bvurem32(~x~0, 2bv32) then 1bv32 else 0bv32)); {2670#false} is VALID [2018-11-23 11:32:14,612 INFO L273 TraceCheckUtils]: 101: Hoare triple {2670#false} ~cond := #in~cond; {2670#false} is VALID [2018-11-23 11:32:14,613 INFO L273 TraceCheckUtils]: 102: Hoare triple {2670#false} assume 0bv32 == ~cond; {2670#false} is VALID [2018-11-23 11:32:14,613 INFO L273 TraceCheckUtils]: 103: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2018-11-23 11:32:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:32:14,628 INFO L316 TraceCheckSpWp]: Computing backward predicates...