java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum01_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:58:44,933 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:58:44,935 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:58:44,955 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:58:44,956 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:58:44,957 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:58:44,958 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:58:44,960 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:58:44,962 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:58:44,962 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:58:44,965 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:58:44,965 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:58:44,967 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:58:44,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:58:44,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:58:44,971 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:58:44,972 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:58:44,980 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:58:44,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:58:44,987 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:58:44,988 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:58:44,990 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:58:44,992 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:58:44,992 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:58:44,995 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:58:44,996 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:58:44,998 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:58:44,999 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:58:45,000 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:58:45,001 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:58:45,001 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:58:45,003 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:58:45,004 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:58:45,004 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:58:45,005 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:58:45,005 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:58:45,006 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-18 23:58:45,030 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:58:45,030 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:58:45,034 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:58:45,034 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:58:45,035 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:58:45,035 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:58:45,035 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:58:45,035 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:58:45,036 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:58:45,036 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:58:45,036 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:58:45,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:58:45,036 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:58:45,037 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:58:45,037 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:58:45,037 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:58:45,037 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:58:45,037 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:58:45,037 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:58:45,038 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:58:45,038 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:58:45,038 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:58:45,038 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:58:45,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:58:45,039 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:58:45,039 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:58:45,039 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:58:45,039 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:58:45,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:58:45,040 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:58:45,040 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:58:45,090 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:58:45,103 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:58:45,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:58:45,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:58:45,109 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:58:45,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_true-unreach-call_true-termination.i [2018-11-18 23:58:45,170 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd9cdd37/94c8eb2b58b7437fac9b06d41e8dddac/FLAGa3e7cc4e7 [2018-11-18 23:58:45,662 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:58:45,663 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_true-unreach-call_true-termination.i [2018-11-18 23:58:45,669 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd9cdd37/94c8eb2b58b7437fac9b06d41e8dddac/FLAGa3e7cc4e7 [2018-11-18 23:58:46,023 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cd9cdd37/94c8eb2b58b7437fac9b06d41e8dddac [2018-11-18 23:58:46,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:58:46,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:58:46,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:58:46,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:58:46,039 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:58:46,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:46" (1/1) ... [2018-11-18 23:58:46,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb8be79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46, skipping insertion in model container [2018-11-18 23:58:46,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:58:46" (1/1) ... [2018-11-18 23:58:46,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:58:46,075 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:58:46,287 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:58:46,293 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:58:46,318 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:58:46,337 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:58:46,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46 WrapperNode [2018-11-18 23:58:46,338 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:58:46,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:58:46,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:58:46,339 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:58:46,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46" (1/1) ... [2018-11-18 23:58:46,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46" (1/1) ... [2018-11-18 23:58:46,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46" (1/1) ... [2018-11-18 23:58:46,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46" (1/1) ... [2018-11-18 23:58:46,370 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46" (1/1) ... [2018-11-18 23:58:46,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46" (1/1) ... [2018-11-18 23:58:46,379 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46" (1/1) ... [2018-11-18 23:58:46,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:58:46,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:58:46,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:58:46,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:58:46,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46" (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-18 23:58:46,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:58:46,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:58:46,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:58:46,529 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:58:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:58:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 23:58:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:58:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:58:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:58:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:58:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:58:47,075 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:58:47,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:47 BoogieIcfgContainer [2018-11-18 23:58:47,076 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:58:47,077 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:58:47,077 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:58:47,079 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:58:47,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:58:46" (1/3) ... [2018-11-18 23:58:47,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e430f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:47, skipping insertion in model container [2018-11-18 23:58:47,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:58:46" (2/3) ... [2018-11-18 23:58:47,081 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e430f10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:58:47, skipping insertion in model container [2018-11-18 23:58:47,081 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:58:47" (3/3) ... [2018-11-18 23:58:47,083 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_true-unreach-call_true-termination.i [2018-11-18 23:58:47,093 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:58:47,101 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:58:47,118 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:58:47,156 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:58:47,156 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:58:47,157 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:58:47,157 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:58:47,157 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:58:47,157 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:58:47,158 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:58:47,158 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:58:47,158 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:58:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-18 23:58:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 23:58:47,184 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:47,185 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:47,187 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:47,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:47,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1280988026, now seen corresponding path program 1 times [2018-11-18 23:58:47,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:47,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:47,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:47,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:47,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:47,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-18 23:58:47,332 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-18 23:58:47,332 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #37#return; {23#true} is VALID [2018-11-18 23:58:47,332 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2018-11-18 23:58:47,333 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {23#true} is VALID [2018-11-18 23:58:47,333 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {23#true} is VALID [2018-11-18 23:58:47,348 INFO L273 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-18 23:58:47,349 INFO L256 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2018-11-18 23:58:47,349 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-18 23:58:47,349 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2018-11-18 23:58:47,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-18 23:58:47,353 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-18 23:58:47,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:58:47,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:58:47,362 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 23:58:47,365 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:47,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:58:47,465 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-18 23:58:47,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:58:47,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:58:47,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:58:47,476 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-18 23:58:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:47,558 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-18 23:58:47,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:58:47,559 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 23:58:47,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:47,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:58:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-18 23:58:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:58:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-18 23:58:47,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-18 23:58:47,762 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-18 23:58:47,774 INFO L225 Difference]: With dead ends: 31 [2018-11-18 23:58:47,774 INFO L226 Difference]: Without dead ends: 14 [2018-11-18 23:58:47,777 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:58:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-18 23:58:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 23:58:47,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:47,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:47,857 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:47,857 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:47,861 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 23:58:47,861 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 23:58:47,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:47,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:47,862 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:47,862 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-18 23:58:47,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:47,865 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-18 23:58:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 23:58:47,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:47,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:47,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:47,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 23:58:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-18 23:58:47,870 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-18 23:58:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:47,871 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-18 23:58:47,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:58:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-18 23:58:47,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-18 23:58:47,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:47,872 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:47,872 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:47,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:47,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1336229576, now seen corresponding path program 1 times [2018-11-18 23:58:47,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:47,873 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:47,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:47,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:47,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:48,137 INFO L256 TraceCheckUtils]: 0: Hoare triple {116#true} call ULTIMATE.init(); {116#true} is VALID [2018-11-18 23:58:48,137 INFO L273 TraceCheckUtils]: 1: Hoare triple {116#true} assume true; {116#true} is VALID [2018-11-18 23:58:48,137 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {116#true} {116#true} #37#return; {116#true} is VALID [2018-11-18 23:58:48,138 INFO L256 TraceCheckUtils]: 3: Hoare triple {116#true} call #t~ret2 := main(); {116#true} is VALID [2018-11-18 23:58:48,140 INFO L273 TraceCheckUtils]: 4: Hoare triple {116#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {118#(= main_~sn~0 0)} is VALID [2018-11-18 23:58:48,140 INFO L273 TraceCheckUtils]: 5: Hoare triple {118#(= main_~sn~0 0)} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {118#(= main_~sn~0 0)} is VALID [2018-11-18 23:58:48,141 INFO L273 TraceCheckUtils]: 6: Hoare triple {118#(= main_~sn~0 0)} assume true; {118#(= main_~sn~0 0)} is VALID [2018-11-18 23:58:48,142 INFO L273 TraceCheckUtils]: 7: Hoare triple {118#(= main_~sn~0 0)} assume !(~i~0 <= ~n~0); {118#(= main_~sn~0 0)} is VALID [2018-11-18 23:58:48,143 INFO L256 TraceCheckUtils]: 8: Hoare triple {118#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {119#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-18 23:58:48,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {119#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {120#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:58:48,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {120#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {117#false} is VALID [2018-11-18 23:58:48,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {117#false} assume !false; {117#false} is VALID [2018-11-18 23:58:48,147 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-18 23:58:48,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:58:48,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:58:48,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-18 23:58:48,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:48,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:58:48,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:48,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:58:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:58:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:58:48,254 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 5 states. [2018-11-18 23:58:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:48,541 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-18 23:58:48,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:58:48,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-18 23:58:48,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:58:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-18 23:58:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:58:48,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-11-18 23:58:48,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2018-11-18 23:58:48,589 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:48,591 INFO L225 Difference]: With dead ends: 21 [2018-11-18 23:58:48,592 INFO L226 Difference]: Without dead ends: 16 [2018-11-18 23:58:48,593 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:58:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-18 23:58:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 23:58:48,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:48,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2018-11-18 23:58:48,605 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-18 23:58:48,606 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-18 23:58:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:48,608 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-18 23:58:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-18 23:58:48,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:48,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:48,609 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2018-11-18 23:58:48,609 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2018-11-18 23:58:48,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:48,611 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-18 23:58:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-18 23:58:48,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:48,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:48,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:48,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 23:58:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-18 23:58:48,614 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-11-18 23:58:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:48,614 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-18 23:58:48,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:58:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-18 23:58:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 23:58:48,615 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:48,616 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:48,616 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:48,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:48,616 INFO L82 PathProgramCache]: Analyzing trace with hash -214348638, now seen corresponding path program 1 times [2018-11-18 23:58:48,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:48,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:48,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:48,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:48,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:48,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:49,066 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 13 [2018-11-18 23:58:49,436 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-18 23:58:49,437 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-18 23:58:49,437 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #37#return; {212#true} is VALID [2018-11-18 23:58:49,438 INFO L256 TraceCheckUtils]: 3: Hoare triple {212#true} call #t~ret2 := main(); {212#true} is VALID [2018-11-18 23:58:49,439 INFO L273 TraceCheckUtils]: 4: Hoare triple {212#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {214#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-18 23:58:49,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {214#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {215#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-18 23:58:49,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {215#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume true; {215#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-18 23:58:49,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {215#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {216#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} is VALID [2018-11-18 23:58:49,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {216#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {217#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-18 23:58:49,444 INFO L273 TraceCheckUtils]: 9: Hoare triple {217#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume true; {217#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-18 23:58:49,462 INFO L273 TraceCheckUtils]: 10: Hoare triple {217#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {218#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} is VALID [2018-11-18 23:58:49,464 INFO L256 TraceCheckUtils]: 11: Hoare triple {218#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {219#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:58:49,464 INFO L273 TraceCheckUtils]: 12: Hoare triple {219#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {220#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:58:49,465 INFO L273 TraceCheckUtils]: 13: Hoare triple {220#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {213#false} is VALID [2018-11-18 23:58:49,465 INFO L273 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-18 23:58:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:49,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:49,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:49,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:49,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:49,961 INFO L256 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {212#true} is VALID [2018-11-18 23:58:49,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID [2018-11-18 23:58:49,962 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #37#return; {212#true} is VALID [2018-11-18 23:58:49,962 INFO L256 TraceCheckUtils]: 3: Hoare triple {212#true} call #t~ret2 := main(); {212#true} is VALID [2018-11-18 23:58:49,976 INFO L273 TraceCheckUtils]: 4: Hoare triple {212#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {214#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-18 23:58:49,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {214#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {239#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-18 23:58:49,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {239#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume true; {239#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-18 23:58:49,999 INFO L273 TraceCheckUtils]: 7: Hoare triple {239#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {246#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-18 23:58:50,000 INFO L273 TraceCheckUtils]: 8: Hoare triple {246#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {250#(and (<= main_~i~0 2) (<= 1 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-18 23:58:50,001 INFO L273 TraceCheckUtils]: 9: Hoare triple {250#(and (<= main_~i~0 2) (<= 1 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume true; {250#(and (<= main_~i~0 2) (<= 1 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-18 23:58:50,002 INFO L273 TraceCheckUtils]: 10: Hoare triple {250#(and (<= main_~i~0 2) (<= 1 main_~n~0) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !(~i~0 <= ~n~0); {257#(and (<= 1 main_~n~0) (<= main_~n~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-18 23:58:50,008 INFO L256 TraceCheckUtils]: 11: Hoare triple {257#(and (<= 1 main_~n~0) (<= main_~n~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {219#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:58:50,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {219#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {220#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:58:50,015 INFO L273 TraceCheckUtils]: 13: Hoare triple {220#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {213#false} is VALID [2018-11-18 23:58:50,016 INFO L273 TraceCheckUtils]: 14: Hoare triple {213#false} assume !false; {213#false} is VALID [2018-11-18 23:58:50,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:50,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:50,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-18 23:58:50,038 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-11-18 23:58:50,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:50,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-18 23:58:50,132 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-18 23:58:50,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 23:58:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 23:58:50,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-11-18 23:58:50,133 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2018-11-18 23:58:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:50,737 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-18 23:58:50,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 23:58:50,737 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2018-11-18 23:58:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:50,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:58:50,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-11-18 23:58:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-18 23:58:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2018-11-18 23:58:50,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 29 transitions. [2018-11-18 23:58:50,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:50,815 INFO L225 Difference]: With dead ends: 28 [2018-11-18 23:58:50,815 INFO L226 Difference]: Without dead ends: 22 [2018-11-18 23:58:50,816 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2018-11-18 23:58:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-18 23:58:50,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-18 23:58:50,837 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:50,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:50,837 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:50,837 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:50,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:50,839 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-18 23:58:50,840 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-18 23:58:50,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:50,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:50,841 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:50,841 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-18 23:58:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:50,843 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-18 23:58:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-18 23:58:50,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:50,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:50,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:50,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 23:58:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-18 23:58:50,846 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 15 [2018-11-18 23:58:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:50,847 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-18 23:58:50,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 23:58:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-18 23:58:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 23:58:50,848 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:58:50,848 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:58:50,848 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:58:50,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:58:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1462115102, now seen corresponding path program 2 times [2018-11-18 23:58:50,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:58:50,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:58:50,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:50,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:58:50,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:58:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:51,204 INFO L256 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2018-11-18 23:58:51,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-18 23:58:51,205 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {392#true} {392#true} #37#return; {392#true} is VALID [2018-11-18 23:58:51,206 INFO L256 TraceCheckUtils]: 3: Hoare triple {392#true} call #t~ret2 := main(); {392#true} is VALID [2018-11-18 23:58:51,207 INFO L273 TraceCheckUtils]: 4: Hoare triple {392#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {394#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-18 23:58:51,208 INFO L273 TraceCheckUtils]: 5: Hoare triple {394#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-18 23:58:51,209 INFO L273 TraceCheckUtils]: 6: Hoare triple {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume true; {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-18 23:58:51,209 INFO L273 TraceCheckUtils]: 7: Hoare triple {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {396#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-18 23:58:51,210 INFO L273 TraceCheckUtils]: 8: Hoare triple {396#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-18 23:58:51,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume true; {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-18 23:58:51,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {396#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-18 23:58:51,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {396#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-18 23:58:51,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume true; {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-18 23:58:51,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {395#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {397#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} is VALID [2018-11-18 23:58:51,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {397#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {398#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-18 23:58:51,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {398#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume true; {398#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-18 23:58:51,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {398#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {399#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} is VALID [2018-11-18 23:58:51,223 INFO L256 TraceCheckUtils]: 17: Hoare triple {399#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {400#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:58:51,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {400#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {401#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:58:51,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {401#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {393#false} is VALID [2018-11-18 23:58:51,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {393#false} assume !false; {393#false} is VALID [2018-11-18 23:58:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 23:58:51,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:58:51,229 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 23:58:51,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:58:51,285 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:58:51,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:58:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:58:51,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:58:51,887 INFO L256 TraceCheckUtils]: 0: Hoare triple {392#true} call ULTIMATE.init(); {392#true} is VALID [2018-11-18 23:58:51,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {392#true} assume true; {392#true} is VALID [2018-11-18 23:58:51,888 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {392#true} {392#true} #37#return; {392#true} is VALID [2018-11-18 23:58:51,888 INFO L256 TraceCheckUtils]: 3: Hoare triple {392#true} call #t~ret2 := main(); {392#true} is VALID [2018-11-18 23:58:51,889 INFO L273 TraceCheckUtils]: 4: Hoare triple {392#true} havoc ~i~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0; {394#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-18 23:58:51,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {394#(and (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~n~0 < 1000 && ~n~0 >= -1000);~i~0 := 1; {420#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-18 23:58:51,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {420#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume true; {420#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} is VALID [2018-11-18 23:58:51,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {420#(and (= main_~i~0 1) (<= main_~sn~0 0) (<= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {427#(and (= main_~i~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-18 23:58:51,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {427#(and (= main_~i~0 1) (<= main_~sn~0 2) (<= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {431#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-18 23:58:51,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {431#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume true; {431#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} is VALID [2018-11-18 23:58:51,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {431#(and (= main_~i~0 2) (<= main_~sn~0 2) (<= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {438#(and (= main_~i~0 2) (<= main_~sn~0 4) (<= 4 main_~sn~0))} is VALID [2018-11-18 23:58:51,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {438#(and (= main_~i~0 2) (<= main_~sn~0 4) (<= 4 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {442#(and (= main_~i~0 3) (<= main_~sn~0 4) (<= 4 main_~sn~0))} is VALID [2018-11-18 23:58:51,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {442#(and (= main_~i~0 3) (<= main_~sn~0 4) (<= 4 main_~sn~0))} assume true; {442#(and (= main_~i~0 3) (<= main_~sn~0 4) (<= 4 main_~sn~0))} is VALID [2018-11-18 23:58:51,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {442#(and (= main_~i~0 3) (<= main_~sn~0 4) (<= 4 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {449#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 main_~n~0))} is VALID [2018-11-18 23:58:51,898 INFO L273 TraceCheckUtils]: 14: Hoare triple {449#(and (= main_~i~0 3) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 main_~n~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {453#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2018-11-18 23:58:51,899 INFO L273 TraceCheckUtils]: 15: Hoare triple {453#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 4))} assume true; {453#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 4))} is VALID [2018-11-18 23:58:51,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {453#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~i~0 4))} assume !(~i~0 <= ~n~0); {460#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~n~0 3))} is VALID [2018-11-18 23:58:51,915 INFO L256 TraceCheckUtils]: 17: Hoare triple {460#(and (<= 3 main_~n~0) (<= 6 main_~sn~0) (<= main_~sn~0 6) (<= main_~n~0 3))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {400#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:58:51,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {400#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {401#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-18 23:58:51,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {401#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {393#false} is VALID [2018-11-18 23:58:51,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {393#false} assume !false; {393#false} is VALID [2018-11-18 23:58:51,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:58:51,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:58:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 18 [2018-11-18 23:58:51,941 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-11-18 23:58:51,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:58:51,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-18 23:58:51,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:51,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 23:58:51,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 23:58:51,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-11-18 23:58:51,984 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 18 states. [2018-11-18 23:58:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:53,072 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-18 23:58:53,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 23:58:53,072 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2018-11-18 23:58:53,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:58:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:58:53,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-11-18 23:58:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 23:58:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2018-11-18 23:58:53,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 27 transitions. [2018-11-18 23:58:53,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:58:53,124 INFO L225 Difference]: With dead ends: 26 [2018-11-18 23:58:53,125 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 23:58:53,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2018-11-18 23:58:53,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 23:58:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 23:58:53,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:58:53,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:53,127 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:53,127 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:53,127 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:58:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:58:53,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:53,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:53,128 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:53,128 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-18 23:58:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:58:53,128 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-18 23:58:53,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:58:53,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:53,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:58:53,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:58:53,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:58:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 23:58:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 23:58:53,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-18 23:58:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:58:53,130 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 23:58:53,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 23:58:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 23:58:53,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:58:53,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 23:58:53,308 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 23:58:53,308 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:58:53,308 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 23:58:53,309 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 23:58:53,309 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 23:58:53,309 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 23:58:53,309 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2018-11-18 23:58:53,309 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 11 18) no Hoare annotation was computed. [2018-11-18 23:58:53,309 INFO L425 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2018-11-18 23:58:53,309 INFO L425 ceAbstractionStarter]: For program point L14-1(lines 14 16) no Hoare annotation was computed. [2018-11-18 23:58:53,309 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 11 18) no Hoare annotation was computed. [2018-11-18 23:58:53,309 INFO L425 ceAbstractionStarter]: For program point L14-3(lines 14 16) no Hoare annotation was computed. [2018-11-18 23:58:53,310 INFO L421 ceAbstractionStarter]: At program point L14-4(lines 14 16) the Hoare annotation is: (or (let ((.cse1 (* 2 main_~i~0)) (.cse0 (+ main_~sn~0 2))) (and (<= .cse0 .cse1) (<= .cse1 .cse0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))) (and (= main_~i~0 1) (= main_~sn~0 0))) [2018-11-18 23:58:53,310 INFO L421 ceAbstractionStarter]: At program point L14-5(lines 14 16) the Hoare annotation is: (or (let ((.cse0 (* 2 main_~n~0))) (and (<= .cse0 main_~sn~0) (< main_~sn~0 (+ .cse0 1)))) (= main_~sn~0 0)) [2018-11-18 23:58:53,310 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 4 9) the Hoare annotation is: true [2018-11-18 23:58:53,310 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 4 9) no Hoare annotation was computed. [2018-11-18 23:58:53,310 INFO L425 ceAbstractionStarter]: For program point L6(line 6) no Hoare annotation was computed. [2018-11-18 23:58:53,310 INFO L425 ceAbstractionStarter]: For program point L5(lines 5 7) no Hoare annotation was computed. [2018-11-18 23:58:53,311 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-18 23:58:53,311 INFO L425 ceAbstractionStarter]: For program point L5-2(lines 4 9) no Hoare annotation was computed. [2018-11-18 23:58:53,312 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:58:53,312 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-18 23:58:53,312 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:58:53,313 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-18 23:58:53,313 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:58:53,313 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-18 23:58:53,313 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2018-11-18 23:58:53,313 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:58:53,313 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-18 23:58:53,313 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-18 23:58:53,313 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:58:53,313 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-18 23:58:53,314 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-18 23:58:53,314 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2018-11-18 23:58:53,314 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation [2018-11-18 23:58:53,314 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-18 23:58:53,314 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-18 23:58:53,315 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-18 23:58:53,315 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-18 23:58:53,315 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-18 23:58:53,315 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2018-11-18 23:58:53,315 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-18 23:58:53,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 11:58:53 BoogieIcfgContainer [2018-11-18 23:58:53,327 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 23:58:53,328 INFO L168 Benchmark]: Toolchain (without parser) took 7294.61 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -296.0 MB). Peak memory consumption was 409.1 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:53,331 INFO L168 Benchmark]: CDTParser took 0.25 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-18 23:58:53,332 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.97 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-18 23:58:53,333 INFO L168 Benchmark]: Boogie Preprocessor took 42.32 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-18 23:58:53,333 INFO L168 Benchmark]: RCFGBuilder took 694.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:53,334 INFO L168 Benchmark]: TraceAbstraction took 6250.32 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 437.9 MB). Peak memory consumption was 437.9 MB. Max. memory is 7.1 GB. [2018-11-18 23:58:53,339 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.25 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 302.97 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 Preprocessor took 42.32 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 694.41 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.2 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -744.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6250.32 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.7 GB in the end (delta: 437.9 MB). Peak memory consumption was 437.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((sn + 2 <= 2 * i && 2 * i <= sn + 2) && sn < 2 * n + 1) || (i == 1 && sn == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. SAFE Result, 6.1s OverallTime, 4 OverallIterations, 4 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 12 SDslu, 211 SDs, 0 SdLazy, 189 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 12 PreInvPairs, 21 NumberOfFragments, 52 HoareAnnotationTreeSize, 12 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 100 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 95 NumberOfCodeBlocks, 95 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 10401 SizeOfPredicates, 6 NumberOfNonLiveVariables, 86 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 7/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...