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/loop-acceleration/phases_true-unreach-call2_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:08:18,667 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:08:18,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:08:18,684 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:08:18,684 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:08:18,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:08:18,687 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:08:18,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:08:18,690 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:08:18,691 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:08:18,692 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:08:18,692 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:08:18,693 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:08:18,694 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:08:18,695 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:08:18,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:08:18,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:08:18,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:08:18,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:08:18,702 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:08:18,703 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:08:18,704 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:08:18,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:08:18,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:08:18,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:08:18,710 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:08:18,711 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:08:18,712 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:08:18,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:08:18,714 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:08:18,715 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:08:18,720 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:08:18,721 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:08:18,721 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:08:18,722 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:08:18,723 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:08:18,723 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:08:18,753 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:08:18,753 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:08:18,754 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:08:18,754 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:08:18,756 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:08:18,756 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:08:18,756 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:08:18,757 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:08:18,757 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:08:18,757 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:08:18,757 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:08:18,757 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:08:18,757 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:08:18,759 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:08:18,759 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:08:18,759 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:08:18,759 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:08:18,759 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:08:18,759 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:08:18,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:08:18,760 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:08:18,760 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:08:18,760 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:08:18,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:08:18,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:08:18,762 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:08:18,762 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:08:18,762 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:08:18,763 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:08:18,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:08:18,763 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:08:18,826 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:08:18,839 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:08:18,843 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:08:18,845 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:08:18,845 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:08:18,846 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i [2018-11-23 13:08:18,905 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2737b9770/1b38649c95ed4f70abeef35c4986b154/FLAG129834a70 [2018-11-23 13:08:19,297 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:08:19,298 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_true-unreach-call2_false-termination.i [2018-11-23 13:08:19,303 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2737b9770/1b38649c95ed4f70abeef35c4986b154/FLAG129834a70 [2018-11-23 13:08:19,694 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2737b9770/1b38649c95ed4f70abeef35c4986b154 [2018-11-23 13:08:19,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:08:19,705 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:08:19,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:19,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:08:19,709 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:08:19,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:19" (1/1) ... [2018-11-23 13:08:19,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e7c9a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:19, skipping insertion in model container [2018-11-23 13:08:19,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:08:19" (1/1) ... [2018-11-23 13:08:19,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:08:19,748 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:08:19,997 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:20,003 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:08:20,025 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:08:20,042 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:08:20,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20 WrapperNode [2018-11-23 13:08:20,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:08:20,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:20,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:08:20,044 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:08:20,052 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:08:20" (1/1) ... [2018-11-23 13:08:20,057 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:08:20" (1/1) ... [2018-11-23 13:08:20,063 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:08:20,064 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:08:20,064 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:08:20,064 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:08:20,072 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,073 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (1/1) ... [2018-11-23 13:08:20,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:08:20,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:08:20,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:08:20,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:08:20,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (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:08:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:08:20,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:08:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:08:20,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:08:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:08:20,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:08:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:08:20,215 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:08:20,687 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:08:20,687 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:08:20,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:20 BoogieIcfgContainer [2018-11-23 13:08:20,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:08:20,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:08:20,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:08:20,693 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:08:20,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:08:19" (1/3) ... [2018-11-23 13:08:20,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb87477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:20, skipping insertion in model container [2018-11-23 13:08:20,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:08:20" (2/3) ... [2018-11-23 13:08:20,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bb87477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:08:20, skipping insertion in model container [2018-11-23 13:08:20,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:20" (3/3) ... [2018-11-23 13:08:20,697 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_true-unreach-call2_false-termination.i [2018-11-23 13:08:20,705 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:08:20,712 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:08:20,727 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:08:20,758 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:08:20,759 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:08:20,759 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:08:20,759 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:08:20,760 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:08:20,760 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:08:20,760 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:08:20,760 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:08:20,760 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:08:20,778 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:08:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:08:20,785 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:20,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:20,788 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:20,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:20,793 INFO L82 PathProgramCache]: Analyzing trace with hash -133618162, now seen corresponding path program 1 times [2018-11-23 13:08:20,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:20,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:20,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:20,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:08:20,936 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:08:20,936 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #41#return; {22#true} is VALID [2018-11-23 13:08:20,937 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret3 := main(); {22#true} is VALID [2018-11-23 13:08:20,937 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} ~x~0 := 1;~y~0 := #t~nondet1;havoc #t~nondet1; {22#true} is VALID [2018-11-23 13:08:20,937 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !!(~y~0 % 4294967296 > 0); {22#true} is VALID [2018-11-23 13:08:20,938 INFO L273 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:08:20,939 INFO L256 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {23#false} is VALID [2018-11-23 13:08:20,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:08:20,939 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:08:20,940 INFO L273 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:08:20,943 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:08:20,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:20,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:08:20,951 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:08:20,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:20,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:08:21,012 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:08:21,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:08:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:08:21,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:08:21,023 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:08:21,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:21,119 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 13:08:21,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:08:21,120 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-23 13:08:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:21,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:08:21,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 13:08:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:08:21,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 13:08:21,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-23 13:08:21,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:21,556 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:08:21,556 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:08:21,560 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:08:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:08:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:08:21,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:21,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:21,631 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:21,631 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:21,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:21,634 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:08:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:08:21,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:21,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:21,635 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:21,635 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:08:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:21,638 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:08:21,638 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:08:21,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:21,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:21,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:21,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:21,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:08:21,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 13:08:21,643 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-11-23 13:08:21,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:21,644 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 13:08:21,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:08:21,644 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:08:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-23 13:08:21,646 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:21,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:21,646 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:21,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash -142853372, now seen corresponding path program 1 times [2018-11-23 13:08:21,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:21,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:21,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:21,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:22,009 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2018-11-23 13:08:22,402 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2018-11-23 13:08:22,462 INFO L256 TraceCheckUtils]: 0: Hoare triple {111#true} call ULTIMATE.init(); {111#true} is VALID [2018-11-23 13:08:22,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#true} assume true; {111#true} is VALID [2018-11-23 13:08:22,463 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} #41#return; {111#true} is VALID [2018-11-23 13:08:22,463 INFO L256 TraceCheckUtils]: 3: Hoare triple {111#true} call #t~ret3 := main(); {111#true} is VALID [2018-11-23 13:08:22,464 INFO L273 TraceCheckUtils]: 4: Hoare triple {111#true} ~x~0 := 1;~y~0 := #t~nondet1;havoc #t~nondet1; {113#(and (or (<= main_~x~0 1) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:22,465 INFO L273 TraceCheckUtils]: 5: Hoare triple {113#(and (or (<= main_~x~0 1) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0); {114#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:22,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {114#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (< 0 (+ (div main_~x~0 4294967296) 1)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {115#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0)) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2018-11-23 13:08:22,484 INFO L256 TraceCheckUtils]: 7: Hoare triple {115#(and (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0)) (< 0 (+ (div main_~x~0 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {116#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:08:22,500 INFO L273 TraceCheckUtils]: 8: Hoare triple {116#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {117#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:08:22,509 INFO L273 TraceCheckUtils]: 9: Hoare triple {117#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {112#false} is VALID [2018-11-23 13:08:22,509 INFO L273 TraceCheckUtils]: 10: Hoare triple {112#false} assume !false; {112#false} is VALID [2018-11-23 13:08:22,513 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:08:22,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:22,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:08:22,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 13:08:22,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:22,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:08:22,581 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:08:22,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:08:22,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:08:22,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:08:22,582 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-11-23 13:08:30,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:30,975 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 13:08:30,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:08:30,975 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-11-23 13:08:30,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:08:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 13:08:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:08:30,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-23 13:08:30,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2018-11-23 13:08:31,016 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:08:31,018 INFO L225 Difference]: With dead ends: 20 [2018-11-23 13:08:31,018 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 13:08:31,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:08:31,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 13:08:31,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 13:08:31,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:31,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 14 states. [2018-11-23 13:08:31,035 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 14 states. [2018-11-23 13:08:31,035 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 14 states. [2018-11-23 13:08:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:31,037 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 13:08:31,037 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:08:31,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:31,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:31,038 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 15 states. [2018-11-23 13:08:31,038 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 15 states. [2018-11-23 13:08:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:31,040 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 13:08:31,040 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-11-23 13:08:31,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:31,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:31,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:31,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:08:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:08:31,043 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2018-11-23 13:08:31,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:31,044 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:08:31,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:08:31,044 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:08:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:08:31,045 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:08:31,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:08:31,045 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:08:31,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:08:31,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1232195137, now seen corresponding path program 1 times [2018-11-23 13:08:31,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:08:31,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:08:31,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:31,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:31,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:08:31,054 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 13:08:31,055 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 13:08:31,055 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 13:08:31,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:08:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:08:31,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:08:31,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2018-11-23 13:08:31,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2018-11-23 13:08:31,203 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #41#return; {204#true} is VALID [2018-11-23 13:08:31,203 INFO L256 TraceCheckUtils]: 3: Hoare triple {204#true} call #t~ret3 := main(); {204#true} is VALID [2018-11-23 13:08:31,204 INFO L273 TraceCheckUtils]: 4: Hoare triple {204#true} ~x~0 := 1;~y~0 := #t~nondet1;havoc #t~nondet1; {221#(= main_~x~0 1)} is VALID [2018-11-23 13:08:31,205 INFO L273 TraceCheckUtils]: 5: Hoare triple {221#(= main_~x~0 1)} assume !!(~y~0 % 4294967296 > 0); {221#(= main_~x~0 1)} is VALID [2018-11-23 13:08:31,205 INFO L273 TraceCheckUtils]: 6: Hoare triple {221#(= main_~x~0 1)} assume !!(~x~0 % 4294967296 < ~y~0 % 4294967296); {228#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2018-11-23 13:08:31,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {228#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume ~x~0 % 4294967296 < (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % (~x~0 % 4294967296) then (if ~x~0 % 4294967296 < 0 then ~y~0 % 4294967296 / (~x~0 % 4294967296) - 1 else 1 + ~y~0 % 4294967296 / (~x~0 % 4294967296)) else ~y~0 % 4294967296 / (~x~0 % 4294967296)) % 4294967296;~x~0 := ~x~0 * ~x~0; {228#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2018-11-23 13:08:31,212 INFO L273 TraceCheckUtils]: 8: Hoare triple {228#(and (= main_~x~0 1) (< (mod main_~x~0 4294967296) (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < ~y~0 % 4294967296); {205#false} is VALID [2018-11-23 13:08:31,212 INFO L256 TraceCheckUtils]: 9: Hoare triple {205#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~y~0 % 4294967296 then 1 else 0)); {205#false} is VALID [2018-11-23 13:08:31,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2018-11-23 13:08:31,212 INFO L273 TraceCheckUtils]: 11: Hoare triple {205#false} assume 0 == ~cond; {205#false} is VALID [2018-11-23 13:08:31,213 INFO L273 TraceCheckUtils]: 12: Hoare triple {205#false} assume !false; {205#false} is VALID [2018-11-23 13:08:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:08:31,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:08:31,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:08:31,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 13:08:31,235 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:08:31,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:08:31,259 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:08:31,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:08:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:08:31,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:08:31,260 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 4 states. [2018-11-23 13:08:33,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:33,311 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-11-23 13:08:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:08:33,311 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-11-23 13:08:33,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:08:33,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:08:33,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 13:08:33,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:08:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2018-11-23 13:08:33,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 19 transitions. [2018-11-23 13:08:33,340 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:08:33,340 INFO L225 Difference]: With dead ends: 16 [2018-11-23 13:08:33,340 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:08:33,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:08:33,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:08:33,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:08:33,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:08:33,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:33,343 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:33,343 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:33,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:33,344 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:08:33,344 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:08:33,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:33,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:33,344 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:33,345 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-23 13:08:33,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:08:33,345 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 13:08:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:08:33,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:33,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:08:33,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:08:33,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:08:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:08:33,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:08:33,347 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2018-11-23 13:08:33,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:08:33,348 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:08:33,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:08:33,348 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:08:33,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:08:33,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:08:33,459 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-23 13:08:33,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:08:33,459 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:08:33,460 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:08:33,460 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:08:33,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:08:33,460 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 22) the Hoare annotation is: true [2018-11-23 13:08:33,460 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 22) no Hoare annotation was computed. [2018-11-23 13:08:33,460 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 19) no Hoare annotation was computed. [2018-11-23 13:08:33,460 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-23 13:08:33,461 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 14 20) the Hoare annotation is: (and (= main_~x~0 1) (<= (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0) (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))))) [2018-11-23 13:08:33,461 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 22) no Hoare annotation was computed. [2018-11-23 13:08:33,461 INFO L444 ceAbstractionStarter]: At program point L14-2(lines 14 20) the Hoare annotation is: (let ((.cse2 (div main_~x~0 4294967296))) (let ((.cse1 (+ main_~y~0 (* 4294967296 .cse2))) (.cse0 (+ (* 4294967296 (div main_~y~0 4294967296)) main_~x~0))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (< 0 (+ .cse2 1))))) [2018-11-23 13:08:33,461 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-23 13:08:33,461 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-23 13:08:33,462 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-23 13:08:33,462 INFO L448 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-23 13:08:33,462 INFO L448 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-23 13:08:33,462 INFO L448 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-23 13:08:33,463 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:08:33,463 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:08:33,464 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:08:33,464 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:08:33,464 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:08:33,464 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:08:33,464 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-23 13:08:33,464 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:08:33,465 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:08:33,465 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:08:33,465 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:08:33,469 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:08:33,469 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:08:33,469 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-23 13:08:33,469 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-23 13:08:33,469 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:08:33,469 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:08:33,469 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:08:33,470 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:08:33,470 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:08:33,470 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:08:33,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:08:33 BoogieIcfgContainer [2018-11-23 13:08:33,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:08:33,479 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:08:33,479 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:08:33,480 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:08:33,480 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:08:20" (3/4) ... [2018-11-23 13:08:33,483 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:08:33,489 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:08:33,489 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:08:33,489 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-23 13:08:33,493 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 13:08:33,493 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-23 13:08:33,493 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:08:33,537 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loop-acceleration/phases_true-unreach-call2_false-termination.i-witness.graphml [2018-11-23 13:08:33,537 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:08:33,538 INFO L168 Benchmark]: Toolchain (without parser) took 13834.59 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -617.5 MB). Peak memory consumption was 112.9 MB. Max. memory is 7.1 GB. [2018-11-23 13:08:33,539 INFO L168 Benchmark]: CDTParser took 0.23 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:08:33,540 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.11 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:08:33,540 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.18 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:08:33,541 INFO L168 Benchmark]: Boogie Preprocessor took 21.38 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:08:33,542 INFO L168 Benchmark]: RCFGBuilder took 602.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:08:33,543 INFO L168 Benchmark]: TraceAbstraction took 12789.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 153.2 MB). Peak memory consumption was 153.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:08:33,543 INFO L168 Benchmark]: Witness Printer took 57.79 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:08:33,547 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.23 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 337.11 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 20.18 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 21.38 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 602.49 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -781.3 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12789.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 153.2 MB). Peak memory consumption was 153.2 MB. Max. memory is 7.1 GB. * Witness Printer took 57.79 ms. Allocated memory is still 2.3 GB. Free memory is still 2.0 GB. There was no memory consumed. 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: x == 1 && 4294967296 * (y / 4294967296) + x <= y + 4294967296 * (x / 4294967296) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 12.7s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 11.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 35 SDtfs, 7 SDslu, 29 SDs, 0 SdLazy, 32 SolverSat, 2 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 62 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 19 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 29 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...