/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gj2007b.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:49:23,839 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:49:23,841 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:49:23,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:49:23,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:49:23,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:49:23,866 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:49:23,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:49:23,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:49:23,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:49:23,884 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:49:23,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:49:23,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:49:23,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:49:23,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:49:23,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:49:23,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:49:23,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:49:23,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:49:23,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:49:23,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:49:23,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:49:23,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:49:23,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:49:23,916 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:49:23,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:49:23,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:49:23,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:49:23,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:49:23,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:49:23,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:49:23,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:49:23,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:49:23,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:49:23,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:49:23,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:49:23,924 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:49:23,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:49:23,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:49:23,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:49:23,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:49:23,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:49:23,956 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:49:23,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:49:23,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:49:23,961 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:49:23,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:49:23,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:49:23,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:49:23,962 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:49:23,962 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:49:23,963 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:49:23,963 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:49:23,963 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:49:23,963 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:49:23,963 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:49:23,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:49:23,964 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:49:23,964 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:49:23,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:49:23,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:49:23,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:49:23,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:49:23,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:49:23,967 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:49:24,263 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:49:24,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:49:24,279 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:49:24,281 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:49:24,281 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:49:24,282 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007b.i [2020-07-18 00:49:24,359 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5966bf4b/9885b7aecbfd44d2bfc6e341289ac3eb/FLAG19f7aa688 [2020-07-18 00:49:24,829 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:49:24,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007b.i [2020-07-18 00:49:24,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5966bf4b/9885b7aecbfd44d2bfc6e341289ac3eb/FLAG19f7aa688 [2020-07-18 00:49:25,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5966bf4b/9885b7aecbfd44d2bfc6e341289ac3eb [2020-07-18 00:49:25,329 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:49:25,331 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:49:25,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:25,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:49:25,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:49:25,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:25" (1/1) ... [2020-07-18 00:49:25,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bea63f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25, skipping insertion in model container [2020-07-18 00:49:25,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:49:25" (1/1) ... [2020-07-18 00:49:25,351 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:49:25,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:49:25,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:25,545 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:49:25,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:49:25,578 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:49:25,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25 WrapperNode [2020-07-18 00:49:25,578 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:49:25,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:49:25,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:49:25,579 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:49:25,593 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25" (1/1) ... [2020-07-18 00:49:25,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25" (1/1) ... [2020-07-18 00:49:25,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25" (1/1) ... [2020-07-18 00:49:25,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25" (1/1) ... [2020-07-18 00:49:25,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25" (1/1) ... [2020-07-18 00:49:25,612 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25" (1/1) ... [2020-07-18 00:49:25,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25" (1/1) ... [2020-07-18 00:49:25,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:49:25,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:49:25,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:49:25,704 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:49:25,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49: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-18 00:49:25,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:49:25,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:49:25,771 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-18 00:49:25,771 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-18 00:49:25,771 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:49:25,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:49:25,772 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:49:25,772 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-18 00:49:25,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-18 00:49:25,772 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:49:25,773 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:49:25,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:49:25,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:49:26,105 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:49:26,106 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-18 00:49:26,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:26 BoogieIcfgContainer [2020-07-18 00:49:26,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:49:26,111 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:49:26,111 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:49:26,115 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:49:26,115 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:49:25" (1/3) ... [2020-07-18 00:49:26,116 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499ea2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:26, skipping insertion in model container [2020-07-18 00:49:26,116 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:49:25" (2/3) ... [2020-07-18 00:49:26,117 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499ea2a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:49:26, skipping insertion in model container [2020-07-18 00:49:26,117 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:49:26" (3/3) ... [2020-07-18 00:49:26,119 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007b.i [2020-07-18 00:49:26,127 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:49:26,134 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-18 00:49:26,144 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-18 00:49:26,165 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:49:26,165 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:49:26,165 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:49:26,165 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:49:26,165 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:49:26,166 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:49:26,166 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:49:26,166 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:49:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-18 00:49:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 00:49:26,193 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:26,194 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:26,195 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:26,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:26,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1007675669, now seen corresponding path program 1 times [2020-07-18 00:49:26,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:26,207 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696328503] [2020-07-18 00:49:26,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:26,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:26,363 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-18 00:49:26,364 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #57#return; {32#true} is VALID [2020-07-18 00:49:26,366 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-18 00:49:26,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-18 00:49:26,368 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #57#return; {32#true} is VALID [2020-07-18 00:49:26,368 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2020-07-18 00:49:26,368 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} ~x~0 := 0; {32#true} is VALID [2020-07-18 00:49:26,369 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} ~m~0 := 0; {32#true} is VALID [2020-07-18 00:49:26,369 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {32#true} is VALID [2020-07-18 00:49:26,369 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} ~n~0 := #t~nondet0; {32#true} is VALID [2020-07-18 00:49:26,370 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} havoc #t~nondet0; {32#true} is VALID [2020-07-18 00:49:26,371 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-18 00:49:26,371 INFO L263 TraceCheckUtils]: 10: Hoare triple {33#false} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {33#false} is VALID [2020-07-18 00:49:26,371 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-18 00:49:26,372 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-18 00:49:26,372 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-18 00:49:26,373 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-18 00:49:26,375 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:26,377 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696328503] [2020-07-18 00:49:26,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:26,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-18 00:49:26,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246883731] [2020-07-18 00:49:26,384 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 00:49:26,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:26,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-18 00:49:26,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:26,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-18 00:49:26,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:26,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-18 00:49:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-18 00:49:26,443 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-18 00:49:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:26,554 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-18 00:49:26,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-18 00:49:26,555 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2020-07-18 00:49:26,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:49:26,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-18 00:49:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-18 00:49:26,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2020-07-18 00:49:26,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2020-07-18 00:49:26,664 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:26,676 INFO L225 Difference]: With dead ends: 42 [2020-07-18 00:49:26,676 INFO L226 Difference]: Without dead ends: 24 [2020-07-18 00:49:26,680 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-18 00:49:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-18 00:49:26,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-18 00:49:26,735 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:26,735 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-18 00:49:26,736 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-18 00:49:26,736 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-18 00:49:26,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:26,742 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-18 00:49:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 00:49:26,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:26,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:26,743 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-18 00:49:26,743 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-18 00:49:26,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:26,748 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-18 00:49:26,748 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 00:49:26,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:26,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:26,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:26,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-18 00:49:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-18 00:49:26,754 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2020-07-18 00:49:26,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:26,755 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-18 00:49:26,755 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-18 00:49:26,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2020-07-18 00:49:26,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:26,800 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-18 00:49:26,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-18 00:49:26,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:26,801 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:26,801 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:49:26,801 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:26,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:26,802 INFO L82 PathProgramCache]: Analyzing trace with hash 993822854, now seen corresponding path program 1 times [2020-07-18 00:49:26,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:26,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [721209846] [2020-07-18 00:49:26,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:26,919 INFO L280 TraceCheckUtils]: 0: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-18 00:49:26,919 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {218#true} {218#true} #57#return; {218#true} is VALID [2020-07-18 00:49:26,920 INFO L263 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2020-07-18 00:49:26,920 INFO L280 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2020-07-18 00:49:26,921 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #57#return; {218#true} is VALID [2020-07-18 00:49:26,921 INFO L263 TraceCheckUtils]: 3: Hoare triple {218#true} call #t~ret2 := main(); {218#true} is VALID [2020-07-18 00:49:26,921 INFO L280 TraceCheckUtils]: 4: Hoare triple {218#true} ~x~0 := 0; {218#true} is VALID [2020-07-18 00:49:26,922 INFO L280 TraceCheckUtils]: 5: Hoare triple {218#true} ~m~0 := 0; {222#(<= 0 main_~m~0)} is VALID [2020-07-18 00:49:26,923 INFO L280 TraceCheckUtils]: 6: Hoare triple {222#(<= 0 main_~m~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {222#(<= 0 main_~m~0)} is VALID [2020-07-18 00:49:26,924 INFO L280 TraceCheckUtils]: 7: Hoare triple {222#(<= 0 main_~m~0)} ~n~0 := #t~nondet0; {222#(<= 0 main_~m~0)} is VALID [2020-07-18 00:49:26,925 INFO L280 TraceCheckUtils]: 8: Hoare triple {222#(<= 0 main_~m~0)} havoc #t~nondet0; {222#(<= 0 main_~m~0)} is VALID [2020-07-18 00:49:26,926 INFO L280 TraceCheckUtils]: 9: Hoare triple {222#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {222#(<= 0 main_~m~0)} is VALID [2020-07-18 00:49:26,928 INFO L263 TraceCheckUtils]: 10: Hoare triple {222#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {223#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:26,929 INFO L280 TraceCheckUtils]: 11: Hoare triple {223#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {224#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:26,930 INFO L280 TraceCheckUtils]: 12: Hoare triple {224#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {219#false} is VALID [2020-07-18 00:49:26,930 INFO L280 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2020-07-18 00:49:26,932 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-18 00:49:26,933 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:26,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [721209846] [2020-07-18 00:49:26,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:26,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:49:26,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095874462] [2020-07-18 00:49:26,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 00:49:26,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:26,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:49:26,956 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:26,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:49:26,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:26,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:49:26,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:49:26,958 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2020-07-18 00:49:27,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:27,154 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-18 00:49:27,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:49:27,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-07-18 00:49:27,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:27,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-18 00:49:27,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:49:27,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2020-07-18 00:49:27,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2020-07-18 00:49:27,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:27,213 INFO L225 Difference]: With dead ends: 39 [2020-07-18 00:49:27,213 INFO L226 Difference]: Without dead ends: 37 [2020-07-18 00:49:27,215 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:49:27,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-18 00:49:27,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2020-07-18 00:49:27,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:27,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2020-07-18 00:49:27,248 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2020-07-18 00:49:27,248 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2020-07-18 00:49:27,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:27,252 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-18 00:49:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-18 00:49:27,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:27,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:27,253 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2020-07-18 00:49:27,253 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2020-07-18 00:49:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:27,257 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-18 00:49:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-18 00:49:27,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:27,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:27,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:27,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-18 00:49:27,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-18 00:49:27,262 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 14 [2020-07-18 00:49:27,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:27,262 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-18 00:49:27,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:49:27,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2020-07-18 00:49:27,309 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-18 00:49:27,310 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-18 00:49:27,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-18 00:49:27,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:27,311 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:27,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:49:27,312 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:27,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:27,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1988212296, now seen corresponding path program 1 times [2020-07-18 00:49:27,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:27,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [787532058] [2020-07-18 00:49:27,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:27,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 00:49:27,391 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {449#true} {449#true} #57#return; {449#true} is VALID [2020-07-18 00:49:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:27,401 INFO L280 TraceCheckUtils]: 0: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-18 00:49:27,401 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-18 00:49:27,402 INFO L280 TraceCheckUtils]: 2: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 00:49:27,403 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {449#true} {454#(<= main_~n~0 0)} #61#return; {454#(<= main_~n~0 0)} is VALID [2020-07-18 00:49:27,403 INFO L263 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2020-07-18 00:49:27,404 INFO L280 TraceCheckUtils]: 1: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 00:49:27,404 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {449#true} {449#true} #57#return; {449#true} is VALID [2020-07-18 00:49:27,404 INFO L263 TraceCheckUtils]: 3: Hoare triple {449#true} call #t~ret2 := main(); {449#true} is VALID [2020-07-18 00:49:27,405 INFO L280 TraceCheckUtils]: 4: Hoare triple {449#true} ~x~0 := 0; {453#(<= main_~x~0 0)} is VALID [2020-07-18 00:49:27,406 INFO L280 TraceCheckUtils]: 5: Hoare triple {453#(<= main_~x~0 0)} ~m~0 := 0; {453#(<= main_~x~0 0)} is VALID [2020-07-18 00:49:27,407 INFO L280 TraceCheckUtils]: 6: Hoare triple {453#(<= main_~x~0 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {453#(<= main_~x~0 0)} is VALID [2020-07-18 00:49:27,407 INFO L280 TraceCheckUtils]: 7: Hoare triple {453#(<= main_~x~0 0)} ~n~0 := #t~nondet0; {453#(<= main_~x~0 0)} is VALID [2020-07-18 00:49:27,408 INFO L280 TraceCheckUtils]: 8: Hoare triple {453#(<= main_~x~0 0)} havoc #t~nondet0; {453#(<= main_~x~0 0)} is VALID [2020-07-18 00:49:27,409 INFO L280 TraceCheckUtils]: 9: Hoare triple {453#(<= main_~x~0 0)} assume !(~x~0 < ~n~0); {454#(<= main_~n~0 0)} is VALID [2020-07-18 00:49:27,409 INFO L263 TraceCheckUtils]: 10: Hoare triple {454#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {449#true} is VALID [2020-07-18 00:49:27,410 INFO L280 TraceCheckUtils]: 11: Hoare triple {449#true} ~cond := #in~cond; {449#true} is VALID [2020-07-18 00:49:27,410 INFO L280 TraceCheckUtils]: 12: Hoare triple {449#true} assume !(0 == ~cond); {449#true} is VALID [2020-07-18 00:49:27,410 INFO L280 TraceCheckUtils]: 13: Hoare triple {449#true} assume true; {449#true} is VALID [2020-07-18 00:49:27,412 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {449#true} {454#(<= main_~n~0 0)} #61#return; {454#(<= main_~n~0 0)} is VALID [2020-07-18 00:49:27,413 INFO L263 TraceCheckUtils]: 15: Hoare triple {454#(<= main_~n~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {459#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:27,414 INFO L280 TraceCheckUtils]: 16: Hoare triple {459#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {460#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:27,415 INFO L280 TraceCheckUtils]: 17: Hoare triple {460#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {450#false} is VALID [2020-07-18 00:49:27,415 INFO L280 TraceCheckUtils]: 18: Hoare triple {450#false} assume !false; {450#false} is VALID [2020-07-18 00:49:27,416 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-18 00:49:27,416 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:27,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [787532058] [2020-07-18 00:49:27,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:27,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:49:27,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706177953] [2020-07-18 00:49:27,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-18 00:49:27,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:27,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:49:27,443 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-18 00:49:27,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:49:27,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:27,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:49:27,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:49:27,444 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2020-07-18 00:49:27,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:27,700 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2020-07-18 00:49:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:49:27,700 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-07-18 00:49:27,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:27,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:49:27,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-18 00:49:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:49:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 43 transitions. [2020-07-18 00:49:27,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 43 transitions. [2020-07-18 00:49:27,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:27,779 INFO L225 Difference]: With dead ends: 54 [2020-07-18 00:49:27,779 INFO L226 Difference]: Without dead ends: 42 [2020-07-18 00:49:27,780 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:49:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-18 00:49:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2020-07-18 00:49:27,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:27,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 35 states. [2020-07-18 00:49:27,846 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 35 states. [2020-07-18 00:49:27,846 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 35 states. [2020-07-18 00:49:27,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:27,850 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-18 00:49:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-18 00:49:27,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:27,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:27,851 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 42 states. [2020-07-18 00:49:27,851 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 42 states. [2020-07-18 00:49:27,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:27,855 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-07-18 00:49:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2020-07-18 00:49:27,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:27,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:27,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:27,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:27,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-18 00:49:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-18 00:49:27,860 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2020-07-18 00:49:27,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:27,860 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-18 00:49:27,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:49:27,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 39 transitions. [2020-07-18 00:49:27,911 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-18 00:49:27,911 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-18 00:49:27,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-18 00:49:27,912 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:27,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:27,913 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:49:27,913 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:27,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2096508511, now seen corresponding path program 1 times [2020-07-18 00:49:27,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:27,914 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [903970170] [2020-07-18 00:49:27,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:28,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {729#true} assume true; {729#true} is VALID [2020-07-18 00:49:28,047 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {729#true} {729#true} #57#return; {729#true} is VALID [2020-07-18 00:49:28,047 INFO L263 TraceCheckUtils]: 0: Hoare triple {729#true} call ULTIMATE.init(); {729#true} is VALID [2020-07-18 00:49:28,047 INFO L280 TraceCheckUtils]: 1: Hoare triple {729#true} assume true; {729#true} is VALID [2020-07-18 00:49:28,048 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {729#true} {729#true} #57#return; {729#true} is VALID [2020-07-18 00:49:28,048 INFO L263 TraceCheckUtils]: 3: Hoare triple {729#true} call #t~ret2 := main(); {729#true} is VALID [2020-07-18 00:49:28,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {729#true} ~x~0 := 0; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 00:49:28,051 INFO L280 TraceCheckUtils]: 5: Hoare triple {733#(<= 0 main_~x~0)} ~m~0 := 0; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 00:49:28,052 INFO L280 TraceCheckUtils]: 6: Hoare triple {733#(<= 0 main_~x~0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 00:49:28,053 INFO L280 TraceCheckUtils]: 7: Hoare triple {733#(<= 0 main_~x~0)} ~n~0 := #t~nondet0; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 00:49:28,053 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#(<= 0 main_~x~0)} havoc #t~nondet0; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 00:49:28,054 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#(<= 0 main_~x~0)} assume !!(~x~0 < ~n~0); {733#(<= 0 main_~x~0)} is VALID [2020-07-18 00:49:28,055 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#(<= 0 main_~x~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 00:49:28,055 INFO L280 TraceCheckUtils]: 11: Hoare triple {733#(<= 0 main_~x~0)} assume 0 != #t~nondet1; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 00:49:28,056 INFO L280 TraceCheckUtils]: 12: Hoare triple {733#(<= 0 main_~x~0)} havoc #t~nondet1; {733#(<= 0 main_~x~0)} is VALID [2020-07-18 00:49:28,057 INFO L280 TraceCheckUtils]: 13: Hoare triple {733#(<= 0 main_~x~0)} ~m~0 := ~x~0; {734#(<= 0 main_~m~0)} is VALID [2020-07-18 00:49:28,057 INFO L280 TraceCheckUtils]: 14: Hoare triple {734#(<= 0 main_~m~0)} ~x~0 := 1 + ~x~0; {734#(<= 0 main_~m~0)} is VALID [2020-07-18 00:49:28,060 INFO L280 TraceCheckUtils]: 15: Hoare triple {734#(<= 0 main_~m~0)} assume !(~x~0 < ~n~0); {734#(<= 0 main_~m~0)} is VALID [2020-07-18 00:49:28,064 INFO L263 TraceCheckUtils]: 16: Hoare triple {734#(<= 0 main_~m~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {735#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:28,065 INFO L280 TraceCheckUtils]: 17: Hoare triple {735#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {736#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:28,066 INFO L280 TraceCheckUtils]: 18: Hoare triple {736#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {730#false} is VALID [2020-07-18 00:49:28,066 INFO L280 TraceCheckUtils]: 19: Hoare triple {730#false} assume !false; {730#false} is VALID [2020-07-18 00:49:28,067 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-18 00:49:28,068 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:28,068 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [903970170] [2020-07-18 00:49:28,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:28,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:49:28,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525174547] [2020-07-18 00:49:28,070 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-18 00:49:28,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:28,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:49:28,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:28,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:49:28,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:28,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:49:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:49:28,092 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2020-07-18 00:49:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:28,294 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2020-07-18 00:49:28,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:49:28,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-18 00:49:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:28,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:49:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-18 00:49:28,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:49:28,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-07-18 00:49:28,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2020-07-18 00:49:28,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:28,342 INFO L225 Difference]: With dead ends: 41 [2020-07-18 00:49:28,343 INFO L226 Difference]: Without dead ends: 37 [2020-07-18 00:49:28,343 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:49:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-18 00:49:28,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2020-07-18 00:49:28,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:28,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 27 states. [2020-07-18 00:49:28,381 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 27 states. [2020-07-18 00:49:28,381 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 27 states. [2020-07-18 00:49:28,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:28,384 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-18 00:49:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-18 00:49:28,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:28,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:28,385 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 37 states. [2020-07-18 00:49:28,385 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 37 states. [2020-07-18 00:49:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:28,388 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2020-07-18 00:49:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-07-18 00:49:28,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:28,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:28,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:28,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-18 00:49:28,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-07-18 00:49:28,391 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2020-07-18 00:49:28,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:28,391 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-07-18 00:49:28,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:49:28,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2020-07-18 00:49:28,423 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-18 00:49:28,423 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-07-18 00:49:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 00:49:28,424 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:28,425 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:28,425 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:49:28,425 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:28,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1883436929, now seen corresponding path program 1 times [2020-07-18 00:49:28,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:28,426 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2091839357] [2020-07-18 00:49:28,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:30,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:30,711 INFO L280 TraceCheckUtils]: 0: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-18 00:49:30,712 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {953#true} {953#true} #57#return; {953#true} is VALID [2020-07-18 00:49:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:30,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {953#true} ~cond := #in~cond; {953#true} is VALID [2020-07-18 00:49:30,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {953#true} assume !(0 == ~cond); {953#true} is VALID [2020-07-18 00:49:30,721 INFO L280 TraceCheckUtils]: 2: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-18 00:49:30,722 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {953#true} {957#(<= main_~m~0 0)} #61#return; {957#(<= main_~m~0 0)} is VALID [2020-07-18 00:49:30,722 INFO L263 TraceCheckUtils]: 0: Hoare triple {953#true} call ULTIMATE.init(); {953#true} is VALID [2020-07-18 00:49:30,722 INFO L280 TraceCheckUtils]: 1: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-18 00:49:30,723 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {953#true} {953#true} #57#return; {953#true} is VALID [2020-07-18 00:49:30,723 INFO L263 TraceCheckUtils]: 3: Hoare triple {953#true} call #t~ret2 := main(); {953#true} is VALID [2020-07-18 00:49:30,723 INFO L280 TraceCheckUtils]: 4: Hoare triple {953#true} ~x~0 := 0; {953#true} is VALID [2020-07-18 00:49:30,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {953#true} ~m~0 := 0; {957#(<= main_~m~0 0)} is VALID [2020-07-18 00:49:30,725 INFO L280 TraceCheckUtils]: 6: Hoare triple {957#(<= main_~m~0 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {957#(<= main_~m~0 0)} is VALID [2020-07-18 00:49:30,726 INFO L280 TraceCheckUtils]: 7: Hoare triple {957#(<= main_~m~0 0)} ~n~0 := #t~nondet0; {957#(<= main_~m~0 0)} is VALID [2020-07-18 00:49:30,726 INFO L280 TraceCheckUtils]: 8: Hoare triple {957#(<= main_~m~0 0)} havoc #t~nondet0; {957#(<= main_~m~0 0)} is VALID [2020-07-18 00:49:30,727 INFO L280 TraceCheckUtils]: 9: Hoare triple {957#(<= main_~m~0 0)} [65] L17-2-->L17-3_primed: Formula: (let ((.cse7 (* 2 |v_oct_main_#t~nondet1_in_1|)) (.cse6 (+ v_oct_main_~x~0_in_1 1))) (let ((.cse0 (<= v_oct_main_~n~0_in_1 v_oct_main_~n~0_out_1)) (.cse1 (<= .cse6 v_oct_main_~n~0_in_1)) (.cse2 (<= v_oct_main_~n~0_out_1 v_oct_main_~n~0_in_1)) (.cse4 (<= 0 .cse7)) (.cse5 (<= .cse7 0))) (or (let ((.cse3 (+ v_oct_main_~x~0_in_1 2))) (and .cse0 .cse1 .cse2 (<= .cse3 v_oct_main_~x~0_out_1) .cse4 (<= v_oct_main_~x~0_out_1 (+ v_oct_main_~n~0_in_1 1)) .cse5 (<= v_oct_main_~x~0_out_1 v_oct_main_~n~0_in_1) (<= .cse3 v_oct_main_~n~0_in_1))) (and .cse0 (<= v_oct_main_~x~0_out_1 .cse6) .cse1 .cse2 .cse4 (<= .cse6 v_oct_main_~x~0_out_1) .cse5)))) InVars {main_~n~0=v_oct_main_~n~0_in_1, main_~x~0=v_oct_main_~x~0_in_1, main_#t~nondet1=|v_oct_main_#t~nondet1_in_1|} OutVars{main_~n~0=v_oct_main_~n~0_out_1, main_~x~0=v_oct_main_~x~0_out_1, main_#t~nondet1=|v_oct_main_#t~nondet1_out_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_~n~0] {957#(<= main_~m~0 0)} is VALID [2020-07-18 00:49:30,728 INFO L280 TraceCheckUtils]: 10: Hoare triple {957#(<= main_~m~0 0)} [64] L17-3_primed-->L17-3: Formula: (not (< v_main_~x~0_5 v_main_~n~0_4)) InVars {main_~x~0=v_main_~x~0_5, main_~n~0=v_main_~n~0_4} OutVars{main_~x~0=v_main_~x~0_5, main_~n~0=v_main_~n~0_4} AuxVars[] AssignedVars[] {957#(<= main_~m~0 0)} is VALID [2020-07-18 00:49:30,728 INFO L263 TraceCheckUtils]: 11: Hoare triple {957#(<= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {953#true} is VALID [2020-07-18 00:49:30,729 INFO L280 TraceCheckUtils]: 12: Hoare triple {953#true} ~cond := #in~cond; {953#true} is VALID [2020-07-18 00:49:30,729 INFO L280 TraceCheckUtils]: 13: Hoare triple {953#true} assume !(0 == ~cond); {953#true} is VALID [2020-07-18 00:49:30,729 INFO L280 TraceCheckUtils]: 14: Hoare triple {953#true} assume true; {953#true} is VALID [2020-07-18 00:49:30,730 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {953#true} {957#(<= main_~m~0 0)} #61#return; {957#(<= main_~m~0 0)} is VALID [2020-07-18 00:49:30,732 INFO L263 TraceCheckUtils]: 16: Hoare triple {957#(<= main_~m~0 0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {962#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:30,733 INFO L280 TraceCheckUtils]: 17: Hoare triple {962#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {963#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:30,733 INFO L280 TraceCheckUtils]: 18: Hoare triple {963#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {954#false} is VALID [2020-07-18 00:49:30,734 INFO L280 TraceCheckUtils]: 19: Hoare triple {954#false} assume !false; {954#false} is VALID [2020-07-18 00:49:30,735 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-18 00:49:30,847 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:30,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2091839357] [2020-07-18 00:49:30,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:30,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-18 00:49:30,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653550345] [2020-07-18 00:49:30,849 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-18 00:49:30,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:30,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-18 00:49:30,876 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:30,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-18 00:49:30,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:30,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-18 00:49:30,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-07-18 00:49:30,886 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 9 states. [2020-07-18 00:49:31,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:31,220 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-07-18 00:49:31,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:49:31,220 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2020-07-18 00:49:31,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-18 00:49:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-18 00:49:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2020-07-18 00:49:31,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 42 transitions. [2020-07-18 00:49:31,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:31,302 INFO L225 Difference]: With dead ends: 40 [2020-07-18 00:49:31,302 INFO L226 Difference]: Without dead ends: 34 [2020-07-18 00:49:31,303 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:49:31,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-18 00:49:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2020-07-18 00:49:31,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:31,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 31 states. [2020-07-18 00:49:31,375 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 31 states. [2020-07-18 00:49:31,375 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 31 states. [2020-07-18 00:49:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:31,377 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-18 00:49:31,377 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-18 00:49:31,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:31,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:31,378 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 34 states. [2020-07-18 00:49:31,378 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 34 states. [2020-07-18 00:49:31,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:31,381 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-18 00:49:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-18 00:49:31,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:31,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:31,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:31,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:31,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-18 00:49:31,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2020-07-18 00:49:31,384 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 24 [2020-07-18 00:49:31,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:31,384 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2020-07-18 00:49:31,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-18 00:49:31,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 33 transitions. [2020-07-18 00:49:31,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-18 00:49:31,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-18 00:49:31,432 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:49:31,432 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:49:31,433 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:49:31,433 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:49:31,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:49:31,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1649594383, now seen corresponding path program 1 times [2020-07-18 00:49:31,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:49:31,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [332511515] [2020-07-18 00:49:31,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:49:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:31,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {1183#true} assume true; {1183#true} is VALID [2020-07-18 00:49:31,566 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1183#true} {1183#true} #57#return; {1183#true} is VALID [2020-07-18 00:49:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:49:31,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2020-07-18 00:49:31,578 INFO L280 TraceCheckUtils]: 1: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2020-07-18 00:49:31,579 INFO L280 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2020-07-18 00:49:31,580 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1188#(<= (+ main_~m~0 1) main_~n~0)} #61#return; {1188#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 00:49:31,580 INFO L263 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2020-07-18 00:49:31,581 INFO L280 TraceCheckUtils]: 1: Hoare triple {1183#true} assume true; {1183#true} is VALID [2020-07-18 00:49:31,581 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1183#true} {1183#true} #57#return; {1183#true} is VALID [2020-07-18 00:49:31,581 INFO L263 TraceCheckUtils]: 3: Hoare triple {1183#true} call #t~ret2 := main(); {1183#true} is VALID [2020-07-18 00:49:31,581 INFO L280 TraceCheckUtils]: 4: Hoare triple {1183#true} ~x~0 := 0; {1183#true} is VALID [2020-07-18 00:49:31,582 INFO L280 TraceCheckUtils]: 5: Hoare triple {1183#true} ~m~0 := 0; {1183#true} is VALID [2020-07-18 00:49:31,582 INFO L280 TraceCheckUtils]: 6: Hoare triple {1183#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1183#true} is VALID [2020-07-18 00:49:31,582 INFO L280 TraceCheckUtils]: 7: Hoare triple {1183#true} ~n~0 := #t~nondet0; {1183#true} is VALID [2020-07-18 00:49:31,582 INFO L280 TraceCheckUtils]: 8: Hoare triple {1183#true} havoc #t~nondet0; {1183#true} is VALID [2020-07-18 00:49:31,585 INFO L280 TraceCheckUtils]: 9: Hoare triple {1183#true} assume !!(~x~0 < ~n~0); {1187#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2020-07-18 00:49:31,591 INFO L280 TraceCheckUtils]: 10: Hoare triple {1187#(<= (+ main_~x~0 1) main_~n~0)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1187#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2020-07-18 00:49:31,591 INFO L280 TraceCheckUtils]: 11: Hoare triple {1187#(<= (+ main_~x~0 1) main_~n~0)} assume 0 != #t~nondet1; {1187#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2020-07-18 00:49:31,596 INFO L280 TraceCheckUtils]: 12: Hoare triple {1187#(<= (+ main_~x~0 1) main_~n~0)} havoc #t~nondet1; {1187#(<= (+ main_~x~0 1) main_~n~0)} is VALID [2020-07-18 00:49:31,604 INFO L280 TraceCheckUtils]: 13: Hoare triple {1187#(<= (+ main_~x~0 1) main_~n~0)} ~m~0 := ~x~0; {1188#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 00:49:31,605 INFO L280 TraceCheckUtils]: 14: Hoare triple {1188#(<= (+ main_~m~0 1) main_~n~0)} ~x~0 := 1 + ~x~0; {1188#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 00:49:31,606 INFO L280 TraceCheckUtils]: 15: Hoare triple {1188#(<= (+ main_~m~0 1) main_~n~0)} assume !(~x~0 < ~n~0); {1188#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 00:49:31,606 INFO L263 TraceCheckUtils]: 16: Hoare triple {1188#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 >= 0 || ~n~0 <= 0 then 1 else 0)); {1183#true} is VALID [2020-07-18 00:49:31,606 INFO L280 TraceCheckUtils]: 17: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2020-07-18 00:49:31,606 INFO L280 TraceCheckUtils]: 18: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2020-07-18 00:49:31,607 INFO L280 TraceCheckUtils]: 19: Hoare triple {1183#true} assume true; {1183#true} is VALID [2020-07-18 00:49:31,608 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {1183#true} {1188#(<= (+ main_~m~0 1) main_~n~0)} #61#return; {1188#(<= (+ main_~m~0 1) main_~n~0)} is VALID [2020-07-18 00:49:31,611 INFO L263 TraceCheckUtils]: 21: Hoare triple {1188#(<= (+ main_~m~0 1) main_~n~0)} call __VERIFIER_assert((if ~m~0 < ~n~0 || ~n~0 <= 0 then 1 else 0)); {1193#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-18 00:49:31,613 INFO L280 TraceCheckUtils]: 22: Hoare triple {1193#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1194#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-18 00:49:31,613 INFO L280 TraceCheckUtils]: 23: Hoare triple {1194#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1184#false} is VALID [2020-07-18 00:49:31,614 INFO L280 TraceCheckUtils]: 24: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2020-07-18 00:49:31,615 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-18 00:49:31,615 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:49:31,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [332511515] [2020-07-18 00:49:31,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:49:31,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:49:31,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308271582] [2020-07-18 00:49:31,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-18 00:49:31,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:49:31,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:49:31,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:31,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:49:31,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:49:31,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:49:31,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:49:31,647 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 6 states. [2020-07-18 00:49:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:31,881 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-18 00:49:31,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-18 00:49:31,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-18 00:49:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:49:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:49:31,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-18 00:49:31,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:49:31,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2020-07-18 00:49:31,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2020-07-18 00:49:31,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:31,919 INFO L225 Difference]: With dead ends: 33 [2020-07-18 00:49:31,920 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:49:31,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:49:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:49:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:49:31,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:49:31,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:31,921 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:31,921 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:31,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:31,922 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:31,922 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:31,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:31,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:31,922 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:31,922 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:49:31,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:49:31,923 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:49:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:31,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:31,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:49:31,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:49:31,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:49:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:49:31,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:49:31,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2020-07-18 00:49:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:49:31,924 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:49:31,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:49:31,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:49:31,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:49:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:49:31,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:49:31,925 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:49:31,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:49:32,439 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:32,440 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:32,440 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:49:32,440 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:49:32,440 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:49:32,440 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:49:32,440 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:32,440 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:32,440 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-18 00:49:32,441 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-18 00:49:32,441 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-18 00:49:32,441 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 26) the Hoare annotation is: true [2020-07-18 00:49:32,441 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (or (and (<= main_~x~0 0) (<= main_~n~0 0)) (and (<= (+ main_~m~0 1) main_~n~0) (<= 0 main_~x~0) (<= 0 main_~m~0))) [2020-07-18 00:49:32,441 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= 0 main_~x~0) (<= 0 main_~m~0)) [2020-07-18 00:49:32,441 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (<= main_~x~0 0) (<= 0 main_~x~0)) [2020-07-18 00:49:32,441 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 0 main_~x~0)) (.cse1 (<= 0 main_~m~0))) (or (and (<= main_~x~0 0) .cse0 (<= main_~m~0 0) .cse1) (and (<= (+ main_~m~0 1) main_~n~0) .cse0 .cse1))) [2020-07-18 00:49:32,441 INFO L264 CegarLoopResult]: At program point L17-3(lines 17 22) the Hoare annotation is: (let ((.cse0 (<= 0 main_~m~0))) (or (and (<= main_~x~0 0) (<= main_~n~0 0) .cse0) (and (<= (+ main_~m~0 1) main_~n~0) (<= 0 main_~x~0) .cse0))) [2020-07-18 00:49:32,441 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 26) the Hoare annotation is: true [2020-07-18 00:49:32,442 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 26) the Hoare annotation is: true [2020-07-18 00:49:32,442 INFO L271 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-07-18 00:49:32,442 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= (+ main_~m~0 1) main_~n~0) (<= 0 main_~x~0) (<= 0 main_~m~0)) [2020-07-18 00:49:32,442 INFO L264 CegarLoopResult]: At program point L18-1(lines 18 20) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= (+ main_~m~0 1) main_~n~0) (<= 0 main_~x~0) (<= 0 main_~m~0)) [2020-07-18 00:49:32,442 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~m~0 0) (<= 0 main_~m~0)) [2020-07-18 00:49:32,442 INFO L264 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= 0 main_~x~0) (<= 0 main_~m~0)) [2020-07-18 00:49:32,442 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (and (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~m~0 0) (<= 0 main_~m~0)) [2020-07-18 00:49:32,442 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (and (<= main_~x~0 0) (<= 0 main_~x~0) (<= main_~m~0 0) (<= 0 main_~m~0)) [2020-07-18 00:49:32,442 INFO L264 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= (+ main_~m~0 1) main_~n~0) (<= 0 main_~x~0) (<= 0 main_~m~0)) [2020-07-18 00:49:32,443 INFO L264 CegarLoopResult]: At program point L18-5(lines 18 20) the Hoare annotation is: (and (<= (+ main_~x~0 1) main_~n~0) (<= (+ main_~m~0 1) main_~n~0) (<= 0 main_~x~0) (<= 0 main_~m~0)) [2020-07-18 00:49:32,443 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-18 00:49:32,443 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:32,443 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:32,443 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:32,443 INFO L264 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-18 00:49:32,443 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-18 00:49:32,448 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-18 00:49:32,449 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:32,449 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-18 00:49:32,451 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-18 00:49:32,451 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-18 00:49:32,467 INFO L163 areAnnotationChecker]: CFG has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:49:32,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:49:32 BoogieIcfgContainer [2020-07-18 00:49:32,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:49:32,484 INFO L168 Benchmark]: Toolchain (without parser) took 7152.88 ms. Allocated memory was 146.3 MB in the beginning and 274.2 MB in the end (delta: 127.9 MB). Free memory was 104.1 MB in the beginning and 152.6 MB in the end (delta: -48.4 MB). Peak memory consumption was 79.5 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:32,485 INFO L168 Benchmark]: CDTParser took 0.88 ms. Allocated memory is still 146.3 MB. Free memory was 122.8 MB in the beginning and 122.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-18 00:49:32,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.20 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 94.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:32,487 INFO L168 Benchmark]: Boogie Preprocessor took 124.59 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 94.0 MB in the beginning and 182.9 MB in the end (delta: -89.0 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:32,487 INFO L168 Benchmark]: RCFGBuilder took 405.81 ms. Allocated memory is still 202.9 MB. Free memory was 182.9 MB in the beginning and 164.1 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:32,488 INFO L168 Benchmark]: TraceAbstraction took 6369.68 ms. Allocated memory was 202.9 MB in the beginning and 274.2 MB in the end (delta: 71.3 MB). Free memory was 163.5 MB in the beginning and 155.2 MB in the end (delta: 8.3 MB). Peak memory consumption was 79.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:49:32,492 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.88 ms. Allocated memory is still 146.3 MB. Free memory was 122.8 MB in the beginning and 122.6 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 246.20 ms. Allocated memory is still 146.3 MB. Free memory was 103.7 MB in the beginning and 94.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 124.59 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 94.0 MB in the beginning and 182.9 MB in the end (delta: -89.0 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 405.81 ms. Allocated memory is still 202.9 MB. Free memory was 182.9 MB in the beginning and 164.1 MB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6369.68 ms. Allocated memory was 202.9 MB in the beginning and 274.2 MB in the end (delta: 71.3 MB). Free memory was 163.5 MB in the beginning and 155.2 MB in the end (delta: 8.3 MB). Peak memory consumption was 79.6 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: 17]: Loop Invariant Derived loop invariant: (((x <= 0 && 0 <= x) && m <= 0) && 0 <= m) || ((m + 1 <= n && 0 <= x) && 0 <= m) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 0 == \old(cond) || !(0 == cond) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.7s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 142 SDtfs, 66 SDslu, 360 SDs, 0 SdLazy, 156 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 71 PreInvPairs, 109 NumberOfFragments, 248 HoareAnnotationTreeSize, 71 FomulaSimplifications, 254 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 165 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...