/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:29:23,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:29:23,766 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:29:23,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:29:23,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:29:23,797 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:29:23,800 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:29:23,814 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:29:23,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:29:23,822 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:29:23,826 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:29:23,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:29:23,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:29:23,833 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:29:23,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:29:23,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:29:23,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:29:23,843 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:29:23,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:29:23,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:29:23,861 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:29:23,867 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:29:23,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:29:23,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:29:23,874 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:29:23,874 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:29:23,874 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:29:23,878 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:29:23,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:29:23,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:29:23,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:29:23,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:29:23,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:29:23,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:29:23,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:29:23,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:29:23,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:29:23,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:29:23,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:29:23,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:29:23,892 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:29:23,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:29:23,926 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:29:23,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:29:23,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:29:23,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:29:23,937 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:29:23,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:29:23,937 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:29:23,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:29:23,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:29:23,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:29:23,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:29:23,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:29:23,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:29:23,941 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:29:23,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:29:23,941 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:29:23,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:29:23,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:29:23,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:29:23,942 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:29:23,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:29:23,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:29:23,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:29:23,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:29:23,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:29:23,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:29:23,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:29:23,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:29:23,945 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:29:23,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:29:24,305 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:29:24,322 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:29:24,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:29:24,329 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:29:24,330 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:29:24,331 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2020-07-10 15:29:24,434 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996a2f3c1/1fc65f6f691e482d984114c24fc51808/FLAG5f366c06a [2020-07-10 15:29:25,048 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:29:25,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2020-07-10 15:29:25,057 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996a2f3c1/1fc65f6f691e482d984114c24fc51808/FLAG5f366c06a [2020-07-10 15:29:25,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996a2f3c1/1fc65f6f691e482d984114c24fc51808 [2020-07-10 15:29:25,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:29:25,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:29:25,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:25,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:29:25,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:29:25,430 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:25" (1/1) ... [2020-07-10 15:29:25,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3be094ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25, skipping insertion in model container [2020-07-10 15:29:25,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:25" (1/1) ... [2020-07-10 15:29:25,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:29:25,468 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:29:25,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:25,709 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:29:25,727 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:29:25,746 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:29:25,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25 WrapperNode [2020-07-10 15:29:25,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:29:25,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:29:25,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:29:25,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:29:25,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25" (1/1) ... [2020-07-10 15:29:25,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25" (1/1) ... [2020-07-10 15:29:25,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25" (1/1) ... [2020-07-10 15:29:25,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25" (1/1) ... [2020-07-10 15:29:25,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25" (1/1) ... [2020-07-10 15:29:25,782 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25" (1/1) ... [2020-07-10 15:29:25,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25" (1/1) ... [2020-07-10 15:29:25,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:29:25,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:29:25,887 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:29:25,887 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:29:25,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25" (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 [2020-07-10 15:29:25,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:29:25,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:29:25,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:29:25,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:29:25,976 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:29:25,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:29:25,977 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:29:25,977 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:29:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:29:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:29:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:29:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:29:25,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:29:26,318 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:29:26,319 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 15:29:26,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:26 BoogieIcfgContainer [2020-07-10 15:29:26,327 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:29:26,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:29:26,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:29:26,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:29:26,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:25" (1/3) ... [2020-07-10 15:29:26,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d006147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:26, skipping insertion in model container [2020-07-10 15:29:26,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:25" (2/3) ... [2020-07-10 15:29:26,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d006147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:26, skipping insertion in model container [2020-07-10 15:29:26,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:26" (3/3) ... [2020-07-10 15:29:26,341 INFO L109 eAbstractionObserver]: Analyzing ICFG half.i [2020-07-10 15:29:26,359 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:29:26,371 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:29:26,409 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:29:26,493 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:29:26,494 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:29:26,494 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:29:26,494 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:29:26,494 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:29:26,494 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:29:26,495 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:29:26,495 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:29:26,527 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 15:29:26,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:29:26,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:26,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:26,544 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:26,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:26,560 INFO L82 PathProgramCache]: Analyzing trace with hash -961315073, now seen corresponding path program 1 times [2020-07-10 15:29:26,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:26,579 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901790775] [2020-07-10 15:29:26,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:26,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:26,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 15:29:26,782 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2020-07-10 15:29:26,784 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-10 15:29:26,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 15:29:26,785 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2020-07-10 15:29:26,785 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-10 15:29:26,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {24#true} is VALID [2020-07-10 15:29:26,786 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {24#true} is VALID [2020-07-10 15:29:26,794 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2020-07-10 15:29:26,795 INFO L263 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {25#false} is VALID [2020-07-10 15:29:26,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2020-07-10 15:29:26,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2020-07-10 15:29:26,796 INFO L280 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 15:29:26,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:26,799 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901790775] [2020-07-10 15:29:26,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:26,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 15:29:26,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180315256] [2020-07-10 15:29:26,810 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-10 15:29:26,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:26,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 15:29:26,848 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:26,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 15:29:26,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:26,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 15:29:26,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:29:26,864 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2020-07-10 15:29:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:26,962 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-07-10 15:29:26,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 15:29:26,963 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-10 15:29:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:29:26,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-10 15:29:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 15:29:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2020-07-10 15:29:26,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 38 transitions. [2020-07-10 15:29:27,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:27,143 INFO L225 Difference]: With dead ends: 33 [2020-07-10 15:29:27,144 INFO L226 Difference]: Without dead ends: 14 [2020-07-10 15:29:27,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 15:29:27,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-10 15:29:27,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-10 15:29:27,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:27,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:27,198 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:27,198 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:27,204 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-10 15:29:27,204 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-10 15:29:27,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:27,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:27,206 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:27,206 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-10 15:29:27,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:27,210 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-10 15:29:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-10 15:29:27,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:27,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:27,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:27,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:27,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-10 15:29:27,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-10 15:29:27,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2020-07-10 15:29:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:27,218 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-10 15:29:27,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 15:29:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-10 15:29:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-10 15:29:27,219 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:27,219 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:27,220 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:27,220 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:27,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:27,221 INFO L82 PathProgramCache]: Analyzing trace with hash -971473804, now seen corresponding path program 1 times [2020-07-10 15:29:27,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:27,222 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214999734] [2020-07-10 15:29:27,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:27,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-10 15:29:27,534 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {121#true} {121#true} #50#return; {121#true} is VALID [2020-07-10 15:29:27,535 INFO L263 TraceCheckUtils]: 0: Hoare triple {121#true} call ULTIMATE.init(); {121#true} is VALID [2020-07-10 15:29:27,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {121#true} assume true; {121#true} is VALID [2020-07-10 15:29:27,536 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {121#true} {121#true} #50#return; {121#true} is VALID [2020-07-10 15:29:27,536 INFO L263 TraceCheckUtils]: 3: Hoare triple {121#true} call #t~ret3 := main(); {121#true} is VALID [2020-07-10 15:29:27,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {121#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {125#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 15:29:27,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {125#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {126#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:27,542 INFO L280 TraceCheckUtils]: 6: Hoare triple {126#(and (<= main_~n~0 0) (<= main_~i~0 (* 2 main_~n~0)))} assume !(~i~0 < 2 * ~k~0); {127#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} is VALID [2020-07-10 15:29:27,545 INFO L263 TraceCheckUtils]: 7: Hoare triple {127#(and (<= main_~k~0 main_~n~0) (or (<= main_~n~0 0) (<= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {128#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:27,547 INFO L280 TraceCheckUtils]: 8: Hoare triple {128#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {129#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:27,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {129#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {122#false} is VALID [2020-07-10 15:29:27,549 INFO L280 TraceCheckUtils]: 10: Hoare triple {122#false} assume !false; {122#false} is VALID [2020-07-10 15:29:27,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:27,551 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214999734] [2020-07-10 15:29:27,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:27,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:29:27,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6851375] [2020-07-10 15:29:27,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-10 15:29:27,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:27,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:29:27,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:27,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:29:27,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:27,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:29:27,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:29:27,584 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 7 states. [2020-07-10 15:29:27,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:27,965 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2020-07-10 15:29:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:29:27,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-07-10 15:29:27,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:27,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-10 15:29:27,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:29:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 30 transitions. [2020-07-10 15:29:27,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 30 transitions. [2020-07-10 15:29:28,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:28,034 INFO L225 Difference]: With dead ends: 26 [2020-07-10 15:29:28,034 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 15:29:28,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 15:29:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2020-07-10 15:29:28,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:28,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 15 states. [2020-07-10 15:29:28,051 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 15 states. [2020-07-10 15:29:28,051 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 15 states. [2020-07-10 15:29:28,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:28,054 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-10 15:29:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-10 15:29:28,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:28,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:28,056 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 21 states. [2020-07-10 15:29:28,056 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 21 states. [2020-07-10 15:29:28,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:28,059 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-07-10 15:29:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-07-10 15:29:28,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:28,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:28,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:28,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:29:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-10 15:29:28,063 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2020-07-10 15:29:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:28,064 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-10 15:29:28,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:29:28,064 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-10 15:29:28,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-10 15:29:28,065 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:28,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:28,066 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:29:28,066 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:28,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:28,067 INFO L82 PathProgramCache]: Analyzing trace with hash -18708286, now seen corresponding path program 1 times [2020-07-10 15:29:28,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:28,067 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932900730] [2020-07-10 15:29:28,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:28,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:28,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {241#true} assume true; {241#true} is VALID [2020-07-10 15:29:28,218 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {241#true} {241#true} #50#return; {241#true} is VALID [2020-07-10 15:29:28,218 INFO L263 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2020-07-10 15:29:28,219 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#true} assume true; {241#true} is VALID [2020-07-10 15:29:28,219 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {241#true} {241#true} #50#return; {241#true} is VALID [2020-07-10 15:29:28,219 INFO L263 TraceCheckUtils]: 3: Hoare triple {241#true} call #t~ret3 := main(); {241#true} is VALID [2020-07-10 15:29:28,221 INFO L280 TraceCheckUtils]: 4: Hoare triple {241#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {245#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 15:29:28,222 INFO L280 TraceCheckUtils]: 5: Hoare triple {245#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {246#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 15:29:28,225 INFO L280 TraceCheckUtils]: 6: Hoare triple {246#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {247#(and (<= (+ main_~n~0 1) main_~k~0) (<= main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:28,227 INFO L280 TraceCheckUtils]: 7: Hoare triple {247#(and (<= (+ main_~n~0 1) main_~k~0) (<= main_~i~0 (* 2 main_~n~0)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {248#(<= (+ main_~i~0 2) (* 2 main_~k~0))} is VALID [2020-07-10 15:29:28,230 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#(<= (+ main_~i~0 2) (* 2 main_~k~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {249#(<= (+ main_~i~0 1) (* 2 main_~k~0))} is VALID [2020-07-10 15:29:28,231 INFO L280 TraceCheckUtils]: 9: Hoare triple {249#(<= (+ main_~i~0 1) (* 2 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {242#false} is VALID [2020-07-10 15:29:28,232 INFO L263 TraceCheckUtils]: 10: Hoare triple {242#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {242#false} is VALID [2020-07-10 15:29:28,232 INFO L280 TraceCheckUtils]: 11: Hoare triple {242#false} ~cond := #in~cond; {242#false} is VALID [2020-07-10 15:29:28,233 INFO L280 TraceCheckUtils]: 12: Hoare triple {242#false} assume 0 == ~cond; {242#false} is VALID [2020-07-10 15:29:28,233 INFO L280 TraceCheckUtils]: 13: Hoare triple {242#false} assume !false; {242#false} is VALID [2020-07-10 15:29:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:28,235 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932900730] [2020-07-10 15:29:28,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071766579] [2020-07-10 15:29:28,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-10 15:29:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:28,282 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:29:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:28,296 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:28,512 INFO L263 TraceCheckUtils]: 0: Hoare triple {241#true} call ULTIMATE.init(); {241#true} is VALID [2020-07-10 15:29:28,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {241#true} assume true; {241#true} is VALID [2020-07-10 15:29:28,513 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {241#true} {241#true} #50#return; {241#true} is VALID [2020-07-10 15:29:28,513 INFO L263 TraceCheckUtils]: 3: Hoare triple {241#true} call #t~ret3 := main(); {241#true} is VALID [2020-07-10 15:29:28,515 INFO L280 TraceCheckUtils]: 4: Hoare triple {241#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {245#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 15:29:28,516 INFO L280 TraceCheckUtils]: 5: Hoare triple {245#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {268#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-10 15:29:28,518 INFO L280 TraceCheckUtils]: 6: Hoare triple {268#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {272#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} is VALID [2020-07-10 15:29:28,520 INFO L280 TraceCheckUtils]: 7: Hoare triple {272#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {276#(and (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} is VALID [2020-07-10 15:29:28,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {276#(and (= 0 main_~i~0) (< main_~i~0 (* 2 main_~k~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {280#(and (<= main_~i~0 1) (< 0 (* 2 main_~k~0)))} is VALID [2020-07-10 15:29:28,523 INFO L280 TraceCheckUtils]: 9: Hoare triple {280#(and (<= main_~i~0 1) (< 0 (* 2 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {242#false} is VALID [2020-07-10 15:29:28,524 INFO L263 TraceCheckUtils]: 10: Hoare triple {242#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {242#false} is VALID [2020-07-10 15:29:28,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {242#false} ~cond := #in~cond; {242#false} is VALID [2020-07-10 15:29:28,524 INFO L280 TraceCheckUtils]: 12: Hoare triple {242#false} assume 0 == ~cond; {242#false} is VALID [2020-07-10 15:29:28,525 INFO L280 TraceCheckUtils]: 13: Hoare triple {242#false} assume !false; {242#false} is VALID [2020-07-10 15:29:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:28,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:28,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2020-07-10 15:29:28,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949772266] [2020-07-10 15:29:28,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-07-10 15:29:28,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:28,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:29:28,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:28,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:29:28,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:28,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:29:28,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:29:28,558 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 11 states. [2020-07-10 15:29:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:28,953 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-07-10 15:29:28,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:29:28,954 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-07-10 15:29:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:29:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2020-07-10 15:29:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:29:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 37 transitions. [2020-07-10 15:29:28,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 37 transitions. [2020-07-10 15:29:29,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:29,042 INFO L225 Difference]: With dead ends: 31 [2020-07-10 15:29:29,043 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 15:29:29,044 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:29:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 15:29:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 18. [2020-07-10 15:29:29,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:29,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 18 states. [2020-07-10 15:29:29,061 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 18 states. [2020-07-10 15:29:29,062 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 18 states. [2020-07-10 15:29:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:29,065 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-10 15:29:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 15:29:29,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:29,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:29,066 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 23 states. [2020-07-10 15:29:29,067 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 23 states. [2020-07-10 15:29:29,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:29,070 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-10 15:29:29,070 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 15:29:29,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:29,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:29,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:29,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:29:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2020-07-10 15:29:29,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2020-07-10 15:29:29,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:29,075 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2020-07-10 15:29:29,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:29:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2020-07-10 15:29:29,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-10 15:29:29,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:29,077 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:29,291 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:29:29,291 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash 154986550, now seen corresponding path program 1 times [2020-07-10 15:29:29,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:29,293 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077605908] [2020-07-10 15:29:29,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:29,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {414#true} assume true; {414#true} is VALID [2020-07-10 15:29:29,659 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {414#true} {414#true} #50#return; {414#true} is VALID [2020-07-10 15:29:29,660 INFO L263 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2020-07-10 15:29:29,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2020-07-10 15:29:29,660 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #50#return; {414#true} is VALID [2020-07-10 15:29:29,661 INFO L263 TraceCheckUtils]: 3: Hoare triple {414#true} call #t~ret3 := main(); {414#true} is VALID [2020-07-10 15:29:29,662 INFO L280 TraceCheckUtils]: 4: Hoare triple {414#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {418#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 15:29:29,664 INFO L280 TraceCheckUtils]: 5: Hoare triple {418#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {419#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 15:29:29,666 INFO L280 TraceCheckUtils]: 6: Hoare triple {419#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {419#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} is VALID [2020-07-10 15:29:29,668 INFO L280 TraceCheckUtils]: 7: Hoare triple {419#(and (<= main_~i~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {420#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:29,670 INFO L280 TraceCheckUtils]: 8: Hoare triple {420#(and (<= (* 2 main_~n~0) (+ main_~i~0 2)) (<= (+ main_~i~0 2) (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {421#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:29,671 INFO L280 TraceCheckUtils]: 9: Hoare triple {421#(and (<= (* 2 main_~n~0) (+ main_~i~0 1)) (<= (+ main_~i~0 1) (* 2 main_~n~0)))} assume !!(~i~0 < 2 * ~k~0); {422#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-10 15:29:29,673 INFO L280 TraceCheckUtils]: 10: Hoare triple {422#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {422#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-10 15:29:29,674 INFO L280 TraceCheckUtils]: 11: Hoare triple {422#(and (or (<= (+ main_~i~0 1) (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {423#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} is VALID [2020-07-10 15:29:29,676 INFO L280 TraceCheckUtils]: 12: Hoare triple {423#(and (or (<= main_~i~0 (* 2 main_~n~0)) (<= main_~k~0 main_~n~0)) (<= main_~n~0 main_~k~0))} assume !(~i~0 < 2 * ~k~0); {424#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} is VALID [2020-07-10 15:29:29,678 INFO L263 TraceCheckUtils]: 13: Hoare triple {424#(and (<= main_~k~0 main_~n~0) (<= main_~n~0 main_~k~0))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {425#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:29,679 INFO L280 TraceCheckUtils]: 14: Hoare triple {425#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {426#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:29,680 INFO L280 TraceCheckUtils]: 15: Hoare triple {426#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {415#false} is VALID [2020-07-10 15:29:29,680 INFO L280 TraceCheckUtils]: 16: Hoare triple {415#false} assume !false; {415#false} is VALID [2020-07-10 15:29:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:29,682 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077605908] [2020-07-10 15:29:29,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447506317] [2020-07-10 15:29:29,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:29,717 INFO L264 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-10 15:29:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:29,728 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:30,011 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:30,032 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:30,076 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:29:30,100 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-10 15:29:30,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2020-07-10 15:29:30,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2020-07-10 15:29:30,181 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #50#return; {414#true} is VALID [2020-07-10 15:29:30,181 INFO L263 TraceCheckUtils]: 3: Hoare triple {414#true} call #t~ret3 := main(); {414#true} is VALID [2020-07-10 15:29:30,183 INFO L280 TraceCheckUtils]: 4: Hoare triple {414#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~k~0 := #t~nondet0;havoc #t~nondet0; {418#(and (<= 0 main_~n~0) (<= main_~n~0 0))} is VALID [2020-07-10 15:29:30,184 INFO L280 TraceCheckUtils]: 5: Hoare triple {418#(and (<= 0 main_~n~0) (<= main_~n~0 0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {445#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-10 15:29:30,186 INFO L280 TraceCheckUtils]: 6: Hoare triple {445#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume !!(~i~0 < 2 * ~k~0); {445#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} is VALID [2020-07-10 15:29:30,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {445#(and (<= 0 main_~n~0) (<= main_~n~0 0) (= 0 main_~i~0))} assume 0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2);#t~post2 := ~n~0;~n~0 := 1 + #t~post2;havoc #t~post2; {452#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-10 15:29:30,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {452#(and (= 0 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {456#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-10 15:29:30,190 INFO L280 TraceCheckUtils]: 9: Hoare triple {456#(and (= 1 main_~i~0) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !!(~i~0 < 2 * ~k~0); {460#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} is VALID [2020-07-10 15:29:30,192 INFO L280 TraceCheckUtils]: 10: Hoare triple {460#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} assume !(0 == (if ~i~0 < 0 && 0 != ~i~0 % 2 then ~i~0 % 2 - 2 else ~i~0 % 2)); {460#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} is VALID [2020-07-10 15:29:30,194 INFO L280 TraceCheckUtils]: 11: Hoare triple {460#(and (= 1 main_~i~0) (<= 1 main_~n~0) (< main_~i~0 (* 2 main_~k~0)) (<= main_~n~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {467#(and (<= main_~i~0 2) (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-10 15:29:30,196 INFO L280 TraceCheckUtils]: 12: Hoare triple {467#(and (<= main_~i~0 2) (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= main_~n~0 1))} assume !(~i~0 < 2 * ~k~0); {471#(and (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= (* 2 main_~k~0) 2) (<= main_~n~0 1))} is VALID [2020-07-10 15:29:30,198 INFO L263 TraceCheckUtils]: 13: Hoare triple {471#(and (< 1 (* 2 main_~k~0)) (<= 1 main_~n~0) (<= (* 2 main_~k~0) 2) (<= main_~n~0 1))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {475#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:30,199 INFO L280 TraceCheckUtils]: 14: Hoare triple {475#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {479#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:30,200 INFO L280 TraceCheckUtils]: 15: Hoare triple {479#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {415#false} is VALID [2020-07-10 15:29:30,201 INFO L280 TraceCheckUtils]: 16: Hoare triple {415#false} assume !false; {415#false} is VALID [2020-07-10 15:29:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:30,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:30,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2020-07-10 15:29:30,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939440148] [2020-07-10 15:29:30,204 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-10 15:29:30,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:30,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2020-07-10 15:29:30,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:30,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-10 15:29:30,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:30,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-10 15:29:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2020-07-10 15:29:30,270 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 19 states. [2020-07-10 15:29:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:30,931 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-07-10 15:29:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 15:29:30,932 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 17 [2020-07-10 15:29:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:30,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:29:30,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2020-07-10 15:29:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 15:29:30,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 39 transitions. [2020-07-10 15:29:30,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 39 transitions. [2020-07-10 15:29:30,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:30,995 INFO L225 Difference]: With dead ends: 34 [2020-07-10 15:29:30,995 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:30,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2020-07-10 15:29:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:30,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:30,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:30,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:30,998 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:30,998 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:30,998 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:30,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:30,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:30,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:30,999 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:31,000 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:31,000 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:31,000 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:31,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:31,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:31,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:31,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:31,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-07-10 15:29:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:31,002 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:31,002 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-10 15:29:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:31,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:31,204 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:31,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:31,405 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 15:29:31,405 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:31,405 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:31,405 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:31,405 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:31,406 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:31,406 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:31,406 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:31,406 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:31,406 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:31,406 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 25) the Hoare annotation is: true [2020-07-10 15:29:31,406 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 25) no Hoare annotation was computed. [2020-07-10 15:29:31,406 INFO L268 CegarLoopResult]: For program point L23(line 23) no Hoare annotation was computed. [2020-07-10 15:29:31,406 INFO L268 CegarLoopResult]: For program point L19(lines 19 21) no Hoare annotation was computed. [2020-07-10 15:29:31,406 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-10 15:29:31,407 INFO L268 CegarLoopResult]: For program point L18-2(lines 18 22) no Hoare annotation was computed. [2020-07-10 15:29:31,407 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 22) the Hoare annotation is: (let ((.cse1 (* 2 main_~n~0))) (let ((.cse0 (<= main_~i~0 .cse1))) (or (and (<= main_~n~0 0) .cse0 (= 0 main_~i~0)) (and .cse0 (<= .cse1 main_~i~0) (<= main_~n~0 main_~k~0)) (let ((.cse2 (+ main_~i~0 1))) (and (<= .cse1 .cse2) (<= .cse2 (* 2 main_~k~0)) (<= .cse2 .cse1)))))) [2020-07-10 15:29:31,407 INFO L264 CegarLoopResult]: At program point L18-4(lines 18 22) the Hoare annotation is: (let ((.cse2 (* 2 main_~n~0))) (let ((.cse0 (<= main_~i~0 .cse2)) (.cse1 (<= main_~k~0 main_~n~0))) (or (and (<= 0 main_~n~0) (<= main_~n~0 0) .cse0 .cse1) (and .cse0 .cse1 (<= .cse2 main_~i~0) (<= main_~n~0 main_~k~0))))) [2020-07-10 15:29:31,407 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 25) no Hoare annotation was computed. [2020-07-10 15:29:31,408 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:31,408 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:31,408 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:31,408 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:31,408 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:31,408 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:31,413 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:31,413 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:31,413 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:31,413 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:31,413 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:31,413 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:31,413 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:31,414 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:31,414 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:31,414 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-10 15:29:31,414 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:31,414 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:31,414 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:31,414 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:31,414 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:31,416 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:29:31,416 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:31,416 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:31,416 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:31,416 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:31,416 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:29:31,416 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:29:31,417 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:29:31,417 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:31,417 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:29:31,417 WARN L170 areAnnotationChecker]: L18-2 has no Hoare annotation [2020-07-10 15:29:31,417 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. [2020-07-10 15:29:31,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:31 BoogieIcfgContainer [2020-07-10 15:29:31,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:31,435 INFO L168 Benchmark]: Toolchain (without parser) took 6013.01 ms. Allocated memory was 140.0 MB in the beginning and 246.4 MB in the end (delta: 106.4 MB). Free memory was 101.9 MB in the beginning and 111.5 MB in the end (delta: -9.5 MB). Peak memory consumption was 96.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:31,436 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 140.0 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:31,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.72 ms. Allocated memory is still 140.0 MB. Free memory was 101.7 MB in the beginning and 92.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:31,438 INFO L168 Benchmark]: Boogie Preprocessor took 135.55 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 183.6 MB in the end (delta: -91.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:31,439 INFO L168 Benchmark]: RCFGBuilder took 441.27 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 165.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:31,441 INFO L168 Benchmark]: TraceAbstraction took 5102.22 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 164.8 MB in the beginning and 111.5 MB in the end (delta: 53.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:31,445 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 140.0 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 323.72 ms. Allocated memory is still 140.0 MB. Free memory was 101.7 MB in the beginning and 92.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 135.55 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 92.0 MB in the beginning and 183.6 MB in the end (delta: -91.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 441.27 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 165.5 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5102.22 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 164.8 MB in the beginning and 111.5 MB in the end (delta: 53.4 MB). Peak memory consumption was 96.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: 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: 18]: Loop Invariant Derived loop invariant: (((n <= 0 && i <= 2 * n) && 0 == i) || ((i <= 2 * n && 2 * n <= i) && n <= k)) || ((2 * n <= i + 1 && i + 1 <= 2 * k) && i + 1 <= 2 * n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.7s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 51 SDtfs, 40 SDslu, 152 SDs, 0 SdLazy, 184 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 20 NumberOfFragments, 87 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 89 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 84 NumberOfCodeBlocks, 84 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 5789 SizeOfPredicates, 6 NumberOfNonLiveVariables, 82 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...