java -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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-new/nested-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:43:38,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:43:38,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:43:38,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:43:38,743 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:43:38,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:43:38,745 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:43:38,747 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:43:38,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:43:38,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:43:38,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:43:38,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:43:38,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:43:38,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:43:38,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:43:38,755 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:43:38,756 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:43:38,757 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:43:38,758 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:43:38,760 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:43:38,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:43:38,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:43:38,764 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:43:38,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:43:38,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:43:38,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:43:38,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:43:38,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:43:38,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:43:38,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:43:38,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:43:38,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:43:38,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:43:38,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:43:38,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:43:38,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:43:38,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:43:38,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:43:38,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:43:38,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:43:38,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:43:38,776 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 [2019-10-07 13:43:38,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:43:38,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:43:38,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:43:38,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:43:38,792 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:43:38,792 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:43:38,792 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:43:38,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:43:38,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:43:38,793 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:43:38,793 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:43:38,793 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:43:38,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:43:38,794 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:43:38,794 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:43:38,794 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:43:38,794 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:43:38,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:43:38,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:43:38,795 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:43:38,795 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:43:38,795 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:43:38,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:43:38,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:43:38,796 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:43:38,796 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:43:38,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:43:38,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:43:38,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:43:39,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:43:39,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:43:39,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:43:39,103 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:43:39,104 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:43:39,104 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/nested-1.i [2019-10-07 13:43:39,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0eea1e5e/941ca0aa724640b7b8c1a98b0735c468/FLAG4ee442b72 [2019-10-07 13:43:39,631 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:43:39,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested-1.i [2019-10-07 13:43:39,638 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0eea1e5e/941ca0aa724640b7b8c1a98b0735c468/FLAG4ee442b72 [2019-10-07 13:43:40,055 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0eea1e5e/941ca0aa724640b7b8c1a98b0735c468 [2019-10-07 13:43:40,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:43:40,067 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:43:40,068 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:43:40,068 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:43:40,071 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:43:40,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:43:40" (1/1) ... [2019-10-07 13:43:40,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bc8f46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40, skipping insertion in model container [2019-10-07 13:43:40,076 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:43:40" (1/1) ... [2019-10-07 13:43:40,083 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:43:40,099 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:43:40,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:43:40,277 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:43:40,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:43:40,304 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:43:40,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40 WrapperNode [2019-10-07 13:43:40,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:43:40,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:43:40,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:43:40,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:43:40,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40" (1/1) ... [2019-10-07 13:43:40,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40" (1/1) ... [2019-10-07 13:43:40,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40" (1/1) ... [2019-10-07 13:43:40,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40" (1/1) ... [2019-10-07 13:43:40,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40" (1/1) ... [2019-10-07 13:43:40,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40" (1/1) ... [2019-10-07 13:43:40,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40" (1/1) ... [2019-10-07 13:43:40,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:43:40,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:43:40,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:43:40,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:43:40,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40" (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 [2019-10-07 13:43:40,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:43:40,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:43:40,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-07 13:43:40,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:43:40,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:43:40,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:43:40,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:43:40,464 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:43:40,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:43:40,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:43:40,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:43:40,679 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:43:40,679 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-07 13:43:40,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:43:40 BoogieIcfgContainer [2019-10-07 13:43:40,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:43:40,682 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:43:40,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:43:40,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:43:40,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:43:40" (1/3) ... [2019-10-07 13:43:40,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0af46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:43:40, skipping insertion in model container [2019-10-07 13:43:40,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:43:40" (2/3) ... [2019-10-07 13:43:40,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0af46f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:43:40, skipping insertion in model container [2019-10-07 13:43:40,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:43:40" (3/3) ... [2019-10-07 13:43:40,697 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-1.i [2019-10-07 13:43:40,725 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:43:40,742 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:43:40,764 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:43:40,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:43:40,798 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:43:40,799 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:43:40,799 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:43:40,799 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:43:40,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:43:40,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:43:40,799 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:43:40,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-07 13:43:40,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:43:40,819 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:40,819 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:40,821 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:40,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:40,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1228495020, now seen corresponding path program 1 times [2019-10-07 13:43:40,832 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:40,832 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:40,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:40,832 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:40,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:40,988 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:40,989 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:43:40,989 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:43:40,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:43:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:43:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:43:41,017 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 4 states. [2019-10-07 13:43:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:41,093 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-07 13:43:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:43:41,094 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:43:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:41,101 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:43:41,101 INFO L226 Difference]: Without dead ends: 16 [2019-10-07 13:43:41,104 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:43:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-07 13:43:41,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-07 13:43:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-07 13:43:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-07 13:43:41,144 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-10-07 13:43:41,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:41,145 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-07 13:43:41,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:43:41,145 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-07 13:43:41,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:43:41,146 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:41,146 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:41,147 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash 439510219, now seen corresponding path program 1 times [2019-10-07 13:43:41,147 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:41,148 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:41,148 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:41,148 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:41,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:41,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:41,185 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:41,186 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:43:41,186 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:43:41,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:43:41,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:43:41,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:43:41,189 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2019-10-07 13:43:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:41,219 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-10-07 13:43:41,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:43:41,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:43:41,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:41,221 INFO L225 Difference]: With dead ends: 23 [2019-10-07 13:43:41,222 INFO L226 Difference]: Without dead ends: 16 [2019-10-07 13:43:41,223 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:43:41,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-07 13:43:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-07 13:43:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-07 13:43:41,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-07 13:43:41,229 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-10-07 13:43:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:41,230 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-07 13:43:41,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:43:41,230 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-07 13:43:41,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:43:41,231 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:41,231 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:41,231 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:41,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:41,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1862123311, now seen corresponding path program 1 times [2019-10-07 13:43:41,232 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:41,232 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:41,232 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:41,233 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:41,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:41,333 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:41,334 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:41,334 INFO L95 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 [2019-10-07 13:43:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:41,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 13:43:41,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:41,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:41,478 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:41,543 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:41,579 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 13:43:41,579 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:41,606 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:41,623 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:41,624 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:41,682 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:43:42,386 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:43:42,410 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:43:42,416 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:42,417 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:42,417 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 200#true [2019-10-07 13:43:42,425 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 177#(and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~i~0) (<= 10 main_~n~0)) [2019-10-07 13:43:42,425 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 149#(and (or (and (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (= main_~k~0 0) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (= main_~i~0 0)) (and (<= 0 main_~j~0) (not (< main_~j~0 main_~m~0)) (<= 1 main_~i~0))) (or (and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~n~0)) (and (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~k~0 0) (<= main_~i~0 0) (<= main_~m~0 10000) (<= 10 main_~n~0)))) [2019-10-07 13:43:42,426 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 186#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:42,426 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 38#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647)) [2019-10-07 13:43:42,426 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 144#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~m~0 10000) (<= 10 main_~n~0)) [2019-10-07 13:43:42,427 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 43#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (<= main_~n~0 10000) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647) (<= 10 main_~n~0)) [2019-10-07 13:43:42,427 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:43:42,427 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:43:42,427 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 205#true [2019-10-07 13:43:42,428 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:42,428 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 191#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:42,429 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 181#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| 1))) [2019-10-07 13:43:42,429 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 196#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:42,797 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:42,797 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 10] total 20 [2019-10-07 13:43:42,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-07 13:43:42,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-07 13:43:42,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2019-10-07 13:43:42,802 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 20 states. [2019-10-07 13:43:43,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:43,430 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2019-10-07 13:43:43,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 13:43:43,431 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-10-07 13:43:43,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:43,432 INFO L225 Difference]: With dead ends: 32 [2019-10-07 13:43:43,432 INFO L226 Difference]: Without dead ends: 24 [2019-10-07 13:43:43,435 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=195, Invalid=797, Unknown=0, NotChecked=0, Total=992 [2019-10-07 13:43:43,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-07 13:43:43,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-10-07 13:43:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-07 13:43:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-07 13:43:43,446 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2019-10-07 13:43:43,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:43,447 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-07 13:43:43,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-07 13:43:43,447 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-07 13:43:43,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:43:43,448 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:43,449 INFO L385 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:43,655 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:43,655 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:43,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:43,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1028404811, now seen corresponding path program 2 times [2019-10-07 13:43:43,656 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:43,657 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:43,657 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:43,657 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:43,792 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:43,792 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:43,792 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:43,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2019-10-07 13:43:43,836 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-07 13:43:43,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:43:43,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-07 13:43:43,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:43,878 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 13:43:43,878 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:43,924 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-07 13:43:43,925 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:43,926 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 13:43:43,927 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:43,927 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:43,929 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:43,929 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:43,948 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:43:44,259 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:43:44,274 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:43:44,277 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:44,277 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:44,277 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 200#true [2019-10-07 13:43:44,277 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 177#(and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~i~0) (<= 10 main_~n~0)) [2019-10-07 13:43:44,278 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 149#(and (or (and (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (= main_~k~0 0) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (= main_~i~0 0)) (and (<= 0 main_~j~0) (not (< main_~j~0 main_~m~0)) (<= 1 main_~i~0))) (or (and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~n~0)) (and (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~k~0 0) (<= main_~i~0 0) (<= main_~m~0 10000) (<= 10 main_~n~0)))) [2019-10-07 13:43:44,278 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 186#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:44,278 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 38#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647)) [2019-10-07 13:43:44,278 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 144#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~m~0 10000) (<= 10 main_~n~0)) [2019-10-07 13:43:44,279 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 43#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (<= main_~n~0 10000) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647) (<= 10 main_~n~0)) [2019-10-07 13:43:44,279 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:43:44,279 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:43:44,279 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 205#true [2019-10-07 13:43:44,279 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:44,280 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 191#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:44,280 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 181#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:43:44,280 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 196#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:44,617 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:44,617 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 9] total 23 [2019-10-07 13:43:44,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-07 13:43:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-07 13:43:44,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-10-07 13:43:44,619 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 23 states. [2019-10-07 13:43:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:46,766 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2019-10-07 13:43:46,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-07 13:43:46,767 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2019-10-07 13:43:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:46,768 INFO L225 Difference]: With dead ends: 64 [2019-10-07 13:43:46,768 INFO L226 Difference]: Without dead ends: 59 [2019-10-07 13:43:46,771 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=804, Invalid=3102, Unknown=0, NotChecked=0, Total=3906 [2019-10-07 13:43:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-07 13:43:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2019-10-07 13:43:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-07 13:43:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-10-07 13:43:46,794 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 18 [2019-10-07 13:43:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:46,794 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-10-07 13:43:46,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-07 13:43:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-10-07 13:43:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-07 13:43:46,796 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:46,797 INFO L385 BasicCegarLoop]: trace histogram [17, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:47,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:47,005 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:47,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:47,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2137855798, now seen corresponding path program 3 times [2019-10-07 13:43:47,007 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:47,007 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:47,008 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:47,008 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:47,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:43:47,478 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:47,479 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:47,479 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:47,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-07 13:43:47,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-07 13:43:47,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:43:47,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 40 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-07 13:43:47,791 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 127 proven. 45 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-07 13:43:48,052 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:48,053 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 13:43:48,054 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:48,054 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:48,055 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:48,055 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:48,086 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:43:48,302 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:43:48,313 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:43:48,315 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:48,315 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:48,315 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 200#true [2019-10-07 13:43:48,315 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 177#(and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~i~0) (<= 10 main_~n~0)) [2019-10-07 13:43:48,316 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 149#(and (or (and (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (= main_~k~0 0) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (= main_~i~0 0)) (and (<= 0 main_~j~0) (not (< main_~j~0 main_~m~0)) (<= 1 main_~i~0))) (or (and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~n~0)) (and (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~k~0 0) (<= main_~i~0 0) (<= main_~m~0 10000) (<= 10 main_~n~0)))) [2019-10-07 13:43:48,316 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 186#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:48,316 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 144#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~m~0 10000) (<= 10 main_~n~0)) [2019-10-07 13:43:48,316 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 38#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647)) [2019-10-07 13:43:48,317 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 43#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (<= main_~n~0 10000) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647) (<= 10 main_~n~0)) [2019-10-07 13:43:48,317 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:43:48,317 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:43:48,317 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 205#true [2019-10-07 13:43:48,317 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:48,318 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 191#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:48,318 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 181#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:43:48,318 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 196#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:48,791 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:48,791 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13, 13, 9] total 53 [2019-10-07 13:43:48,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-07 13:43:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-07 13:43:48,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2540, Unknown=0, NotChecked=0, Total=2756 [2019-10-07 13:43:48,794 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 53 states. [2019-10-07 13:43:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:50,700 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2019-10-07 13:43:50,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-07 13:43:50,701 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 37 [2019-10-07 13:43:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:50,702 INFO L225 Difference]: With dead ends: 98 [2019-10-07 13:43:50,702 INFO L226 Difference]: Without dead ends: 61 [2019-10-07 13:43:50,705 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=669, Invalid=5337, Unknown=0, NotChecked=0, Total=6006 [2019-10-07 13:43:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-07 13:43:50,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-07 13:43:50,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-07 13:43:50,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-10-07 13:43:50,719 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 37 [2019-10-07 13:43:50,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:50,719 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-10-07 13:43:50,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-07 13:43:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-10-07 13:43:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-07 13:43:50,721 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:50,721 INFO L385 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:50,924 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:50,925 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1178038992, now seen corresponding path program 4 times [2019-10-07 13:43:50,926 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:50,926 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:50,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:50,926 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-07 13:43:51,070 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:51,071 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:43:51,071 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:51,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-07 13:43:51,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:43:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-07 13:43:51,235 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:43:51,306 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-07 13:43:51,306 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:43:51,307 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-07 13:43:51,307 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:43:51,308 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:43:51,308 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:43:51,308 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:43:51,317 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-07 13:43:51,516 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-07 13:43:51,525 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-07 13:43:51,527 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:43:51,527 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:43:51,527 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 200#true [2019-10-07 13:43:51,528 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 177#(and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~i~0) (<= 10 main_~n~0)) [2019-10-07 13:43:51,528 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 149#(and (or (and (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (= main_~k~0 0) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (= main_~i~0 0)) (and (<= 0 main_~j~0) (not (< main_~j~0 main_~m~0)) (<= 1 main_~i~0))) (or (and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~n~0)) (and (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~k~0 0) (<= main_~i~0 0) (<= main_~m~0 10000) (<= 10 main_~n~0)))) [2019-10-07 13:43:51,528 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 186#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-07 13:43:51,528 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 144#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~m~0 10000) (<= 10 main_~n~0)) [2019-10-07 13:43:51,528 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 38#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647)) [2019-10-07 13:43:51,529 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 43#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (<= main_~n~0 10000) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647) (<= 10 main_~n~0)) [2019-10-07 13:43:51,529 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-07 13:43:51,529 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-07 13:43:51,530 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 205#true [2019-10-07 13:43:51,530 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:43:51,531 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 191#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:51,534 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 181#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-07 13:43:51,535 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 196#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-07 13:43:51,806 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:43:51,806 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 9] total 27 [2019-10-07 13:43:51,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-07 13:43:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-07 13:43:51,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-10-07 13:43:51,808 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 27 states. [2019-10-07 13:43:52,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:52,969 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2019-10-07 13:43:52,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-07 13:43:52,970 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2019-10-07 13:43:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:52,973 INFO L225 Difference]: With dead ends: 138 [2019-10-07 13:43:52,973 INFO L226 Difference]: Without dead ends: 133 [2019-10-07 13:43:52,974 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=614, Invalid=1836, Unknown=0, NotChecked=0, Total=2450 [2019-10-07 13:43:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-07 13:43:52,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-07 13:43:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-07 13:43:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2019-10-07 13:43:52,997 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 60 [2019-10-07 13:43:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:52,998 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2019-10-07 13:43:52,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-07 13:43:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2019-10-07 13:43:53,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-07 13:43:53,000 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:43:53,000 INFO L385 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:43:53,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:43:53,204 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:43:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:43:53,205 INFO L82 PathProgramCache]: Analyzing trace with hash 259705594, now seen corresponding path program 5 times [2019-10-07 13:43:53,205 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:43:53,205 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:53,205 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:53,206 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:43:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:43:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:43:57,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-07 13:43:57,687 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:43:57,687 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:43:57,687 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2019-10-07 13:43:57,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-10-07 13:43:57,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-10-07 13:43:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=5663, Unknown=0, NotChecked=0, Total=10920 [2019-10-07 13:43:57,693 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 105 states. [2019-10-07 13:43:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:43:58,984 INFO L93 Difference]: Finished difference Result 5128 states and 5588 transitions. [2019-10-07 13:43:58,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-07 13:43:58,984 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 132 [2019-10-07 13:43:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:43:58,985 INFO L225 Difference]: With dead ends: 5128 [2019-10-07 13:43:58,985 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:43:59,000 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2019-10-07 13:43:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:43:59,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:43:59,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:43:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:43:59,001 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2019-10-07 13:43:59,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:43:59,001 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:43:59,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-10-07 13:43:59,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:43:59,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:43:59,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:44:01,352 WARN L191 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 693 DAG size of output: 692 [2019-10-07 13:45:36,441 WARN L191 SmtUtils]: Spent 1.58 m on a formula simplification. DAG size of input: 4951 DAG size of output: 2485 [2019-10-07 13:45:44,627 WARN L191 SmtUtils]: Spent 8.15 s on a formula simplification. DAG size of input: 692 DAG size of output: 68 [2019-10-07 13:48:06,783 WARN L191 SmtUtils]: Spent 2.37 m on a formula simplification. DAG size of input: 2479 DAG size of output: 360 [2019-10-07 13:48:06,787 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:48:06,787 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:48:06,787 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:48:06,787 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:48:06,787 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:48:06,787 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:48:06,787 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 24) no Hoare annotation was computed. [2019-10-07 13:48:06,788 INFO L443 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-10-07 13:48:06,788 INFO L439 ceAbstractionStarter]: At program point L17-3(lines 17 21) the Hoare annotation is: (let ((.cse5 (= main_~i~0 0))) (let ((.cse0 (<= 10 main_~m~0)) (.cse1 (<= main_~n~0 10000)) (.cse2 (<= main_~m~0 10000)) (.cse3 (<= 10 main_~n~0)) (.cse4 (or (and (<= 1 main_~i~0) (<= main_~m~0 main_~j~0)) (and (<= main_~k~0 0) .cse5)))) (or (and (<= 80 main_~k~0) .cse0 (< (+ main_~i~0 1) main_~n~0) .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 10 main_~k~0) (<= main_~i~0 1) .cse2 .cse3 .cse4) (and .cse0 (<= 20 main_~k~0) .cse1 (<= main_~i~0 2) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 60 main_~k~0) .cse2 .cse3 (< (+ main_~i~0 3) main_~n~0) .cse4) (and .cse0 .cse1 (<= 100 main_~k~0) .cse2 .cse3 .cse4) (and (<= 30 main_~k~0) (<= main_~i~0 3) .cse0 .cse1 .cse2 .cse3 .cse4) (and (<= 50 main_~k~0) .cse0 .cse1 (< (+ main_~i~0 4) main_~n~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 (< main_~i~0 main_~n~0) .cse2 .cse3 (<= 90 main_~k~0) .cse4) (and .cse0 .cse1 (= main_~k~0 0) .cse2 .cse3 .cse5) (and (<= 70 main_~k~0) .cse0 .cse1 (< (+ main_~i~0 2) main_~n~0) .cse2 .cse3 .cse4) (and .cse0 (<= 40 main_~k~0) .cse1 (<= main_~i~0 4) .cse2 .cse3 .cse4)))) [2019-10-07 13:48:06,788 INFO L439 ceAbstractionStarter]: At program point L17-4(lines 17 21) the Hoare annotation is: (and (<= 10 main_~m~0) (<= main_~m~0 main_~j~0) (<= main_~n~0 10000) (<= 100 main_~k~0) (<= main_~m~0 10000) (<= 10 main_~n~0) (<= 10 main_~i~0)) [2019-10-07 13:48:06,788 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 24) no Hoare annotation was computed. [2019-10-07 13:48:06,789 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 24) the Hoare annotation is: true [2019-10-07 13:48:06,789 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-10-07 13:48:06,789 INFO L443 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-10-07 13:48:06,790 INFO L439 ceAbstractionStarter]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse27 (<= 30 main_~k~0)) (.cse33 (<= 70 main_~k~0)) (.cse35 (<= 80 main_~k~0)) (.cse13 (< (+ main_~j~0 2) main_~m~0)) (.cse26 (< (+ main_~j~0 3) main_~m~0)) (.cse34 (<= 20 main_~k~0)) (.cse22 (<= main_~j~0 3)) (.cse23 (<= 3 main_~j~0)) (.cse29 (<= 50 main_~k~0)) (.cse2 (<= main_~j~0 1)) (.cse4 (<= 1 main_~j~0)) (.cse20 (< (+ main_~i~0 2) main_~n~0)) (.cse36 (<= 40 main_~k~0)) (.cse30 (<= 10 main_~k~0)) (.cse24 (<= 90 main_~k~0)) (.cse19 (<= main_~i~0 3)) (.cse37 (<= 60 main_~k~0)) (.cse25 (< main_~i~0 main_~n~0)) (.cse28 (<= main_~j~0 0)) (.cse31 (<= main_~i~0 4)) (.cse32 (< (+ main_~j~0 4) main_~m~0)) (.cse14 (< (+ main_~i~0 3) main_~n~0)) (.cse15 (<= 0 main_~j~0)) (.cse10 (<= main_~i~0 2)) (.cse12 (<= main_~j~0 2)) (.cse16 (< (+ main_~i~0 1) main_~n~0)) (.cse17 (< main_~j~0 main_~m~0)) (.cse21 (<= main_~i~0 1)) (.cse5 (< (+ main_~i~0 4) main_~n~0)) (.cse18 (<= main_~j~0 4)) (.cse8 (<= 4 main_~j~0)) (.cse0 (<= 0 main_~i~0)) (.cse1 (<= 10 main_~m~0)) (.cse3 (<= main_~n~0 10000)) (.cse9 (< (+ main_~j~0 1) main_~m~0)) (.cse6 (<= main_~m~0 10000)) (.cse11 (<= main_~i~0 0)) (.cse7 (<= 10 main_~n~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 51 main_~k~0) .cse7) (and .cse8 (<= 28 main_~k~0) .cse0 .cse1 .cse3 .cse9 .cse10 .cse6 .cse7) (and (<= 2 main_~j~0) .cse0 (<= 2 main_~k~0) .cse1 .cse3 .cse11 .cse6 .cse12 .cse7) (and (<= 67 main_~k~0) .cse8 .cse0 .cse1 .cse3 .cse13 .cse6 .cse7 .cse14) (and .cse15 .cse0 .cse16 .cse1 .cse3 .cse6 (<= 82 main_~k~0) .cse12 .cse7) (and .cse17 .cse8 .cse0 (<= 59 main_~k~0) .cse1 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse10 .cse18 .cse6 .cse7 (<= 24 main_~k~0)) (and (<= 37 main_~k~0) .cse19 .cse8 .cse0 .cse1 .cse3 .cse13 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse9 (<= 78 main_~k~0) .cse20 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse9 (<= 18 main_~k~0) .cse21 .cse6 .cse7) (and .cse0 .cse1 .cse22 .cse3 .cse10 .cse6 (<= 23 main_~k~0) .cse23 .cse7) (and .cse8 .cse0 .cse16 .cse1 .cse3 .cse6 .cse7 .cse24) (and (<= 99 main_~k~0) .cse17 .cse8 .cse0 .cse1 .cse3 .cse25 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse5 .cse13 .cse6 .cse7 (<= 57 main_~k~0)) (and .cse0 .cse1 .cse22 .cse3 .cse20 .cse6 .cse23 .cse7 (<= 73 main_~k~0)) (and (<= 16 main_~k~0) .cse8 .cse0 .cse1 .cse3 .cse21 .cse6 .cse26 .cse7) (and .cse27 .cse15 .cse19 .cse0 .cse1 .cse3 .cse6 .cse28 .cse7) (and (<= 14 main_~k~0) .cse8 .cse0 .cse1 .cse3 .cse21 .cse18 .cse6 .cse7) (and .cse0 .cse1 .cse22 .cse3 .cse25 (<= 93 main_~k~0) .cse23 .cse6 .cse7) (and .cse19 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= 31 main_~k~0)) (and .cse8 .cse0 .cse1 (<= 96 main_~k~0) .cse3 .cse25 .cse6 .cse26 .cse7) (and .cse15 .cse0 .cse1 .cse3 .cse25 (<= 92 main_~k~0) .cse12 .cse6 .cse7) (and .cse8 .cse0 (<= 74 main_~k~0) .cse1 .cse3 .cse18 .cse20 .cse6 .cse7) (and .cse8 .cse0 (<= 6 main_~k~0) .cse1 .cse3 .cse6 .cse11 .cse26 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse20 .cse6 .cse26 .cse7 (<= 76 main_~k~0)) (and .cse15 .cse29 .cse0 .cse1 .cse3 .cse5 .cse6 .cse28 .cse7) (and .cse15 .cse0 .cse1 .cse3 (<= 12 main_~k~0) .cse6 .cse21 .cse12 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse30 .cse6 .cse11 .cse7) (and .cse8 .cse0 .cse16 .cse1 .cse3 .cse9 .cse6 .cse7 (<= 88 main_~k~0)) (and .cse17 .cse8 .cse0 .cse1 .cse3 .cse31 .cse6 (<= 49 main_~k~0) .cse7) (and .cse8 .cse0 .cse1 .cse3 (<= 7 main_~k~0) .cse13 .cse6 .cse11 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse13 .cse20 .cse6 (<= 77 main_~k~0) .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse10 .cse13 .cse6 .cse7 (<= 27 main_~k~0)) (and .cse8 .cse0 .cse1 .cse3 .cse25 .cse18 .cse6 (<= 94 main_~k~0) .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse9 .cse31 (<= 48 main_~k~0) .cse6 .cse7) (and .cse0 .cse1 (<= 91 main_~k~0) .cse2 .cse3 .cse25 .cse4 .cse6 .cse7) (and .cse27 .cse8 .cse0 .cse1 .cse3 .cse10 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse9 (<= 68 main_~k~0) .cse6 .cse7 .cse14) (and .cse19 .cse8 .cse0 .cse1 .cse3 (<= 36 main_~k~0) .cse6 .cse26 .cse7) (and .cse15 .cse0 .cse1 .cse3 (<= 32 main_~k~0) .cse6 .cse19 .cse12 .cse7) (and .cse8 .cse0 .cse16 .cse1 (<= 86 main_~k~0) .cse3 .cse6 .cse26 .cse7) (and .cse0 .cse1 .cse22 .cse3 .cse6 .cse31 (<= 43 main_~k~0) .cse23 .cse7) (and .cse17 .cse19 .cse8 .cse0 .cse1 .cse3 (<= 39 main_~k~0) .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 (<= 15 main_~k~0) .cse21 .cse32 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 (<= 61 main_~k~0) .cse7 .cse14) (and (<= 58 main_~k~0) .cse8 .cse0 .cse1 .cse3 .cse9 .cse5 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse3 .cse20 .cse6 (<= 72 main_~k~0) .cse12 .cse7) (and .cse15 .cse33 .cse0 .cse1 .cse3 .cse20 .cse6 .cse28 .cse7) (and .cse17 .cse8 .cse0 .cse1 .cse3 (<= 9 main_~k~0) .cse6 .cse11 .cse7) (and .cse8 .cse0 .cse1 .cse34 .cse3 .cse21 .cse6 .cse7) (and .cse8 .cse0 (<= 26 main_~k~0) .cse1 .cse3 .cse10 .cse6 .cse26 .cse7) (and .cse35 .cse8 .cse0 .cse1 .cse3 .cse20 .cse6 .cse7) (and .cse8 .cse0 (<= 75 main_~k~0) .cse1 .cse3 .cse32 .cse20 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 (<= 1 main_~k~0)) (and .cse8 .cse0 (<= 66 main_~k~0) .cse1 .cse3 .cse6 .cse26 .cse7 .cse14) (and .cse0 .cse1 .cse22 .cse3 .cse11 .cse6 (<= 3 main_~k~0) .cse23 .cse7) (and .cse0 .cse1 .cse22 .cse3 .cse6 (<= 63 main_~k~0) .cse23 .cse7 .cse14) (and .cse8 .cse0 .cse1 .cse3 .cse31 .cse13 (<= 47 main_~k~0) .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse25 (<= 97 main_~k~0) .cse13 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse3 (<= 42 main_~k~0) .cse6 .cse31 .cse12 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse5 (<= 55 main_~k~0) .cse32 .cse6 .cse7) (and (<= 69 main_~k~0) .cse17 .cse8 .cse0 .cse1 .cse3 .cse6 .cse7 .cse14) (and .cse8 .cse0 .cse1 .cse3 .cse31 .cse18 (<= 44 main_~k~0) .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse21 .cse13 (<= 17 main_~k~0) .cse6 .cse7) (and .cse33 .cse8 .cse0 .cse1 .cse3 .cse6 .cse7 .cse14) (and .cse35 .cse15 .cse0 .cse1 .cse16 .cse3 .cse6 .cse28 .cse7) (and .cse8 .cse0 .cse1 (<= 95 main_~k~0) .cse3 .cse25 .cse32 .cse6 .cse7) (and .cse17 .cse8 .cse0 .cse1 .cse3 .cse20 .cse6 (<= 79 main_~k~0) .cse7) (and .cse0 .cse1 .cse22 .cse3 (<= 13 main_~k~0) .cse6 .cse21 .cse23 .cse7) (and .cse0 .cse16 .cse1 .cse2 .cse3 .cse4 (<= 81 main_~k~0) .cse6 .cse7) (and .cse0 .cse1 .cse22 .cse3 .cse6 (<= 53 main_~k~0) .cse5 .cse23 .cse7) (and .cse8 .cse0 .cse16 .cse1 .cse3 .cse13 .cse6 (<= 87 main_~k~0) .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse31 (<= 46 main_~k~0) .cse6 .cse26 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse31 (<= 41 main_~k~0) .cse6 .cse7) (and .cse0 .cse16 .cse1 .cse22 .cse3 .cse6 (<= 83 main_~k~0) .cse23 .cse7) (and .cse8 .cse0 .cse16 .cse1 .cse3 (<= 85 main_~k~0) .cse32 .cse6 .cse7) (and .cse0 (<= 11 main_~k~0) .cse1 .cse2 .cse3 .cse4 .cse21 .cse6 .cse7) (and .cse0 (<= 21 main_~k~0) .cse1 .cse2 .cse3 .cse10 .cse4 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse32 .cse6 .cse11 (<= 5 main_~k~0) .cse7) (and .cse8 .cse0 .cse1 .cse3 (<= 56 main_~k~0) .cse5 .cse6 .cse26 .cse7) (and .cse15 .cse0 .cse1 .cse36 .cse3 .cse31 .cse6 .cse28 .cse7) (and .cse15 .cse0 .cse1 .cse34 .cse3 .cse10 .cse6 .cse28 .cse7) (and .cse8 .cse0 .cse1 .cse3 (<= 25 main_~k~0) .cse10 .cse32 .cse6 .cse7) (and (<= 33 main_~k~0) .cse0 .cse1 .cse22 .cse3 .cse6 .cse19 .cse23 .cse7) (and .cse8 .cse29 .cse0 .cse1 .cse3 .cse31 .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse3 .cse37 .cse6 .cse28 .cse7 .cse14) (and .cse19 .cse8 .cse0 .cse1 .cse3 (<= 35 main_~k~0) .cse32 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 71 main_~k~0) .cse20 .cse6 .cse7) (and .cse19 .cse8 .cse0 .cse1 .cse36 .cse3 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 (<= 64 main_~k~0) .cse18 .cse6 .cse7 .cse14) (and .cse15 .cse0 .cse1 .cse3 .cse30 .cse21 .cse6 .cse28 .cse7) (and .cse15 .cse0 .cse1 .cse3 (<= 62 main_~k~0) .cse6 .cse12 .cse7 .cse14) (and .cse15 .cse0 .cse1 .cse3 .cse25 .cse6 .cse28 .cse7 .cse24) (and .cse19 .cse8 .cse0 .cse1 .cse3 .cse18 (<= 34 main_~k~0) .cse6 .cse7) (and .cse15 .cse0 .cse1 .cse3 (<= 52 main_~k~0) .cse6 .cse5 .cse12 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse25 (<= 100 main_~k~0) .cse6 .cse7) (and .cse19 .cse8 .cse0 .cse1 .cse3 .cse9 (<= 38 main_~k~0) .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse37 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse25 .cse9 (<= 98 main_~k~0) .cse6 .cse7) (and .cse15 .cse3 .cse6 (<= (+ main_~j~0 10) main_~m~0) (= main_~k~0 0) .cse28 .cse7 (= main_~i~0 0)) (and .cse17 .cse8 .cse0 .cse1 .cse3 (<= 29 main_~k~0) .cse10 .cse6 .cse7) (and .cse17 (<= 89 main_~k~0) .cse8 .cse0 .cse16 .cse1 .cse3 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse6 .cse11 .cse18 (<= 4 main_~k~0) .cse7) (and .cse8 .cse0 .cse1 .cse3 (<= 45 main_~k~0) .cse31 .cse32 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 (<= 65 main_~k~0) .cse32 .cse6 .cse7 .cse14) (and .cse15 .cse0 .cse1 (<= 22 main_~k~0) .cse3 .cse10 .cse6 .cse12 .cse7) (and .cse8 .cse0 .cse16 .cse1 .cse3 (<= 84 main_~k~0) .cse18 .cse6 .cse7) (and .cse17 .cse8 .cse0 .cse1 .cse3 .cse21 .cse6 .cse7 (<= 19 main_~k~0)) (and (<= 54 main_~k~0) .cse8 .cse0 .cse1 .cse3 .cse5 .cse18 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse9 (<= 8 main_~k~0) .cse6 .cse11 .cse7))) [2019-10-07 13:48:06,790 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-07 13:48:06,790 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:48:06,790 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-07 13:48:06,790 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-07 13:48:06,791 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-07 13:48:06,791 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-07 13:48:06,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:48:06 BoogieIcfgContainer [2019-10-07 13:48:06,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:48:06,872 INFO L168 Benchmark]: Toolchain (without parser) took 266803.44 ms. Allocated memory was 137.4 MB in the beginning and 613.9 MB in the end (delta: 476.6 MB). Free memory was 102.5 MB in the beginning and 237.1 MB in the end (delta: -134.5 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-10-07 13:48:06,876 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:48:06,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.35 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 92.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-10-07 13:48:06,878 INFO L168 Benchmark]: Boogie Preprocessor took 108.53 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.8 MB in the beginning and 179.1 MB in the end (delta: -86.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:48:06,878 INFO L168 Benchmark]: RCFGBuilder took 266.49 ms. Allocated memory is still 200.8 MB. Free memory was 179.1 MB in the beginning and 164.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:48:06,879 INFO L168 Benchmark]: TraceAbstraction took 266186.41 ms. Allocated memory was 200.8 MB in the beginning and 613.9 MB in the end (delta: 413.1 MB). Free memory was 164.8 MB in the beginning and 237.1 MB in the end (delta: -72.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. [2019-10-07 13:48:06,890 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 237.35 ms. Allocated memory is still 137.4 MB. Free memory was 102.3 MB in the beginning and 92.8 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.53 ms. Allocated memory was 137.4 MB in the beginning and 200.8 MB in the end (delta: 63.4 MB). Free memory was 92.8 MB in the beginning and 179.1 MB in the end (delta: -86.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 266.49 ms. Allocated memory is still 200.8 MB. Free memory was 179.1 MB in the beginning and 164.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 266186.41 ms. Allocated memory was 200.8 MB in the beginning and 613.9 MB in the end (delta: 413.1 MB). Free memory was 164.8 MB in the beginning and 237.1 MB in the end (delta: -72.2 MB). Peak memory consumption was 2.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: (((((((((((((((80 <= k && 10 <= m) && i + 1 < n) && n <= 10000) && m <= 10000) && 10 <= n) && ((1 <= i && m <= j) || (k <= 0 && i == 0))) || ((((((10 <= m && n <= 10000) && 10 <= k) && i <= 1) && m <= 10000) && 10 <= n) && ((1 <= i && m <= j) || (k <= 0 && i == 0)))) || ((((((10 <= m && 20 <= k) && n <= 10000) && i <= 2) && m <= 10000) && 10 <= n) && ((1 <= i && m <= j) || (k <= 0 && i == 0)))) || ((((((10 <= m && n <= 10000) && 60 <= k) && m <= 10000) && 10 <= n) && i + 3 < n) && ((1 <= i && m <= j) || (k <= 0 && i == 0)))) || (((((10 <= m && n <= 10000) && 100 <= k) && m <= 10000) && 10 <= n) && ((1 <= i && m <= j) || (k <= 0 && i == 0)))) || ((((((30 <= k && i <= 3) && 10 <= m) && n <= 10000) && m <= 10000) && 10 <= n) && ((1 <= i && m <= j) || (k <= 0 && i == 0)))) || ((((((50 <= k && 10 <= m) && n <= 10000) && i + 4 < n) && m <= 10000) && 10 <= n) && ((1 <= i && m <= j) || (k <= 0 && i == 0)))) || ((((((10 <= m && n <= 10000) && i < n) && m <= 10000) && 10 <= n) && 90 <= k) && ((1 <= i && m <= j) || (k <= 0 && i == 0)))) || (((((10 <= m && n <= 10000) && k == 0) && m <= 10000) && 10 <= n) && i == 0)) || ((((((70 <= k && 10 <= m) && n <= 10000) && i + 2 < n) && m <= 10000) && 10 <= n) && ((1 <= i && m <= j) || (k <= 0 && i == 0)))) || ((((((10 <= m && 40 <= k) && n <= 10000) && i <= 4) && m <= 10000) && 10 <= n) && ((1 <= i && m <= j) || (k <= 0 && i == 0))) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= i && 10 <= m) && j <= 1) && n <= 10000) && 1 <= j) && i + 4 < n) && m <= 10000) && 51 <= k) && 10 <= n) || ((((((((4 <= j && 28 <= k) && 0 <= i) && 10 <= m) && n <= 10000) && j + 1 < m) && i <= 2) && m <= 10000) && 10 <= n)) || ((((((((2 <= j && 0 <= i) && 2 <= k) && 10 <= m) && n <= 10000) && i <= 0) && m <= 10000) && j <= 2) && 10 <= n)) || ((((((((67 <= k && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && j + 2 < m) && m <= 10000) && 10 <= n) && i + 3 < n)) || ((((((((0 <= j && 0 <= i) && i + 1 < n) && 10 <= m) && n <= 10000) && m <= 10000) && 82 <= k) && j <= 2) && 10 <= n)) || ((((((((j < m && 4 <= j) && 0 <= i) && 59 <= k) && 10 <= m) && n <= 10000) && i + 4 < n) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i <= 2) && j <= 4) && m <= 10000) && 10 <= n) && 24 <= k)) || ((((((((37 <= k && i <= 3) && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && j + 2 < m) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && j + 1 < m) && 78 <= k) && i + 2 < n) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && j + 1 < m) && 18 <= k) && i <= 1) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 3) && n <= 10000) && i <= 2) && m <= 10000) && 23 <= k) && 3 <= j) && 10 <= n)) || (((((((4 <= j && 0 <= i) && i + 1 < n) && 10 <= m) && n <= 10000) && m <= 10000) && 10 <= n) && 90 <= k)) || ((((((((99 <= k && j < m) && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && i < n) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i + 4 < n) && j + 2 < m) && m <= 10000) && 10 <= n) && 57 <= k)) || ((((((((0 <= i && 10 <= m) && j <= 3) && n <= 10000) && i + 2 < n) && m <= 10000) && 3 <= j) && 10 <= n) && 73 <= k)) || ((((((((16 <= k && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && i <= 1) && m <= 10000) && j + 3 < m) && 10 <= n)) || ((((((((30 <= k && 0 <= j) && i <= 3) && 0 <= i) && 10 <= m) && n <= 10000) && m <= 10000) && j <= 0) && 10 <= n)) || ((((((((14 <= k && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && i <= 1) && j <= 4) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 3) && n <= 10000) && i < n) && 93 <= k) && 3 <= j) && m <= 10000) && 10 <= n)) || ((((((((i <= 3 && 0 <= i) && 10 <= m) && j <= 1) && n <= 10000) && 1 <= j) && m <= 10000) && 10 <= n) && 31 <= k)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && 96 <= k) && n <= 10000) && i < n) && m <= 10000) && j + 3 < m) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i < n) && 92 <= k) && j <= 2) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 74 <= k) && 10 <= m) && n <= 10000) && j <= 4) && i + 2 < n) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 6 <= k) && 10 <= m) && n <= 10000) && m <= 10000) && i <= 0) && j + 3 < m) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i + 2 < n) && m <= 10000) && j + 3 < m) && 10 <= n) && 76 <= k)) || ((((((((0 <= j && 50 <= k) && 0 <= i) && 10 <= m) && n <= 10000) && i + 4 < n) && m <= 10000) && j <= 0) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 12 <= k) && m <= 10000) && i <= 1) && j <= 2) && 10 <= n)) || (((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 10 <= k) && m <= 10000) && i <= 0) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && i + 1 < n) && 10 <= m) && n <= 10000) && j + 1 < m) && m <= 10000) && 10 <= n) && 88 <= k)) || ((((((((j < m && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && i <= 4) && m <= 10000) && 49 <= k) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 7 <= k) && j + 2 < m) && m <= 10000) && i <= 0) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && j + 2 < m) && i + 2 < n) && m <= 10000) && 77 <= k) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i <= 2) && j + 2 < m) && m <= 10000) && 10 <= n) && 27 <= k)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i < n) && j <= 4) && m <= 10000) && 94 <= k) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && j + 1 < m) && i <= 4) && 48 <= k) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && 91 <= k) && j <= 1) && n <= 10000) && i < n) && 1 <= j) && m <= 10000) && 10 <= n)) || (((((((30 <= k && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && i <= 2) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && j + 1 < m) && 68 <= k) && m <= 10000) && 10 <= n) && i + 3 < n)) || ((((((((i <= 3 && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && 36 <= k) && m <= 10000) && j + 3 < m) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 32 <= k) && m <= 10000) && i <= 3) && j <= 2) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && i + 1 < n) && 10 <= m) && 86 <= k) && n <= 10000) && m <= 10000) && j + 3 < m) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 3) && n <= 10000) && m <= 10000) && i <= 4) && 43 <= k) && 3 <= j) && 10 <= n)) || ((((((((j < m && i <= 3) && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && 39 <= k) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 15 <= k) && i <= 1) && j + 4 < m) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 1) && n <= 10000) && 1 <= j) && m <= 10000) && 61 <= k) && 10 <= n) && i + 3 < n)) || ((((((((58 <= k && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && j + 1 < m) && i + 4 < n) && m <= 10000) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i + 2 < n) && m <= 10000) && 72 <= k) && j <= 2) && 10 <= n)) || ((((((((0 <= j && 70 <= k) && 0 <= i) && 10 <= m) && n <= 10000) && i + 2 < n) && m <= 10000) && j <= 0) && 10 <= n)) || ((((((((j < m && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && 9 <= k) && m <= 10000) && i <= 0) && 10 <= n)) || (((((((4 <= j && 0 <= i) && 10 <= m) && 20 <= k) && n <= 10000) && i <= 1) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 26 <= k) && 10 <= m) && n <= 10000) && i <= 2) && m <= 10000) && j + 3 < m) && 10 <= n)) || (((((((80 <= k && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && i + 2 < n) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 75 <= k) && 10 <= m) && n <= 10000) && j + 4 < m) && i + 2 < n) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 1) && n <= 10000) && 1 <= j) && i <= 0) && m <= 10000) && 10 <= n) && 1 <= k)) || ((((((((4 <= j && 0 <= i) && 66 <= k) && 10 <= m) && n <= 10000) && m <= 10000) && j + 3 < m) && 10 <= n) && i + 3 < n)) || ((((((((0 <= i && 10 <= m) && j <= 3) && n <= 10000) && i <= 0) && m <= 10000) && 3 <= k) && 3 <= j) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 3) && n <= 10000) && m <= 10000) && 63 <= k) && 3 <= j) && 10 <= n) && i + 3 < n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i <= 4) && j + 2 < m) && 47 <= k) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i < n) && 97 <= k) && j + 2 < m) && m <= 10000) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 42 <= k) && m <= 10000) && i <= 4) && j <= 2) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i + 4 < n) && 55 <= k) && j + 4 < m) && m <= 10000) && 10 <= n)) || ((((((((69 <= k && j < m) && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && m <= 10000) && 10 <= n) && i + 3 < n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i <= 4) && j <= 4) && 44 <= k) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i <= 1) && j + 2 < m) && 17 <= k) && m <= 10000) && 10 <= n)) || (((((((70 <= k && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && m <= 10000) && 10 <= n) && i + 3 < n)) || ((((((((80 <= k && 0 <= j) && 0 <= i) && 10 <= m) && i + 1 < n) && n <= 10000) && m <= 10000) && j <= 0) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && 95 <= k) && n <= 10000) && i < n) && j + 4 < m) && m <= 10000) && 10 <= n)) || ((((((((j < m && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && i + 2 < n) && m <= 10000) && 79 <= k) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 3) && n <= 10000) && 13 <= k) && m <= 10000) && i <= 1) && 3 <= j) && 10 <= n)) || ((((((((0 <= i && i + 1 < n) && 10 <= m) && j <= 1) && n <= 10000) && 1 <= j) && 81 <= k) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 3) && n <= 10000) && m <= 10000) && 53 <= k) && i + 4 < n) && 3 <= j) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && i + 1 < n) && 10 <= m) && n <= 10000) && j + 2 < m) && m <= 10000) && 87 <= k) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i <= 4) && 46 <= k) && m <= 10000) && j + 3 < m) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 1) && n <= 10000) && 1 <= j) && i <= 4) && 41 <= k) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && i + 1 < n) && 10 <= m) && j <= 3) && n <= 10000) && m <= 10000) && 83 <= k) && 3 <= j) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && i + 1 < n) && 10 <= m) && n <= 10000) && 85 <= k) && j + 4 < m) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && 11 <= k) && 10 <= m) && j <= 1) && n <= 10000) && 1 <= j) && i <= 1) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && 21 <= k) && 10 <= m) && j <= 1) && n <= 10000) && i <= 2) && 1 <= j) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && j + 4 < m) && m <= 10000) && i <= 0) && 5 <= k) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 56 <= k) && i + 4 < n) && m <= 10000) && j + 3 < m) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && 40 <= k) && n <= 10000) && i <= 4) && m <= 10000) && j <= 0) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && 20 <= k) && n <= 10000) && i <= 2) && m <= 10000) && j <= 0) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 25 <= k) && i <= 2) && j + 4 < m) && m <= 10000) && 10 <= n)) || ((((((((33 <= k && 0 <= i) && 10 <= m) && j <= 3) && n <= 10000) && m <= 10000) && i <= 3) && 3 <= j) && 10 <= n)) || (((((((4 <= j && 50 <= k) && 0 <= i) && 10 <= m) && n <= 10000) && i <= 4) && m <= 10000) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 60 <= k) && m <= 10000) && j <= 0) && 10 <= n) && i + 3 < n)) || ((((((((i <= 3 && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && 35 <= k) && j + 4 < m) && m <= 10000) && 10 <= n)) || ((((((((0 <= i && 10 <= m) && j <= 1) && n <= 10000) && 1 <= j) && 71 <= k) && i + 2 < n) && m <= 10000) && 10 <= n)) || (((((((i <= 3 && 4 <= j) && 0 <= i) && 10 <= m) && 40 <= k) && n <= 10000) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 64 <= k) && j <= 4) && m <= 10000) && 10 <= n) && i + 3 < n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 10 <= k) && i <= 1) && m <= 10000) && j <= 0) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 62 <= k) && m <= 10000) && j <= 2) && 10 <= n) && i + 3 < n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i < n) && m <= 10000) && j <= 0) && 10 <= n) && 90 <= k)) || ((((((((i <= 3 && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && j <= 4) && 34 <= k) && m <= 10000) && 10 <= n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 52 <= k) && m <= 10000) && i + 4 < n) && j <= 2) && 10 <= n)) || (((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i < n) && 100 <= k) && m <= 10000) && 10 <= n)) || ((((((((i <= 3 && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && j + 1 < m) && 38 <= k) && m <= 10000) && 10 <= n)) || (((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 60 <= k) && i + 4 < n) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && i < n) && j + 1 < m) && 98 <= k) && m <= 10000) && 10 <= n)) || (((((((0 <= j && n <= 10000) && m <= 10000) && j + 10 <= m) && k == 0) && j <= 0) && 10 <= n) && i == 0)) || ((((((((j < m && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && 29 <= k) && i <= 2) && m <= 10000) && 10 <= n)) || ((((((((j < m && 89 <= k) && 4 <= j) && 0 <= i) && i + 1 < n) && 10 <= m) && n <= 10000) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && m <= 10000) && i <= 0) && j <= 4) && 4 <= k) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 45 <= k) && i <= 4) && j + 4 < m) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && 65 <= k) && j + 4 < m) && m <= 10000) && 10 <= n) && i + 3 < n)) || ((((((((0 <= j && 0 <= i) && 10 <= m) && 22 <= k) && n <= 10000) && i <= 2) && m <= 10000) && j <= 2) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && i + 1 < n) && 10 <= m) && n <= 10000) && 84 <= k) && j <= 4) && m <= 10000) && 10 <= n)) || ((((((((j < m && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && i <= 1) && m <= 10000) && 10 <= n) && 19 <= k)) || ((((((((54 <= k && 4 <= j) && 0 <= i) && 10 <= m) && n <= 10000) && i + 4 < n) && j <= 4) && m <= 10000) && 10 <= n)) || ((((((((4 <= j && 0 <= i) && 10 <= m) && n <= 10000) && j + 1 < m) && 8 <= k) && m <= 10000) && i <= 0) && 10 <= n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Result: SAFE, OverallTime: 265.9s, OverallIterations: 7, TraceHistogramMax: 100, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 247.7s, HoareTripleCheckerStatistics: 256 SDtfs, 360 SDslu, 1042 SDs, 0 SdLazy, 1277 SolverSat, 342 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 654 GetRequests, 323 SyntacticMatches, 6 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3553 ImplicationChecksByTransitivity, 11.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 14 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 5131 NumberOfFragments, 3610 HoareAnnotationTreeSize, 14 FomulaSimplifications, 537459 FormulaSimplificationTreeSizeReduction, 97.4s HoareSimplificationTime, 8 FomulaSimplificationsInter, 105538 FormulaSimplificationTreeSizeReductionInter, 150.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 418 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 120536 SizeOfPredicates, 12 NumberOfNonLiveVariables, 474 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 7088/9618 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 1698, ICFG_INTERPRETER_ENTERED_PROCEDURES: 16, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 172, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 96, TOOLS_POST_TIME[ms]: 95, TOOLS_POST_CALL_APPLICATIONS: 20, TOOLS_POST_CALL_TIME[ms]: 42, TOOLS_POST_RETURN_APPLICATIONS: 8, TOOLS_POST_RETURN_TIME[ms]: 1, TOOLS_QUANTIFIERELIM_APPLICATIONS: 124, TOOLS_QUANTIFIERELIM_TIME[ms]: 105, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 15, FLUID_QUERY_TIME[ms]: 8, FLUID_QUERIES: 188, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 136, DOMAIN_JOIN_TIME[ms]: 1076, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 12, DOMAIN_WIDEN_TIME[ms]: 206, DOMAIN_ISSUBSETEQ_APPLICATIONS: 16, DOMAIN_ISSUBSETEQ_TIME[ms]: 29, DOMAIN_ISBOTTOM_APPLICATIONS: 28, DOMAIN_ISBOTTOM_TIME[ms]: 66, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 970, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 970, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 16, CALL_SUMMARIZER_APPLICATIONS: 8, CALL_SUMMARIZER_CACHE_MISSES: 4, CALL_SUMMARIZER_OVERALL_TIME[ms]: 16, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 16, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 6, PATH_EXPR_TIME[ms]: 6, REGEX_TO_DAG_TIME[ms]: 6, DAG_COMPRESSION_TIME[ms]: 29, DAG_COMPRESSION_PROCESSED_NODES: 380, DAG_COMPRESSION_RETAINED_NODES: 212, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...