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/sum01_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:04:30,596 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:04:30,600 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:04:30,612 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:04:30,612 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:04:30,613 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:04:30,614 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:04:30,616 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:04:30,618 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:04:30,619 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:04:30,619 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:04:30,620 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:04:30,621 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:04:30,622 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:04:30,623 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:04:30,624 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:04:30,624 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:04:30,626 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:04:30,628 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:04:30,630 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:04:30,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:04:30,632 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:04:30,634 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:04:30,635 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:04:30,635 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:04:30,636 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:04:30,637 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:04:30,638 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:04:30,639 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:04:30,640 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:04:30,640 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:04:30,641 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:04:30,641 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:04:30,641 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:04:30,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:04:30,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:04:30,643 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:04:30,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:04:30,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:04:30,660 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:04:30,661 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:04:30,661 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:04:30,661 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:04:30,662 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:04:30,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:04:30,662 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:04:30,662 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:04:30,662 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:04:30,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:04:30,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:04:30,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:04:30,664 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:04:30,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:04:30,664 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:04:30,665 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:04:30,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:04:30,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:04:30,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:04:30,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:04:30,667 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:04:30,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:04:30,667 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:04:30,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:04:30,668 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:04:30,668 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:04:30,668 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:04:30,668 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:04:30,668 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:04:30,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:04:30,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:04:30,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:04:30,760 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:04:30,761 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:04:30,761 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_true-unreach-call_true-termination.i [2018-11-23 13:04:30,826 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e3ae122/e0e73c6b6e9c43efa26c9f7bb8533826/FLAG8d7168354 [2018-11-23 13:04:31,247 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:04:31,247 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_true-unreach-call_true-termination.i [2018-11-23 13:04:31,253 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e3ae122/e0e73c6b6e9c43efa26c9f7bb8533826/FLAG8d7168354 [2018-11-23 13:04:31,615 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e3ae122/e0e73c6b6e9c43efa26c9f7bb8533826 [2018-11-23 13:04:31,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:04:31,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:04:31,626 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:31,627 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:04:31,630 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:04:31,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:31" (1/1) ... [2018-11-23 13:04:31,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61785c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31, skipping insertion in model container [2018-11-23 13:04:31,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:04:31" (1/1) ... [2018-11-23 13:04:31,646 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:04:31,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:04:31,904 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:31,908 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:04:31,931 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:04:31,950 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:04:31,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31 WrapperNode [2018-11-23 13:04:31,951 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:04:31,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:31,952 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:04:31,952 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:04:31,962 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:04:31" (1/1) ... [2018-11-23 13:04:31,968 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:04:31" (1/1) ... [2018-11-23 13:04:31,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:04:31,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:04:31,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:04:31,976 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:04:31,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31" (1/1) ... [2018-11-23 13:04:31,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31" (1/1) ... [2018-11-23 13:04:31,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31" (1/1) ... [2018-11-23 13:04:31,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31" (1/1) ... [2018-11-23 13:04:31,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31" (1/1) ... [2018-11-23 13:04:32,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31" (1/1) ... [2018-11-23 13:04:32,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31" (1/1) ... [2018-11-23 13:04:32,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:04:32,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:04:32,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:04:32,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:04:32,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31" (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:04:32,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:04:32,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:04:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:04:32,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:04:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:04:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:04:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:04:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:04:32,595 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:04:32,595 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:04:32,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:32 BoogieIcfgContainer [2018-11-23 13:04:32,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:04:32,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:04:32,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:04:32,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:04:32,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:04:31" (1/3) ... [2018-11-23 13:04:32,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a83e2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:32, skipping insertion in model container [2018-11-23 13:04:32,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:04:31" (2/3) ... [2018-11-23 13:04:32,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a83e2cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:04:32, skipping insertion in model container [2018-11-23 13:04:32,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:32" (3/3) ... [2018-11-23 13:04:32,604 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_true-unreach-call_true-termination.i [2018-11-23 13:04:32,614 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:04:32,622 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:04:32,638 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:04:32,670 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:04:32,671 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:04:32,671 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:04:32,671 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:04:32,672 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:04:32,672 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:04:32,672 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:04:32,672 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:04:32,672 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:04:32,691 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:04:32,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:04:32,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:32,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:32,700 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:32,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:32,706 INFO L82 PathProgramCache]: Analyzing trace with hash 579653156, now seen corresponding path program 1 times [2018-11-23 13:04:32,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:32,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:32,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:32,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:32,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:32,844 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:04:32,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:04:32,849 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #36#return; {22#true} is VALID [2018-11-23 13:04:32,850 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 13:04:32,850 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {22#true} is VALID [2018-11-23 13:04:32,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {22#true} is VALID [2018-11-23 13:04:32,861 INFO L273 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:04:32,861 INFO L256 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2018-11-23 13:04:32,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:04:32,862 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:04:32,862 INFO L273 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:04:32,865 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:04:32,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:32,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:04:32,873 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:04:32,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:32,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:04:32,930 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-23 13:04:32,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:04:32,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:04:32,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:04:32,943 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:04:33,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:33,029 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 13:04:33,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:04:33,029 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:04:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:33,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:04:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:04:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:04:33,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 13:04:33,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:33,352 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:04:33,352 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:04:33,356 INFO L631 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-23 13:04:33,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:04:33,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:04:33,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:33,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:33,421 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:33,422 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:33,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:33,425 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:04:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:04:33,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:33,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:33,426 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:33,426 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:04:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:33,429 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-23 13:04:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:04:33,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:33,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:33,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:33,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-11-23 13:04:33,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-11-23 13:04:33,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:33,434 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-11-23 13:04:33,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:04:33,434 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-11-23 13:04:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:04:33,435 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:33,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:33,435 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:33,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:33,436 INFO L82 PathProgramCache]: Analyzing trace with hash 574112030, now seen corresponding path program 1 times [2018-11-23 13:04:33,436 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:33,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:33,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:33,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:33,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:33,613 INFO L256 TraceCheckUtils]: 0: Hoare triple {111#true} call ULTIMATE.init(); {111#true} is VALID [2018-11-23 13:04:33,613 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#true} assume true; {111#true} is VALID [2018-11-23 13:04:33,614 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} #36#return; {111#true} is VALID [2018-11-23 13:04:33,614 INFO L256 TraceCheckUtils]: 3: Hoare triple {111#true} call #t~ret2 := main(); {111#true} is VALID [2018-11-23 13:04:33,615 INFO L273 TraceCheckUtils]: 4: Hoare triple {111#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {113#(= main_~sn~0 0)} is VALID [2018-11-23 13:04:33,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {113#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {113#(= main_~sn~0 0)} is VALID [2018-11-23 13:04:33,617 INFO L273 TraceCheckUtils]: 6: Hoare triple {113#(= main_~sn~0 0)} assume !(~i~0 <= ~n~0); {113#(= main_~sn~0 0)} is VALID [2018-11-23 13:04:33,627 INFO L256 TraceCheckUtils]: 7: Hoare triple {113#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {114#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:04:33,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {114#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {115#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:04:33,629 INFO L273 TraceCheckUtils]: 9: Hoare triple {115#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {112#false} is VALID [2018-11-23 13:04:33,629 INFO L273 TraceCheckUtils]: 10: Hoare triple {112#false} assume !false; {112#false} is VALID [2018-11-23 13:04:33,630 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:04:33,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:04:33,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:04:33,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:04:33,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:33,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:04:33,671 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-23 13:04:33,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:04:33,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:04:33,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:04:33,672 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 5 states. [2018-11-23 13:04:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:33,927 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-23 13:04:33,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:04:33,928 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-11-23 13:04:33,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:33,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:04:33,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:04:33,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-11-23 13:04:33,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2018-11-23 13:04:33,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:33,973 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:04:33,973 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:04:33,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:04:33,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:04:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:04:33,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:33,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:33,988 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:33,989 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:33,990 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:04:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:33,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:33,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:33,991 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:33,991 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:04:33,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:33,994 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-23 13:04:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:33,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:33,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:33,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:33,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:04:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-23 13:04:33,997 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-23 13:04:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:33,997 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-23 13:04:33,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:04:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-23 13:04:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:04:33,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:33,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:33,998 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:33,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1164206820, now seen corresponding path program 1 times [2018-11-23 13:04:33,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:33,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:34,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:34,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:34,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:34,331 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-11-23 13:04:34,704 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-11-23 13:04:34,888 INFO L256 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2018-11-23 13:04:34,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {199#true} assume true; {199#true} is VALID [2018-11-23 13:04:34,889 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {199#true} {199#true} #36#return; {199#true} is VALID [2018-11-23 13:04:34,889 INFO L256 TraceCheckUtils]: 3: Hoare triple {199#true} call #t~ret2 := main(); {199#true} is VALID [2018-11-23 13:04:34,890 INFO L273 TraceCheckUtils]: 4: Hoare triple {199#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {201#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-23 13:04:34,891 INFO L273 TraceCheckUtils]: 5: Hoare triple {201#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {202#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:04:34,892 INFO L273 TraceCheckUtils]: 6: Hoare triple {202#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {203#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} is VALID [2018-11-23 13:04:34,893 INFO L273 TraceCheckUtils]: 7: Hoare triple {203#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {204#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-23 13:04:34,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {204#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {205#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} is VALID [2018-11-23 13:04:34,897 INFO L256 TraceCheckUtils]: 9: Hoare triple {205#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {206#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:34,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {206#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {207#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:04:34,899 INFO L273 TraceCheckUtils]: 11: Hoare triple {207#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {200#false} is VALID [2018-11-23 13:04:34,900 INFO L273 TraceCheckUtils]: 12: Hoare triple {200#false} assume !false; {200#false} is VALID [2018-11-23 13:04:34,902 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:04:34,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:34,903 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:04:34,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:34,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:35,412 INFO L256 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2018-11-23 13:04:35,412 INFO L273 TraceCheckUtils]: 1: Hoare triple {199#true} assume true; {199#true} is VALID [2018-11-23 13:04:35,413 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {199#true} {199#true} #36#return; {199#true} is VALID [2018-11-23 13:04:35,413 INFO L256 TraceCheckUtils]: 3: Hoare triple {199#true} call #t~ret2 := main(); {199#true} is VALID [2018-11-23 13:04:35,432 INFO L273 TraceCheckUtils]: 4: Hoare triple {199#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {201#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-23 13:04:35,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {201#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {226#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-23 13:04:35,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {226#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {230#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-23 13:04:35,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {230#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {234#(and (<= main_~i~0 2) (<= 1 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-23 13:04:35,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {234#(and (<= main_~i~0 2) (<= 1 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !(~i~0 <= ~n~0); {238#(and (<= 1 main_~n~0) (<= main_~n~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-23 13:04:35,473 INFO L256 TraceCheckUtils]: 9: Hoare triple {238#(and (<= 1 main_~n~0) (<= main_~n~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {206#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:35,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {206#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {207#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:04:35,476 INFO L273 TraceCheckUtils]: 11: Hoare triple {207#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {200#false} is VALID [2018-11-23 13:04:35,476 INFO L273 TraceCheckUtils]: 12: Hoare triple {200#false} assume !false; {200#false} is VALID [2018-11-23 13:04:35,478 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:04:35,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:35,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-23 13:04:35,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 13:04:35,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:35,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 13:04:35,585 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:04:35,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:04:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:04:35,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:04:35,586 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-11-23 13:04:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:36,144 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 13:04:36,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:04:36,144 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-11-23 13:04:36,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-11-23 13:04:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:04:36,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 25 transitions. [2018-11-23 13:04:36,149 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 25 transitions. [2018-11-23 13:04:36,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:36,189 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:04:36,189 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 13:04:36,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:04:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 13:04:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 13:04:36,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:36,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:36,228 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:36,228 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:36,231 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:36,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:36,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:36,232 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:36,232 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 13:04:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:36,234 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-11-23 13:04:36,234 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:36,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:36,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:36,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:36,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:04:36,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-23 13:04:36,237 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2018-11-23 13:04:36,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:36,237 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-23 13:04:36,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:04:36,237 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-23 13:04:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:04:36,238 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:04:36,238 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:04:36,239 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:04:36,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:04:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2033115496, now seen corresponding path program 2 times [2018-11-23 13:04:36,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:04:36,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:04:36,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:36,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:04:36,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:04:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:36,661 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 13:04:36,662 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 13:04:36,662 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #36#return; {357#true} is VALID [2018-11-23 13:04:36,663 INFO L256 TraceCheckUtils]: 3: Hoare triple {357#true} call #t~ret2 := main(); {357#true} is VALID [2018-11-23 13:04:36,666 INFO L273 TraceCheckUtils]: 4: Hoare triple {357#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {359#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-23 13:04:36,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {359#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {360#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:04:36,667 INFO L273 TraceCheckUtils]: 6: Hoare triple {360#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {361#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:04:36,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {361#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {360#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:04:36,670 INFO L273 TraceCheckUtils]: 8: Hoare triple {360#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {361#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:04:36,671 INFO L273 TraceCheckUtils]: 9: Hoare triple {361#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {360#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:04:36,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {360#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {362#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} is VALID [2018-11-23 13:04:36,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {362#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {363#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-23 13:04:36,675 INFO L273 TraceCheckUtils]: 12: Hoare triple {363#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {364#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} is VALID [2018-11-23 13:04:36,682 INFO L256 TraceCheckUtils]: 13: Hoare triple {364#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {365#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:36,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {365#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {366#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:04:36,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {366#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {358#false} is VALID [2018-11-23 13:04:36,685 INFO L273 TraceCheckUtils]: 16: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 13:04:36,687 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:04:36,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:04:36,687 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:04:36,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:04:36,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:04:36,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:04:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:04:36,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:04:37,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2018-11-23 13:04:37,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2018-11-23 13:04:37,259 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #36#return; {357#true} is VALID [2018-11-23 13:04:37,259 INFO L256 TraceCheckUtils]: 3: Hoare triple {357#true} call #t~ret2 := main(); {357#true} is VALID [2018-11-23 13:04:37,260 INFO L273 TraceCheckUtils]: 4: Hoare triple {357#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {359#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-23 13:04:37,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {359#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {385#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-23 13:04:37,261 INFO L273 TraceCheckUtils]: 6: Hoare triple {385#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {389#(and (= main_~i~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-23 13:04:37,262 INFO L273 TraceCheckUtils]: 7: Hoare triple {389#(and (= main_~i~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {393#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-23 13:04:37,264 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {397#(and (= main_~i~0 2) (<= main_~sn~0 4) (<= 4 main_~sn~0))} is VALID [2018-11-23 13:04:37,265 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#(and (= main_~i~0 2) (<= main_~sn~0 4) (<= 4 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {401#(and (= main_~i~0 3) (<= main_~sn~0 4) (<= 4 main_~sn~0))} is VALID [2018-11-23 13:04:37,266 INFO L273 TraceCheckUtils]: 10: Hoare triple {401#(and (= main_~i~0 3) (<= main_~sn~0 4) (<= 4 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {405#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 main_~n~0))} is VALID [2018-11-23 13:04:37,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {405#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {409#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2018-11-23 13:04:37,268 INFO L273 TraceCheckUtils]: 12: Hoare triple {409#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {413#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~n~0 3))} is VALID [2018-11-23 13:04:37,270 INFO L256 TraceCheckUtils]: 13: Hoare triple {413#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~n~0 3))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {365#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:04:37,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {365#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {366#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:04:37,272 INFO L273 TraceCheckUtils]: 15: Hoare triple {366#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {358#false} is VALID [2018-11-23 13:04:37,272 INFO L273 TraceCheckUtils]: 16: Hoare triple {358#false} assume !false; {358#false} is VALID [2018-11-23 13:04:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:04:37,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:04:37,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 18 [2018-11-23 13:04:37,299 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-11-23 13:04:37,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:04:37,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 13:04:37,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:37,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 13:04:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:04:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:04:37,329 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-11-23 13:04:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,181 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 13:04:38,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:04:38,182 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-11-23 13:04:38,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:04:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:04:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-23 13:04:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 13:04:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2018-11-23 13:04:38,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 22 transitions. [2018-11-23 13:04:38,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:04:38,223 INFO L225 Difference]: With dead ends: 21 [2018-11-23 13:04:38,223 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:04:38,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2018-11-23 13:04:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:04:38,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:04:38,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:04:38,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,225 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,225 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,226 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:38,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,226 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,226 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:04:38,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:04:38,227 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:04:38,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:38,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:04:38,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:04:38,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:04:38,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:04:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:04:38,228 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-11-23 13:04:38,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:04:38,228 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:04:38,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 13:04:38,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:04:38,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:04:38,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:04:38,390 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:04:38,391 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:38,391 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:04:38,391 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:04:38,391 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:04:38,392 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:04:38,392 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2018-11-23 13:04:38,392 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 18) no Hoare annotation was computed. [2018-11-23 13:04:38,393 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-23 13:04:38,393 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 18) no Hoare annotation was computed. [2018-11-23 13:04:38,393 INFO L448 ceAbstractionStarter]: For program point L14-2(lines 14 16) no Hoare annotation was computed. [2018-11-23 13:04:38,393 INFO L444 ceAbstractionStarter]: At program point L14-3(lines 14 16) the Hoare annotation is: (or (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))) (and (= main_~i~0 1) (= main_~sn~0 0))) [2018-11-23 13:04:38,394 INFO L444 ceAbstractionStarter]: At program point L14-4(lines 14 16) the Hoare annotation is: (or (let ((.cse0 (* 2 main_~n~0))) (and (<= .cse0 main_~sn~0) (< main_~sn~0 (+ .cse0 1)))) (= main_~sn~0 0)) [2018-11-23 13:04:38,394 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-23 13:04:38,394 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 13:04:38,394 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 13:04:38,394 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-23 13:04:38,394 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-23 13:04:38,395 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-23 13:04:38,396 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:38,396 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:04:38,396 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:38,396 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:04:38,397 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:38,397 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:04:38,397 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:04:38,397 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:38,397 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:04:38,397 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:04:38,397 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:38,400 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2018-11-23 13:04:38,400 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:04:38,400 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:04:38,400 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-23 13:04:38,400 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:04:38,400 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:04:38,400 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2018-11-23 13:04:38,400 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:04:38,401 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:04:38,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:04:38 BoogieIcfgContainer [2018-11-23 13:04:38,411 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:04:38,412 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:04:38,412 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:04:38,412 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:04:38,413 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:04:32" (3/4) ... [2018-11-23 13:04:38,416 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:04:38,421 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:04:38,422 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:04:38,422 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:04:38,426 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-23 13:04:38,426 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:04:38,426 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:04:38,468 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/sum01_true-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:04:38,468 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:04:38,470 INFO L168 Benchmark]: Toolchain (without parser) took 6845.33 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -344.5 MB). Peak memory consumption was 398.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:38,471 INFO L168 Benchmark]: CDTParser took 0.20 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:04:38,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.79 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:04:38,472 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.69 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:04:38,473 INFO L168 Benchmark]: Boogie Preprocessor took 33.81 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:04:38,473 INFO L168 Benchmark]: RCFGBuilder took 586.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:38,474 INFO L168 Benchmark]: TraceAbstraction took 5814.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 413.2 MB). Peak memory consumption was 413.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:38,475 INFO L168 Benchmark]: Witness Printer took 56.63 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:04:38,480 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.20 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 324.79 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 23.69 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 33.81 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 586.31 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.8 MB). Peak memory consumption was 26.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5814.46 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 413.2 MB). Peak memory consumption was 413.2 MB. Max. memory is 7.1 GB. * Witness Printer took 56.63 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.8 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: 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: 14]: Loop Invariant Derived loop invariant: ((sn + 2 <= 2 * i && 2 * i <= sn + 2) && sn < 2 * n + 1) || (i == 1 && sn == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 5.7s OverallTime, 4 OverallIterations, 3 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 47 SDtfs, 10 SDslu, 142 SDs, 0 SdLazy, 172 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 21 NumberOfFragments, 52 HoareAnnotationTreeSize, 12 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 100 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 6056 SizeOfPredicates, 6 NumberOfNonLiveVariables, 80 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...