/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:28:55,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:28:55,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:28:55,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:28:55,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:28:55,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:28:55,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:28:55,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:28:55,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:28:55,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:28:55,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:28:55,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:28:55,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:28:55,914 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:28:55,917 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:28:55,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:28:55,921 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:28:55,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:28:55,925 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:28:55,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:28:55,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:28:55,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:28:55,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:28:55,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:28:55,948 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:28:55,948 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:28:55,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:28:55,952 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:28:55,952 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:28:55,954 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:28:55,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:28:55,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:28:55,958 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:28:55,959 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:28:55,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:28:55,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:28:55,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:28:55,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:28:55,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:28:55,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:28:55,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:28:55,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:28:56,010 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:28:56,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:28:56,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:28:56,013 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:28:56,016 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:28:56,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:28:56,017 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:28:56,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:28:56,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:28:56,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:28:56,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:28:56,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:28:56,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:28:56,020 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:28:56,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:28:56,021 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:28:56,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:28:56,021 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:28:56,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:28:56,022 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:28:56,022 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:28:56,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:56,022 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:28:56,023 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:28:56,023 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:28:56,023 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:28:56,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:28:56,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:28:56,028 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:28:56,028 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:28:56,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:28:56,408 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:28:56,413 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:28:56,415 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:28:56,416 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:28:56,417 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9.i [2020-07-10 15:28:56,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c700d7ad5/06de3069c60549ca8a2f127258be5c37/FLAGc3db7aba1 [2020-07-10 15:28:57,115 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:28:57,116 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2020-07-10 15:28:57,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c700d7ad5/06de3069c60549ca8a2f127258be5c37/FLAGc3db7aba1 [2020-07-10 15:28:57,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c700d7ad5/06de3069c60549ca8a2f127258be5c37 [2020-07-10 15:28:57,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:28:57,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:28:57,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:57,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:28:57,542 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:28:57,544 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:57" (1/1) ... [2020-07-10 15:28:57,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d30136a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57, skipping insertion in model container [2020-07-10 15:28:57,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:28:57" (1/1) ... [2020-07-10 15:28:57,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:28:57,588 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:28:57,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:57,904 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:28:57,930 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:28:57,949 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:28:57,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57 WrapperNode [2020-07-10 15:28:57,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:28:57,950 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:28:57,951 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:28:57,951 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:28:57,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57" (1/1) ... [2020-07-10 15:28:57,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57" (1/1) ... [2020-07-10 15:28:57,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57" (1/1) ... [2020-07-10 15:28:57,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57" (1/1) ... [2020-07-10 15:28:57,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57" (1/1) ... [2020-07-10 15:28:58,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57" (1/1) ... [2020-07-10 15:28:58,131 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57" (1/1) ... [2020-07-10 15:28:58,133 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:28:58,134 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:28:58,134 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:28:58,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:28:58,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:28:58,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:28:58,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:28:58,217 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:28:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:28:58,218 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:28:58,218 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:28:58,218 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:28:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:28:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:28:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:28:58,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:28:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:28:58,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:28:58,636 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:28:58,637 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:28:58,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:58 BoogieIcfgContainer [2020-07-10 15:28:58,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:28:58,645 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:28:58,645 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:28:58,651 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:28:58,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:28:57" (1/3) ... [2020-07-10 15:28:58,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6c858c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:58, skipping insertion in model container [2020-07-10 15:28:58,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:28:57" (2/3) ... [2020-07-10 15:28:58,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f6c858c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:28:58, skipping insertion in model container [2020-07-10 15:28:58,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:28:58" (3/3) ... [2020-07-10 15:28:58,658 INFO L109 eAbstractionObserver]: Analyzing ICFG nested9.i [2020-07-10 15:28:58,677 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:28:58,689 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:28:58,707 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:28:58,739 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:28:58,740 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:28:58,740 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:28:58,741 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:28:58,741 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:28:58,742 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:28:58,742 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:28:58,742 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:28:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-10 15:28:58,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-10 15:28:58,775 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:28:58,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:28:58,777 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:28:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:28:58,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1671060194, now seen corresponding path program 1 times [2020-07-10 15:28:58,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:28:58,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042211490] [2020-07-10 15:28:58,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:28:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:28:59,197 INFO L280 TraceCheckUtils]: 0: Hoare triple {42#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {32#true} is VALID [2020-07-10 15:28:59,198 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 15:28:59,198 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #85#return; {32#true} is VALID [2020-07-10 15:28:59,203 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {42#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} is VALID [2020-07-10 15:28:59,204 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {32#true} is VALID [2020-07-10 15:28:59,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 15:28:59,205 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #85#return; {32#true} is VALID [2020-07-10 15:28:59,205 INFO L263 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2020-07-10 15:28:59,206 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~m~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~l~0 := #t~nondet2;havoc #t~nondet2; {32#true} is VALID [2020-07-10 15:28:59,206 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {32#true} is VALID [2020-07-10 15:28:59,207 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {32#true} is VALID [2020-07-10 15:28:59,207 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {32#true} is VALID [2020-07-10 15:28:59,208 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {32#true} is VALID [2020-07-10 15:28:59,210 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#true} ~i~0 := 0; {37#(<= 0 main_~i~0)} is VALID [2020-07-10 15:28:59,212 INFO L280 TraceCheckUtils]: 11: Hoare triple {37#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {38#(<= 1 main_~n~0)} is VALID [2020-07-10 15:28:59,214 INFO L280 TraceCheckUtils]: 12: Hoare triple {38#(<= 1 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {39#(<= (+ main_~k~0 2) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:28:59,215 INFO L280 TraceCheckUtils]: 13: Hoare triple {39#(<= (+ main_~k~0 2) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~k~0 < ~j~0); {39#(<= (+ main_~k~0 2) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:28:59,219 INFO L263 TraceCheckUtils]: 14: Hoare triple {39#(<= (+ main_~k~0 2) (+ main_~i~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {40#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:28:59,221 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {41#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:28:59,223 INFO L280 TraceCheckUtils]: 16: Hoare triple {41#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {33#false} is VALID [2020-07-10 15:28:59,224 INFO L280 TraceCheckUtils]: 17: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-10 15:28:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:28:59,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042211490] [2020-07-10 15:28:59,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:28:59,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 15:28:59,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125030043] [2020-07-10 15:28:59,243 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-10 15:28:59,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:28:59,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 15:28:59,329 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:28:59,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 15:28:59,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:28:59,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 15:28:59,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:28:59,348 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 8 states. [2020-07-10 15:29:00,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:00,483 INFO L93 Difference]: Finished difference Result 68 states and 95 transitions. [2020-07-10 15:29:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:29:00,484 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-10 15:29:00,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2020-07-10 15:29:00,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 15:29:00,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2020-07-10 15:29:00,512 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2020-07-10 15:29:00,711 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:00,746 INFO L225 Difference]: With dead ends: 68 [2020-07-10 15:29:00,748 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:29:00,762 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:29:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:29:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2020-07-10 15:29:00,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:00,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 30 states. [2020-07-10 15:29:00,889 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 30 states. [2020-07-10 15:29:00,890 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 30 states. [2020-07-10 15:29:00,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:00,902 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 15:29:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 15:29:00,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:00,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:00,905 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 36 states. [2020-07-10 15:29:00,905 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 36 states. [2020-07-10 15:29:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:00,912 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 15:29:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 15:29:00,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:00,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:00,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:00,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:29:00,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:29:00,920 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 18 [2020-07-10 15:29:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:00,922 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:29:00,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 15:29:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:29:00,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:29:00,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:00,924 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:00,924 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:29:00,925 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:00,926 INFO L82 PathProgramCache]: Analyzing trace with hash -764881689, now seen corresponding path program 1 times [2020-07-10 15:29:00,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:00,926 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850455613] [2020-07-10 15:29:00,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,100 INFO L280 TraceCheckUtils]: 0: Hoare triple {276#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {264#true} is VALID [2020-07-10 15:29:01,101 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#true} assume true; {264#true} is VALID [2020-07-10 15:29:01,101 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {264#true} {264#true} #85#return; {264#true} is VALID [2020-07-10 15:29:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,110 INFO L280 TraceCheckUtils]: 0: Hoare triple {264#true} ~cond := #in~cond; {264#true} is VALID [2020-07-10 15:29:01,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#true} assume !(0 == ~cond); {264#true} is VALID [2020-07-10 15:29:01,112 INFO L280 TraceCheckUtils]: 2: Hoare triple {264#true} assume true; {264#true} is VALID [2020-07-10 15:29:01,112 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {264#true} {265#false} #89#return; {265#false} is VALID [2020-07-10 15:29:01,115 INFO L263 TraceCheckUtils]: 0: Hoare triple {264#true} call ULTIMATE.init(); {276#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} is VALID [2020-07-10 15:29:01,116 INFO L280 TraceCheckUtils]: 1: Hoare triple {276#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {264#true} is VALID [2020-07-10 15:29:01,116 INFO L280 TraceCheckUtils]: 2: Hoare triple {264#true} assume true; {264#true} is VALID [2020-07-10 15:29:01,117 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {264#true} {264#true} #85#return; {264#true} is VALID [2020-07-10 15:29:01,117 INFO L263 TraceCheckUtils]: 4: Hoare triple {264#true} call #t~ret6 := main(); {264#true} is VALID [2020-07-10 15:29:01,118 INFO L280 TraceCheckUtils]: 5: Hoare triple {264#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~m~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~l~0 := #t~nondet2;havoc #t~nondet2; {264#true} is VALID [2020-07-10 15:29:01,119 INFO L280 TraceCheckUtils]: 6: Hoare triple {264#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {264#true} is VALID [2020-07-10 15:29:01,119 INFO L280 TraceCheckUtils]: 7: Hoare triple {264#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {264#true} is VALID [2020-07-10 15:29:01,120 INFO L280 TraceCheckUtils]: 8: Hoare triple {264#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {264#true} is VALID [2020-07-10 15:29:01,120 INFO L280 TraceCheckUtils]: 9: Hoare triple {264#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {264#true} is VALID [2020-07-10 15:29:01,122 INFO L280 TraceCheckUtils]: 10: Hoare triple {264#true} ~i~0 := 0; {269#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:01,124 INFO L280 TraceCheckUtils]: 11: Hoare triple {269#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {270#(<= main_~j~0 main_~i~0)} is VALID [2020-07-10 15:29:01,126 INFO L280 TraceCheckUtils]: 12: Hoare triple {270#(<= main_~j~0 main_~i~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {271#(<= main_~j~0 main_~k~0)} is VALID [2020-07-10 15:29:01,128 INFO L280 TraceCheckUtils]: 13: Hoare triple {271#(<= main_~j~0 main_~k~0)} assume !!(~k~0 < ~j~0); {265#false} is VALID [2020-07-10 15:29:01,129 INFO L263 TraceCheckUtils]: 14: Hoare triple {265#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {264#true} is VALID [2020-07-10 15:29:01,129 INFO L280 TraceCheckUtils]: 15: Hoare triple {264#true} ~cond := #in~cond; {264#true} is VALID [2020-07-10 15:29:01,130 INFO L280 TraceCheckUtils]: 16: Hoare triple {264#true} assume !(0 == ~cond); {264#true} is VALID [2020-07-10 15:29:01,130 INFO L280 TraceCheckUtils]: 17: Hoare triple {264#true} assume true; {264#true} is VALID [2020-07-10 15:29:01,131 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {264#true} {265#false} #89#return; {265#false} is VALID [2020-07-10 15:29:01,131 INFO L280 TraceCheckUtils]: 19: Hoare triple {265#false} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {265#false} is VALID [2020-07-10 15:29:01,132 INFO L280 TraceCheckUtils]: 20: Hoare triple {265#false} assume !!(~k~0 < ~j~0); {265#false} is VALID [2020-07-10 15:29:01,132 INFO L263 TraceCheckUtils]: 21: Hoare triple {265#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {265#false} is VALID [2020-07-10 15:29:01,133 INFO L280 TraceCheckUtils]: 22: Hoare triple {265#false} ~cond := #in~cond; {265#false} is VALID [2020-07-10 15:29:01,133 INFO L280 TraceCheckUtils]: 23: Hoare triple {265#false} assume 0 == ~cond; {265#false} is VALID [2020-07-10 15:29:01,134 INFO L280 TraceCheckUtils]: 24: Hoare triple {265#false} assume !false; {265#false} is VALID [2020-07-10 15:29:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:29:01,137 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850455613] [2020-07-10 15:29:01,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:01,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:29:01,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339557753] [2020-07-10 15:29:01,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-10 15:29:01,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:01,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:29:01,181 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-10 15:29:01,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:29:01,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:01,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:29:01,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:29:01,183 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 6 states. [2020-07-10 15:29:01,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:01,591 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2020-07-10 15:29:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:29:01,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-07-10 15:29:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:01,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-10 15:29:01,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:29:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2020-07-10 15:29:01,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2020-07-10 15:29:01,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:01,681 INFO L225 Difference]: With dead ends: 57 [2020-07-10 15:29:01,682 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 15:29:01,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:29:01,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 15:29:01,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2020-07-10 15:29:01,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:01,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 34 states. [2020-07-10 15:29:01,742 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 34 states. [2020-07-10 15:29:01,743 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 34 states. [2020-07-10 15:29:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:01,747 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-10 15:29:01,747 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-10 15:29:01,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:01,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:01,748 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 38 states. [2020-07-10 15:29:01,748 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 38 states. [2020-07-10 15:29:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:01,753 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2020-07-10 15:29:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2020-07-10 15:29:01,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:01,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:01,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:01,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:01,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-10 15:29:01,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2020-07-10 15:29:01,758 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 25 [2020-07-10 15:29:01,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:01,759 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2020-07-10 15:29:01,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:29:01,759 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2020-07-10 15:29:01,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:29:01,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:01,761 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:01,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:29:01,762 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:01,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:01,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1134636734, now seen corresponding path program 1 times [2020-07-10 15:29:01,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:01,763 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792947797] [2020-07-10 15:29:01,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,937 INFO L280 TraceCheckUtils]: 0: Hoare triple {509#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {496#true} is VALID [2020-07-10 15:29:01,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-10 15:29:01,938 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {496#true} {496#true} #85#return; {496#true} is VALID [2020-07-10 15:29:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:01,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {496#true} ~cond := #in~cond; {496#true} is VALID [2020-07-10 15:29:01,952 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#true} assume !(0 == ~cond); {496#true} is VALID [2020-07-10 15:29:01,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-10 15:29:01,953 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {496#true} {503#(<= main_~j~0 (+ main_~k~0 1))} #89#return; {503#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2020-07-10 15:29:01,954 INFO L263 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {509#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} is VALID [2020-07-10 15:29:01,955 INFO L280 TraceCheckUtils]: 1: Hoare triple {509#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {496#true} is VALID [2020-07-10 15:29:01,955 INFO L280 TraceCheckUtils]: 2: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-10 15:29:01,955 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {496#true} {496#true} #85#return; {496#true} is VALID [2020-07-10 15:29:01,956 INFO L263 TraceCheckUtils]: 4: Hoare triple {496#true} call #t~ret6 := main(); {496#true} is VALID [2020-07-10 15:29:01,956 INFO L280 TraceCheckUtils]: 5: Hoare triple {496#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~m~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~l~0 := #t~nondet2;havoc #t~nondet2; {496#true} is VALID [2020-07-10 15:29:01,957 INFO L280 TraceCheckUtils]: 6: Hoare triple {496#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {496#true} is VALID [2020-07-10 15:29:01,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {496#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {496#true} is VALID [2020-07-10 15:29:01,957 INFO L280 TraceCheckUtils]: 8: Hoare triple {496#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {496#true} is VALID [2020-07-10 15:29:01,958 INFO L280 TraceCheckUtils]: 9: Hoare triple {496#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {496#true} is VALID [2020-07-10 15:29:01,959 INFO L280 TraceCheckUtils]: 10: Hoare triple {496#true} ~i~0 := 0; {501#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:01,961 INFO L280 TraceCheckUtils]: 11: Hoare triple {501#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {501#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:01,962 INFO L280 TraceCheckUtils]: 12: Hoare triple {501#(<= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {501#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:01,963 INFO L280 TraceCheckUtils]: 13: Hoare triple {501#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {502#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:01,964 INFO L280 TraceCheckUtils]: 14: Hoare triple {502#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {502#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:01,965 INFO L280 TraceCheckUtils]: 15: Hoare triple {502#(<= main_~i~0 1)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {503#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2020-07-10 15:29:01,966 INFO L280 TraceCheckUtils]: 16: Hoare triple {503#(<= main_~j~0 (+ main_~k~0 1))} assume !!(~k~0 < ~j~0); {503#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2020-07-10 15:29:01,966 INFO L263 TraceCheckUtils]: 17: Hoare triple {503#(<= main_~j~0 (+ main_~k~0 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {496#true} is VALID [2020-07-10 15:29:01,967 INFO L280 TraceCheckUtils]: 18: Hoare triple {496#true} ~cond := #in~cond; {496#true} is VALID [2020-07-10 15:29:01,967 INFO L280 TraceCheckUtils]: 19: Hoare triple {496#true} assume !(0 == ~cond); {496#true} is VALID [2020-07-10 15:29:01,967 INFO L280 TraceCheckUtils]: 20: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-10 15:29:01,969 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {496#true} {503#(<= main_~j~0 (+ main_~k~0 1))} #89#return; {503#(<= main_~j~0 (+ main_~k~0 1))} is VALID [2020-07-10 15:29:01,971 INFO L280 TraceCheckUtils]: 22: Hoare triple {503#(<= main_~j~0 (+ main_~k~0 1))} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {508#(<= main_~j~0 main_~k~0)} is VALID [2020-07-10 15:29:01,973 INFO L280 TraceCheckUtils]: 23: Hoare triple {508#(<= main_~j~0 main_~k~0)} assume !!(~k~0 < ~j~0); {497#false} is VALID [2020-07-10 15:29:01,973 INFO L263 TraceCheckUtils]: 24: Hoare triple {497#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {497#false} is VALID [2020-07-10 15:29:01,974 INFO L280 TraceCheckUtils]: 25: Hoare triple {497#false} ~cond := #in~cond; {497#false} is VALID [2020-07-10 15:29:01,974 INFO L280 TraceCheckUtils]: 26: Hoare triple {497#false} assume 0 == ~cond; {497#false} is VALID [2020-07-10 15:29:01,974 INFO L280 TraceCheckUtils]: 27: Hoare triple {497#false} assume !false; {497#false} is VALID [2020-07-10 15:29:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:01,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792947797] [2020-07-10 15:29:01,977 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099057595] [2020-07-10 15:29:01,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:02,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:29:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:02,051 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:02,305 INFO L263 TraceCheckUtils]: 0: Hoare triple {496#true} call ULTIMATE.init(); {496#true} is VALID [2020-07-10 15:29:02,305 INFO L280 TraceCheckUtils]: 1: Hoare triple {496#true} ~__BLAST_NONDET~0 := 0; {496#true} is VALID [2020-07-10 15:29:02,306 INFO L280 TraceCheckUtils]: 2: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-10 15:29:02,306 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {496#true} {496#true} #85#return; {496#true} is VALID [2020-07-10 15:29:02,306 INFO L263 TraceCheckUtils]: 4: Hoare triple {496#true} call #t~ret6 := main(); {496#true} is VALID [2020-07-10 15:29:02,307 INFO L280 TraceCheckUtils]: 5: Hoare triple {496#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~m~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~l~0 := #t~nondet2;havoc #t~nondet2; {496#true} is VALID [2020-07-10 15:29:02,307 INFO L280 TraceCheckUtils]: 6: Hoare triple {496#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {496#true} is VALID [2020-07-10 15:29:02,307 INFO L280 TraceCheckUtils]: 7: Hoare triple {496#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {496#true} is VALID [2020-07-10 15:29:02,308 INFO L280 TraceCheckUtils]: 8: Hoare triple {496#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {496#true} is VALID [2020-07-10 15:29:02,312 INFO L280 TraceCheckUtils]: 9: Hoare triple {496#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {496#true} is VALID [2020-07-10 15:29:02,316 INFO L280 TraceCheckUtils]: 10: Hoare triple {496#true} ~i~0 := 0; {501#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:02,317 INFO L280 TraceCheckUtils]: 11: Hoare triple {501#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {501#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:02,318 INFO L280 TraceCheckUtils]: 12: Hoare triple {501#(<= main_~i~0 0)} assume !(~j~0 < 3 * ~i~0); {501#(<= main_~i~0 0)} is VALID [2020-07-10 15:29:02,325 INFO L280 TraceCheckUtils]: 13: Hoare triple {501#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {502#(<= main_~i~0 1)} is VALID [2020-07-10 15:29:02,328 INFO L280 TraceCheckUtils]: 14: Hoare triple {502#(<= main_~i~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {555#(and (<= main_~i~0 1) (<= main_~j~0 (* 2 main_~i~0)))} is VALID [2020-07-10 15:29:02,330 INFO L280 TraceCheckUtils]: 15: Hoare triple {555#(and (<= main_~i~0 1) (<= main_~j~0 (* 2 main_~i~0)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {559#(and (<= (div (* main_~j~0 (- 1)) (- 2)) main_~k~0) (<= (div (* main_~j~0 (- 1)) (- 2)) 1))} is VALID [2020-07-10 15:29:02,339 INFO L280 TraceCheckUtils]: 16: Hoare triple {559#(and (<= (div (* main_~j~0 (- 1)) (- 2)) main_~k~0) (<= (div (* main_~j~0 (- 1)) (- 2)) 1))} assume !!(~k~0 < ~j~0); {559#(and (<= (div (* main_~j~0 (- 1)) (- 2)) main_~k~0) (<= (div (* main_~j~0 (- 1)) (- 2)) 1))} is VALID [2020-07-10 15:29:02,339 INFO L263 TraceCheckUtils]: 17: Hoare triple {559#(and (<= (div (* main_~j~0 (- 1)) (- 2)) main_~k~0) (<= (div (* main_~j~0 (- 1)) (- 2)) 1))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {496#true} is VALID [2020-07-10 15:29:02,339 INFO L280 TraceCheckUtils]: 18: Hoare triple {496#true} ~cond := #in~cond; {496#true} is VALID [2020-07-10 15:29:02,340 INFO L280 TraceCheckUtils]: 19: Hoare triple {496#true} assume !(0 == ~cond); {496#true} is VALID [2020-07-10 15:29:02,340 INFO L280 TraceCheckUtils]: 20: Hoare triple {496#true} assume true; {496#true} is VALID [2020-07-10 15:29:02,342 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {496#true} {559#(and (<= (div (* main_~j~0 (- 1)) (- 2)) main_~k~0) (<= (div (* main_~j~0 (- 1)) (- 2)) 1))} #89#return; {559#(and (<= (div (* main_~j~0 (- 1)) (- 2)) main_~k~0) (<= (div (* main_~j~0 (- 1)) (- 2)) 1))} is VALID [2020-07-10 15:29:02,343 INFO L280 TraceCheckUtils]: 22: Hoare triple {559#(and (<= (div (* main_~j~0 (- 1)) (- 2)) main_~k~0) (<= (div (* main_~j~0 (- 1)) (- 2)) 1))} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {581#(and (<= (div (* main_~j~0 (- 1)) (- 2)) 1) (<= (+ (div (* main_~j~0 (- 1)) (- 2)) 1) main_~k~0))} is VALID [2020-07-10 15:29:02,345 INFO L280 TraceCheckUtils]: 23: Hoare triple {581#(and (<= (div (* main_~j~0 (- 1)) (- 2)) 1) (<= (+ (div (* main_~j~0 (- 1)) (- 2)) 1) main_~k~0))} assume !!(~k~0 < ~j~0); {497#false} is VALID [2020-07-10 15:29:02,345 INFO L263 TraceCheckUtils]: 24: Hoare triple {497#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {497#false} is VALID [2020-07-10 15:29:02,345 INFO L280 TraceCheckUtils]: 25: Hoare triple {497#false} ~cond := #in~cond; {497#false} is VALID [2020-07-10 15:29:02,346 INFO L280 TraceCheckUtils]: 26: Hoare triple {497#false} assume 0 == ~cond; {497#false} is VALID [2020-07-10 15:29:02,346 INFO L280 TraceCheckUtils]: 27: Hoare triple {497#false} assume !false; {497#false} is VALID [2020-07-10 15:29:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:29:02,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:02,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2020-07-10 15:29:02,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503606255] [2020-07-10 15:29:02,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-10 15:29:02,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:02,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 15:29:02,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:02,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 15:29:02,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:02,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 15:29:02,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 15:29:02,408 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 10 states. [2020-07-10 15:29:03,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:03,394 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2020-07-10 15:29:03,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 15:29:03,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-07-10 15:29:03,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:29:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2020-07-10 15:29:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 15:29:03,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 70 transitions. [2020-07-10 15:29:03,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 70 transitions. [2020-07-10 15:29:03,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:03,537 INFO L225 Difference]: With dead ends: 70 [2020-07-10 15:29:03,538 INFO L226 Difference]: Without dead ends: 51 [2020-07-10 15:29:03,552 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2020-07-10 15:29:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-10 15:29:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2020-07-10 15:29:03,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:03,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 43 states. [2020-07-10 15:29:03,619 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 43 states. [2020-07-10 15:29:03,620 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 43 states. [2020-07-10 15:29:03,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:03,625 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2020-07-10 15:29:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2020-07-10 15:29:03,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:03,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:03,627 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 51 states. [2020-07-10 15:29:03,627 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 51 states. [2020-07-10 15:29:03,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:03,631 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2020-07-10 15:29:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2020-07-10 15:29:03,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:03,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:03,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:03,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 15:29:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2020-07-10 15:29:03,636 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 28 [2020-07-10 15:29:03,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:03,637 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2020-07-10 15:29:03,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 15:29:03,637 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-07-10 15:29:03,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 15:29:03,638 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:03,639 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:03,853 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:29:03,853 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:03,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:03,854 INFO L82 PathProgramCache]: Analyzing trace with hash 848296232, now seen corresponding path program 1 times [2020-07-10 15:29:03,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:03,855 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531736434] [2020-07-10 15:29:03,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,973 INFO L280 TraceCheckUtils]: 0: Hoare triple {898#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {887#true} is VALID [2020-07-10 15:29:03,974 INFO L280 TraceCheckUtils]: 1: Hoare triple {887#true} assume true; {887#true} is VALID [2020-07-10 15:29:03,974 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {887#true} {887#true} #85#return; {887#true} is VALID [2020-07-10 15:29:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:03,982 INFO L280 TraceCheckUtils]: 0: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2020-07-10 15:29:03,983 INFO L280 TraceCheckUtils]: 1: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2020-07-10 15:29:03,984 INFO L280 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2020-07-10 15:29:03,984 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {887#true} {888#false} #89#return; {888#false} is VALID [2020-07-10 15:29:03,986 INFO L263 TraceCheckUtils]: 0: Hoare triple {887#true} call ULTIMATE.init(); {898#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} is VALID [2020-07-10 15:29:03,986 INFO L280 TraceCheckUtils]: 1: Hoare triple {898#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {887#true} is VALID [2020-07-10 15:29:03,987 INFO L280 TraceCheckUtils]: 2: Hoare triple {887#true} assume true; {887#true} is VALID [2020-07-10 15:29:03,987 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {887#true} {887#true} #85#return; {887#true} is VALID [2020-07-10 15:29:03,987 INFO L263 TraceCheckUtils]: 4: Hoare triple {887#true} call #t~ret6 := main(); {887#true} is VALID [2020-07-10 15:29:03,988 INFO L280 TraceCheckUtils]: 5: Hoare triple {887#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~m~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~l~0 := #t~nondet2;havoc #t~nondet2; {887#true} is VALID [2020-07-10 15:29:03,988 INFO L280 TraceCheckUtils]: 6: Hoare triple {887#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {887#true} is VALID [2020-07-10 15:29:03,988 INFO L280 TraceCheckUtils]: 7: Hoare triple {887#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {887#true} is VALID [2020-07-10 15:29:03,989 INFO L280 TraceCheckUtils]: 8: Hoare triple {887#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {887#true} is VALID [2020-07-10 15:29:03,989 INFO L280 TraceCheckUtils]: 9: Hoare triple {887#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {887#true} is VALID [2020-07-10 15:29:03,990 INFO L280 TraceCheckUtils]: 10: Hoare triple {887#true} ~i~0 := 0; {887#true} is VALID [2020-07-10 15:29:03,990 INFO L280 TraceCheckUtils]: 11: Hoare triple {887#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {887#true} is VALID [2020-07-10 15:29:03,990 INFO L280 TraceCheckUtils]: 12: Hoare triple {887#true} assume !(~j~0 < 3 * ~i~0); {887#true} is VALID [2020-07-10 15:29:03,990 INFO L280 TraceCheckUtils]: 13: Hoare triple {887#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {887#true} is VALID [2020-07-10 15:29:03,993 INFO L280 TraceCheckUtils]: 14: Hoare triple {887#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {892#(<= (* 2 main_~i~0) main_~j~0)} is VALID [2020-07-10 15:29:03,995 INFO L280 TraceCheckUtils]: 15: Hoare triple {892#(<= (* 2 main_~i~0) main_~j~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {893#(<= (+ main_~k~0 1) main_~j~0)} is VALID [2020-07-10 15:29:03,997 INFO L280 TraceCheckUtils]: 16: Hoare triple {893#(<= (+ main_~k~0 1) main_~j~0)} assume !(~k~0 < ~j~0); {888#false} is VALID [2020-07-10 15:29:03,997 INFO L280 TraceCheckUtils]: 17: Hoare triple {888#false} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {888#false} is VALID [2020-07-10 15:29:03,998 INFO L280 TraceCheckUtils]: 18: Hoare triple {888#false} assume !(~j~0 < 3 * ~i~0); {888#false} is VALID [2020-07-10 15:29:03,998 INFO L280 TraceCheckUtils]: 19: Hoare triple {888#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {888#false} is VALID [2020-07-10 15:29:03,998 INFO L280 TraceCheckUtils]: 20: Hoare triple {888#false} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {888#false} is VALID [2020-07-10 15:29:03,999 INFO L280 TraceCheckUtils]: 21: Hoare triple {888#false} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {888#false} is VALID [2020-07-10 15:29:03,999 INFO L280 TraceCheckUtils]: 22: Hoare triple {888#false} assume !!(~k~0 < ~j~0); {888#false} is VALID [2020-07-10 15:29:03,999 INFO L263 TraceCheckUtils]: 23: Hoare triple {888#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {887#true} is VALID [2020-07-10 15:29:04,000 INFO L280 TraceCheckUtils]: 24: Hoare triple {887#true} ~cond := #in~cond; {887#true} is VALID [2020-07-10 15:29:04,000 INFO L280 TraceCheckUtils]: 25: Hoare triple {887#true} assume !(0 == ~cond); {887#true} is VALID [2020-07-10 15:29:04,001 INFO L280 TraceCheckUtils]: 26: Hoare triple {887#true} assume true; {887#true} is VALID [2020-07-10 15:29:04,001 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {887#true} {888#false} #89#return; {888#false} is VALID [2020-07-10 15:29:04,002 INFO L280 TraceCheckUtils]: 28: Hoare triple {888#false} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {888#false} is VALID [2020-07-10 15:29:04,002 INFO L280 TraceCheckUtils]: 29: Hoare triple {888#false} assume !!(~k~0 < ~j~0); {888#false} is VALID [2020-07-10 15:29:04,002 INFO L263 TraceCheckUtils]: 30: Hoare triple {888#false} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {888#false} is VALID [2020-07-10 15:29:04,003 INFO L280 TraceCheckUtils]: 31: Hoare triple {888#false} ~cond := #in~cond; {888#false} is VALID [2020-07-10 15:29:04,003 INFO L280 TraceCheckUtils]: 32: Hoare triple {888#false} assume 0 == ~cond; {888#false} is VALID [2020-07-10 15:29:04,003 INFO L280 TraceCheckUtils]: 33: Hoare triple {888#false} assume !false; {888#false} is VALID [2020-07-10 15:29:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:29:04,006 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531736434] [2020-07-10 15:29:04,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:29:04,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:29:04,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511065819] [2020-07-10 15:29:04,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-10 15:29:04,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:04,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:29:04,066 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-10 15:29:04,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:29:04,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:04,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:29:04,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:29:04,069 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 5 states. [2020-07-10 15:29:04,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:04,396 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2020-07-10 15:29:04,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 15:29:04,396 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-10 15:29:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-10 15:29:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:29:04,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-10 15:29:04,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-10 15:29:04,462 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-10 15:29:04,466 INFO L225 Difference]: With dead ends: 73 [2020-07-10 15:29:04,467 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 15:29:04,468 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:29:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 15:29:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-10 15:29:04,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:04,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2020-07-10 15:29:04,544 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 15:29:04,544 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 15:29:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:04,548 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-10 15:29:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-07-10 15:29:04,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:04,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:04,550 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2020-07-10 15:29:04,550 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2020-07-10 15:29:04,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:04,554 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2020-07-10 15:29:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-07-10 15:29:04,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:04,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:04,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:04,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 15:29:04,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2020-07-10 15:29:04,558 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 34 [2020-07-10 15:29:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:04,559 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2020-07-10 15:29:04,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:29:04,559 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2020-07-10 15:29:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 15:29:04,560 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:29:04,561 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:29:04,561 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:29:04,561 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:29:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:29:04,562 INFO L82 PathProgramCache]: Analyzing trace with hash -670641491, now seen corresponding path program 2 times [2020-07-10 15:29:04,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:29:04,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402343447] [2020-07-10 15:29:04,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:29:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {1179#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {1159#true} is VALID [2020-07-10 15:29:04,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {1159#true} assume true; {1159#true} is VALID [2020-07-10 15:29:04,755 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1159#true} {1159#true} #85#return; {1159#true} is VALID [2020-07-10 15:29:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {1159#true} ~cond := #in~cond; {1159#true} is VALID [2020-07-10 15:29:04,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {1159#true} assume !(0 == ~cond); {1159#true} is VALID [2020-07-10 15:29:04,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {1159#true} assume true; {1159#true} is VALID [2020-07-10 15:29:04,783 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1159#true} {1166#(<= 2 main_~n~0)} #89#return; {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {1159#true} ~cond := #in~cond; {1159#true} is VALID [2020-07-10 15:29:04,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {1159#true} assume !(0 == ~cond); {1159#true} is VALID [2020-07-10 15:29:04,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {1159#true} assume true; {1159#true} is VALID [2020-07-10 15:29:04,797 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1159#true} {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} #89#return; {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:04,799 INFO L263 TraceCheckUtils]: 0: Hoare triple {1159#true} call ULTIMATE.init(); {1179#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} is VALID [2020-07-10 15:29:04,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {1179#(= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|)} ~__BLAST_NONDET~0 := 0; {1159#true} is VALID [2020-07-10 15:29:04,799 INFO L280 TraceCheckUtils]: 2: Hoare triple {1159#true} assume true; {1159#true} is VALID [2020-07-10 15:29:04,800 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1159#true} {1159#true} #85#return; {1159#true} is VALID [2020-07-10 15:29:04,800 INFO L263 TraceCheckUtils]: 4: Hoare triple {1159#true} call #t~ret6 := main(); {1159#true} is VALID [2020-07-10 15:29:04,800 INFO L280 TraceCheckUtils]: 5: Hoare triple {1159#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~m~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~l~0 := #t~nondet2;havoc #t~nondet2; {1159#true} is VALID [2020-07-10 15:29:04,801 INFO L280 TraceCheckUtils]: 6: Hoare triple {1159#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1159#true} is VALID [2020-07-10 15:29:04,801 INFO L280 TraceCheckUtils]: 7: Hoare triple {1159#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1159#true} is VALID [2020-07-10 15:29:04,801 INFO L280 TraceCheckUtils]: 8: Hoare triple {1159#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1159#true} is VALID [2020-07-10 15:29:04,802 INFO L280 TraceCheckUtils]: 9: Hoare triple {1159#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1159#true} is VALID [2020-07-10 15:29:04,803 INFO L280 TraceCheckUtils]: 10: Hoare triple {1159#true} ~i~0 := 0; {1164#(<= 0 main_~i~0)} is VALID [2020-07-10 15:29:04,805 INFO L280 TraceCheckUtils]: 11: Hoare triple {1164#(<= 0 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1164#(<= 0 main_~i~0)} is VALID [2020-07-10 15:29:04,807 INFO L280 TraceCheckUtils]: 12: Hoare triple {1164#(<= 0 main_~i~0)} assume !(~j~0 < 3 * ~i~0); {1164#(<= 0 main_~i~0)} is VALID [2020-07-10 15:29:04,809 INFO L280 TraceCheckUtils]: 13: Hoare triple {1164#(<= 0 main_~i~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1165#(<= 1 main_~i~0)} is VALID [2020-07-10 15:29:04,811 INFO L280 TraceCheckUtils]: 14: Hoare triple {1165#(<= 1 main_~i~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,813 INFO L280 TraceCheckUtils]: 15: Hoare triple {1166#(<= 2 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,815 INFO L280 TraceCheckUtils]: 16: Hoare triple {1166#(<= 2 main_~n~0)} assume !!(~k~0 < ~j~0); {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,815 INFO L263 TraceCheckUtils]: 17: Hoare triple {1166#(<= 2 main_~n~0)} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1159#true} is VALID [2020-07-10 15:29:04,816 INFO L280 TraceCheckUtils]: 18: Hoare triple {1159#true} ~cond := #in~cond; {1159#true} is VALID [2020-07-10 15:29:04,816 INFO L280 TraceCheckUtils]: 19: Hoare triple {1159#true} assume !(0 == ~cond); {1159#true} is VALID [2020-07-10 15:29:04,817 INFO L280 TraceCheckUtils]: 20: Hoare triple {1159#true} assume true; {1159#true} is VALID [2020-07-10 15:29:04,819 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1159#true} {1166#(<= 2 main_~n~0)} #89#return; {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,820 INFO L280 TraceCheckUtils]: 22: Hoare triple {1166#(<= 2 main_~n~0)} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,821 INFO L280 TraceCheckUtils]: 23: Hoare triple {1166#(<= 2 main_~n~0)} assume !(~k~0 < ~j~0); {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,822 INFO L280 TraceCheckUtils]: 24: Hoare triple {1166#(<= 2 main_~n~0)} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,823 INFO L280 TraceCheckUtils]: 25: Hoare triple {1166#(<= 2 main_~n~0)} assume !(~j~0 < 3 * ~i~0); {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,824 INFO L280 TraceCheckUtils]: 26: Hoare triple {1166#(<= 2 main_~n~0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1166#(<= 2 main_~n~0)} is VALID [2020-07-10 15:29:04,825 INFO L280 TraceCheckUtils]: 27: Hoare triple {1166#(<= 2 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:04,826 INFO L280 TraceCheckUtils]: 28: Hoare triple {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:04,827 INFO L280 TraceCheckUtils]: 29: Hoare triple {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~k~0 < ~j~0); {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:04,827 INFO L263 TraceCheckUtils]: 30: Hoare triple {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1159#true} is VALID [2020-07-10 15:29:04,828 INFO L280 TraceCheckUtils]: 31: Hoare triple {1159#true} ~cond := #in~cond; {1159#true} is VALID [2020-07-10 15:29:04,828 INFO L280 TraceCheckUtils]: 32: Hoare triple {1159#true} assume !(0 == ~cond); {1159#true} is VALID [2020-07-10 15:29:04,828 INFO L280 TraceCheckUtils]: 33: Hoare triple {1159#true} assume true; {1159#true} is VALID [2020-07-10 15:29:04,829 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1159#true} {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} #89#return; {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:04,830 INFO L280 TraceCheckUtils]: 35: Hoare triple {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:04,832 INFO L280 TraceCheckUtils]: 36: Hoare triple {1171#(<= (+ main_~j~0 3) (+ main_~i~0 (* 2 main_~n~0)))} assume !!(~k~0 < ~j~0); {1176#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} is VALID [2020-07-10 15:29:04,834 INFO L263 TraceCheckUtils]: 37: Hoare triple {1176#(<= (+ main_~k~0 4) (+ main_~i~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1177#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:29:04,835 INFO L280 TraceCheckUtils]: 38: Hoare triple {1177#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1178#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:29:04,835 INFO L280 TraceCheckUtils]: 39: Hoare triple {1178#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1160#false} is VALID [2020-07-10 15:29:04,836 INFO L280 TraceCheckUtils]: 40: Hoare triple {1160#false} assume !false; {1160#false} is VALID [2020-07-10 15:29:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 15:29:04,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402343447] [2020-07-10 15:29:04,841 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915602858] [2020-07-10 15:29:04,842 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:04,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-10 15:29:04,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:29:04,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:29:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:29:04,923 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:29:05,125 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:05,159 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:29:05,287 INFO L263 TraceCheckUtils]: 0: Hoare triple {1159#true} call ULTIMATE.init(); {1159#true} is VALID [2020-07-10 15:29:05,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {1159#true} ~__BLAST_NONDET~0 := 0; {1159#true} is VALID [2020-07-10 15:29:05,288 INFO L280 TraceCheckUtils]: 2: Hoare triple {1159#true} assume true; {1159#true} is VALID [2020-07-10 15:29:05,288 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1159#true} {1159#true} #85#return; {1159#true} is VALID [2020-07-10 15:29:05,288 INFO L263 TraceCheckUtils]: 4: Hoare triple {1159#true} call #t~ret6 := main(); {1159#true} is VALID [2020-07-10 15:29:05,288 INFO L280 TraceCheckUtils]: 5: Hoare triple {1159#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~n~0;havoc ~l~0;havoc ~m~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~n~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~m~0 := #t~nondet1;havoc #t~nondet1;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~l~0 := #t~nondet2;havoc #t~nondet2; {1159#true} is VALID [2020-07-10 15:29:05,289 INFO L280 TraceCheckUtils]: 6: Hoare triple {1159#true} assume !!(-1000000 < ~n~0 && ~n~0 < 1000000); {1159#true} is VALID [2020-07-10 15:29:05,289 INFO L280 TraceCheckUtils]: 7: Hoare triple {1159#true} assume !!(-1000000 < ~m~0 && ~m~0 < 1000000); {1159#true} is VALID [2020-07-10 15:29:05,289 INFO L280 TraceCheckUtils]: 8: Hoare triple {1159#true} assume !!(-1000000 < ~l~0 && ~l~0 < 1000000); {1159#true} is VALID [2020-07-10 15:29:05,289 INFO L280 TraceCheckUtils]: 9: Hoare triple {1159#true} assume 3 * ~n~0 <= ~m~0 + ~l~0; {1159#true} is VALID [2020-07-10 15:29:05,290 INFO L280 TraceCheckUtils]: 10: Hoare triple {1159#true} ~i~0 := 0; {1159#true} is VALID [2020-07-10 15:29:05,290 INFO L280 TraceCheckUtils]: 11: Hoare triple {1159#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1159#true} is VALID [2020-07-10 15:29:05,290 INFO L280 TraceCheckUtils]: 12: Hoare triple {1159#true} assume !(~j~0 < 3 * ~i~0); {1159#true} is VALID [2020-07-10 15:29:05,290 INFO L280 TraceCheckUtils]: 13: Hoare triple {1159#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1159#true} is VALID [2020-07-10 15:29:05,290 INFO L280 TraceCheckUtils]: 14: Hoare triple {1159#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1159#true} is VALID [2020-07-10 15:29:05,291 INFO L280 TraceCheckUtils]: 15: Hoare triple {1159#true} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1159#true} is VALID [2020-07-10 15:29:05,291 INFO L280 TraceCheckUtils]: 16: Hoare triple {1159#true} assume !!(~k~0 < ~j~0); {1159#true} is VALID [2020-07-10 15:29:05,292 INFO L263 TraceCheckUtils]: 17: Hoare triple {1159#true} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1159#true} is VALID [2020-07-10 15:29:05,292 INFO L280 TraceCheckUtils]: 18: Hoare triple {1159#true} ~cond := #in~cond; {1159#true} is VALID [2020-07-10 15:29:05,292 INFO L280 TraceCheckUtils]: 19: Hoare triple {1159#true} assume !(0 == ~cond); {1159#true} is VALID [2020-07-10 15:29:05,293 INFO L280 TraceCheckUtils]: 20: Hoare triple {1159#true} assume true; {1159#true} is VALID [2020-07-10 15:29:05,293 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {1159#true} {1159#true} #89#return; {1159#true} is VALID [2020-07-10 15:29:05,293 INFO L280 TraceCheckUtils]: 22: Hoare triple {1159#true} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1159#true} is VALID [2020-07-10 15:29:05,294 INFO L280 TraceCheckUtils]: 23: Hoare triple {1159#true} assume !(~k~0 < ~j~0); {1159#true} is VALID [2020-07-10 15:29:05,294 INFO L280 TraceCheckUtils]: 24: Hoare triple {1159#true} #t~post4 := ~j~0;~j~0 := 1 + #t~post4;havoc #t~post4; {1159#true} is VALID [2020-07-10 15:29:05,294 INFO L280 TraceCheckUtils]: 25: Hoare triple {1159#true} assume !(~j~0 < 3 * ~i~0); {1159#true} is VALID [2020-07-10 15:29:05,294 INFO L280 TraceCheckUtils]: 26: Hoare triple {1159#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1159#true} is VALID [2020-07-10 15:29:05,295 INFO L280 TraceCheckUtils]: 27: Hoare triple {1159#true} assume !!(~i~0 < ~n~0);~j~0 := 2 * ~i~0; {1264#(< main_~i~0 main_~n~0)} is VALID [2020-07-10 15:29:05,296 INFO L280 TraceCheckUtils]: 28: Hoare triple {1264#(< main_~i~0 main_~n~0)} assume !!(~j~0 < 3 * ~i~0);~k~0 := ~i~0; {1268#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)))} is VALID [2020-07-10 15:29:05,297 INFO L280 TraceCheckUtils]: 29: Hoare triple {1268#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)))} assume !!(~k~0 < ~j~0); {1268#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)))} is VALID [2020-07-10 15:29:05,297 INFO L263 TraceCheckUtils]: 30: Hoare triple {1268#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1159#true} is VALID [2020-07-10 15:29:05,297 INFO L280 TraceCheckUtils]: 31: Hoare triple {1159#true} ~cond := #in~cond; {1159#true} is VALID [2020-07-10 15:29:05,297 INFO L280 TraceCheckUtils]: 32: Hoare triple {1159#true} assume !(0 == ~cond); {1159#true} is VALID [2020-07-10 15:29:05,297 INFO L280 TraceCheckUtils]: 33: Hoare triple {1159#true} assume true; {1159#true} is VALID [2020-07-10 15:29:05,298 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1159#true} {1268#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)))} #89#return; {1268#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)))} is VALID [2020-07-10 15:29:05,299 INFO L280 TraceCheckUtils]: 35: Hoare triple {1268#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)))} #t~post5 := ~k~0;~k~0 := 1 + #t~post5;havoc #t~post5; {1268#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)))} is VALID [2020-07-10 15:29:05,300 INFO L280 TraceCheckUtils]: 36: Hoare triple {1268#(and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)))} assume !!(~k~0 < ~j~0); {1293#(and (< main_~i~0 main_~n~0) (<= (+ main_~k~0 2) (* 3 main_~i~0)))} is VALID [2020-07-10 15:29:05,301 INFO L263 TraceCheckUtils]: 37: Hoare triple {1293#(and (< main_~i~0 main_~n~0) (<= (+ main_~k~0 2) (* 3 main_~i~0)))} call __VERIFIER_assert((if ~k~0 - ~i~0 <= 2 * ~n~0 then 1 else 0)); {1297#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:29:05,302 INFO L280 TraceCheckUtils]: 38: Hoare triple {1297#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1301#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:29:05,303 INFO L280 TraceCheckUtils]: 39: Hoare triple {1301#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1160#false} is VALID [2020-07-10 15:29:05,304 INFO L280 TraceCheckUtils]: 40: Hoare triple {1160#false} assume !false; {1160#false} is VALID [2020-07-10 15:29:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-10 15:29:05,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:29:05,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2020-07-10 15:29:05,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8773487] [2020-07-10 15:29:05,310 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-10 15:29:05,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:29:05,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 15:29:05,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:05,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 15:29:05,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:29:05,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 15:29:05,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-07-10 15:29:05,387 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 15 states. [2020-07-10 15:29:06,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,357 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2020-07-10 15:29:06,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-10 15:29:06,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2020-07-10 15:29:06,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:29:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:29:06,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2020-07-10 15:29:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 15:29:06,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 47 transitions. [2020-07-10 15:29:06,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 47 transitions. [2020-07-10 15:29:06,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:29:06,449 INFO L225 Difference]: With dead ends: 68 [2020-07-10 15:29:06,449 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:29:06,451 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=439, Unknown=0, NotChecked=0, Total=552 [2020-07-10 15:29:06,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:29:06,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:29:06,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:29:06,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,452 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,453 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,453 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:06,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:06,454 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,454 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:29:06,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:29:06,454 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:29:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:06,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:29:06,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:29:06,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:29:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:29:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:29:06,456 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2020-07-10 15:29:06,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:29:06,456 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:29:06,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 15:29:06,456 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:29:06,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:29:06,670 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:29:06,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:29:07,076 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:07,076 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~__BLAST_NONDET~0 |old(~__BLAST_NONDET~0)|) [2020-07-10 15:29:07,077 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:07,077 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:29:07,077 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:29:07,077 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:29:07,077 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:29:07,077 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:07,077 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:29:07,077 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:07,078 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 15:29:07,078 INFO L271 CegarLoopResult]: At program point L27(lines 14 29) the Hoare annotation is: true [2020-07-10 15:29:07,078 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 14 29) no Hoare annotation was computed. [2020-07-10 15:29:07,078 INFO L268 CegarLoopResult]: For program point L23-2(lines 23 26) no Hoare annotation was computed. [2020-07-10 15:29:07,078 INFO L264 CegarLoopResult]: At program point L23-3(lines 23 26) the Hoare annotation is: (let ((.cse1 (<= 1 main_~i~0))) (or (and (let ((.cse0 (<= main_~i~0 1))) (or (and .cse0 (<= main_~j~0 (* 2 main_~i~0))) (and .cse0 (<= main_~j~0 (+ main_~k~0 1))))) .cse1) (and (<= 2 main_~n~0) .cse1) (and (<= main_~i~0 0) (<= 0 main_~i~0)))) [2020-07-10 15:29:07,079 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-10 15:29:07,079 INFO L268 CegarLoopResult]: For program point L24-2(lines 24 26) no Hoare annotation was computed. [2020-07-10 15:29:07,079 INFO L264 CegarLoopResult]: At program point L24-3(lines 24 26) the Hoare annotation is: (let ((.cse3 (* 2 main_~i~0))) (let ((.cse4 (<= .cse3 main_~j~0))) (or (and (let ((.cse0 (<= main_~i~0 0)) (.cse1 (<= 0 main_~i~0)) (.cse2 (<= 1 main_~n~0))) (or (and .cse0 .cse1 .cse2 (<= main_~j~0 .cse3)) (and .cse0 .cse1 .cse2 (<= main_~j~0 (+ main_~k~0 1))))) .cse4) (and (< main_~i~0 main_~n~0) (<= 1 main_~i~0) .cse4)))) [2020-07-10 15:29:07,079 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-10 15:29:07,080 INFO L264 CegarLoopResult]: At program point L25-2(lines 25 26) the Hoare annotation is: (and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 15:29:07,080 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-10 15:29:07,080 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 14 29) no Hoare annotation was computed. [2020-07-10 15:29:07,080 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 14 29) the Hoare annotation is: true [2020-07-10 15:29:07,080 INFO L264 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (and (< main_~i~0 main_~n~0) (< main_~j~0 (* 3 main_~i~0)) (<= (+ main_~k~0 1) main_~j~0) (<= (* 2 main_~i~0) main_~j~0)) [2020-07-10 15:29:07,080 INFO L268 CegarLoopResult]: For program point L26-1(lines 25 26) no Hoare annotation was computed. [2020-07-10 15:29:07,081 INFO L268 CegarLoopResult]: For program point L22(line 22) no Hoare annotation was computed. [2020-07-10 15:29:07,081 INFO L268 CegarLoopResult]: For program point L22-1(line 22) no Hoare annotation was computed. [2020-07-10 15:29:07,081 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 15:29:07,081 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:07,081 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-10 15:29:07,081 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed. [2020-07-10 15:29:07,081 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed. [2020-07-10 15:29:07,082 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed. [2020-07-10 15:29:07,087 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:29:07,093 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:29:07,093 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:29:07,093 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:07,093 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:29:07,093 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:07,094 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:07,094 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:29:07,094 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:29:07,094 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2020-07-10 15:29:07,094 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:07,094 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 15:29:07,094 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:29:07,094 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:29:07,095 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-10 15:29:07,095 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:07,095 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 15:29:07,095 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2020-07-10 15:29:07,095 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:07,095 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2020-07-10 15:29:07,095 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation [2020-07-10 15:29:07,096 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:29:07,096 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:29:07,096 WARN L170 areAnnotationChecker]: L21 has no Hoare annotation [2020-07-10 15:29:07,096 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:29:07,096 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:29:07,096 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:29:07,096 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 15:29:07,096 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-10 15:29:07,097 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:29:07,097 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-10 15:29:07,097 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-10 15:29:07,103 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-10 15:29:07,103 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-10 15:29:07,103 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-10 15:29:07,104 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-10 15:29:07,105 WARN L170 areAnnotationChecker]: L23-2 has no Hoare annotation [2020-07-10 15:29:07,105 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:29:07,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:07 BoogieIcfgContainer [2020-07-10 15:29:07,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:29:07,143 INFO L168 Benchmark]: Toolchain (without parser) took 9606.87 ms. Allocated memory was 136.8 MB in the beginning and 314.0 MB in the end (delta: 177.2 MB). Free memory was 101.5 MB in the beginning and 241.1 MB in the end (delta: -139.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:07,143 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 15:29:07,144 INFO L168 Benchmark]: CACSL2BoogieTranslator took 412.94 ms. Allocated memory is still 136.8 MB. Free memory was 101.3 MB in the beginning and 91.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:07,145 INFO L168 Benchmark]: Boogie Preprocessor took 183.17 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 91.1 MB in the beginning and 180.2 MB in the end (delta: -89.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:07,146 INFO L168 Benchmark]: RCFGBuilder took 508.57 ms. Allocated memory is still 201.9 MB. Free memory was 180.2 MB in the beginning and 157.3 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:07,147 INFO L168 Benchmark]: TraceAbstraction took 8494.34 ms. Allocated memory was 201.9 MB in the beginning and 314.0 MB in the end (delta: 112.2 MB). Free memory was 156.6 MB in the beginning and 241.1 MB in the end (delta: -84.5 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:29:07,150 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.35 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 412.94 ms. Allocated memory is still 136.8 MB. Free memory was 101.3 MB in the beginning and 91.1 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 183.17 ms. Allocated memory was 136.8 MB in the beginning and 201.9 MB in the end (delta: 65.0 MB). Free memory was 91.1 MB in the beginning and 180.2 MB in the end (delta: -89.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 508.57 ms. Allocated memory is still 201.9 MB. Free memory was 180.2 MB in the beginning and 157.3 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8494.34 ms. Allocated memory was 201.9 MB in the beginning and 314.0 MB in the end (delta: 112.2 MB). Free memory was 156.6 MB in the beginning and 241.1 MB in the end (delta: -84.5 MB). Peak memory consumption was 27.7 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: 14]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (i < n && j < 3 * i) && 2 * i <= j - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((i <= 1 && j <= 2 * i) || (i <= 1 && j <= k + 1)) && 1 <= i) || (2 <= n && 1 <= i)) || (i <= 0 && 0 <= i) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: (((((i <= 0 && 0 <= i) && 1 <= n) && j <= 2 * i) || (((i <= 0 && 0 <= i) && 1 <= n) && j <= k + 1)) && 2 * i <= j) || ((i < n && 1 <= i) && 2 * i <= j) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 7.9s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 100 SDtfs, 219 SDslu, 177 SDs, 0 SdLazy, 588 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 23 PreInvPairs, 43 NumberOfFragments, 129 HoareAnnotationTreeSize, 23 FomulaSimplifications, 1091 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 176 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 215 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 15510 SizeOfPredicates, 6 NumberOfNonLiveVariables, 120 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 67/88 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...