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/array-tiling/mbpr2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:52:45,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:52:45,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:52:45,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:52:45,035 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:52:45,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:52:45,038 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:52:45,040 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:52:45,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:52:45,042 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:52:45,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:52:45,044 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:52:45,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:52:45,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:52:45,047 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:52:45,048 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:52:45,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:52:45,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:52:45,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:52:45,054 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:52:45,056 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:52:45,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:52:45,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:52:45,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:52:45,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:52:45,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:52:45,066 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:52:45,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:52:45,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:52:45,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:52:45,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:52:45,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:52:45,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:52:45,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:52:45,075 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:52:45,075 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:52:45,077 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:52:45,077 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:52:45,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:52:45,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:52:45,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:52:45,080 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-14 23:52:45,100 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:52:45,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:52:45,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:52:45,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:52:45,102 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:52:45,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:52:45,102 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:52:45,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:52:45,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:52:45,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:52:45,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:52:45,103 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:52:45,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:52:45,104 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:52:45,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:52:45,104 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:52:45,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:52:45,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:52:45,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:52:45,105 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:52:45,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:52:45,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:52:45,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:52:45,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:52:45,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:52:45,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:52:45,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:52:45,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:52:45,107 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-10-14 23:52:45,362 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:52:45,380 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:52:45,383 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:52:45,385 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:52:45,385 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:52:45,386 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr2.c [2019-10-14 23:52:45,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375540a83/ae71939c38b0471e900eceacdbb4425d/FLAG8cc24babc [2019-10-14 23:52:45,921 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:52:45,922 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr2.c [2019-10-14 23:52:45,931 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375540a83/ae71939c38b0471e900eceacdbb4425d/FLAG8cc24babc [2019-10-14 23:52:46,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375540a83/ae71939c38b0471e900eceacdbb4425d [2019-10-14 23:52:46,291 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:52:46,292 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:52:46,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:46,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:52:46,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:52:46,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:46" (1/1) ... [2019-10-14 23:52:46,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c44318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46, skipping insertion in model container [2019-10-14 23:52:46,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:46" (1/1) ... [2019-10-14 23:52:46,309 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:52:46,328 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:52:46,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:46,519 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:52:46,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:46,667 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:52:46,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46 WrapperNode [2019-10-14 23:52:46,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:46,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:52:46,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:52:46,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:52:46,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46" (1/1) ... [2019-10-14 23:52:46,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46" (1/1) ... [2019-10-14 23:52:46,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46" (1/1) ... [2019-10-14 23:52:46,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46" (1/1) ... [2019-10-14 23:52:46,695 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46" (1/1) ... [2019-10-14 23:52:46,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46" (1/1) ... [2019-10-14 23:52:46,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46" (1/1) ... [2019-10-14 23:52:46,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:52:46,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:52:46,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:52:46,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:52:46,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:52:46,762 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:52:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:52:46,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:52:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:52:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:52:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:52:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 23:52:46,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:52:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:52:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:52:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:52:46,764 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:52:47,104 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:52:47,104 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:52:47,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:47 BoogieIcfgContainer [2019-10-14 23:52:47,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:52:47,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:52:47,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:52:47,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:52:47,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:52:46" (1/3) ... [2019-10-14 23:52:47,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a9b229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:47, skipping insertion in model container [2019-10-14 23:52:47,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:46" (2/3) ... [2019-10-14 23:52:47,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42a9b229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:47, skipping insertion in model container [2019-10-14 23:52:47,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:47" (3/3) ... [2019-10-14 23:52:47,114 INFO L109 eAbstractionObserver]: Analyzing ICFG mbpr2.c [2019-10-14 23:52:47,125 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:52:47,133 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:52:47,142 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:52:47,167 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:52:47,167 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:52:47,167 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:52:47,168 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:52:47,168 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:52:47,168 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:52:47,168 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:52:47,168 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:52:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-14 23:52:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:52:47,193 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:47,194 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:47,196 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1027175342, now seen corresponding path program 1 times [2019-10-14 23:52:47,208 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:47,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958028603] [2019-10-14 23:52:47,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:47,209 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:47,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:47,351 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-14 23:52:47,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958028603] [2019-10-14 23:52:47,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:47,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:52:47,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910387144] [2019-10-14 23:52:47,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:52:47,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:47,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:52:47,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:52:47,373 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-14 23:52:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:47,396 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-10-14 23:52:47,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:52:47,397 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-10-14 23:52:47,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:47,406 INFO L225 Difference]: With dead ends: 58 [2019-10-14 23:52:47,407 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 23:52:47,410 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:52:47,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 23:52:47,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-14 23:52:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-14 23:52:47,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-14 23:52:47,451 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 18 [2019-10-14 23:52:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:47,451 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-14 23:52:47,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:52:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-14 23:52:47,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:52:47,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:47,453 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:47,454 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:47,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:47,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2086094079, now seen corresponding path program 1 times [2019-10-14 23:52:47,455 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:47,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738283199] [2019-10-14 23:52:47,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:47,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:47,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:47,588 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-14 23:52:47,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738283199] [2019-10-14 23:52:47,589 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:47,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:52:47,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486288190] [2019-10-14 23:52:47,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:52:47,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:47,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:52:47,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:52:47,592 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 5 states. [2019-10-14 23:52:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:47,675 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-10-14 23:52:47,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:52:47,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-14 23:52:47,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:47,678 INFO L225 Difference]: With dead ends: 37 [2019-10-14 23:52:47,678 INFO L226 Difference]: Without dead ends: 35 [2019-10-14 23:52:47,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:52:47,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-14 23:52:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-14 23:52:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-14 23:52:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-14 23:52:47,688 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 18 [2019-10-14 23:52:47,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:47,688 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-14 23:52:47,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:52:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-14 23:52:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:52:47,690 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:47,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:47,690 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:47,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:47,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2087941121, now seen corresponding path program 1 times [2019-10-14 23:52:47,691 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:47,691 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936464335] [2019-10-14 23:52:47,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:47,692 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:47,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:47,772 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-14 23:52:47,772 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936464335] [2019-10-14 23:52:47,773 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:47,773 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:52:47,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623388270] [2019-10-14 23:52:47,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:47,774 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:47,775 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 4 states. [2019-10-14 23:52:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:47,882 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2019-10-14 23:52:47,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:47,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-14 23:52:47,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:47,886 INFO L225 Difference]: With dead ends: 64 [2019-10-14 23:52:47,886 INFO L226 Difference]: Without dead ends: 42 [2019-10-14 23:52:47,887 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-14 23:52:47,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2019-10-14 23:52:47,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-14 23:52:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-10-14 23:52:47,894 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 18 [2019-10-14 23:52:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:47,894 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-10-14 23:52:47,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-10-14 23:52:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:52:47,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:47,896 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:47,896 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:47,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:47,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1576263499, now seen corresponding path program 1 times [2019-10-14 23:52:47,897 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:47,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185037343] [2019-10-14 23:52:47,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:47,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:47,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:47,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185037343] [2019-10-14 23:52:47,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:47,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:52:47,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659333708] [2019-10-14 23:52:47,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:52:47,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:52:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:47,969 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 3 states. [2019-10-14 23:52:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:47,989 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2019-10-14 23:52:47,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:47,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:52:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:47,991 INFO L225 Difference]: With dead ends: 57 [2019-10-14 23:52:47,991 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 23:52:47,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 23:52:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-10-14 23:52:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-14 23:52:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2019-10-14 23:52:48,002 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 26 [2019-10-14 23:52:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:48,002 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2019-10-14 23:52:48,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:52:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2019-10-14 23:52:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-14 23:52:48,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:48,004 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:48,004 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:48,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:48,005 INFO L82 PathProgramCache]: Analyzing trace with hash -2017639219, now seen corresponding path program 1 times [2019-10-14 23:52:48,005 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:48,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565383894] [2019-10-14 23:52:48,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:48,006 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:48,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:48,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:49,123 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-14 23:52:49,123 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565383894] [2019-10-14 23:52:49,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412778983] [2019-10-14 23:52:49,124 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-10-14 23:52:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:49,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-14 23:52:49,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:49,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-10-14 23:52:49,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:49,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:49,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:49,366 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-10-14 23:52:49,433 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:52:49,435 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:49,436 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2019-10-14 23:52:49,437 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:49,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:49,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:49,448 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-10-14 23:52:49,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:52:49,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2019-10-14 23:52:49,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:49,543 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:49,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:49,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-14 23:52:49,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:52:49,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:52:49,638 INFO L341 Elim1Store]: treesize reduction 26, result has 44.7 percent of original size [2019-10-14 23:52:49,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 51 [2019-10-14 23:52:49,640 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:49,664 INFO L567 ElimStorePlain]: treesize reduction 26, result has 52.7 percent of original size [2019-10-14 23:52:49,665 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:52:49,666 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:29 [2019-10-14 23:52:49,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:49,813 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-14 23:52:49,813 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:49,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:49,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2019-10-14 23:52:49,996 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-10-14 23:52:49,997 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-14 23:52:50,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:50,006 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:52:50,011 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:50,012 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-14 23:52:50,012 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:14 [2019-10-14 23:52:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:52:50,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [452577102] [2019-10-14 23:52:50,078 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 27 [2019-10-14 23:52:50,123 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:52:50,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:52:50,227 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:52:50,228 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 22 root evaluator evaluations with a maximum evaluation depth of 2. Performed 22 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Never found a fixpoint. Largest state had 28 variables. [2019-10-14 23:52:50,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:50,233 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:52:50,312 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 96.67% of their original sizes. [2019-10-14 23:52:50,312 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:52:50,317 INFO L553 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2019-10-14 23:52:50,317 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:52:50,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:52:50,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12, 11, 7] total 26 [2019-10-14 23:52:50,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483647370] [2019-10-14 23:52:50,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:52:50,321 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:50,321 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:52:50,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:52:50,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:50,322 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 3 states. [2019-10-14 23:52:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:50,332 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2019-10-14 23:52:50,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:52:50,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-14 23:52:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:50,333 INFO L225 Difference]: With dead ends: 36 [2019-10-14 23:52:50,333 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:52:50,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:52:50,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:52:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:52:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:52:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:52:50,337 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-10-14 23:52:50,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:50,337 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:52:50,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:52:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:52:50,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:52:50,542 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:50,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:52:50,617 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:50,618 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:50,618 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:50,618 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:52:50,618 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) [2019-10-14 23:52:50,618 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:52:50,619 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:52:50,619 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 46) no Hoare annotation was computed. [2019-10-14 23:52:50,619 INFO L439 ceAbstractionStarter]: At program point L35-3(lines 35 46) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:50,619 INFO L443 ceAbstractionStarter]: For program point L35-4(lines 35 46) no Hoare annotation was computed. [2019-10-14 23:52:50,620 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 54) no Hoare annotation was computed. [2019-10-14 23:52:50,620 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-14 23:52:50,620 INFO L443 ceAbstractionStarter]: For program point L48-2(lines 48 51) no Hoare annotation was computed. [2019-10-14 23:52:50,620 INFO L439 ceAbstractionStarter]: At program point L48-3(lines 48 51) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:50,620 INFO L443 ceAbstractionStarter]: For program point L48-4(lines 48 51) no Hoare annotation was computed. [2019-10-14 23:52:50,621 INFO L443 ceAbstractionStarter]: For program point L11(lines 11 52) no Hoare annotation was computed. [2019-10-14 23:52:50,621 INFO L443 ceAbstractionStarter]: For program point L11-2(lines 11 52) no Hoare annotation was computed. [2019-10-14 23:52:50,621 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 31) no Hoare annotation was computed. [2019-10-14 23:52:50,621 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 24 31) no Hoare annotation was computed. [2019-10-14 23:52:50,622 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 44) no Hoare annotation was computed. [2019-10-14 23:52:50,623 INFO L443 ceAbstractionStarter]: For program point L37-2(lines 37 44) no Hoare annotation was computed. [2019-10-14 23:52:50,623 INFO L443 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-10-14 23:52:50,623 INFO L439 ceAbstractionStarter]: At program point L50-2(line 50) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:50,623 INFO L443 ceAbstractionStarter]: For program point L50-3(line 50) no Hoare annotation was computed. [2019-10-14 23:52:50,624 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 54) no Hoare annotation was computed. [2019-10-14 23:52:50,624 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 8 54) the Hoare annotation is: (or (and (<= ~CELLCOUNT~0 2147483647) (<= 0 (+ ~CELLCOUNT~0 2147483648))) (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:50,624 INFO L443 ceAbstractionStarter]: For program point L22-2(lines 22 33) no Hoare annotation was computed. [2019-10-14 23:52:50,624 INFO L439 ceAbstractionStarter]: At program point L22-3(lines 22 33) the Hoare annotation is: (or (not (<= |old(~CELLCOUNT~0)| 2147483647)) (not (<= 0 (+ |old(~CELLCOUNT~0)| 2147483648)))) [2019-10-14 23:52:50,624 INFO L443 ceAbstractionStarter]: For program point L22-4(lines 22 33) no Hoare annotation was computed. [2019-10-14 23:52:50,624 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:52:50,625 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:52:50,626 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:52:50,626 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:52:50,626 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:52:50,626 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:52:50,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:52:50 BoogieIcfgContainer [2019-10-14 23:52:50,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:52:50,662 INFO L168 Benchmark]: Toolchain (without parser) took 4361.46 ms. Allocated memory was 138.4 MB in the beginning and 245.9 MB in the end (delta: 107.5 MB). Free memory was 103.6 MB in the beginning and 146.0 MB in the end (delta: -42.4 MB). Peak memory consumption was 65.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:50,662 INFO L168 Benchmark]: CDTParser took 1.18 ms. Allocated memory is still 138.4 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-14 23:52:50,663 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.43 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 181.1 MB in the end (delta: -77.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:50,664 INFO L168 Benchmark]: Boogie Preprocessor took 39.14 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 179.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:50,665 INFO L168 Benchmark]: RCFGBuilder took 398.34 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 161.9 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:50,669 INFO L168 Benchmark]: TraceAbstraction took 3544.52 ms. Allocated memory was 202.4 MB in the beginning and 245.9 MB in the end (delta: 43.5 MB). Free memory was 160.9 MB in the beginning and 146.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:52:50,677 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18 ms. Allocated memory is still 138.4 MB. Free memory is still 121.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 374.43 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 103.2 MB in the beginning and 181.1 MB in the end (delta: -77.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.14 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 179.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 398.34 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 161.9 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3544.52 ms. Allocated memory was 202.4 MB in the beginning and 245.9 MB in the end (delta: 43.5 MB). Free memory was 160.9 MB in the beginning and 146.0 MB in the end (delta: 14.9 MB). Peak memory consumption was 58.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 48]: Loop Invariant Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: !(\old(CELLCOUNT) <= 2147483647) || !(0 <= \old(CELLCOUNT) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. Result: SAFE, OverallTime: 3.4s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 129 SDtfs, 63 SDslu, 114 SDs, 0 SdLazy, 53 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 15 NumberOfFragments, 76 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 132 NumberOfCodeBlocks, 132 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 151 ConstructedInterpolants, 4 QuantifiedInterpolants, 24489 SizeOfPredicates, 11 NumberOfNonLiveVariables, 96 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 3/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 155, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9533333333333333, AVG_VARS_REMOVED_DURING_WEAKENING: 0.88, AVG_WEAKENED_CONJUNCTS: 0.64, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...