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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-19 00:02:28,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-19 00:02:28,726 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-19 00:02:28,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-19 00:02:28,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-19 00:02:28,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-19 00:02:28,743 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-19 00:02:28,747 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-19 00:02:28,749 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-19 00:02:28,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-19 00:02:28,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-19 00:02:28,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-19 00:02:28,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-19 00:02:28,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-19 00:02:28,764 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-19 00:02:28,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-19 00:02:28,766 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-19 00:02:28,770 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-19 00:02:28,771 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-19 00:02:28,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-19 00:02:28,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-19 00:02:28,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-19 00:02:28,779 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-19 00:02:28,780 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-19 00:02:28,780 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-19 00:02:28,781 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-19 00:02:28,782 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-19 00:02:28,783 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-19 00:02:28,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-19 00:02:28,788 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-19 00:02:28,789 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-19 00:02:28,790 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-19 00:02:28,790 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-19 00:02:28,790 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-19 00:02:28,791 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-19 00:02:28,793 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-19 00:02:28,794 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-19 00:02:28,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-19 00:02:28,818 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-19 00:02:28,819 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-19 00:02:28,819 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-19 00:02:28,819 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-19 00:02:28,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-19 00:02:28,820 INFO L133 SettingsManager]: * Use SBE=true [2018-11-19 00:02:28,820 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-19 00:02:28,820 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-19 00:02:28,820 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-19 00:02:28,821 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-19 00:02:28,821 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-19 00:02:28,821 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-19 00:02:28,821 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-19 00:02:28,821 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-19 00:02:28,822 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-19 00:02:28,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-19 00:02:28,822 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-19 00:02:28,822 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-19 00:02:28,822 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-19 00:02:28,823 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-19 00:02:28,823 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-19 00:02:28,823 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-19 00:02:28,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-19 00:02:28,823 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-19 00:02:28,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-19 00:02:28,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-19 00:02:28,824 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-19 00:02:28,824 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-19 00:02:28,824 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-19 00:02:28,825 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-19 00:02:28,867 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-19 00:02:28,879 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-19 00:02:28,883 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-19 00:02:28,884 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-19 00:02:28,885 INFO L276 PluginConnector]: CDTParser initialized [2018-11-19 00:02:28,886 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i [2018-11-19 00:02:28,941 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc923fd54/a09a5d2dfbea47a3a7c314b5553798ad/FLAG475fbbc3b [2018-11-19 00:02:29,368 INFO L307 CDTParser]: Found 1 translation units. [2018-11-19 00:02:29,369 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/overflow_true-unreach-call1.i [2018-11-19 00:02:29,375 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc923fd54/a09a5d2dfbea47a3a7c314b5553798ad/FLAG475fbbc3b [2018-11-19 00:02:29,775 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc923fd54/a09a5d2dfbea47a3a7c314b5553798ad [2018-11-19 00:02:29,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-19 00:02:29,787 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-19 00:02:29,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-19 00:02:29,788 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-19 00:02:29,791 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-19 00:02:29,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:02:29" (1/1) ... [2018-11-19 00:02:29,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4f0244 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:29, skipping insertion in model container [2018-11-19 00:02:29,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 12:02:29" (1/1) ... [2018-11-19 00:02:29,806 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-19 00:02:29,828 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-19 00:02:30,050 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:02:30,055 INFO L191 MainTranslator]: Completed pre-run [2018-11-19 00:02:30,072 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-19 00:02:30,087 INFO L195 MainTranslator]: Completed translation [2018-11-19 00:02:30,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30 WrapperNode [2018-11-19 00:02:30,088 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-19 00:02:30,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-19 00:02:30,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-19 00:02:30,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-19 00:02:30,103 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30" (1/1) ... [2018-11-19 00:02:30,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30" (1/1) ... [2018-11-19 00:02:30,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30" (1/1) ... [2018-11-19 00:02:30,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30" (1/1) ... [2018-11-19 00:02:30,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30" (1/1) ... [2018-11-19 00:02:30,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30" (1/1) ... [2018-11-19 00:02:30,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30" (1/1) ... [2018-11-19 00:02:30,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-19 00:02:30,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-19 00:02:30,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-19 00:02:30,126 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-19 00:02:30,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30" (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-19 00:02:30,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-19 00:02:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-19 00:02:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-19 00:02:30,248 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-19 00:02:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-19 00:02:30,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-19 00:02:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-19 00:02:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-19 00:02:30,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-19 00:02:30,556 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-19 00:02:30,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:02:30 BoogieIcfgContainer [2018-11-19 00:02:30,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-19 00:02:30,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-19 00:02:30,558 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-19 00:02:30,562 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-19 00:02:30,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 12:02:29" (1/3) ... [2018-11-19 00:02:30,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18123f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:02:30, skipping insertion in model container [2018-11-19 00:02:30,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 12:02:30" (2/3) ... [2018-11-19 00:02:30,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18123f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 12:02:30, skipping insertion in model container [2018-11-19 00:02:30,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 12:02:30" (3/3) ... [2018-11-19 00:02:30,565 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow_true-unreach-call1.i [2018-11-19 00:02:30,576 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-19 00:02:30,584 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-19 00:02:30,602 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-19 00:02:30,630 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-19 00:02:30,631 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-19 00:02:30,632 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-19 00:02:30,632 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-19 00:02:30,632 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-19 00:02:30,632 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-19 00:02:30,632 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-19 00:02:30,632 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-19 00:02:30,633 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-19 00:02:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2018-11-19 00:02:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-19 00:02:30,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:30,657 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:30,659 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:30,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:30,665 INFO L82 PathProgramCache]: Analyzing trace with hash -10373566, now seen corresponding path program 1 times [2018-11-19 00:02:30,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:30,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:30,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:30,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:02:30,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:30,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {21#true} is VALID [2018-11-19 00:02:30,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2018-11-19 00:02:30,783 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #32#return; {21#true} is VALID [2018-11-19 00:02:30,783 INFO L256 TraceCheckUtils]: 3: Hoare triple {21#true} call #t~ret0 := main(); {21#true} is VALID [2018-11-19 00:02:30,783 INFO L273 TraceCheckUtils]: 4: Hoare triple {21#true} ~x~0 := 10; {21#true} is VALID [2018-11-19 00:02:30,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {21#true} assume !true; {22#false} is VALID [2018-11-19 00:02:30,787 INFO L256 TraceCheckUtils]: 6: Hoare triple {22#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {22#false} is VALID [2018-11-19 00:02:30,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2018-11-19 00:02:30,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2018-11-19 00:02:30,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {22#false} assume !false; {22#false} is VALID [2018-11-19 00:02:30,790 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-19 00:02:30,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:02:30,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-19 00:02:30,797 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-19 00:02:30,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:30,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-19 00:02:30,882 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-19 00:02:30,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-19 00:02:30,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-19 00:02:30,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-19 00:02:30,896 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2018-11-19 00:02:30,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:30,988 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-19 00:02:30,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-19 00:02:30,988 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-19 00:02:30,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:30,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 00:02:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-19 00:02:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-19 00:02:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 32 transitions. [2018-11-19 00:02:31,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 32 transitions. [2018-11-19 00:02:31,126 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-19 00:02:31,136 INFO L225 Difference]: With dead ends: 29 [2018-11-19 00:02:31,137 INFO L226 Difference]: Without dead ends: 12 [2018-11-19 00:02:31,140 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-19 00:02:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-19 00:02:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-19 00:02:31,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:31,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-19 00:02:31,269 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-19 00:02:31,270 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-19 00:02:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:31,273 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-19 00:02:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-19 00:02:31,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:31,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:31,274 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-19 00:02:31,274 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-19 00:02:31,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:31,277 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-19 00:02:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-19 00:02:31,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:31,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:31,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:31,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-19 00:02:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-19 00:02:31,283 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-19 00:02:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:31,284 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-19 00:02:31,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-19 00:02:31,284 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-19 00:02:31,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-19 00:02:31,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:31,285 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:31,285 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:31,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash -571410792, now seen corresponding path program 1 times [2018-11-19 00:02:31,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:31,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:31,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:02:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:31,701 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 8 [2018-11-19 00:02:31,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {106#true} call ULTIMATE.init(); {106#true} is VALID [2018-11-19 00:02:31,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {106#true} assume true; {106#true} is VALID [2018-11-19 00:02:31,799 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {106#true} {106#true} #32#return; {106#true} is VALID [2018-11-19 00:02:31,800 INFO L256 TraceCheckUtils]: 3: Hoare triple {106#true} call #t~ret0 := main(); {106#true} is VALID [2018-11-19 00:02:31,819 INFO L273 TraceCheckUtils]: 4: Hoare triple {106#true} ~x~0 := 10; {108#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:31,822 INFO L273 TraceCheckUtils]: 5: Hoare triple {108#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} assume true; {108#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:31,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {108#(and (<= (div main_~x~0 4294967296) 0) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {107#false} is VALID [2018-11-19 00:02:31,827 INFO L256 TraceCheckUtils]: 7: Hoare triple {107#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {107#false} is VALID [2018-11-19 00:02:31,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {107#false} ~cond := #in~cond; {107#false} is VALID [2018-11-19 00:02:31,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {107#false} assume 0 == ~cond; {107#false} is VALID [2018-11-19 00:02:31,828 INFO L273 TraceCheckUtils]: 10: Hoare triple {107#false} assume !false; {107#false} is VALID [2018-11-19 00:02:31,829 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-19 00:02:31,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-19 00:02:31,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-19 00:02:31,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-19 00:02:31,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:31,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-19 00:02:31,915 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:31,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-19 00:02:31,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-19 00:02:31,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 00:02:31,916 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-19 00:02:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:32,092 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-19 00:02:32,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-19 00:02:32,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-19 00:02:32,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 00:02:32,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-19 00:02:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-19 00:02:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-19 00:02:32,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-19 00:02:32,264 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:32,265 INFO L225 Difference]: With dead ends: 19 [2018-11-19 00:02:32,266 INFO L226 Difference]: Without dead ends: 14 [2018-11-19 00:02:32,267 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-19 00:02:32,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-19 00:02:32,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-19 00:02:32,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:32,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-19 00:02:32,285 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-19 00:02:32,285 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-19 00:02:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:32,287 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-19 00:02:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-19 00:02:32,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:32,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:32,288 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-19 00:02:32,288 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-19 00:02:32,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:32,290 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-19 00:02:32,290 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-19 00:02:32,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:32,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:32,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:32,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-19 00:02:32,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-19 00:02:32,293 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-19 00:02:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:32,293 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-19 00:02:32,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-19 00:02:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-19 00:02:32,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-19 00:02:32,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:32,294 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:32,295 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:32,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:32,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1625028318, now seen corresponding path program 1 times [2018-11-19 00:02:32,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:32,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:32,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:32,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:02:32,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:32,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-19 00:02:32,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-19 00:02:32,465 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-19 00:02:32,465 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret0 := main(); {190#true} is VALID [2018-11-19 00:02:32,467 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 10; {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:32,472 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:32,473 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {193#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:32,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {193#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {193#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:32,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {193#(and (<= 12 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {191#false} is VALID [2018-11-19 00:02:32,476 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {191#false} is VALID [2018-11-19 00:02:32,476 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-19 00:02:32,477 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2018-11-19 00:02:32,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-19 00:02:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:32,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:32,480 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:32,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:02:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:32,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:32,708 INFO L256 TraceCheckUtils]: 0: Hoare triple {190#true} call ULTIMATE.init(); {190#true} is VALID [2018-11-19 00:02:32,708 INFO L273 TraceCheckUtils]: 1: Hoare triple {190#true} assume true; {190#true} is VALID [2018-11-19 00:02:32,708 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {190#true} {190#true} #32#return; {190#true} is VALID [2018-11-19 00:02:32,709 INFO L256 TraceCheckUtils]: 3: Hoare triple {190#true} call #t~ret0 := main(); {190#true} is VALID [2018-11-19 00:02:32,712 INFO L273 TraceCheckUtils]: 4: Hoare triple {190#true} ~x~0 := 10; {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:32,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:32,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {192#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {215#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:32,725 INFO L273 TraceCheckUtils]: 7: Hoare triple {215#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {215#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:32,734 INFO L273 TraceCheckUtils]: 8: Hoare triple {215#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {191#false} is VALID [2018-11-19 00:02:32,735 INFO L256 TraceCheckUtils]: 9: Hoare triple {191#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {191#false} is VALID [2018-11-19 00:02:32,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {191#false} ~cond := #in~cond; {191#false} is VALID [2018-11-19 00:02:32,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {191#false} assume 0 == ~cond; {191#false} is VALID [2018-11-19 00:02:32,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {191#false} assume !false; {191#false} is VALID [2018-11-19 00:02:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:32,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:32,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-19 00:02:32,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-19 00:02:32,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:32,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-19 00:02:32,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:32,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-19 00:02:32,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-19 00:02:32,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:02:32,999 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-19 00:02:33,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:33,246 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-19 00:02:33,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-19 00:02:33,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-19 00:02:33,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:33,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:02:33,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-19 00:02:33,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-19 00:02:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-19 00:02:33,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2018-11-19 00:02:33,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:33,329 INFO L225 Difference]: With dead ends: 23 [2018-11-19 00:02:33,329 INFO L226 Difference]: Without dead ends: 18 [2018-11-19 00:02:33,330 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-19 00:02:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-19 00:02:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-19 00:02:33,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:33,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-19 00:02:33,346 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-19 00:02:33,346 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-19 00:02:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:33,348 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-19 00:02:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-19 00:02:33,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:33,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:33,349 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-19 00:02:33,349 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-19 00:02:33,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:33,352 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-19 00:02:33,352 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-19 00:02:33,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:33,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:33,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:33,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-19 00:02:33,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-19 00:02:33,357 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2018-11-19 00:02:33,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:33,357 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-19 00:02:33,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-19 00:02:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-19 00:02:33,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-19 00:02:33,359 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:33,359 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:33,359 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:33,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:33,360 INFO L82 PathProgramCache]: Analyzing trace with hash -296916246, now seen corresponding path program 2 times [2018-11-19 00:02:33,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:33,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:33,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:33,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:02:33,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:33,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:33,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2018-11-19 00:02:33,614 INFO L273 TraceCheckUtils]: 1: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-19 00:02:33,614 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {332#true} {332#true} #32#return; {332#true} is VALID [2018-11-19 00:02:33,615 INFO L256 TraceCheckUtils]: 3: Hoare triple {332#true} call #t~ret0 := main(); {332#true} is VALID [2018-11-19 00:02:33,618 INFO L273 TraceCheckUtils]: 4: Hoare triple {332#true} ~x~0 := 10; {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:33,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:33,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:33,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:33,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:33,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:33,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {337#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:33,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {337#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {337#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:33,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {337#(and (<= 16 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {333#false} is VALID [2018-11-19 00:02:33,627 INFO L256 TraceCheckUtils]: 13: Hoare triple {333#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {333#false} is VALID [2018-11-19 00:02:33,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2018-11-19 00:02:33,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {333#false} assume 0 == ~cond; {333#false} is VALID [2018-11-19 00:02:33,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {333#false} assume !false; {333#false} is VALID [2018-11-19 00:02:33,630 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:33,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:33,630 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:33,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:02:33,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:02:33,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:33,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:33,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {332#true} call ULTIMATE.init(); {332#true} is VALID [2018-11-19 00:02:33,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {332#true} assume true; {332#true} is VALID [2018-11-19 00:02:33,844 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {332#true} {332#true} #32#return; {332#true} is VALID [2018-11-19 00:02:33,844 INFO L256 TraceCheckUtils]: 3: Hoare triple {332#true} call #t~ret0 := main(); {332#true} is VALID [2018-11-19 00:02:33,845 INFO L273 TraceCheckUtils]: 4: Hoare triple {332#true} ~x~0 := 10; {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:33,847 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:33,848 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:33,849 INFO L273 TraceCheckUtils]: 7: Hoare triple {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:33,850 INFO L273 TraceCheckUtils]: 8: Hoare triple {335#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:33,851 INFO L273 TraceCheckUtils]: 9: Hoare triple {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:33,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {336#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {371#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:33,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {371#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {371#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:33,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {371#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {333#false} is VALID [2018-11-19 00:02:33,855 INFO L256 TraceCheckUtils]: 13: Hoare triple {333#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {333#false} is VALID [2018-11-19 00:02:33,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {333#false} ~cond := #in~cond; {333#false} is VALID [2018-11-19 00:02:33,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {333#false} assume 0 == ~cond; {333#false} is VALID [2018-11-19 00:02:33,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {333#false} assume !false; {333#false} is VALID [2018-11-19 00:02:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:33,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:33,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-19 00:02:33,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-19 00:02:33,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:33,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-19 00:02:33,913 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-19 00:02:33,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-19 00:02:33,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-19 00:02:33,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-19 00:02:33,915 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 7 states. [2018-11-19 00:02:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:34,130 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-19 00:02:34,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-19 00:02:34,131 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-11-19 00:02:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 00:02:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-19 00:02:34,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-19 00:02:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-19 00:02:34,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 28 transitions. [2018-11-19 00:02:34,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:34,201 INFO L225 Difference]: With dead ends: 27 [2018-11-19 00:02:34,201 INFO L226 Difference]: Without dead ends: 22 [2018-11-19 00:02:34,202 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-19 00:02:34,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-19 00:02:34,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-19 00:02:34,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:34,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-19 00:02:34,224 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-19 00:02:34,224 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-19 00:02:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:34,226 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-19 00:02:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-19 00:02:34,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:34,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:34,227 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-19 00:02:34,227 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-19 00:02:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:34,229 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-19 00:02:34,230 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-19 00:02:34,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:34,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:34,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:34,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-19 00:02:34,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-19 00:02:34,233 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2018-11-19 00:02:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:34,233 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-19 00:02:34,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-19 00:02:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-19 00:02:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-19 00:02:34,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:34,234 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:34,235 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:34,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1097991946, now seen corresponding path program 3 times [2018-11-19 00:02:34,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:34,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:34,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:34,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:34,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:34,852 INFO L256 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2018-11-19 00:02:34,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-19 00:02:34,853 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {508#true} {508#true} #32#return; {508#true} is VALID [2018-11-19 00:02:34,853 INFO L256 TraceCheckUtils]: 3: Hoare triple {508#true} call #t~ret0 := main(); {508#true} is VALID [2018-11-19 00:02:34,869 INFO L273 TraceCheckUtils]: 4: Hoare triple {508#true} ~x~0 := 10; {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:34,882 INFO L273 TraceCheckUtils]: 5: Hoare triple {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:34,883 INFO L273 TraceCheckUtils]: 6: Hoare triple {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:34,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:34,886 INFO L273 TraceCheckUtils]: 8: Hoare triple {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:34,887 INFO L273 TraceCheckUtils]: 9: Hoare triple {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:34,888 INFO L273 TraceCheckUtils]: 10: Hoare triple {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:34,889 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:34,890 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:34,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:34,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {515#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:34,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {515#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {515#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:34,895 INFO L273 TraceCheckUtils]: 16: Hoare triple {515#(and (<= 20 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {509#false} is VALID [2018-11-19 00:02:34,895 INFO L256 TraceCheckUtils]: 17: Hoare triple {509#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {509#false} is VALID [2018-11-19 00:02:34,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {509#false} ~cond := #in~cond; {509#false} is VALID [2018-11-19 00:02:34,896 INFO L273 TraceCheckUtils]: 19: Hoare triple {509#false} assume 0 == ~cond; {509#false} is VALID [2018-11-19 00:02:34,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {509#false} assume !false; {509#false} is VALID [2018-11-19 00:02:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:34,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:34,899 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:34,908 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:02:34,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-19 00:02:34,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:34,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:34,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:35,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {508#true} call ULTIMATE.init(); {508#true} is VALID [2018-11-19 00:02:35,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {508#true} assume true; {508#true} is VALID [2018-11-19 00:02:35,061 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {508#true} {508#true} #32#return; {508#true} is VALID [2018-11-19 00:02:35,061 INFO L256 TraceCheckUtils]: 3: Hoare triple {508#true} call #t~ret0 := main(); {508#true} is VALID [2018-11-19 00:02:35,068 INFO L273 TraceCheckUtils]: 4: Hoare triple {508#true} ~x~0 := 10; {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:35,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:35,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {510#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:35,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:35,072 INFO L273 TraceCheckUtils]: 8: Hoare triple {511#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:35,073 INFO L273 TraceCheckUtils]: 9: Hoare triple {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:35,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {512#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:35,079 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:35,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:35,080 INFO L273 TraceCheckUtils]: 13: Hoare triple {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:35,081 INFO L273 TraceCheckUtils]: 14: Hoare triple {514#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {561#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:35,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {561#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {561#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:35,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {561#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !(~x~0 % 4294967296 >= 10); {509#false} is VALID [2018-11-19 00:02:35,083 INFO L256 TraceCheckUtils]: 17: Hoare triple {509#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {509#false} is VALID [2018-11-19 00:02:35,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {509#false} ~cond := #in~cond; {509#false} is VALID [2018-11-19 00:02:35,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {509#false} assume 0 == ~cond; {509#false} is VALID [2018-11-19 00:02:35,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {509#false} assume !false; {509#false} is VALID [2018-11-19 00:02:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:35,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:35,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-19 00:02:35,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-19 00:02:35,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:35,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-19 00:02:35,153 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:35,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-19 00:02:35,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-19 00:02:35,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-19 00:02:35,154 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2018-11-19 00:02:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:35,501 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-19 00:02:35,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-19 00:02:35,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-11-19 00:02:35,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:35,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:02:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-19 00:02:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-19 00:02:35,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2018-11-19 00:02:35,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2018-11-19 00:02:35,567 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-19 00:02:35,568 INFO L225 Difference]: With dead ends: 31 [2018-11-19 00:02:35,569 INFO L226 Difference]: Without dead ends: 26 [2018-11-19 00:02:35,569 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-19 00:02:35,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-19 00:02:35,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-19 00:02:35,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:35,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-19 00:02:35,593 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-19 00:02:35,593 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-19 00:02:35,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:35,595 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-19 00:02:35,596 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-19 00:02:35,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:35,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:35,596 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-19 00:02:35,597 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-19 00:02:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:35,599 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-19 00:02:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-19 00:02:35,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:35,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:35,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:35,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-19 00:02:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-19 00:02:35,602 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 21 [2018-11-19 00:02:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:35,602 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-19 00:02:35,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-19 00:02:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-19 00:02:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-19 00:02:35,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:35,603 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:35,604 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:35,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1082171650, now seen corresponding path program 4 times [2018-11-19 00:02:35,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:35,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:35,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:35,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:36,208 INFO L256 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2018-11-19 00:02:36,209 INFO L273 TraceCheckUtils]: 1: Hoare triple {718#true} assume true; {718#true} is VALID [2018-11-19 00:02:36,209 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {718#true} {718#true} #32#return; {718#true} is VALID [2018-11-19 00:02:36,210 INFO L256 TraceCheckUtils]: 3: Hoare triple {718#true} call #t~ret0 := main(); {718#true} is VALID [2018-11-19 00:02:36,211 INFO L273 TraceCheckUtils]: 4: Hoare triple {718#true} ~x~0 := 10; {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:36,216 INFO L273 TraceCheckUtils]: 5: Hoare triple {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:36,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:36,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:36,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:36,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:36,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:36,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:36,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:36,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:36,223 INFO L273 TraceCheckUtils]: 14: Hoare triple {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:36,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:36,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:36,226 INFO L273 TraceCheckUtils]: 17: Hoare triple {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:36,231 INFO L273 TraceCheckUtils]: 18: Hoare triple {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {727#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:36,232 INFO L273 TraceCheckUtils]: 19: Hoare triple {727#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} assume true; {727#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:36,232 INFO L273 TraceCheckUtils]: 20: Hoare triple {727#(and (<= (div main_~x~0 4294967296) 0) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {719#false} is VALID [2018-11-19 00:02:36,232 INFO L256 TraceCheckUtils]: 21: Hoare triple {719#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {719#false} is VALID [2018-11-19 00:02:36,233 INFO L273 TraceCheckUtils]: 22: Hoare triple {719#false} ~cond := #in~cond; {719#false} is VALID [2018-11-19 00:02:36,233 INFO L273 TraceCheckUtils]: 23: Hoare triple {719#false} assume 0 == ~cond; {719#false} is VALID [2018-11-19 00:02:36,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {719#false} assume !false; {719#false} is VALID [2018-11-19 00:02:36,235 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:36,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:36,236 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:36,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:02:36,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:02:36,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:36,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:36,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:36,548 INFO L256 TraceCheckUtils]: 0: Hoare triple {718#true} call ULTIMATE.init(); {718#true} is VALID [2018-11-19 00:02:36,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {718#true} assume true; {718#true} is VALID [2018-11-19 00:02:36,548 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {718#true} {718#true} #32#return; {718#true} is VALID [2018-11-19 00:02:36,548 INFO L256 TraceCheckUtils]: 3: Hoare triple {718#true} call #t~ret0 := main(); {718#true} is VALID [2018-11-19 00:02:36,549 INFO L273 TraceCheckUtils]: 4: Hoare triple {718#true} ~x~0 := 10; {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:36,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:36,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {720#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:36,551 INFO L273 TraceCheckUtils]: 7: Hoare triple {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:36,551 INFO L273 TraceCheckUtils]: 8: Hoare triple {721#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:36,552 INFO L273 TraceCheckUtils]: 9: Hoare triple {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:36,553 INFO L273 TraceCheckUtils]: 10: Hoare triple {722#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:36,554 INFO L273 TraceCheckUtils]: 11: Hoare triple {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:36,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {723#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:36,556 INFO L273 TraceCheckUtils]: 13: Hoare triple {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:36,558 INFO L273 TraceCheckUtils]: 14: Hoare triple {724#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:36,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:36,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {725#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:36,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:36,562 INFO L273 TraceCheckUtils]: 18: Hoare triple {726#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {785#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:36,563 INFO L273 TraceCheckUtils]: 19: Hoare triple {785#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {785#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:36,564 INFO L273 TraceCheckUtils]: 20: Hoare triple {785#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {719#false} is VALID [2018-11-19 00:02:36,564 INFO L256 TraceCheckUtils]: 21: Hoare triple {719#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {719#false} is VALID [2018-11-19 00:02:36,565 INFO L273 TraceCheckUtils]: 22: Hoare triple {719#false} ~cond := #in~cond; {719#false} is VALID [2018-11-19 00:02:36,565 INFO L273 TraceCheckUtils]: 23: Hoare triple {719#false} assume 0 == ~cond; {719#false} is VALID [2018-11-19 00:02:36,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {719#false} assume !false; {719#false} is VALID [2018-11-19 00:02:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:36,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:36,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-19 00:02:36,589 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-19 00:02:36,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:36,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-19 00:02:36,623 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:36,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-19 00:02:36,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-19 00:02:36,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-19 00:02:36,625 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 11 states. [2018-11-19 00:02:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:37,046 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-19 00:02:37,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-19 00:02:37,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-11-19 00:02:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:02:37,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2018-11-19 00:02:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-19 00:02:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2018-11-19 00:02:37,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 36 transitions. [2018-11-19 00:02:37,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:37,106 INFO L225 Difference]: With dead ends: 35 [2018-11-19 00:02:37,106 INFO L226 Difference]: Without dead ends: 30 [2018-11-19 00:02:37,106 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-11-19 00:02:37,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-19 00:02:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-19 00:02:37,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:37,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-19 00:02:37,163 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-19 00:02:37,163 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-19 00:02:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:37,165 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-19 00:02:37,165 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-19 00:02:37,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:37,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:37,166 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-19 00:02:37,166 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-19 00:02:37,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:37,168 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-11-19 00:02:37,168 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-19 00:02:37,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:37,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:37,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:37,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:37,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-19 00:02:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-11-19 00:02:37,171 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 25 [2018-11-19 00:02:37,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:37,172 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-11-19 00:02:37,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-19 00:02:37,172 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-11-19 00:02:37,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-19 00:02:37,173 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:37,173 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:37,173 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:37,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:37,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1182244082, now seen corresponding path program 5 times [2018-11-19 00:02:37,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:37,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:37,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:37,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:38,428 INFO L256 TraceCheckUtils]: 0: Hoare triple {962#true} call ULTIMATE.init(); {962#true} is VALID [2018-11-19 00:02:38,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {962#true} assume true; {962#true} is VALID [2018-11-19 00:02:38,429 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {962#true} {962#true} #32#return; {962#true} is VALID [2018-11-19 00:02:38,429 INFO L256 TraceCheckUtils]: 3: Hoare triple {962#true} call #t~ret0 := main(); {962#true} is VALID [2018-11-19 00:02:38,430 INFO L273 TraceCheckUtils]: 4: Hoare triple {962#true} ~x~0 := 10; {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:38,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:38,432 INFO L273 TraceCheckUtils]: 6: Hoare triple {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:38,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:38,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:38,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:38,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:38,436 INFO L273 TraceCheckUtils]: 11: Hoare triple {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:38,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:38,438 INFO L273 TraceCheckUtils]: 13: Hoare triple {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:38,439 INFO L273 TraceCheckUtils]: 14: Hoare triple {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:38,440 INFO L273 TraceCheckUtils]: 15: Hoare triple {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:38,441 INFO L273 TraceCheckUtils]: 16: Hoare triple {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:38,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:38,443 INFO L273 TraceCheckUtils]: 18: Hoare triple {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:38,445 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:38,446 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:38,447 INFO L273 TraceCheckUtils]: 21: Hoare triple {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:38,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {973#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:38,449 INFO L273 TraceCheckUtils]: 23: Hoare triple {973#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {973#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:38,451 INFO L273 TraceCheckUtils]: 24: Hoare triple {973#(and (<= 28 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {963#false} is VALID [2018-11-19 00:02:38,451 INFO L256 TraceCheckUtils]: 25: Hoare triple {963#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {963#false} is VALID [2018-11-19 00:02:38,451 INFO L273 TraceCheckUtils]: 26: Hoare triple {963#false} ~cond := #in~cond; {963#false} is VALID [2018-11-19 00:02:38,452 INFO L273 TraceCheckUtils]: 27: Hoare triple {963#false} assume 0 == ~cond; {963#false} is VALID [2018-11-19 00:02:38,452 INFO L273 TraceCheckUtils]: 28: Hoare triple {963#false} assume !false; {963#false} is VALID [2018-11-19 00:02:38,455 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:38,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:38,455 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:38,464 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:02:42,702 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-19 00:02:42,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:42,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:42,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {962#true} call ULTIMATE.init(); {962#true} is VALID [2018-11-19 00:02:42,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {962#true} assume true; {962#true} is VALID [2018-11-19 00:02:42,856 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {962#true} {962#true} #32#return; {962#true} is VALID [2018-11-19 00:02:42,857 INFO L256 TraceCheckUtils]: 3: Hoare triple {962#true} call #t~ret0 := main(); {962#true} is VALID [2018-11-19 00:02:42,863 INFO L273 TraceCheckUtils]: 4: Hoare triple {962#true} ~x~0 := 10; {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:42,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:42,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:42,864 INFO L273 TraceCheckUtils]: 7: Hoare triple {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:42,865 INFO L273 TraceCheckUtils]: 8: Hoare triple {965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:42,874 INFO L273 TraceCheckUtils]: 9: Hoare triple {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:42,874 INFO L273 TraceCheckUtils]: 10: Hoare triple {966#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:42,875 INFO L273 TraceCheckUtils]: 11: Hoare triple {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:42,876 INFO L273 TraceCheckUtils]: 12: Hoare triple {967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:42,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:42,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:42,877 INFO L273 TraceCheckUtils]: 15: Hoare triple {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:42,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {969#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:42,878 INFO L273 TraceCheckUtils]: 17: Hoare triple {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:42,879 INFO L273 TraceCheckUtils]: 18: Hoare triple {970#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:42,896 INFO L273 TraceCheckUtils]: 19: Hoare triple {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:42,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:42,902 INFO L273 TraceCheckUtils]: 21: Hoare triple {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:42,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1043#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:42,903 INFO L273 TraceCheckUtils]: 23: Hoare triple {1043#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1043#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:42,904 INFO L273 TraceCheckUtils]: 24: Hoare triple {1043#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {963#false} is VALID [2018-11-19 00:02:42,904 INFO L256 TraceCheckUtils]: 25: Hoare triple {963#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {963#false} is VALID [2018-11-19 00:02:42,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {963#false} ~cond := #in~cond; {963#false} is VALID [2018-11-19 00:02:42,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {963#false} assume 0 == ~cond; {963#false} is VALID [2018-11-19 00:02:42,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {963#false} assume !false; {963#false} is VALID [2018-11-19 00:02:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:42,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:42,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-19 00:02:42,929 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-19 00:02:42,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:42,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-19 00:02:42,998 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-19 00:02:42,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-19 00:02:42,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-19 00:02:42,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-19 00:02:42,999 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 13 states. [2018-11-19 00:02:43,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:43,644 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-19 00:02:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-19 00:02:43,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-11-19 00:02:43,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:43,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 00:02:43,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2018-11-19 00:02:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-19 00:02:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 40 transitions. [2018-11-19 00:02:43,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 40 transitions. [2018-11-19 00:02:43,726 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:43,727 INFO L225 Difference]: With dead ends: 39 [2018-11-19 00:02:43,727 INFO L226 Difference]: Without dead ends: 34 [2018-11-19 00:02:43,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-11-19 00:02:43,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-19 00:02:43,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-19 00:02:43,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:43,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-19 00:02:43,765 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-19 00:02:43,765 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-19 00:02:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:43,767 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-19 00:02:43,767 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-19 00:02:43,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:43,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:43,768 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-19 00:02:43,768 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-19 00:02:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:43,770 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-11-19 00:02:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-19 00:02:43,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:43,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:43,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:43,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:43,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-19 00:02:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-19 00:02:43,773 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 29 [2018-11-19 00:02:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:43,773 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-19 00:02:43,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-19 00:02:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-19 00:02:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-19 00:02:43,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:43,775 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:43,775 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:43,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:43,776 INFO L82 PathProgramCache]: Analyzing trace with hash 92815130, now seen corresponding path program 6 times [2018-11-19 00:02:43,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:43,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:43,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:43,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:43,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:44,183 INFO L256 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2018-11-19 00:02:44,183 INFO L273 TraceCheckUtils]: 1: Hoare triple {1240#true} assume true; {1240#true} is VALID [2018-11-19 00:02:44,184 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1240#true} {1240#true} #32#return; {1240#true} is VALID [2018-11-19 00:02:44,184 INFO L256 TraceCheckUtils]: 3: Hoare triple {1240#true} call #t~ret0 := main(); {1240#true} is VALID [2018-11-19 00:02:44,184 INFO L273 TraceCheckUtils]: 4: Hoare triple {1240#true} ~x~0 := 10; {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:44,185 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:44,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:44,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:44,187 INFO L273 TraceCheckUtils]: 8: Hoare triple {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:44,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:44,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:44,189 INFO L273 TraceCheckUtils]: 11: Hoare triple {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:44,190 INFO L273 TraceCheckUtils]: 12: Hoare triple {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:44,191 INFO L273 TraceCheckUtils]: 13: Hoare triple {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:44,192 INFO L273 TraceCheckUtils]: 14: Hoare triple {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:44,193 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:44,213 INFO L273 TraceCheckUtils]: 16: Hoare triple {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:44,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:44,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:44,250 INFO L273 TraceCheckUtils]: 19: Hoare triple {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:44,259 INFO L273 TraceCheckUtils]: 20: Hoare triple {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:44,272 INFO L273 TraceCheckUtils]: 21: Hoare triple {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:44,281 INFO L273 TraceCheckUtils]: 22: Hoare triple {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:44,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:44,306 INFO L273 TraceCheckUtils]: 24: Hoare triple {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:44,325 INFO L273 TraceCheckUtils]: 25: Hoare triple {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:44,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1253#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:44,346 INFO L273 TraceCheckUtils]: 27: Hoare triple {1253#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} assume true; {1253#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:44,359 INFO L273 TraceCheckUtils]: 28: Hoare triple {1253#(and (<= (div main_~x~0 4294967296) 0) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1241#false} is VALID [2018-11-19 00:02:44,359 INFO L256 TraceCheckUtils]: 29: Hoare triple {1241#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1241#false} is VALID [2018-11-19 00:02:44,360 INFO L273 TraceCheckUtils]: 30: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2018-11-19 00:02:44,360 INFO L273 TraceCheckUtils]: 31: Hoare triple {1241#false} assume 0 == ~cond; {1241#false} is VALID [2018-11-19 00:02:44,360 INFO L273 TraceCheckUtils]: 32: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2018-11-19 00:02:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:44,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:44,363 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:44,377 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-19 00:02:45,951 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-11-19 00:02:45,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:45,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:46,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {1240#true} call ULTIMATE.init(); {1240#true} is VALID [2018-11-19 00:02:46,239 INFO L273 TraceCheckUtils]: 1: Hoare triple {1240#true} assume true; {1240#true} is VALID [2018-11-19 00:02:46,239 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1240#true} {1240#true} #32#return; {1240#true} is VALID [2018-11-19 00:02:46,240 INFO L256 TraceCheckUtils]: 3: Hoare triple {1240#true} call #t~ret0 := main(); {1240#true} is VALID [2018-11-19 00:02:46,247 INFO L273 TraceCheckUtils]: 4: Hoare triple {1240#true} ~x~0 := 10; {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:46,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:46,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {1242#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:46,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:46,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {1243#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:46,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:46,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {1244#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:46,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:46,252 INFO L273 TraceCheckUtils]: 12: Hoare triple {1245#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:46,253 INFO L273 TraceCheckUtils]: 13: Hoare triple {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:46,254 INFO L273 TraceCheckUtils]: 14: Hoare triple {1246#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:46,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:46,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {1247#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:46,257 INFO L273 TraceCheckUtils]: 17: Hoare triple {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:46,262 INFO L273 TraceCheckUtils]: 18: Hoare triple {1248#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:46,262 INFO L273 TraceCheckUtils]: 19: Hoare triple {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:46,263 INFO L273 TraceCheckUtils]: 20: Hoare triple {1249#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:46,263 INFO L273 TraceCheckUtils]: 21: Hoare triple {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:46,264 INFO L273 TraceCheckUtils]: 22: Hoare triple {1250#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:46,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:46,265 INFO L273 TraceCheckUtils]: 24: Hoare triple {1251#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:46,266 INFO L273 TraceCheckUtils]: 25: Hoare triple {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:46,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {1252#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1335#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:46,268 INFO L273 TraceCheckUtils]: 27: Hoare triple {1335#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1335#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:46,269 INFO L273 TraceCheckUtils]: 28: Hoare triple {1335#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1241#false} is VALID [2018-11-19 00:02:46,269 INFO L256 TraceCheckUtils]: 29: Hoare triple {1241#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1241#false} is VALID [2018-11-19 00:02:46,270 INFO L273 TraceCheckUtils]: 30: Hoare triple {1241#false} ~cond := #in~cond; {1241#false} is VALID [2018-11-19 00:02:46,270 INFO L273 TraceCheckUtils]: 31: Hoare triple {1241#false} assume 0 == ~cond; {1241#false} is VALID [2018-11-19 00:02:46,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {1241#false} assume !false; {1241#false} is VALID [2018-11-19 00:02:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:46,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:46,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-19 00:02:46,300 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-11-19 00:02:46,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:46,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-19 00:02:46,524 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:46,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-19 00:02:46,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-19 00:02:46,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-19 00:02:46,525 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 15 states. [2018-11-19 00:02:47,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:47,338 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-19 00:02:47,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-19 00:02:47,338 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 33 [2018-11-19 00:02:47,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:47,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-19 00:02:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-19 00:02:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-19 00:02:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-19 00:02:47,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2018-11-19 00:02:47,393 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:47,395 INFO L225 Difference]: With dead ends: 43 [2018-11-19 00:02:47,395 INFO L226 Difference]: Without dead ends: 38 [2018-11-19 00:02:47,396 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-11-19 00:02:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-19 00:02:47,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-19 00:02:47,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:47,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-19 00:02:47,512 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-19 00:02:47,513 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-19 00:02:47,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:47,515 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-19 00:02:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-19 00:02:47,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:47,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:47,516 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-19 00:02:47,516 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-19 00:02:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:47,518 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-19 00:02:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-19 00:02:47,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:47,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:47,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:47,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-19 00:02:47,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-11-19 00:02:47,522 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 33 [2018-11-19 00:02:47,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:47,522 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-11-19 00:02:47,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-19 00:02:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-11-19 00:02:47,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-19 00:02:47,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:47,524 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:47,524 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:47,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:47,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1457730854, now seen corresponding path program 7 times [2018-11-19 00:02:47,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:47,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:47,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:47,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:47,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:48,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {1552#true} call ULTIMATE.init(); {1552#true} is VALID [2018-11-19 00:02:48,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {1552#true} assume true; {1552#true} is VALID [2018-11-19 00:02:48,392 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1552#true} {1552#true} #32#return; {1552#true} is VALID [2018-11-19 00:02:48,392 INFO L256 TraceCheckUtils]: 3: Hoare triple {1552#true} call #t~ret0 := main(); {1552#true} is VALID [2018-11-19 00:02:48,393 INFO L273 TraceCheckUtils]: 4: Hoare triple {1552#true} ~x~0 := 10; {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:48,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:48,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:48,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:48,397 INFO L273 TraceCheckUtils]: 8: Hoare triple {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:48,397 INFO L273 TraceCheckUtils]: 9: Hoare triple {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:48,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:48,400 INFO L273 TraceCheckUtils]: 11: Hoare triple {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:48,400 INFO L273 TraceCheckUtils]: 12: Hoare triple {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:48,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:48,403 INFO L273 TraceCheckUtils]: 14: Hoare triple {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:48,404 INFO L273 TraceCheckUtils]: 15: Hoare triple {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:48,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:48,406 INFO L273 TraceCheckUtils]: 17: Hoare triple {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:48,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:48,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:48,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:48,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:48,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:48,414 INFO L273 TraceCheckUtils]: 23: Hoare triple {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:48,415 INFO L273 TraceCheckUtils]: 24: Hoare triple {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:48,415 INFO L273 TraceCheckUtils]: 25: Hoare triple {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:48,416 INFO L273 TraceCheckUtils]: 26: Hoare triple {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:48,417 INFO L273 TraceCheckUtils]: 27: Hoare triple {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:48,418 INFO L273 TraceCheckUtils]: 28: Hoare triple {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:48,419 INFO L273 TraceCheckUtils]: 29: Hoare triple {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:48,420 INFO L273 TraceCheckUtils]: 30: Hoare triple {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1567#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:48,421 INFO L273 TraceCheckUtils]: 31: Hoare triple {1567#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} assume true; {1567#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:48,422 INFO L273 TraceCheckUtils]: 32: Hoare triple {1567#(and (<= (div main_~x~0 4294967296) 0) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1553#false} is VALID [2018-11-19 00:02:48,422 INFO L256 TraceCheckUtils]: 33: Hoare triple {1553#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1553#false} is VALID [2018-11-19 00:02:48,422 INFO L273 TraceCheckUtils]: 34: Hoare triple {1553#false} ~cond := #in~cond; {1553#false} is VALID [2018-11-19 00:02:48,422 INFO L273 TraceCheckUtils]: 35: Hoare triple {1553#false} assume 0 == ~cond; {1553#false} is VALID [2018-11-19 00:02:48,423 INFO L273 TraceCheckUtils]: 36: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2018-11-19 00:02:48,426 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:48,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:48,426 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:48,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:02:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:48,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:48,582 INFO L256 TraceCheckUtils]: 0: Hoare triple {1552#true} call ULTIMATE.init(); {1552#true} is VALID [2018-11-19 00:02:48,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {1552#true} assume true; {1552#true} is VALID [2018-11-19 00:02:48,582 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1552#true} {1552#true} #32#return; {1552#true} is VALID [2018-11-19 00:02:48,583 INFO L256 TraceCheckUtils]: 3: Hoare triple {1552#true} call #t~ret0 := main(); {1552#true} is VALID [2018-11-19 00:02:48,583 INFO L273 TraceCheckUtils]: 4: Hoare triple {1552#true} ~x~0 := 10; {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:48,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:48,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {1554#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:48,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:48,585 INFO L273 TraceCheckUtils]: 8: Hoare triple {1555#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:48,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:48,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {1556#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:48,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:48,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {1557#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:48,595 INFO L273 TraceCheckUtils]: 13: Hoare triple {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:48,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {1558#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:48,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:48,615 INFO L273 TraceCheckUtils]: 16: Hoare triple {1559#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:48,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:48,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {1560#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:48,618 INFO L273 TraceCheckUtils]: 19: Hoare triple {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:48,618 INFO L273 TraceCheckUtils]: 20: Hoare triple {1561#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:48,619 INFO L273 TraceCheckUtils]: 21: Hoare triple {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:48,628 INFO L273 TraceCheckUtils]: 22: Hoare triple {1562#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:48,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:48,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {1563#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:48,630 INFO L273 TraceCheckUtils]: 25: Hoare triple {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:48,631 INFO L273 TraceCheckUtils]: 26: Hoare triple {1564#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:48,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:48,632 INFO L273 TraceCheckUtils]: 28: Hoare triple {1565#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:48,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:48,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {1566#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:48,633 INFO L273 TraceCheckUtils]: 31: Hoare triple {1661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {1661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:48,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {1661#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1553#false} is VALID [2018-11-19 00:02:48,634 INFO L256 TraceCheckUtils]: 33: Hoare triple {1553#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1553#false} is VALID [2018-11-19 00:02:48,634 INFO L273 TraceCheckUtils]: 34: Hoare triple {1553#false} ~cond := #in~cond; {1553#false} is VALID [2018-11-19 00:02:48,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {1553#false} assume 0 == ~cond; {1553#false} is VALID [2018-11-19 00:02:48,635 INFO L273 TraceCheckUtils]: 36: Hoare triple {1553#false} assume !false; {1553#false} is VALID [2018-11-19 00:02:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:48,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:48,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-19 00:02:48,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-11-19 00:02:48,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:48,657 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-19 00:02:48,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:48,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-19 00:02:48,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-19 00:02:48,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-11-19 00:02:48,756 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 17 states. [2018-11-19 00:02:49,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:49,727 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-19 00:02:49,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-19 00:02:49,727 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 37 [2018-11-19 00:02:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:02:49,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2018-11-19 00:02:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-19 00:02:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 48 transitions. [2018-11-19 00:02:49,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 48 transitions. [2018-11-19 00:02:49,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:49,781 INFO L225 Difference]: With dead ends: 47 [2018-11-19 00:02:49,782 INFO L226 Difference]: Without dead ends: 42 [2018-11-19 00:02:49,783 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-11-19 00:02:49,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-19 00:02:49,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-19 00:02:49,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:49,831 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-19 00:02:49,831 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-19 00:02:49,831 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-19 00:02:49,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:49,833 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-19 00:02:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-19 00:02:49,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:49,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:49,834 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-19 00:02:49,834 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-19 00:02:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:49,836 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-11-19 00:02:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-19 00:02:49,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:49,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:49,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:49,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-19 00:02:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-11-19 00:02:49,838 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 37 [2018-11-19 00:02:49,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:49,838 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-11-19 00:02:49,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-19 00:02:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-11-19 00:02:49,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-19 00:02:49,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:49,840 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:49,840 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:49,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:49,840 INFO L82 PathProgramCache]: Analyzing trace with hash -159627982, now seen corresponding path program 8 times [2018-11-19 00:02:49,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:49,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:49,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:49,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-19 00:02:49,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:50,284 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-19 00:02:50,284 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-19 00:02:50,285 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1898#true} {1898#true} #32#return; {1898#true} is VALID [2018-11-19 00:02:50,285 INFO L256 TraceCheckUtils]: 3: Hoare triple {1898#true} call #t~ret0 := main(); {1898#true} is VALID [2018-11-19 00:02:50,286 INFO L273 TraceCheckUtils]: 4: Hoare triple {1898#true} ~x~0 := 10; {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:50,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:50,287 INFO L273 TraceCheckUtils]: 6: Hoare triple {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:50,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:50,290 INFO L273 TraceCheckUtils]: 8: Hoare triple {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:50,291 INFO L273 TraceCheckUtils]: 9: Hoare triple {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:50,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:50,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:50,294 INFO L273 TraceCheckUtils]: 12: Hoare triple {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:50,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:50,298 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:50,299 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:50,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:50,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:50,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:50,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:50,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:50,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:50,305 INFO L273 TraceCheckUtils]: 22: Hoare triple {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:50,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:50,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:50,308 INFO L273 TraceCheckUtils]: 25: Hoare triple {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:50,309 INFO L273 TraceCheckUtils]: 26: Hoare triple {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:50,310 INFO L273 TraceCheckUtils]: 27: Hoare triple {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:50,311 INFO L273 TraceCheckUtils]: 28: Hoare triple {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:50,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:50,312 INFO L273 TraceCheckUtils]: 30: Hoare triple {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:50,313 INFO L273 TraceCheckUtils]: 31: Hoare triple {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:50,314 INFO L273 TraceCheckUtils]: 32: Hoare triple {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:50,315 INFO L273 TraceCheckUtils]: 33: Hoare triple {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:50,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1915#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:50,317 INFO L273 TraceCheckUtils]: 35: Hoare triple {1915#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} assume true; {1915#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:50,317 INFO L273 TraceCheckUtils]: 36: Hoare triple {1915#(and (<= (div main_~x~0 4294967296) 0) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1899#false} is VALID [2018-11-19 00:02:50,318 INFO L256 TraceCheckUtils]: 37: Hoare triple {1899#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1899#false} is VALID [2018-11-19 00:02:50,318 INFO L273 TraceCheckUtils]: 38: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-19 00:02:50,318 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} assume 0 == ~cond; {1899#false} is VALID [2018-11-19 00:02:50,318 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-19 00:02:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:50,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:50,323 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:50,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-19 00:02:50,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-19 00:02:50,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:50,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:50,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {1898#true} call ULTIMATE.init(); {1898#true} is VALID [2018-11-19 00:02:50,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {1898#true} assume true; {1898#true} is VALID [2018-11-19 00:02:50,672 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1898#true} {1898#true} #32#return; {1898#true} is VALID [2018-11-19 00:02:50,672 INFO L256 TraceCheckUtils]: 3: Hoare triple {1898#true} call #t~ret0 := main(); {1898#true} is VALID [2018-11-19 00:02:50,672 INFO L273 TraceCheckUtils]: 4: Hoare triple {1898#true} ~x~0 := 10; {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:50,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:50,673 INFO L273 TraceCheckUtils]: 6: Hoare triple {1900#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:50,674 INFO L273 TraceCheckUtils]: 7: Hoare triple {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:50,674 INFO L273 TraceCheckUtils]: 8: Hoare triple {1901#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:50,675 INFO L273 TraceCheckUtils]: 9: Hoare triple {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:50,675 INFO L273 TraceCheckUtils]: 10: Hoare triple {1902#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:50,676 INFO L273 TraceCheckUtils]: 11: Hoare triple {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:50,677 INFO L273 TraceCheckUtils]: 12: Hoare triple {1903#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:50,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:50,679 INFO L273 TraceCheckUtils]: 14: Hoare triple {1904#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:50,679 INFO L273 TraceCheckUtils]: 15: Hoare triple {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:50,680 INFO L273 TraceCheckUtils]: 16: Hoare triple {1905#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:50,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:50,682 INFO L273 TraceCheckUtils]: 18: Hoare triple {1906#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:50,683 INFO L273 TraceCheckUtils]: 19: Hoare triple {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:50,684 INFO L273 TraceCheckUtils]: 20: Hoare triple {1907#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:50,684 INFO L273 TraceCheckUtils]: 21: Hoare triple {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:50,685 INFO L273 TraceCheckUtils]: 22: Hoare triple {1908#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:50,706 INFO L273 TraceCheckUtils]: 23: Hoare triple {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:50,721 INFO L273 TraceCheckUtils]: 24: Hoare triple {1909#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:50,729 INFO L273 TraceCheckUtils]: 25: Hoare triple {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:50,745 INFO L273 TraceCheckUtils]: 26: Hoare triple {1910#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:50,753 INFO L273 TraceCheckUtils]: 27: Hoare triple {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:50,768 INFO L273 TraceCheckUtils]: 28: Hoare triple {1911#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:50,770 INFO L273 TraceCheckUtils]: 29: Hoare triple {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:50,770 INFO L273 TraceCheckUtils]: 30: Hoare triple {1912#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:50,771 INFO L273 TraceCheckUtils]: 31: Hoare triple {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:50,771 INFO L273 TraceCheckUtils]: 32: Hoare triple {1913#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:50,772 INFO L273 TraceCheckUtils]: 33: Hoare triple {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:50,773 INFO L273 TraceCheckUtils]: 34: Hoare triple {1914#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2021#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:50,774 INFO L273 TraceCheckUtils]: 35: Hoare triple {2021#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2021#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:50,775 INFO L273 TraceCheckUtils]: 36: Hoare triple {2021#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {1899#false} is VALID [2018-11-19 00:02:50,775 INFO L256 TraceCheckUtils]: 37: Hoare triple {1899#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {1899#false} is VALID [2018-11-19 00:02:50,775 INFO L273 TraceCheckUtils]: 38: Hoare triple {1899#false} ~cond := #in~cond; {1899#false} is VALID [2018-11-19 00:02:50,775 INFO L273 TraceCheckUtils]: 39: Hoare triple {1899#false} assume 0 == ~cond; {1899#false} is VALID [2018-11-19 00:02:50,776 INFO L273 TraceCheckUtils]: 40: Hoare triple {1899#false} assume !false; {1899#false} is VALID [2018-11-19 00:02:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:50,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:50,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-19 00:02:50,800 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-11-19 00:02:50,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:50,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-19 00:02:50,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:50,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-19 00:02:50,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-19 00:02:50,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-11-19 00:02:50,850 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 19 states. [2018-11-19 00:02:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:51,967 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-19 00:02:51,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-19 00:02:51,967 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-11-19 00:02:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:51,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:02:51,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2018-11-19 00:02:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-19 00:02:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 52 transitions. [2018-11-19 00:02:51,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 52 transitions. [2018-11-19 00:02:52,045 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:52,047 INFO L225 Difference]: With dead ends: 51 [2018-11-19 00:02:52,047 INFO L226 Difference]: Without dead ends: 46 [2018-11-19 00:02:52,048 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-11-19 00:02:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-19 00:02:52,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-19 00:02:52,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:52,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-19 00:02:52,096 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-19 00:02:52,097 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-19 00:02:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:52,099 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-19 00:02:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-19 00:02:52,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:52,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:52,099 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-19 00:02:52,100 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-19 00:02:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:52,101 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-19 00:02:52,101 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-19 00:02:52,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:52,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:52,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:52,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:52,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-19 00:02:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-19 00:02:52,104 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 41 [2018-11-19 00:02:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:52,104 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-19 00:02:52,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-19 00:02:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-19 00:02:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-19 00:02:52,105 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:52,106 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:52,106 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:52,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash 62287678, now seen corresponding path program 9 times [2018-11-19 00:02:52,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:52,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:52,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:52,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:52,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:52,670 INFO L256 TraceCheckUtils]: 0: Hoare triple {2278#true} call ULTIMATE.init(); {2278#true} is VALID [2018-11-19 00:02:52,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {2278#true} assume true; {2278#true} is VALID [2018-11-19 00:02:52,671 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2278#true} {2278#true} #32#return; {2278#true} is VALID [2018-11-19 00:02:52,671 INFO L256 TraceCheckUtils]: 3: Hoare triple {2278#true} call #t~ret0 := main(); {2278#true} is VALID [2018-11-19 00:02:52,685 INFO L273 TraceCheckUtils]: 4: Hoare triple {2278#true} ~x~0 := 10; {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:52,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:52,697 INFO L273 TraceCheckUtils]: 6: Hoare triple {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:52,697 INFO L273 TraceCheckUtils]: 7: Hoare triple {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:52,698 INFO L273 TraceCheckUtils]: 8: Hoare triple {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:52,698 INFO L273 TraceCheckUtils]: 9: Hoare triple {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:52,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:52,700 INFO L273 TraceCheckUtils]: 11: Hoare triple {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:52,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:52,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:52,702 INFO L273 TraceCheckUtils]: 14: Hoare triple {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:52,702 INFO L273 TraceCheckUtils]: 15: Hoare triple {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:52,703 INFO L273 TraceCheckUtils]: 16: Hoare triple {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:52,703 INFO L273 TraceCheckUtils]: 17: Hoare triple {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:52,704 INFO L273 TraceCheckUtils]: 18: Hoare triple {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:52,704 INFO L273 TraceCheckUtils]: 19: Hoare triple {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:52,705 INFO L273 TraceCheckUtils]: 20: Hoare triple {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:52,706 INFO L273 TraceCheckUtils]: 21: Hoare triple {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:52,707 INFO L273 TraceCheckUtils]: 22: Hoare triple {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:52,707 INFO L273 TraceCheckUtils]: 23: Hoare triple {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:52,708 INFO L273 TraceCheckUtils]: 24: Hoare triple {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:52,709 INFO L273 TraceCheckUtils]: 25: Hoare triple {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:52,710 INFO L273 TraceCheckUtils]: 26: Hoare triple {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:52,711 INFO L273 TraceCheckUtils]: 27: Hoare triple {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:52,711 INFO L273 TraceCheckUtils]: 28: Hoare triple {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:52,712 INFO L273 TraceCheckUtils]: 29: Hoare triple {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:52,713 INFO L273 TraceCheckUtils]: 30: Hoare triple {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:52,714 INFO L273 TraceCheckUtils]: 31: Hoare triple {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:52,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:52,715 INFO L273 TraceCheckUtils]: 33: Hoare triple {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:52,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:52,717 INFO L273 TraceCheckUtils]: 35: Hoare triple {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:52,718 INFO L273 TraceCheckUtils]: 36: Hoare triple {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:52,719 INFO L273 TraceCheckUtils]: 37: Hoare triple {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:52,720 INFO L273 TraceCheckUtils]: 38: Hoare triple {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2297#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:52,721 INFO L273 TraceCheckUtils]: 39: Hoare triple {2297#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {2297#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:52,722 INFO L273 TraceCheckUtils]: 40: Hoare triple {2297#(and (<= 44 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {2279#false} is VALID [2018-11-19 00:02:52,722 INFO L256 TraceCheckUtils]: 41: Hoare triple {2279#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2279#false} is VALID [2018-11-19 00:02:52,722 INFO L273 TraceCheckUtils]: 42: Hoare triple {2279#false} ~cond := #in~cond; {2279#false} is VALID [2018-11-19 00:02:52,722 INFO L273 TraceCheckUtils]: 43: Hoare triple {2279#false} assume 0 == ~cond; {2279#false} is VALID [2018-11-19 00:02:52,722 INFO L273 TraceCheckUtils]: 44: Hoare triple {2279#false} assume !false; {2279#false} is VALID [2018-11-19 00:02:52,726 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:52,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:52,726 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:52,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-19 00:02:52,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-19 00:02:52,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:52,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:52,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:52,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {2278#true} call ULTIMATE.init(); {2278#true} is VALID [2018-11-19 00:02:52,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {2278#true} assume true; {2278#true} is VALID [2018-11-19 00:02:52,953 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2278#true} {2278#true} #32#return; {2278#true} is VALID [2018-11-19 00:02:52,953 INFO L256 TraceCheckUtils]: 3: Hoare triple {2278#true} call #t~ret0 := main(); {2278#true} is VALID [2018-11-19 00:02:52,953 INFO L273 TraceCheckUtils]: 4: Hoare triple {2278#true} ~x~0 := 10; {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:52,954 INFO L273 TraceCheckUtils]: 5: Hoare triple {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:52,955 INFO L273 TraceCheckUtils]: 6: Hoare triple {2280#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:52,955 INFO L273 TraceCheckUtils]: 7: Hoare triple {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:52,956 INFO L273 TraceCheckUtils]: 8: Hoare triple {2281#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:52,956 INFO L273 TraceCheckUtils]: 9: Hoare triple {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:52,957 INFO L273 TraceCheckUtils]: 10: Hoare triple {2282#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:52,958 INFO L273 TraceCheckUtils]: 11: Hoare triple {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:52,959 INFO L273 TraceCheckUtils]: 12: Hoare triple {2283#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:52,959 INFO L273 TraceCheckUtils]: 13: Hoare triple {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:52,974 INFO L273 TraceCheckUtils]: 14: Hoare triple {2284#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:52,975 INFO L273 TraceCheckUtils]: 15: Hoare triple {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:52,975 INFO L273 TraceCheckUtils]: 16: Hoare triple {2285#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:52,976 INFO L273 TraceCheckUtils]: 17: Hoare triple {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:52,976 INFO L273 TraceCheckUtils]: 18: Hoare triple {2286#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:52,977 INFO L273 TraceCheckUtils]: 19: Hoare triple {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:52,977 INFO L273 TraceCheckUtils]: 20: Hoare triple {2287#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:52,978 INFO L273 TraceCheckUtils]: 21: Hoare triple {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:52,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {2288#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:52,980 INFO L273 TraceCheckUtils]: 23: Hoare triple {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:52,981 INFO L273 TraceCheckUtils]: 24: Hoare triple {2289#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:52,981 INFO L273 TraceCheckUtils]: 25: Hoare triple {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:52,982 INFO L273 TraceCheckUtils]: 26: Hoare triple {2290#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:52,983 INFO L273 TraceCheckUtils]: 27: Hoare triple {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:52,984 INFO L273 TraceCheckUtils]: 28: Hoare triple {2291#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:52,985 INFO L273 TraceCheckUtils]: 29: Hoare triple {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:52,986 INFO L273 TraceCheckUtils]: 30: Hoare triple {2292#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:52,986 INFO L273 TraceCheckUtils]: 31: Hoare triple {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:52,987 INFO L273 TraceCheckUtils]: 32: Hoare triple {2293#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:52,988 INFO L273 TraceCheckUtils]: 33: Hoare triple {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:52,989 INFO L273 TraceCheckUtils]: 34: Hoare triple {2294#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:52,990 INFO L273 TraceCheckUtils]: 35: Hoare triple {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:52,990 INFO L273 TraceCheckUtils]: 36: Hoare triple {2295#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:52,991 INFO L273 TraceCheckUtils]: 37: Hoare triple {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:52,992 INFO L273 TraceCheckUtils]: 38: Hoare triple {2296#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2415#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:02:52,993 INFO L273 TraceCheckUtils]: 39: Hoare triple {2415#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {2415#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:02:52,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {2415#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 >= 10); {2279#false} is VALID [2018-11-19 00:02:52,994 INFO L256 TraceCheckUtils]: 41: Hoare triple {2279#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2279#false} is VALID [2018-11-19 00:02:52,994 INFO L273 TraceCheckUtils]: 42: Hoare triple {2279#false} ~cond := #in~cond; {2279#false} is VALID [2018-11-19 00:02:52,994 INFO L273 TraceCheckUtils]: 43: Hoare triple {2279#false} assume 0 == ~cond; {2279#false} is VALID [2018-11-19 00:02:52,995 INFO L273 TraceCheckUtils]: 44: Hoare triple {2279#false} assume !false; {2279#false} is VALID [2018-11-19 00:02:52,998 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:53,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:53,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-19 00:02:53,017 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-11-19 00:02:53,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:53,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-19 00:02:53,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:53,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-19 00:02:53,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-19 00:02:53,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-11-19 00:02:53,066 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 21 states. [2018-11-19 00:02:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:54,777 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-19 00:02:54,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-19 00:02:54,778 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2018-11-19 00:02:54,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:54,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-19 00:02:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2018-11-19 00:02:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-19 00:02:54,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 56 transitions. [2018-11-19 00:02:54,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 56 transitions. [2018-11-19 00:02:54,843 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-19 00:02:54,844 INFO L225 Difference]: With dead ends: 55 [2018-11-19 00:02:54,845 INFO L226 Difference]: Without dead ends: 50 [2018-11-19 00:02:54,845 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-11-19 00:02:54,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-19 00:02:54,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-19 00:02:54,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:54,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-19 00:02:54,897 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-19 00:02:54,898 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-19 00:02:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:54,899 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-19 00:02:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-19 00:02:54,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:54,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:54,900 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-19 00:02:54,900 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-19 00:02:54,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:54,902 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-11-19 00:02:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-19 00:02:54,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:54,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:54,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:54,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:54,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-19 00:02:54,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-11-19 00:02:54,905 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 45 [2018-11-19 00:02:54,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:54,905 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-11-19 00:02:54,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-19 00:02:54,905 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-11-19 00:02:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-19 00:02:54,906 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:54,906 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:54,906 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:54,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash 880063306, now seen corresponding path program 10 times [2018-11-19 00:02:54,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:54,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:54,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:54,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:54,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:55,663 INFO L256 TraceCheckUtils]: 0: Hoare triple {2692#true} call ULTIMATE.init(); {2692#true} is VALID [2018-11-19 00:02:55,663 INFO L273 TraceCheckUtils]: 1: Hoare triple {2692#true} assume true; {2692#true} is VALID [2018-11-19 00:02:55,663 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2692#true} {2692#true} #32#return; {2692#true} is VALID [2018-11-19 00:02:55,663 INFO L256 TraceCheckUtils]: 3: Hoare triple {2692#true} call #t~ret0 := main(); {2692#true} is VALID [2018-11-19 00:02:55,664 INFO L273 TraceCheckUtils]: 4: Hoare triple {2692#true} ~x~0 := 10; {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:55,665 INFO L273 TraceCheckUtils]: 5: Hoare triple {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:55,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:55,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:55,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:55,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:55,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:55,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:55,670 INFO L273 TraceCheckUtils]: 12: Hoare triple {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:55,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:55,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:55,673 INFO L273 TraceCheckUtils]: 15: Hoare triple {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:55,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:55,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:55,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:55,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:55,677 INFO L273 TraceCheckUtils]: 20: Hoare triple {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:55,678 INFO L273 TraceCheckUtils]: 21: Hoare triple {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:55,678 INFO L273 TraceCheckUtils]: 22: Hoare triple {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:55,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:55,680 INFO L273 TraceCheckUtils]: 24: Hoare triple {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:55,681 INFO L273 TraceCheckUtils]: 25: Hoare triple {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:55,682 INFO L273 TraceCheckUtils]: 26: Hoare triple {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:55,682 INFO L273 TraceCheckUtils]: 27: Hoare triple {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:55,683 INFO L273 TraceCheckUtils]: 28: Hoare triple {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:55,684 INFO L273 TraceCheckUtils]: 29: Hoare triple {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:55,685 INFO L273 TraceCheckUtils]: 30: Hoare triple {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:55,686 INFO L273 TraceCheckUtils]: 31: Hoare triple {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:55,687 INFO L273 TraceCheckUtils]: 32: Hoare triple {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:55,687 INFO L273 TraceCheckUtils]: 33: Hoare triple {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:55,688 INFO L273 TraceCheckUtils]: 34: Hoare triple {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:55,689 INFO L273 TraceCheckUtils]: 35: Hoare triple {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:55,690 INFO L273 TraceCheckUtils]: 36: Hoare triple {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:55,690 INFO L273 TraceCheckUtils]: 37: Hoare triple {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:55,691 INFO L273 TraceCheckUtils]: 38: Hoare triple {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:02:55,692 INFO L273 TraceCheckUtils]: 39: Hoare triple {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:02:55,693 INFO L273 TraceCheckUtils]: 40: Hoare triple {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:02:55,694 INFO L273 TraceCheckUtils]: 41: Hoare triple {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume true; {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:02:55,695 INFO L273 TraceCheckUtils]: 42: Hoare triple {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2713#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:55,695 INFO L273 TraceCheckUtils]: 43: Hoare triple {2713#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume true; {2713#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} is VALID [2018-11-19 00:02:55,696 INFO L273 TraceCheckUtils]: 44: Hoare triple {2713#(and (<= 48 main_~x~0) (<= (div main_~x~0 4294967296) 0))} assume !(~x~0 % 4294967296 >= 10); {2693#false} is VALID [2018-11-19 00:02:55,697 INFO L256 TraceCheckUtils]: 45: Hoare triple {2693#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2693#false} is VALID [2018-11-19 00:02:55,697 INFO L273 TraceCheckUtils]: 46: Hoare triple {2693#false} ~cond := #in~cond; {2693#false} is VALID [2018-11-19 00:02:55,697 INFO L273 TraceCheckUtils]: 47: Hoare triple {2693#false} assume 0 == ~cond; {2693#false} is VALID [2018-11-19 00:02:55,697 INFO L273 TraceCheckUtils]: 48: Hoare triple {2693#false} assume !false; {2693#false} is VALID [2018-11-19 00:02:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:55,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:55,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:55,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-19 00:02:55,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-19 00:02:55,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:02:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:55,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:02:55,926 INFO L256 TraceCheckUtils]: 0: Hoare triple {2692#true} call ULTIMATE.init(); {2692#true} is VALID [2018-11-19 00:02:55,927 INFO L273 TraceCheckUtils]: 1: Hoare triple {2692#true} assume true; {2692#true} is VALID [2018-11-19 00:02:55,927 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {2692#true} {2692#true} #32#return; {2692#true} is VALID [2018-11-19 00:02:55,927 INFO L256 TraceCheckUtils]: 3: Hoare triple {2692#true} call #t~ret0 := main(); {2692#true} is VALID [2018-11-19 00:02:55,927 INFO L273 TraceCheckUtils]: 4: Hoare triple {2692#true} ~x~0 := 10; {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:55,928 INFO L273 TraceCheckUtils]: 5: Hoare triple {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:55,928 INFO L273 TraceCheckUtils]: 6: Hoare triple {2694#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:55,929 INFO L273 TraceCheckUtils]: 7: Hoare triple {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:55,929 INFO L273 TraceCheckUtils]: 8: Hoare triple {2695#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:55,930 INFO L273 TraceCheckUtils]: 9: Hoare triple {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:55,930 INFO L273 TraceCheckUtils]: 10: Hoare triple {2696#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:55,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:55,932 INFO L273 TraceCheckUtils]: 12: Hoare triple {2697#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:55,933 INFO L273 TraceCheckUtils]: 13: Hoare triple {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:55,933 INFO L273 TraceCheckUtils]: 14: Hoare triple {2698#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:55,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:55,935 INFO L273 TraceCheckUtils]: 16: Hoare triple {2699#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:55,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:55,937 INFO L273 TraceCheckUtils]: 18: Hoare triple {2700#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:55,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:55,938 INFO L273 TraceCheckUtils]: 20: Hoare triple {2701#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:55,939 INFO L273 TraceCheckUtils]: 21: Hoare triple {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:55,940 INFO L273 TraceCheckUtils]: 22: Hoare triple {2702#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:55,941 INFO L273 TraceCheckUtils]: 23: Hoare triple {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:55,942 INFO L273 TraceCheckUtils]: 24: Hoare triple {2703#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:55,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:55,943 INFO L273 TraceCheckUtils]: 26: Hoare triple {2704#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:55,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:55,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {2705#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:55,945 INFO L273 TraceCheckUtils]: 29: Hoare triple {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:55,946 INFO L273 TraceCheckUtils]: 30: Hoare triple {2706#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:55,947 INFO L273 TraceCheckUtils]: 31: Hoare triple {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:55,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {2707#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:55,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:55,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {2708#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:55,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:55,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {2709#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:55,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:55,953 INFO L273 TraceCheckUtils]: 38: Hoare triple {2710#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:02:55,953 INFO L273 TraceCheckUtils]: 39: Hoare triple {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:02:55,954 INFO L273 TraceCheckUtils]: 40: Hoare triple {2711#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:02:55,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume true; {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:02:55,956 INFO L273 TraceCheckUtils]: 42: Hoare triple {2712#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {2843#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-19 00:02:55,957 INFO L273 TraceCheckUtils]: 43: Hoare triple {2843#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume true; {2843#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-19 00:02:55,958 INFO L273 TraceCheckUtils]: 44: Hoare triple {2843#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !(~x~0 % 4294967296 >= 10); {2693#false} is VALID [2018-11-19 00:02:55,958 INFO L256 TraceCheckUtils]: 45: Hoare triple {2693#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {2693#false} is VALID [2018-11-19 00:02:55,958 INFO L273 TraceCheckUtils]: 46: Hoare triple {2693#false} ~cond := #in~cond; {2693#false} is VALID [2018-11-19 00:02:55,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {2693#false} assume 0 == ~cond; {2693#false} is VALID [2018-11-19 00:02:55,958 INFO L273 TraceCheckUtils]: 48: Hoare triple {2693#false} assume !false; {2693#false} is VALID [2018-11-19 00:02:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:55,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:02:55,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-19 00:02:55,984 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-11-19 00:02:55,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:02:55,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-19 00:02:56,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:56,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-19 00:02:56,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-19 00:02:56,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-11-19 00:02:56,038 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 23 states. [2018-11-19 00:02:57,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:57,466 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-19 00:02:57,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-19 00:02:57,466 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-11-19 00:02:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:02:57,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 00:02:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2018-11-19 00:02:57,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-19 00:02:57,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 60 transitions. [2018-11-19 00:02:57,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 60 transitions. [2018-11-19 00:02:57,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:02:57,528 INFO L225 Difference]: With dead ends: 59 [2018-11-19 00:02:57,528 INFO L226 Difference]: Without dead ends: 54 [2018-11-19 00:02:57,529 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-11-19 00:02:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-19 00:02:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-19 00:02:57,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:02:57,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-19 00:02:57,575 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-19 00:02:57,575 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-19 00:02:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:57,576 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-19 00:02:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-19 00:02:57,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:57,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:57,577 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-19 00:02:57,577 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-19 00:02:57,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:02:57,579 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-11-19 00:02:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-19 00:02:57,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:02:57,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:02:57,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:02:57,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:02:57,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-19 00:02:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-19 00:02:57,581 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 49 [2018-11-19 00:02:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:02:57,581 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-19 00:02:57,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-19 00:02:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-19 00:02:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-19 00:02:57,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:02:57,582 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:02:57,582 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:02:57,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:02:57,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1793453738, now seen corresponding path program 11 times [2018-11-19 00:02:57,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:02:57,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:02:57,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:57,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:02:57,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:02:57,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:02:58,733 INFO L256 TraceCheckUtils]: 0: Hoare triple {3140#true} call ULTIMATE.init(); {3140#true} is VALID [2018-11-19 00:02:58,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {3140#true} assume true; {3140#true} is VALID [2018-11-19 00:02:58,734 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3140#true} {3140#true} #32#return; {3140#true} is VALID [2018-11-19 00:02:58,734 INFO L256 TraceCheckUtils]: 3: Hoare triple {3140#true} call #t~ret0 := main(); {3140#true} is VALID [2018-11-19 00:02:58,734 INFO L273 TraceCheckUtils]: 4: Hoare triple {3140#true} ~x~0 := 10; {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:58,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:02:58,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:58,737 INFO L273 TraceCheckUtils]: 7: Hoare triple {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:02:58,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:58,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:02:58,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:58,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:02:58,741 INFO L273 TraceCheckUtils]: 12: Hoare triple {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:58,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:02:58,742 INFO L273 TraceCheckUtils]: 14: Hoare triple {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:58,743 INFO L273 TraceCheckUtils]: 15: Hoare triple {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:02:58,744 INFO L273 TraceCheckUtils]: 16: Hoare triple {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:58,745 INFO L273 TraceCheckUtils]: 17: Hoare triple {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:02:58,746 INFO L273 TraceCheckUtils]: 18: Hoare triple {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:58,746 INFO L273 TraceCheckUtils]: 19: Hoare triple {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:02:58,747 INFO L273 TraceCheckUtils]: 20: Hoare triple {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:58,766 INFO L273 TraceCheckUtils]: 21: Hoare triple {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:02:58,771 INFO L273 TraceCheckUtils]: 22: Hoare triple {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:58,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:02:58,772 INFO L273 TraceCheckUtils]: 24: Hoare triple {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:58,773 INFO L273 TraceCheckUtils]: 25: Hoare triple {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:02:58,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:58,774 INFO L273 TraceCheckUtils]: 27: Hoare triple {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:02:58,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:58,775 INFO L273 TraceCheckUtils]: 29: Hoare triple {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:02:58,775 INFO L273 TraceCheckUtils]: 30: Hoare triple {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:58,776 INFO L273 TraceCheckUtils]: 31: Hoare triple {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:02:58,776 INFO L273 TraceCheckUtils]: 32: Hoare triple {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:58,777 INFO L273 TraceCheckUtils]: 33: Hoare triple {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:02:58,778 INFO L273 TraceCheckUtils]: 34: Hoare triple {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:58,778 INFO L273 TraceCheckUtils]: 35: Hoare triple {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:02:58,779 INFO L273 TraceCheckUtils]: 36: Hoare triple {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:58,780 INFO L273 TraceCheckUtils]: 37: Hoare triple {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:02:58,781 INFO L273 TraceCheckUtils]: 38: Hoare triple {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:02:58,782 INFO L273 TraceCheckUtils]: 39: Hoare triple {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:02:58,783 INFO L273 TraceCheckUtils]: 40: Hoare triple {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:02:58,783 INFO L273 TraceCheckUtils]: 41: Hoare triple {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume true; {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:02:58,784 INFO L273 TraceCheckUtils]: 42: Hoare triple {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-19 00:02:58,785 INFO L273 TraceCheckUtils]: 43: Hoare triple {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume true; {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-19 00:02:58,786 INFO L273 TraceCheckUtils]: 44: Hoare triple {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-19 00:02:58,787 INFO L273 TraceCheckUtils]: 45: Hoare triple {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume true; {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-19 00:02:58,788 INFO L273 TraceCheckUtils]: 46: Hoare triple {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3163#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} is VALID [2018-11-19 00:02:58,788 INFO L273 TraceCheckUtils]: 47: Hoare triple {3163#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} assume true; {3163#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} is VALID [2018-11-19 00:02:58,789 INFO L273 TraceCheckUtils]: 48: Hoare triple {3163#(and (<= (div main_~x~0 4294967296) 0) (<= 52 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {3141#false} is VALID [2018-11-19 00:02:58,790 INFO L256 TraceCheckUtils]: 49: Hoare triple {3141#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3141#false} is VALID [2018-11-19 00:02:58,790 INFO L273 TraceCheckUtils]: 50: Hoare triple {3141#false} ~cond := #in~cond; {3141#false} is VALID [2018-11-19 00:02:58,790 INFO L273 TraceCheckUtils]: 51: Hoare triple {3141#false} assume 0 == ~cond; {3141#false} is VALID [2018-11-19 00:02:58,790 INFO L273 TraceCheckUtils]: 52: Hoare triple {3141#false} assume !false; {3141#false} is VALID [2018-11-19 00:02:58,795 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:02:58,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:02:58,795 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:02:58,804 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-19 00:05:45,961 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-19 00:05:45,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-19 00:05:46,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:46,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-19 00:05:46,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {3140#true} call ULTIMATE.init(); {3140#true} is VALID [2018-11-19 00:05:46,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {3140#true} assume true; {3140#true} is VALID [2018-11-19 00:05:46,586 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3140#true} {3140#true} #32#return; {3140#true} is VALID [2018-11-19 00:05:46,586 INFO L256 TraceCheckUtils]: 3: Hoare triple {3140#true} call #t~ret0 := main(); {3140#true} is VALID [2018-11-19 00:05:46,587 INFO L273 TraceCheckUtils]: 4: Hoare triple {3140#true} ~x~0 := 10; {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:05:46,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:05:46,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {3142#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:05:46,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:05:46,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {3143#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:05:46,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:05:46,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {3144#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:05:46,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:05:46,592 INFO L273 TraceCheckUtils]: 12: Hoare triple {3145#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:05:46,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:05:46,594 INFO L273 TraceCheckUtils]: 14: Hoare triple {3146#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:05:46,595 INFO L273 TraceCheckUtils]: 15: Hoare triple {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:05:46,596 INFO L273 TraceCheckUtils]: 16: Hoare triple {3147#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:05:46,597 INFO L273 TraceCheckUtils]: 17: Hoare triple {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:05:46,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {3148#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:05:46,598 INFO L273 TraceCheckUtils]: 19: Hoare triple {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:05:46,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {3149#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:05:46,600 INFO L273 TraceCheckUtils]: 21: Hoare triple {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:05:46,601 INFO L273 TraceCheckUtils]: 22: Hoare triple {3150#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:05:46,602 INFO L273 TraceCheckUtils]: 23: Hoare triple {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:05:46,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {3151#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:05:46,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:05:46,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {3152#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:05:46,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:05:46,607 INFO L273 TraceCheckUtils]: 28: Hoare triple {3153#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:05:46,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:05:46,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {3154#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:05:46,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:05:46,620 INFO L273 TraceCheckUtils]: 32: Hoare triple {3155#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:05:46,621 INFO L273 TraceCheckUtils]: 33: Hoare triple {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:05:46,622 INFO L273 TraceCheckUtils]: 34: Hoare triple {3156#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:05:46,622 INFO L273 TraceCheckUtils]: 35: Hoare triple {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:05:46,623 INFO L273 TraceCheckUtils]: 36: Hoare triple {3157#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:05:46,623 INFO L273 TraceCheckUtils]: 37: Hoare triple {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:05:46,624 INFO L273 TraceCheckUtils]: 38: Hoare triple {3158#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:05:46,625 INFO L273 TraceCheckUtils]: 39: Hoare triple {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:05:46,626 INFO L273 TraceCheckUtils]: 40: Hoare triple {3159#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:05:46,627 INFO L273 TraceCheckUtils]: 41: Hoare triple {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume true; {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:05:46,628 INFO L273 TraceCheckUtils]: 42: Hoare triple {3160#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-19 00:05:46,629 INFO L273 TraceCheckUtils]: 43: Hoare triple {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume true; {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-19 00:05:46,630 INFO L273 TraceCheckUtils]: 44: Hoare triple {3161#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-19 00:05:46,631 INFO L273 TraceCheckUtils]: 45: Hoare triple {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume true; {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-19 00:05:46,632 INFO L273 TraceCheckUtils]: 46: Hoare triple {3162#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3305#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-19 00:05:46,632 INFO L273 TraceCheckUtils]: 47: Hoare triple {3305#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume true; {3305#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-19 00:05:46,633 INFO L273 TraceCheckUtils]: 48: Hoare triple {3305#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {3141#false} is VALID [2018-11-19 00:05:46,634 INFO L256 TraceCheckUtils]: 49: Hoare triple {3141#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3141#false} is VALID [2018-11-19 00:05:46,634 INFO L273 TraceCheckUtils]: 50: Hoare triple {3141#false} ~cond := #in~cond; {3141#false} is VALID [2018-11-19 00:05:46,634 INFO L273 TraceCheckUtils]: 51: Hoare triple {3141#false} assume 0 == ~cond; {3141#false} is VALID [2018-11-19 00:05:46,635 INFO L273 TraceCheckUtils]: 52: Hoare triple {3141#false} assume !false; {3141#false} is VALID [2018-11-19 00:05:46,642 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:05:46,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-19 00:05:46,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-19 00:05:46,648 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2018-11-19 00:05:46,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-19 00:05:46,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-19 00:05:46,715 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-19 00:05:46,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-19 00:05:46,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-19 00:05:46,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-11-19 00:05:46,717 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 25 states. [2018-11-19 00:05:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:49,324 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-19 00:05:49,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-19 00:05:49,324 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 53 [2018-11-19 00:05:49,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-19 00:05:49,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:05:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2018-11-19 00:05:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-19 00:05:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 64 transitions. [2018-11-19 00:05:49,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 64 transitions. [2018-11-19 00:05:49,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-19 00:05:49,394 INFO L225 Difference]: With dead ends: 63 [2018-11-19 00:05:49,394 INFO L226 Difference]: Without dead ends: 58 [2018-11-19 00:05:49,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-11-19 00:05:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-19 00:05:49,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-19 00:05:49,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-19 00:05:49,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-19 00:05:49,442 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-19 00:05:49,442 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-19 00:05:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:49,444 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-19 00:05:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-19 00:05:49,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:49,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:49,445 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-19 00:05:49,445 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-19 00:05:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-19 00:05:49,446 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-19 00:05:49,446 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-19 00:05:49,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-19 00:05:49,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-19 00:05:49,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-19 00:05:49,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-19 00:05:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-19 00:05:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-11-19 00:05:49,448 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 53 [2018-11-19 00:05:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-19 00:05:49,448 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-11-19 00:05:49,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-19 00:05:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-11-19 00:05:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-19 00:05:49,449 INFO L367 BasicCegarLoop]: Found error trace [2018-11-19 00:05:49,449 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-19 00:05:49,449 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-19 00:05:49,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-19 00:05:49,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1216973154, now seen corresponding path program 12 times [2018-11-19 00:05:49,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-19 00:05:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-19 00:05:49,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:49,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-19 00:05:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-19 00:05:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-19 00:05:50,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {3622#true} call ULTIMATE.init(); {3622#true} is VALID [2018-11-19 00:05:50,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {3622#true} assume true; {3622#true} is VALID [2018-11-19 00:05:50,088 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {3622#true} {3622#true} #32#return; {3622#true} is VALID [2018-11-19 00:05:50,088 INFO L256 TraceCheckUtils]: 3: Hoare triple {3622#true} call #t~ret0 := main(); {3622#true} is VALID [2018-11-19 00:05:50,089 INFO L273 TraceCheckUtils]: 4: Hoare triple {3622#true} ~x~0 := 10; {3624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:05:50,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {3624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume true; {3624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2018-11-19 00:05:50,090 INFO L273 TraceCheckUtils]: 6: Hoare triple {3624#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3625#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:05:50,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {3625#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume true; {3625#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2018-11-19 00:05:50,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {3625#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3626#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:05:50,092 INFO L273 TraceCheckUtils]: 9: Hoare triple {3626#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume true; {3626#(and (<= main_~x~0 14) (<= 14 main_~x~0))} is VALID [2018-11-19 00:05:50,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {3626#(and (<= main_~x~0 14) (<= 14 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3627#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:05:50,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {3627#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume true; {3627#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2018-11-19 00:05:50,094 INFO L273 TraceCheckUtils]: 12: Hoare triple {3627#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3628#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:05:50,095 INFO L273 TraceCheckUtils]: 13: Hoare triple {3628#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume true; {3628#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2018-11-19 00:05:50,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {3628#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3629#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:05:50,096 INFO L273 TraceCheckUtils]: 15: Hoare triple {3629#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume true; {3629#(and (<= 20 main_~x~0) (<= main_~x~0 20))} is VALID [2018-11-19 00:05:50,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {3629#(and (<= 20 main_~x~0) (<= main_~x~0 20))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3630#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:05:50,098 INFO L273 TraceCheckUtils]: 17: Hoare triple {3630#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume true; {3630#(and (<= main_~x~0 22) (<= 22 main_~x~0))} is VALID [2018-11-19 00:05:50,099 INFO L273 TraceCheckUtils]: 18: Hoare triple {3630#(and (<= main_~x~0 22) (<= 22 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3631#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:05:50,099 INFO L273 TraceCheckUtils]: 19: Hoare triple {3631#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume true; {3631#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2018-11-19 00:05:50,100 INFO L273 TraceCheckUtils]: 20: Hoare triple {3631#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3632#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:05:50,101 INFO L273 TraceCheckUtils]: 21: Hoare triple {3632#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume true; {3632#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2018-11-19 00:05:50,102 INFO L273 TraceCheckUtils]: 22: Hoare triple {3632#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3633#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:05:50,102 INFO L273 TraceCheckUtils]: 23: Hoare triple {3633#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume true; {3633#(and (<= main_~x~0 28) (<= 28 main_~x~0))} is VALID [2018-11-19 00:05:50,103 INFO L273 TraceCheckUtils]: 24: Hoare triple {3633#(and (<= main_~x~0 28) (<= 28 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3634#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:05:50,104 INFO L273 TraceCheckUtils]: 25: Hoare triple {3634#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume true; {3634#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2018-11-19 00:05:50,105 INFO L273 TraceCheckUtils]: 26: Hoare triple {3634#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3635#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:05:50,105 INFO L273 TraceCheckUtils]: 27: Hoare triple {3635#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume true; {3635#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2018-11-19 00:05:50,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {3635#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3636#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:05:50,107 INFO L273 TraceCheckUtils]: 29: Hoare triple {3636#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume true; {3636#(and (<= 34 main_~x~0) (<= main_~x~0 34))} is VALID [2018-11-19 00:05:50,108 INFO L273 TraceCheckUtils]: 30: Hoare triple {3636#(and (<= 34 main_~x~0) (<= main_~x~0 34))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3637#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:05:50,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {3637#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume true; {3637#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2018-11-19 00:05:50,127 INFO L273 TraceCheckUtils]: 32: Hoare triple {3637#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3638#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:05:50,136 INFO L273 TraceCheckUtils]: 33: Hoare triple {3638#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume true; {3638#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2018-11-19 00:05:50,149 INFO L273 TraceCheckUtils]: 34: Hoare triple {3638#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3639#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:05:50,158 INFO L273 TraceCheckUtils]: 35: Hoare triple {3639#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume true; {3639#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2018-11-19 00:05:50,171 INFO L273 TraceCheckUtils]: 36: Hoare triple {3639#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3640#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:05:50,180 INFO L273 TraceCheckUtils]: 37: Hoare triple {3640#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume true; {3640#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2018-11-19 00:05:50,192 INFO L273 TraceCheckUtils]: 38: Hoare triple {3640#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3641#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:05:50,206 INFO L273 TraceCheckUtils]: 39: Hoare triple {3641#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume true; {3641#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2018-11-19 00:05:50,214 INFO L273 TraceCheckUtils]: 40: Hoare triple {3641#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3642#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:05:50,217 INFO L273 TraceCheckUtils]: 41: Hoare triple {3642#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume true; {3642#(and (<= main_~x~0 46) (<= 46 main_~x~0))} is VALID [2018-11-19 00:05:50,217 INFO L273 TraceCheckUtils]: 42: Hoare triple {3642#(and (<= main_~x~0 46) (<= 46 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3643#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-19 00:05:50,219 INFO L273 TraceCheckUtils]: 43: Hoare triple {3643#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume true; {3643#(and (<= 48 main_~x~0) (<= main_~x~0 48))} is VALID [2018-11-19 00:05:50,219 INFO L273 TraceCheckUtils]: 44: Hoare triple {3643#(and (<= 48 main_~x~0) (<= main_~x~0 48))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3644#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-19 00:05:50,221 INFO L273 TraceCheckUtils]: 45: Hoare triple {3644#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume true; {3644#(and (<= 50 main_~x~0) (<= main_~x~0 50))} is VALID [2018-11-19 00:05:50,221 INFO L273 TraceCheckUtils]: 46: Hoare triple {3644#(and (<= 50 main_~x~0) (<= main_~x~0 50))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3645#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-19 00:05:50,223 INFO L273 TraceCheckUtils]: 47: Hoare triple {3645#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume true; {3645#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2018-11-19 00:05:50,223 INFO L273 TraceCheckUtils]: 48: Hoare triple {3645#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3646#(and (<= 54 main_~x~0) (<= main_~x~0 54))} is VALID [2018-11-19 00:05:50,225 INFO L273 TraceCheckUtils]: 49: Hoare triple {3646#(and (<= 54 main_~x~0) (<= main_~x~0 54))} assume true; {3646#(and (<= 54 main_~x~0) (<= main_~x~0 54))} is VALID [2018-11-19 00:05:50,226 INFO L273 TraceCheckUtils]: 50: Hoare triple {3646#(and (<= 54 main_~x~0) (<= main_~x~0 54))} assume !!(~x~0 % 4294967296 >= 10);~x~0 := 2 + ~x~0; {3647#(and (<= (div main_~x~0 4294967296) 0) (<= 56 main_~x~0))} is VALID [2018-11-19 00:05:50,226 INFO L273 TraceCheckUtils]: 51: Hoare triple {3647#(and (<= (div main_~x~0 4294967296) 0) (<= 56 main_~x~0))} assume true; {3647#(and (<= (div main_~x~0 4294967296) 0) (<= 56 main_~x~0))} is VALID [2018-11-19 00:05:50,227 INFO L273 TraceCheckUtils]: 52: Hoare triple {3647#(and (<= (div main_~x~0 4294967296) 0) (<= 56 main_~x~0))} assume !(~x~0 % 4294967296 >= 10); {3623#false} is VALID [2018-11-19 00:05:50,228 INFO L256 TraceCheckUtils]: 53: Hoare triple {3623#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {3623#false} is VALID [2018-11-19 00:05:50,228 INFO L273 TraceCheckUtils]: 54: Hoare triple {3623#false} ~cond := #in~cond; {3623#false} is VALID [2018-11-19 00:05:50,228 INFO L273 TraceCheckUtils]: 55: Hoare triple {3623#false} assume 0 == ~cond; {3623#false} is VALID [2018-11-19 00:05:50,228 INFO L273 TraceCheckUtils]: 56: Hoare triple {3623#false} assume !false; {3623#false} is VALID [2018-11-19 00:05:50,234 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-19 00:05:50,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-19 00:05:50,234 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-19 00:05:50,243 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE