java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/count_up_down_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:03:07,675 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:03:07,677 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:03:07,689 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:03:07,689 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:03:07,690 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:03:07,691 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:03:07,693 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:03:07,695 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:03:07,696 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:03:07,696 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:03:07,697 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:03:07,698 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:03:07,699 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:03:07,700 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:03:07,700 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:03:07,701 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:03:07,703 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:03:07,705 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:03:07,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:03:07,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:03:07,710 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:03:07,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:03:07,713 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:03:07,713 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:03:07,714 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:03:07,715 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:03:07,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:03:07,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:03:07,718 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:03:07,718 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:03:07,719 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:03:07,719 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:03:07,719 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:03:07,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:03:07,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:03:07,722 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-23 13:03:07,738 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:03:07,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:03:07,739 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:03:07,739 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:03:07,743 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:03:07,743 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:03:07,744 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:03:07,744 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:03:07,744 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:03:07,744 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:03:07,744 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:03:07,745 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:03:07,745 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:03:07,745 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:03:07,745 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:03:07,745 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:03:07,748 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:03:07,748 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:03:07,748 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:03:07,748 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:03:07,749 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:03:07,749 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:03:07,749 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:03:07,749 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:07,749 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:03:07,750 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:03:07,750 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:03:07,750 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:03:07,751 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:03:07,751 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:03:07,751 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:03:07,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:03:07,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:03:07,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:03:07,833 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:03:07,834 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:03:07,835 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down_true-unreach-call_true-termination.i [2018-11-23 13:03:07,892 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950612bac/830dfe959c0b4ce29f6e108034313eb3/FLAG37bab49eb [2018-11-23 13:03:08,322 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:03:08,323 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down_true-unreach-call_true-termination.i [2018-11-23 13:03:08,329 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950612bac/830dfe959c0b4ce29f6e108034313eb3/FLAG37bab49eb [2018-11-23 13:03:08,687 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/950612bac/830dfe959c0b4ce29f6e108034313eb3 [2018-11-23 13:03:08,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:03:08,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:03:08,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:08,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:03:08,704 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:03:08,706 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:08" (1/1) ... [2018-11-23 13:03:08,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6239c037 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:08, skipping insertion in model container [2018-11-23 13:03:08,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:03:08" (1/1) ... [2018-11-23 13:03:08,721 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:03:08,750 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:03:08,979 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:08,985 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:03:09,009 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:03:09,026 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:03:09,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09 WrapperNode [2018-11-23 13:03:09,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:03:09,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:09,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:03:09,029 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:03:09,040 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:03:09,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:03:09,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:03:09,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:03:09,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... [2018-11-23 13:03:09,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:03:09,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:03:09,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:03:09,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:03:09,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:03:09,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:03:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:03:09,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:03:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:03:09,211 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:03:09,211 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:03:09,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:03:09,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:03:09,591 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:03:09,591 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:03:09,592 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:09 BoogieIcfgContainer [2018-11-23 13:03:09,592 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:03:09,594 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:03:09,594 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:03:09,597 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:03:09,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:03:08" (1/3) ... [2018-11-23 13:03:09,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bcbec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:09, skipping insertion in model container [2018-11-23 13:03:09,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:03:09" (2/3) ... [2018-11-23 13:03:09,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71bcbec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:03:09, skipping insertion in model container [2018-11-23 13:03:09,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:09" (3/3) ... [2018-11-23 13:03:09,601 INFO L112 eAbstractionObserver]: Analyzing ICFG count_up_down_true-unreach-call_true-termination.i [2018-11-23 13:03:09,611 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:03:09,618 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:03:09,637 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:03:09,670 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:03:09,671 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:03:09,671 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:03:09,671 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:03:09,671 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:03:09,671 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:03:09,671 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:03:09,672 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:03:09,672 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:03:09,690 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-11-23 13:03:09,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:03:09,696 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:09,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:09,699 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:09,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1846144830, now seen corresponding path program 1 times [2018-11-23 13:03:09,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:09,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:09,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:09,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:09,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:09,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:10,294 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 24 [2018-11-23 13:03:10,758 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2018-11-23 13:03:10,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {20#true} call ULTIMATE.init(); {20#true} is VALID [2018-11-23 13:03:10,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {20#true} assume true; {20#true} is VALID [2018-11-23 13:03:10,828 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {20#true} {20#true} #31#return; {20#true} is VALID [2018-11-23 13:03:10,828 INFO L256 TraceCheckUtils]: 3: Hoare triple {20#true} call #t~ret3 := main(); {20#true} is VALID [2018-11-23 13:03:10,830 INFO L273 TraceCheckUtils]: 4: Hoare triple {20#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {22#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= 0 main_~y~0))) (= main_~x~0 main_~n~0))} is VALID [2018-11-23 13:03:10,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= 0 main_~y~0))) (= main_~x~0 main_~n~0))} assume !(~x~0 % 4294967296 > 0); {23#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} is VALID [2018-11-23 13:03:10,838 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#(and (<= (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {24#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:10,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {25#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:10,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {25#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {21#false} is VALID [2018-11-23 13:03:10,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {21#false} assume !false; {21#false} is VALID [2018-11-23 13:03:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:10,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:03:10,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 13:03:10,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 13:03:10,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:10,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:03:10,893 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:10,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:03:10,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:03:10,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:03:10,904 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 6 states. [2018-11-23 13:03:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:11,998 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-23 13:03:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:03:11,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-11-23 13:03:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:12,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-23 13:03:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:03:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2018-11-23 13:03:12,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2018-11-23 13:03:12,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:12,252 INFO L225 Difference]: With dead ends: 36 [2018-11-23 13:03:12,253 INFO L226 Difference]: Without dead ends: 12 [2018-11-23 13:03:12,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:03:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-23 13:03:12,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-23 13:03:12,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:12,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-23 13:03:12,330 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:03:12,330 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:03:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:12,333 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:03:12,333 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:03:12,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:12,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:12,334 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-23 13:03:12,334 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-23 13:03:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:12,336 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-23 13:03:12,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:03:12,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:12,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:12,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:12,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:12,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:03:12,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-23 13:03:12,342 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-23 13:03:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:12,342 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-23 13:03:12,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:03:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-23 13:03:12,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:03:12,343 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:12,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:12,344 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:12,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:12,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1432376145, now seen corresponding path program 1 times [2018-11-23 13:03:12,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:12,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:12,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:12,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:12,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:12,711 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 13:03:13,044 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 22 [2018-11-23 13:03:13,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {124#true} call ULTIMATE.init(); {124#true} is VALID [2018-11-23 13:03:13,203 INFO L273 TraceCheckUtils]: 1: Hoare triple {124#true} assume true; {124#true} is VALID [2018-11-23 13:03:13,203 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {124#true} {124#true} #31#return; {124#true} is VALID [2018-11-23 13:03:13,204 INFO L256 TraceCheckUtils]: 3: Hoare triple {124#true} call #t~ret3 := main(); {124#true} is VALID [2018-11-23 13:03:13,205 INFO L273 TraceCheckUtils]: 4: Hoare triple {124#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {126#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:03:13,206 INFO L273 TraceCheckUtils]: 5: Hoare triple {126#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {127#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} is VALID [2018-11-23 13:03:13,208 INFO L273 TraceCheckUtils]: 6: Hoare triple {127#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} assume !(~x~0 % 4294967296 > 0); {128#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} is VALID [2018-11-23 13:03:13,210 INFO L256 TraceCheckUtils]: 7: Hoare triple {128#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {129#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:13,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {129#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {130#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:13,212 INFO L273 TraceCheckUtils]: 9: Hoare triple {130#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {125#false} is VALID [2018-11-23 13:03:13,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {125#false} assume !false; {125#false} is VALID [2018-11-23 13:03:13,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:13,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:13,215 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-23 13:03:13,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:13,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:13,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {124#true} call ULTIMATE.init(); {124#true} is VALID [2018-11-23 13:03:13,591 INFO L273 TraceCheckUtils]: 1: Hoare triple {124#true} assume true; {124#true} is VALID [2018-11-23 13:03:13,591 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {124#true} {124#true} #31#return; {124#true} is VALID [2018-11-23 13:03:13,591 INFO L256 TraceCheckUtils]: 3: Hoare triple {124#true} call #t~ret3 := main(); {124#true} is VALID [2018-11-23 13:03:13,592 INFO L273 TraceCheckUtils]: 4: Hoare triple {124#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {126#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:03:13,595 INFO L273 TraceCheckUtils]: 5: Hoare triple {126#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {149#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (< 0 (mod main_~n~0 4294967296)) (<= main_~y~0 1))} is VALID [2018-11-23 13:03:13,596 INFO L273 TraceCheckUtils]: 6: Hoare triple {149#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (< 0 (mod main_~n~0 4294967296)) (<= main_~y~0 1))} assume !(~x~0 % 4294967296 > 0); {153#(and (<= 1 main_~y~0) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (<= main_~y~0 1))} is VALID [2018-11-23 13:03:13,600 INFO L256 TraceCheckUtils]: 7: Hoare triple {153#(and (<= 1 main_~y~0) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (<= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {129#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:13,601 INFO L273 TraceCheckUtils]: 8: Hoare triple {129#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {130#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:13,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {130#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {125#false} is VALID [2018-11-23 13:03:13,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {125#false} assume !false; {125#false} is VALID [2018-11-23 13:03:13,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:13,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:13,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-11-23 13:03:13,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-11-23 13:03:13,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:13,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 13:03:13,653 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:13,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:03:13,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:03:13,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:03:13,655 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 9 states. [2018-11-23 13:03:14,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,172 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 13:03:14,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:03:14,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2018-11-23 13:03:14,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 13:03:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:03:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 21 transitions. [2018-11-23 13:03:14,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 21 transitions. [2018-11-23 13:03:14,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:14,211 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:03:14,211 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:03:14,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:03:14,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:03:14,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:03:14,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:14,239 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:14,239 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:14,240 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:14,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,243 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:03:14,243 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:03:14,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:14,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:14,244 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:14,244 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:03:14,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:14,246 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:03:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:03:14,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:14,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:14,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:14,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:03:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:03:14,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-23 13:03:14,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:14,248 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:03:14,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:03:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:03:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:03:14,250 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:03:14,250 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:03:14,250 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:03:14,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:03:14,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1004266255, now seen corresponding path program 2 times [2018-11-23 13:03:14,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:03:14,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:03:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:14,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:03:14,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:03:14,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:14,659 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-23 13:03:14,997 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2018-11-23 13:03:15,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-23 13:03:15,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-23 13:03:15,349 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #31#return; {254#true} is VALID [2018-11-23 13:03:15,349 INFO L256 TraceCheckUtils]: 3: Hoare triple {254#true} call #t~ret3 := main(); {254#true} is VALID [2018-11-23 13:03:15,350 INFO L273 TraceCheckUtils]: 4: Hoare triple {254#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {256#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:03:15,351 INFO L273 TraceCheckUtils]: 5: Hoare triple {256#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {257#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= 1 main_~y~0) (<= (+ main_~x~0 main_~y~0) main_~n~0))} is VALID [2018-11-23 13:03:15,354 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= 1 main_~y~0) (<= (+ main_~x~0 main_~y~0) main_~n~0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {258#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= (+ main_~x~0 main_~y~0) main_~n~0) (<= 2 main_~y~0))} is VALID [2018-11-23 13:03:15,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#(and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) (<= main_~n~0 (+ main_~x~0 main_~y~0)) (<= (+ main_~x~0 main_~y~0) main_~n~0) (<= 2 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {259#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} is VALID [2018-11-23 13:03:15,361 INFO L273 TraceCheckUtils]: 8: Hoare triple {259#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (or (< (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ main_~y~0 (* 4294967296 (div main_~n~0 4294967296)) 1)) (and (<= (+ (div main_~y~0 4294967296) (div main_~x~0 4294967296)) (div main_~n~0 4294967296)) (<= main_~n~0 (+ main_~x~0 main_~y~0)))))} assume !(~x~0 % 4294967296 > 0); {260#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} is VALID [2018-11-23 13:03:15,363 INFO L256 TraceCheckUtils]: 9: Hoare triple {260#(and (<= (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0) (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0)))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {261#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:15,363 INFO L273 TraceCheckUtils]: 10: Hoare triple {261#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {262#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:15,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {262#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {255#false} is VALID [2018-11-23 13:03:15,364 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-23 13:03:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:15,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:03:15,366 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-23 13:03:15,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:03:15,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:03:15,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:03:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:03:15,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:03:15,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {254#true} call ULTIMATE.init(); {254#true} is VALID [2018-11-23 13:03:15,768 INFO L273 TraceCheckUtils]: 1: Hoare triple {254#true} assume true; {254#true} is VALID [2018-11-23 13:03:15,769 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {254#true} {254#true} #31#return; {254#true} is VALID [2018-11-23 13:03:15,769 INFO L256 TraceCheckUtils]: 3: Hoare triple {254#true} call #t~ret3 := main(); {254#true} is VALID [2018-11-23 13:03:15,775 INFO L273 TraceCheckUtils]: 4: Hoare triple {254#true} ~n~0 := #t~nondet0;havoc #t~nondet0;~x~0 := ~n~0;~y~0 := 0; {256#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} is VALID [2018-11-23 13:03:15,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {256#(and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {281#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2018-11-23 13:03:15,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(and (= (+ main_~x~0 1) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {285#(and (= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= 2 main_~y~0))} is VALID [2018-11-23 13:03:15,781 INFO L273 TraceCheckUtils]: 7: Hoare triple {285#(and (= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= 2 main_~y~0))} assume !!(~x~0 % 4294967296 > 0);#t~post1 := ~x~0;~x~0 := #t~post1 - 1;havoc #t~post1;#t~post2 := ~y~0;~y~0 := 1 + #t~post2;havoc #t~post2; {289#(and (= (+ main_~x~0 3) main_~n~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2018-11-23 13:03:15,782 INFO L273 TraceCheckUtils]: 8: Hoare triple {289#(and (= (+ main_~x~0 3) main_~n~0) (<= main_~y~0 3) (<= 3 main_~y~0))} assume !(~x~0 % 4294967296 > 0); {293#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} is VALID [2018-11-23 13:03:15,785 INFO L256 TraceCheckUtils]: 9: Hoare triple {293#(and (<= main_~y~0 3) (<= 3 main_~y~0) (<= (mod (+ main_~n~0 4294967293) 4294967296) 0))} call __VERIFIER_assert((if ~y~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {261#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:03:15,786 INFO L273 TraceCheckUtils]: 10: Hoare triple {261#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {262#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:03:15,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {262#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {255#false} is VALID [2018-11-23 13:03:15,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {255#false} assume !false; {255#false} is VALID [2018-11-23 13:03:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:03:15,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:03:15,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-23 13:03:15,809 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 13:03:15,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:03:15,809 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:03:15,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:15,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:03:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:03:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:03:15,843 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-11-23 13:03:16,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,659 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:03:16,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:03:16,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 13:03:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:03:16,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:03:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-11-23 13:03:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:03:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2018-11-23 13:03:16,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 17 transitions. [2018-11-23 13:03:16,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:03:16,714 INFO L225 Difference]: With dead ends: 16 [2018-11-23 13:03:16,714 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:03:16,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:03:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:03:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:03:16,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:03:16,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:16,716 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:16,716 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:16,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,716 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:03:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:03:16,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:16,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:16,717 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:16,717 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:03:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:03:16,718 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:03:16,718 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:03:16,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:16,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:03:16,718 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:03:16,718 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:03:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:03:16,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:03:16,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-23 13:03:16,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:03:16,719 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:03:16,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:03:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:03:16,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:03:16,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:03:19,319 WARN L180 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 47 DAG size of output: 12 [2018-11-23 13:03:19,583 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:03:19,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:03:19,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:03:19,584 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:03:19,584 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:03:19,584 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:03:19,584 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 21) the Hoare annotation is: true [2018-11-23 13:03:19,584 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 21) no Hoare annotation was computed. [2018-11-23 13:03:19,585 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 15 19) the Hoare annotation is: (let ((.cse2 (+ main_~x~0 main_~y~0))) (let ((.cse0 (<= main_~n~0 .cse2)) (.cse1 (<= .cse2 main_~n~0))) (or (and (<= main_~n~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967295)) .cse0 .cse1 (<= 2 main_~y~0)) (and (<= 0 main_~y~0) (= main_~x~0 main_~n~0) (<= main_~y~0 0)) (and .cse0 (<= 1 main_~y~0) (< 0 (mod main_~n~0 4294967296)) .cse1 (<= main_~y~0 1))))) [2018-11-23 13:03:19,585 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 21) no Hoare annotation was computed. [2018-11-23 13:03:19,585 INFO L444 ceAbstractionStarter]: At program point L15-3(lines 15 19) the Hoare annotation is: (let ((.cse1 (+ (* 4294967296 (div main_~y~0 4294967296)) main_~n~0)) (.cse0 (+ (* 4294967296 (div main_~n~0 4294967296)) main_~y~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) [2018-11-23 13:03:19,585 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-23 13:03:19,585 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:03:19,585 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-23 13:03:19,586 INFO L448 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-23 13:03:19,586 INFO L448 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-23 13:03:19,586 INFO L448 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-23 13:03:19,587 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:03:19,588 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:03:19,588 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:03:19,588 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:03:19,599 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:03:19,599 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:03:19,599 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:03:19,599 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:03:19,600 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:03:19,600 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:03:19,600 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:03:19,600 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:03:19,600 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:03:19,600 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:03:19,601 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:03:19,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:03:19 BoogieIcfgContainer [2018-11-23 13:03:19,614 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:03:19,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:03:19,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:03:19,615 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:03:19,615 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:03:09" (3/4) ... [2018-11-23 13:03:19,619 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:03:19,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:03:19,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:03:19,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:03:19,629 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-23 13:03:19,630 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-23 13:03:19,630 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:03:19,675 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/count_up_down_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:03:19,675 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:03:19,677 INFO L168 Benchmark]: Toolchain (without parser) took 10979.14 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -359.0 MB). Peak memory consumption was 353.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:19,678 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:19,679 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:19,680 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:19,680 INFO L168 Benchmark]: Boogie Preprocessor took 31.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:19,681 INFO L168 Benchmark]: RCFGBuilder took 506.42 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:19,682 INFO L168 Benchmark]: TraceAbstraction took 10020.55 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 396.2 MB). Peak memory consumption was 396.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:03:19,682 INFO L168 Benchmark]: Witness Printer took 60.56 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:03:19,688 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 327.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 24.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.77 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 506.42 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 712.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -765.8 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10020.55 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 396.2 MB). Peak memory consumption was 396.2 MB. Max. memory is 7.1 GB. * Witness Printer took 60.56 ms. Allocated memory is still 2.2 GB. Free memory is still 1.8 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((n <= 4294967296 * (x / 4294967296) + 4294967295 && n <= x + y) && x + y <= n) && 2 <= y) || ((0 <= y && x == n) && y <= 0)) || ((((n <= x + y && 1 <= y) && 0 < n % 4294967296) && x + y <= n) && y <= 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 17 locations, 1 error locations. SAFE Result, 9.9s OverallTime, 3 OverallIterations, 3 TraceHistogramMax, 2.7s AutomataDifference, 0.0s DeadEndRemovalTime, 2.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 27 SDtfs, 17 SDslu, 134 SDs, 0 SdLazy, 104 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 21 NumberOfFragments, 92 HoareAnnotationTreeSize, 12 FomulaSimplifications, 22 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 248 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 53 ConstructedInterpolants, 0 QuantifiedInterpolants, 5005 SizeOfPredicates, 6 NumberOfNonLiveVariables, 72 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 1/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...