/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-invgen/nested9.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:34:24,791 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:34:24,794 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:34:24,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:34:24,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:34:24,808 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:34:24,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:34:24,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:34:24,813 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:34:24,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:34:24,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:34:24,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:34:24,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:34:24,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:34:24,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:34:24,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:34:24,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:34:24,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:34:24,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:34:24,825 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:34:24,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:34:24,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:34:24,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:34:24,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:34:24,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:34:24,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:34:24,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:34:24,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:34:24,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:34:24,835 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:34:24,835 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:34:24,836 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:34:24,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:34:24,837 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:34:24,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:34:24,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:34:24,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:34:24,840 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:34:24,840 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:34:24,841 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:34:24,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:34:24,842 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-11-07 00:34:24,856 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:34:24,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:34:24,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:34:24,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:34:24,858 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:34:24,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:34:24,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:34:24,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:34:24,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:34:24,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:34:24,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:34:24,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:34:24,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:34:24,860 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:34:24,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:34:24,860 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:34:24,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:34:24,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:34:24,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:34:24,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:34:24,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:34:24,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:34:24,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:34:24,863 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:34:24,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:34:24,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:34:24,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:34:24,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:34:24,864 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:34:25,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:34:25,156 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:34:25,159 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:34:25,161 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:34:25,161 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:34:25,162 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/nested9.i [2019-11-07 00:34:25,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18aac14e7/000d992f20e44ff88d1cbaa49832d5ce/FLAG4b51dcc49 [2019-11-07 00:34:25,696 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:34:25,697 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/nested9.i [2019-11-07 00:34:25,703 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18aac14e7/000d992f20e44ff88d1cbaa49832d5ce/FLAG4b51dcc49 [2019-11-07 00:34:26,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18aac14e7/000d992f20e44ff88d1cbaa49832d5ce [2019-11-07 00:34:26,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:34:26,127 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:34:26,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:26,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:34:26,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:34:26,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:26" (1/1) ... [2019-11-07 00:34:26,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4949000d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26, skipping insertion in model container [2019-11-07 00:34:26,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:34:26" (1/1) ... [2019-11-07 00:34:26,172 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:34:26,206 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:34:26,408 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:26,415 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:34:26,440 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:34:26,451 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:34:26,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26 WrapperNode [2019-11-07 00:34:26,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:34:26,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:34:26,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:34:26,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:34:26,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26" (1/1) ... [2019-11-07 00:34:26,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26" (1/1) ... [2019-11-07 00:34:26,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26" (1/1) ... [2019-11-07 00:34:26,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26" (1/1) ... [2019-11-07 00:34:26,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26" (1/1) ... [2019-11-07 00:34:26,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26" (1/1) ... [2019-11-07 00:34:26,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26" (1/1) ... [2019-11-07 00:34:26,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:34:26,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:34:26,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:34:26,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:34:26,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26" (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-11-07 00:34:26,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:34:26,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:34:26,624 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 00:34:26,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:34:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:34:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 00:34:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:34:26,624 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:34:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:34:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:34:26,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:34:26,859 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:34:26,859 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-07 00:34:26,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:26 BoogieIcfgContainer [2019-11-07 00:34:26,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:34:26,862 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:34:26,862 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:34:26,865 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:34:26,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:34:26" (1/3) ... [2019-11-07 00:34:26,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f97d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:26, skipping insertion in model container [2019-11-07 00:34:26,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:34:26" (2/3) ... [2019-11-07 00:34:26,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f97d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:34:26, skipping insertion in model container [2019-11-07 00:34:26,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:34:26" (3/3) ... [2019-11-07 00:34:26,868 INFO L109 eAbstractionObserver]: Analyzing ICFG nested9.i [2019-11-07 00:34:26,878 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:34:26,885 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:34:26,897 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:34:26,929 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:34:26,929 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:34:26,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:34:26,929 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:34:26,930 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:34:26,930 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:34:26,930 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:34:26,930 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:34:26,974 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-11-07 00:34:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 00:34:26,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:26,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:26,990 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash -810471198, now seen corresponding path program 1 times [2019-11-07 00:34:27,007 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:27,007 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169303023] [2019-11-07 00:34:27,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:27,292 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169303023] [2019-11-07 00:34:27,293 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:34:27,293 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-07 00:34:27,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505742951] [2019-11-07 00:34:27,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:34:27,302 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:34:27,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-07 00:34:27,321 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 8 states. [2019-11-07 00:34:27,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:27,625 INFO L93 Difference]: Finished difference Result 61 states and 86 transitions. [2019-11-07 00:34:27,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-07 00:34:27,628 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-07 00:34:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:27,641 INFO L225 Difference]: With dead ends: 61 [2019-11-07 00:34:27,641 INFO L226 Difference]: Without dead ends: 35 [2019-11-07 00:34:27,651 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-07 00:34:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-07 00:34:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-11-07 00:34:27,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-07 00:34:27,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-11-07 00:34:27,733 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 18 [2019-11-07 00:34:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:27,733 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-11-07 00:34:27,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:34:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-11-07 00:34:27,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 00:34:27,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:27,737 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:27,738 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:27,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1809643041, now seen corresponding path program 1 times [2019-11-07 00:34:27,741 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:27,742 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586263418] [2019-11-07 00:34:27,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:27,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:27,919 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586263418] [2019-11-07 00:34:27,919 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527265987] [2019-11-07 00:34:27,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:27,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-07 00:34:27,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:28,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:28,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:28,115 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:28,223 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:34:28,224 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 17 [2019-11-07 00:34:28,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545847785] [2019-11-07 00:34:28,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-07 00:34:28,226 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:28,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-07 00:34:28,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2019-11-07 00:34:28,227 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 8 states. [2019-11-07 00:34:28,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:28,330 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2019-11-07 00:34:28,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-07 00:34:28,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-07 00:34:28,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:28,332 INFO L225 Difference]: With dead ends: 47 [2019-11-07 00:34:28,332 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 00:34:28,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-11-07 00:34:28,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 00:34:28,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-11-07 00:34:28,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-07 00:34:28,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2019-11-07 00:34:28,342 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 21 [2019-11-07 00:34:28,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:28,343 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2019-11-07 00:34:28,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-07 00:34:28,343 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2019-11-07 00:34:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-07 00:34:28,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:28,345 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:28,548 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:28,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:28,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:28,550 INFO L82 PathProgramCache]: Analyzing trace with hash 2040308290, now seen corresponding path program 1 times [2019-11-07 00:34:28,550 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:28,551 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180236422] [2019-11-07 00:34:28,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:28,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:28,673 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180236422] [2019-11-07 00:34:28,673 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364873805] [2019-11-07 00:34:28,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:28,710 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-07 00:34:28,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:28,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:28,822 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:34:28,919 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1130366516] [2019-11-07 00:34:28,928 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 29 [2019-11-07 00:34:28,984 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:34:28,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:34:29,096 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-11-07 00:34:29,098 INFO L272 AbstractInterpreter]: Visited 24 different actions 28 times. Merged at 3 different actions 3 times. Never widened. Performed 41 root evaluator evaluations with a maximum evaluation depth of 7. Performed 41 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 2 fixpoints after 2 different actions. Largest state had 13 variables. [2019-11-07 00:34:29,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:29,105 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-07 00:34:29,105 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:29,105 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 18 [2019-11-07 00:34:29,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386082497] [2019-11-07 00:34:29,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-07 00:34:29,107 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-07 00:34:29,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-11-07 00:34:29,108 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 18 states. [2019-11-07 00:34:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:29,974 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2019-11-07 00:34:29,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-07 00:34:29,975 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-11-07 00:34:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:29,979 INFO L225 Difference]: With dead ends: 96 [2019-11-07 00:34:29,979 INFO L226 Difference]: Without dead ends: 68 [2019-11-07 00:34:29,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=323, Invalid=1237, Unknown=0, NotChecked=0, Total=1560 [2019-11-07 00:34:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-07 00:34:29,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2019-11-07 00:34:29,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-07 00:34:29,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2019-11-07 00:34:30,000 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 28 [2019-11-07 00:34:30,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:30,000 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2019-11-07 00:34:30,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-07 00:34:30,000 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2019-11-07 00:34:30,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-07 00:34:30,003 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:30,003 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:30,207 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:30,208 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:30,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:30,209 INFO L82 PathProgramCache]: Analyzing trace with hash -612204525, now seen corresponding path program 1 times [2019-11-07 00:34:30,209 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:30,210 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515701211] [2019-11-07 00:34:30,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:30,428 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:34:30,429 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515701211] [2019-11-07 00:34:30,429 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933475691] [2019-11-07 00:34:30,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-11-07 00:34:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:30,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-07 00:34:30,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-07 00:34:30,608 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-07 00:34:30,691 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-07 00:34:30,691 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15, 6] total 20 [2019-11-07 00:34:30,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962608607] [2019-11-07 00:34:30,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 00:34:30,692 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:30,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 00:34:30,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2019-11-07 00:34:30,693 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 6 states. [2019-11-07 00:34:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:30,807 INFO L93 Difference]: Finished difference Result 99 states and 119 transitions. [2019-11-07 00:34:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-07 00:34:30,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-11-07 00:34:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:30,809 INFO L225 Difference]: With dead ends: 99 [2019-11-07 00:34:30,809 INFO L226 Difference]: Without dead ends: 60 [2019-11-07 00:34:30,810 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-11-07 00:34:30,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-07 00:34:30,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-11-07 00:34:30,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-07 00:34:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2019-11-07 00:34:30,821 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 37 [2019-11-07 00:34:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:30,821 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2019-11-07 00:34:30,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 00:34:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2019-11-07 00:34:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-07 00:34:30,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:34:30,824 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:34:31,027 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:31,028 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:34:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:34:31,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1320897281, now seen corresponding path program 2 times [2019-11-07 00:34:31,029 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:34:31,029 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604745688] [2019-11-07 00:34:31,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:34:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:34:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 13 proven. 29 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-07 00:34:31,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604745688] [2019-11-07 00:34:31,188 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759616549] [2019-11-07 00:34:31,188 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-11-07 00:34:31,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-07 00:34:31,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-07 00:34:31,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-07 00:34:31,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:34:31,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:34:31,324 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-07 00:34:31,324 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:34:31,402 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-07 00:34:31,402 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [181190457] [2019-11-07 00:34:31,402 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-11-07 00:34:31,403 INFO L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-11-07 00:34:31,403 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:34:31,403 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 19 [2019-11-07 00:34:31,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610041578] [2019-11-07 00:34:31,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-07 00:34:31,404 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:34:31,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-07 00:34:31,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-11-07 00:34:31,405 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 19 states. [2019-11-07 00:34:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:34:32,293 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2019-11-07 00:34:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-07 00:34:32,294 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 51 [2019-11-07 00:34:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:34:32,294 INFO L225 Difference]: With dead ends: 117 [2019-11-07 00:34:32,295 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:34:32,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=531, Invalid=1449, Unknown=0, NotChecked=0, Total=1980 [2019-11-07 00:34:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:34:32,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:34:32,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:34:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:34:32,298 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2019-11-07 00:34:32,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:34:32,300 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:34:32,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-07 00:34:32,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:34:32,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:34:32,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:34:32,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:34:32,847 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 34 [2019-11-07 00:34:32,954 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 37 [2019-11-07 00:34:33,100 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-11-07 00:34:33,413 WARN L191 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2019-11-07 00:34:33,416 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:33,417 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:33,417 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:33,417 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:34:33,417 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:34:33,417 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:34:33,417 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:34:33,417 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2019-11-07 00:34:33,418 INFO L439 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (let ((.cse6 (* 3 main_~i~0))) (let ((.cse0 (<= 2 main_~i~0)) (.cse1 (< main_~j~0 .cse6)) (.cse2 (* 2 main_~n~0)) (.cse3 (< main_~i~0 main_~n~0)) (.cse4 (<= (* 2 main_~i~0) main_~j~0)) (.cse5 (<= (+ main_~k~0 2) .cse6))) (or (and .cse0 .cse1 (<= (+ (* 2 main_~j~0) 2) (+ main_~i~0 main_~k~0 .cse2)) .cse3 .cse4 .cse5) (and (<= (div (- main_~j~0) (- 2)) main_~k~0) .cse4 (<= (+ main_~k~0 4) (+ main_~i~0 .cse2)) (<= main_~i~0 1) .cse5) (and .cse0 .cse1 (<= (+ .cse6 5) (+ main_~j~0 .cse2)) .cse3 .cse4 .cse5)))) [2019-11-07 00:34:33,418 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 22 23) no Hoare annotation was computed. [2019-11-07 00:34:33,418 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-11-07 00:34:33,418 INFO L443 ceAbstractionStarter]: For program point L19-1(line 19) no Hoare annotation was computed. [2019-11-07 00:34:33,418 INFO L446 ceAbstractionStarter]: At program point L24(lines 11 26) the Hoare annotation is: true [2019-11-07 00:34:33,418 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2019-11-07 00:34:33,419 INFO L439 ceAbstractionStarter]: At program point L20-3(lines 20 23) the Hoare annotation is: (let ((.cse0 (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0))) (.cse4 (< main_~j~0 (+ main_~k~0 2))) (.cse2 (<= main_~i~0 main_~n~0))) (or (let ((.cse1 (<= 1 main_~i~0)) (.cse3 (<= main_~i~0 1))) (or (and .cse0 .cse1 .cse2 (<= main_~j~0 (* 2 main_~i~0)) .cse3) (and .cse4 .cse1 .cse2 .cse3 (< main_~j~0 (+ main_~i~0 2))))) (and (<= 2 main_~i~0) (<= main_~k~0 (+ main_~i~0 (* 2 main_~n~0))) (or (and .cse0 .cse2) (and .cse4 .cse2))) (and (<= 0 main_~i~0) (<= main_~i~0 0)))) [2019-11-07 00:34:33,419 INFO L443 ceAbstractionStarter]: For program point L16(line 16) no Hoare annotation was computed. [2019-11-07 00:34:33,419 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 21 23) no Hoare annotation was computed. [2019-11-07 00:34:33,419 INFO L439 ceAbstractionStarter]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse7 (* 2 main_~i~0))) (let ((.cse2 (<= 1 main_~i~0)) (.cse0 (<= .cse7 main_~j~0)) (.cse1 (<= main_~k~0 (+ main_~i~0 (* 2 main_~n~0)))) (.cse4 (<= main_~j~0 .cse7)) (.cse5 (< main_~j~0 (+ main_~k~0 2))) (.cse3 (< main_~i~0 main_~n~0))) (or (and (<= (+ main_~j~0 1) (+ main_~i~0 main_~n~0)) (< main_~j~0 (* 3 main_~i~0)) .cse0 .cse1) (and .cse2 .cse3 .cse0 .cse4 (<= main_~i~0 1)) (and .cse5 .cse2 .cse3 .cse0 .cse1) (and (<= 0 main_~i~0) (let ((.cse6 (<= main_~i~0 0))) (or (and .cse4 .cse6) (and .cse5 .cse6 (< main_~j~0 (+ main_~i~0 2))))) .cse3)))) [2019-11-07 00:34:33,420 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-07 00:34:33,420 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2019-11-07 00:34:33,420 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 26) the Hoare annotation is: true [2019-11-07 00:34:33,420 INFO L439 ceAbstractionStarter]: At program point L22-2(lines 22 23) the Hoare annotation is: (let ((.cse3 (* 2 main_~i~0)) (.cse6 (div (- main_~j~0) (- 2))) (.cse8 (* 2 main_~n~0)) (.cse7 (* 3 main_~i~0))) (let ((.cse0 (< main_~j~0 .cse7)) (.cse2 (<= main_~k~0 (+ main_~i~0 .cse8))) (.cse1 (<= .cse6 main_~k~0)) (.cse4 (< main_~i~0 main_~n~0)) (.cse5 (<= .cse3 main_~j~0))) (or (and .cse0 (<= 0 main_~i~0) .cse1 .cse2 (<= (+ .cse3 1) main_~n~0) (<= main_~i~0 0)) (and (<= 1 main_~i~0) .cse4 .cse5 .cse2 (<= main_~j~0 .cse3) (<= (+ .cse6 1) main_~k~0)) (and (<= 2 main_~i~0) .cse0 (<= (+ .cse7 5) (+ main_~j~0 .cse8)) .cse4 .cse5 .cse2) (and .cse1 .cse4 .cse5 (<= main_~k~0 main_~i~0) (<= (+ main_~k~0 2) .cse7))))) [2019-11-07 00:34:33,420 INFO L443 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2019-11-07 00:34:33,421 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-11-07 00:34:33,421 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:34:33,421 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-07 00:34:33,421 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-07 00:34:33,421 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-07 00:34:33,421 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:34:33,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:34:33 BoogieIcfgContainer [2019-11-07 00:34:33,437 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:34:33,439 INFO L168 Benchmark]: Toolchain (without parser) took 7314.36 ms. Allocated memory was 137.4 MB in the beginning and 280.0 MB in the end (delta: 142.6 MB). Free memory was 102.1 MB in the beginning and 90.3 MB in the end (delta: 11.8 MB). Peak memory consumption was 154.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:33,440 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:34:33,441 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.85 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:33,442 INFO L168 Benchmark]: Boogie Preprocessor took 115.97 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 92.3 MB in the beginning and 178.1 MB in the end (delta: -85.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:33,443 INFO L168 Benchmark]: RCFGBuilder took 292.22 ms. Allocated memory is still 199.8 MB. Free memory was 178.1 MB in the beginning and 163.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:33,444 INFO L168 Benchmark]: TraceAbstraction took 6575.30 ms. Allocated memory was 199.8 MB in the beginning and 280.0 MB in the end (delta: 80.2 MB). Free memory was 163.1 MB in the beginning and 90.3 MB in the end (delta: 72.8 MB). Peak memory consumption was 153.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:34:33,448 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.23 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 319.85 ms. Allocated memory is still 137.4 MB. Free memory was 101.9 MB in the beginning and 92.3 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.97 ms. Allocated memory was 137.4 MB in the beginning and 199.8 MB in the end (delta: 62.4 MB). Free memory was 92.3 MB in the beginning and 178.1 MB in the end (delta: -85.8 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 292.22 ms. Allocated memory is still 199.8 MB. Free memory was 178.1 MB in the beginning and 163.8 MB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6575.30 ms. Allocated memory was 199.8 MB in the beginning and 280.0 MB in the end (delta: 80.2 MB). Free memory was 163.1 MB in the beginning and 90.3 MB in the end (delta: 72.8 MB). Peak memory consumption was 153.0 MB. 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: 20]: Loop Invariant Derived loop invariant: ((((((j + 1 <= i + n && 1 <= i) && i <= n) && j <= 2 * i) && i <= 1) || ((((j < k + 2 && 1 <= i) && i <= n) && i <= 1) && j < i + 2)) || ((2 <= i && k <= i + 2 * n) && ((j + 1 <= i + n && i <= n) || (j < k + 2 && i <= n)))) || (0 <= i && i <= 0) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((j + 1 <= i + n && j < 3 * i) && 2 * i <= j) && k <= i + 2 * n) || ((((1 <= i && i < n) && 2 * i <= j) && j <= 2 * i) && i <= 1)) || ((((j < k + 2 && 1 <= i) && i < n) && 2 * i <= j) && k <= i + 2 * n)) || ((0 <= i && ((j <= 2 * i && i <= 0) || ((j < k + 2 && i <= 0) && j < i + 2))) && i < n) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((((((j < 3 * i && 0 <= i) && -j / -2 <= k) && k <= i + 2 * n) && 2 * i + 1 <= n) && i <= 0) || (((((1 <= i && i < n) && 2 * i <= j) && k <= i + 2 * n) && j <= 2 * i) && -j / -2 + 1 <= k)) || (((((2 <= i && j < 3 * i) && 3 * i + 5 <= j + 2 * n) && i < n) && 2 * i <= j) && k <= i + 2 * n)) || ((((-j / -2 <= k && i < n) && 2 * i <= j) && k <= i) && k + 2 <= 3 * i) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 1 error locations. Result: SAFE, OverallTime: 6.4s, OverallIterations: 5, TraceHistogramMax: 4, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 105 SDtfs, 184 SDslu, 495 SDs, 0 SdLazy, 751 SolverSat, 182 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 246 SyntacticMatches, 4 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 20 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 30 PreInvPairs, 62 NumberOfFragments, 418 HoareAnnotationTreeSize, 30 FomulaSimplifications, 560 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 10 FomulaSimplificationsInter, 929 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 292 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 43371 SizeOfPredicates, 16 NumberOfNonLiveVariables, 264 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 13 InterpolantComputations, 3 PerfectInterpolantSequences, 198/267 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...