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-new/gauss_sum.i.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:06:46,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:06:46,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:06:46,842 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:06:46,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:06:46,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:06:46,847 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:06:46,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:06:46,863 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:06:46,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:06:46,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:06:46,868 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:06:46,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:06:46,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:06:46,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:06:46,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:06:46,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:06:46,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:06:46,882 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:06:46,888 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:06:46,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:06:46,895 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:06:46,896 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:06:46,897 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:06:46,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:06:46,901 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:06:46,901 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:06:46,902 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:06:46,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:06:46,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:06:46,906 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:06:46,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:06:46,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:06:46,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:06:46,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:06:46,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:06:46,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:06:46,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:06:46,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:06:46,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:06:46,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:06:46,915 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-13 21:06:46,935 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:06:46,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:06:46,937 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:06:46,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:06:46,938 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:06:46,938 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:06:46,938 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:06:46,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:06:46,939 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:06:46,939 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:06:46,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:06:46,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:06:46,940 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:06:46,941 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:06:46,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:06:46,941 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:06:46,941 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:06:46,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:06:46,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:06:46,942 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:06:46,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:06:46,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:06:46,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:06:46,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:06:46,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:06:46,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:06:46,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:06:46,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:06:46,944 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-13 21:06:47,224 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:06:47,242 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:06:47,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:06:47,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:06:47,248 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:06:47,249 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c [2019-10-13 21:06:47,328 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488eebbb0/97dca43a7ed843b291689c9da8804d1d/FLAG744dc7d5c [2019-10-13 21:06:47,864 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:06:47,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/gauss_sum.i.v+cfa-reducer.c [2019-10-13 21:06:47,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488eebbb0/97dca43a7ed843b291689c9da8804d1d/FLAG744dc7d5c [2019-10-13 21:06:48,187 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488eebbb0/97dca43a7ed843b291689c9da8804d1d [2019-10-13 21:06:48,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:06:48,199 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:06:48,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:48,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:06:48,204 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:06:48,205 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:48" (1/1) ... [2019-10-13 21:06:48,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c32c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48, skipping insertion in model container [2019-10-13 21:06:48,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:06:48" (1/1) ... [2019-10-13 21:06:48,216 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:06:48,235 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:06:48,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:48,438 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:06:48,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:06:48,473 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:06:48,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48 WrapperNode [2019-10-13 21:06:48,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:06:48,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:06:48,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:06:48,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:06:48,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48" (1/1) ... [2019-10-13 21:06:48,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48" (1/1) ... [2019-10-13 21:06:48,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48" (1/1) ... [2019-10-13 21:06:48,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48" (1/1) ... [2019-10-13 21:06:48,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48" (1/1) ... [2019-10-13 21:06:48,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48" (1/1) ... [2019-10-13 21:06:48,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48" (1/1) ... [2019-10-13 21:06:48,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:06:48,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:06:48,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:06:48,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:06:48,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48" (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-13 21:06:48,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:06:48,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:06:48,650 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:06:48,650 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:06:48,651 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 21:06:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 21:06:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:06:48,652 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:06:48,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:06:48,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:06:48,832 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:06:48,832 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 21:06:48,833 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:48 BoogieIcfgContainer [2019-10-13 21:06:48,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:06:48,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:06:48,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:06:48,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:06:48,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:06:48" (1/3) ... [2019-10-13 21:06:48,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322a2d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:48, skipping insertion in model container [2019-10-13 21:06:48,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:06:48" (2/3) ... [2019-10-13 21:06:48,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@322a2d0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:06:48, skipping insertion in model container [2019-10-13 21:06:48,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:06:48" (3/3) ... [2019-10-13 21:06:48,840 INFO L109 eAbstractionObserver]: Analyzing ICFG gauss_sum.i.v+cfa-reducer.c [2019-10-13 21:06:48,848 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:06:48,854 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:06:48,862 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:06:48,885 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:06:48,885 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:06:48,885 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:06:48,886 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:06:48,886 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:06:48,886 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:06:48,886 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:06:48,886 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:06:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2019-10-13 21:06:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 21:06:48,909 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:48,910 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:48,912 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:48,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1277702393, now seen corresponding path program 1 times [2019-10-13 21:06:48,926 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:48,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894625708] [2019-10-13 21:06:48,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:48,926 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:48,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:48,995 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:06:48,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1844339779] [2019-10-13 21:06:48,996 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-13 21:06:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:49,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:06:49,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:49,133 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-13 21:06:49,134 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:49,176 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-13 21:06:49,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894625708] [2019-10-13 21:06:49,177 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:06:49,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844339779] [2019-10-13 21:06:49,179 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:06:49,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2019-10-13 21:06:49,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082469225] [2019-10-13 21:06:49,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:06:49,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:49,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:06:49,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:49,219 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2019-10-13 21:06:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:49,326 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-10-13 21:06:49,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:06:49,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-10-13 21:06:49,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:49,342 INFO L225 Difference]: With dead ends: 26 [2019-10-13 21:06:49,343 INFO L226 Difference]: Without dead ends: 13 [2019-10-13 21:06:49,349 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:06:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-10-13 21:06:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-10-13 21:06:49,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-10-13 21:06:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-10-13 21:06:49,401 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-10-13 21:06:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:49,402 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-10-13 21:06:49,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:06:49,403 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-10-13 21:06:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 21:06:49,404 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:49,404 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:49,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:49,609 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:49,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:49,610 INFO L82 PathProgramCache]: Analyzing trace with hash -954130992, now seen corresponding path program 1 times [2019-10-13 21:06:49,611 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:49,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664667260] [2019-10-13 21:06:49,611 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:49,612 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:49,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:49,627 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:06:49,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [728321198] [2019-10-13 21:06:49,627 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-10-13 21:06:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:06:49,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 21:06:49,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:49,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:06:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:49,769 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:49,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664667260] [2019-10-13 21:06:49,918 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:06:49,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728321198] [2019-10-13 21:06:49,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [317342892] [2019-10-13 21:06:49,929 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 13 [2019-10-13 21:06:49,967 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 21:06:49,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 21:06:50,113 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-13 21:06:50,116 INFO L272 AbstractInterpreter]: Visited 12 different actions 34 times. Merged at 4 different actions 21 times. Widened at 1 different actions 3 times. Performed 92 root evaluator evaluations with a maximum evaluation depth of 6. Performed 92 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2019-10-13 21:06:50,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:50,120 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:06:50,120 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:06:50,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-10-13 21:06:50,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188836673] [2019-10-13 21:06:50,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:06:50,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:50,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:06:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:06:50,124 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-10-13 21:06:50,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:50,245 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-10-13 21:06:50,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:06:50,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-10-13 21:06:50,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:50,247 INFO L225 Difference]: With dead ends: 17 [2019-10-13 21:06:50,247 INFO L226 Difference]: Without dead ends: 14 [2019-10-13 21:06:50,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:06:50,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-13 21:06:50,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-13 21:06:50,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-13 21:06:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-10-13 21:06:50,254 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-10-13 21:06:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:50,254 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-10-13 21:06:50,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:06:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-10-13 21:06:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 21:06:50,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:50,256 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:50,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:50,457 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:50,458 INFO L82 PathProgramCache]: Analyzing trace with hash 486647847, now seen corresponding path program 2 times [2019-10-13 21:06:50,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:50,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948328292] [2019-10-13 21:06:50,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:50,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:50,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:50,478 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:06:50,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1054305611] [2019-10-13 21:06:50,479 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:50,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 21:06:50,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:06:50,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 21:06:50,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:50,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:06:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:50,598 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:50,716 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__n~0 Int)) (or (= (* main_~main__n~0 (+ main_~main__n~0 1)) (+ (* 2 c_main_~main__sum~0) (* 2 c_main_~main__i~0))) (< c_main_~main__i~0 main_~main__n~0) (< main_~main__n~0 c_main_~main__i~0))) is different from true [2019-10-13 21:06:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-10-13 21:06:52,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948328292] [2019-10-13 21:06:52,782 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:06:52,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054305611] [2019-10-13 21:06:52,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [3548748] [2019-10-13 21:06:52,782 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 21:06:52,783 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 21:06:52,783 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:06:52,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-10-13 21:06:52,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081704589] [2019-10-13 21:06:52,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:06:52,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:52,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:06:52,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=52, Unknown=3, NotChecked=14, Total=90 [2019-10-13 21:06:52,785 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 10 states. [2019-10-13 21:06:53,000 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((main_~main__n~0 Int)) (let ((.cse0 (+ c_main_~main__i~0 1))) (or (= (* main_~main__n~0 (+ main_~main__n~0 1)) (+ (* 2 c_main_~main__sum~0) (* 4 c_main_~main__i~0) 2)) (< main_~main__n~0 .cse0) (< .cse0 main_~main__n~0)))) (or (= (* c_main_~main__n~0 (+ c_main_~main__n~0 1)) (* 2 c_main_~main__sum~0)) (<= c_main_~main__i~0 c_main_~main__n~0)) (forall ((main_~main__n~0 Int)) (or (= (* main_~main__n~0 (+ main_~main__n~0 1)) (+ (* 2 c_main_~main__sum~0) (* 2 c_main_~main__i~0))) (< c_main_~main__i~0 main_~main__n~0) (< main_~main__n~0 c_main_~main__i~0)))) is different from true [2019-10-13 21:06:53,092 WARN L860 $PredicateComparison]: unable to prove that (and (or (= (* c_main_~main__n~0 (+ c_main_~main__n~0 1)) (* 2 c_main_~main__sum~0)) (<= c_main_~main__i~0 c_main_~main__n~0)) (forall ((main_~main__n~0 Int)) (or (= (* main_~main__n~0 (+ main_~main__n~0 1)) (+ (* 2 c_main_~main__sum~0) (* 2 c_main_~main__i~0))) (< c_main_~main__i~0 main_~main__n~0) (< main_~main__n~0 c_main_~main__i~0)))) is different from true [2019-10-13 21:06:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:06:53,213 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-10-13 21:06:53,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 21:06:53,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 13 [2019-10-13 21:06:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:06:53,215 INFO L225 Difference]: With dead ends: 23 [2019-10-13 21:06:53,215 INFO L226 Difference]: Without dead ends: 18 [2019-10-13 21:06:53,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=49, Invalid=114, Unknown=5, NotChecked=72, Total=240 [2019-10-13 21:06:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-13 21:06:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-13 21:06:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-13 21:06:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-10-13 21:06:53,222 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2019-10-13 21:06:53,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:06:53,222 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-10-13 21:06:53,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:06:53,222 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-10-13 21:06:53,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 21:06:53,223 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:06:53,223 INFO L380 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:06:53,424 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:53,424 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:06:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:06:53,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2089680281, now seen corresponding path program 3 times [2019-10-13 21:06:53,425 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:06:53,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129863050] [2019-10-13 21:06:53,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:53,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:06:53,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:06:53,442 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-13 21:06:53,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260050732] [2019-10-13 21:06:53,443 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:06:53,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 21:06:53,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 21:06:53,538 WARN L254 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-13 21:06:53,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:06:53,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 21:06:53,640 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:06:53,640 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:06:53,894 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__n~0 Int)) (let ((.cse0 (+ c_main_~main__i~0 1))) (or (= (* main_~main__n~0 (+ main_~main__n~0 1)) (+ (* 2 c_main_~main__sum~0) (* 4 c_main_~main__i~0) 2)) (< main_~main__n~0 .cse0) (< .cse0 main_~main__n~0)))) is different from true [2019-10-13 21:06:53,914 WARN L860 $PredicateComparison]: unable to prove that (forall ((main_~main__n~0 Int)) (let ((.cse0 (+ c_main_~main__i~0 2))) (or (< main_~main__n~0 .cse0) (= (* main_~main__n~0 (+ main_~main__n~0 1)) (+ (* 2 c_main_~main__sum~0) (* 6 c_main_~main__i~0) 6)) (< .cse0 main_~main__n~0)))) is different from true [2019-10-13 21:06:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 14 not checked. [2019-10-13 21:06:53,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129863050] [2019-10-13 21:06:53,995 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-13 21:06:53,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260050732] [2019-10-13 21:06:53,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [876760410] [2019-10-13 21:06:53,996 INFO L195 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-13 21:06:53,996 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-13 21:06:53,996 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:06:53,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-10-13 21:06:53,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154972077] [2019-10-13 21:06:53,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 21:06:53,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:06:53,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 21:06:53,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=126, Unknown=3, NotChecked=46, Total=210 [2019-10-13 21:06:53,998 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 15 states. [2019-10-13 21:06:54,166 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-10-13 21:06:54,467 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((main_~main__n~0 Int)) (let ((.cse0 (+ c_main_~main__i~0 1))) (or (= (* main_~main__n~0 (+ main_~main__n~0 1)) (+ (* 2 c_main_~main__sum~0) (* 4 c_main_~main__i~0) 2)) (< main_~main__n~0 .cse0) (< .cse0 main_~main__n~0)))) (= 6 c_main_~main__i~0) (or (= (* c_main_~main__n~0 (+ c_main_~main__n~0 1)) (* 2 c_main_~main__sum~0)) (<= c_main_~main__i~0 c_main_~main__n~0)) (= c_main_~main__sum~0 15) (forall ((main_~main__n~0 Int)) (let ((.cse1 (+ c_main_~main__i~0 2))) (or (< main_~main__n~0 .cse1) (= (* main_~main__n~0 (+ main_~main__n~0 1)) (+ (* 2 c_main_~main__sum~0) (* 6 c_main_~main__i~0) 6)) (< .cse1 main_~main__n~0))))) is different from true [2019-10-13 21:06:54,618 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-10-13 21:07:00,984 WARN L191 SmtUtils]: Spent 6.25 s on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-10-13 21:07:01,490 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-10-13 21:07:01,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:07:01,492 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-10-13 21:07:01,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:07:01,492 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-10-13 21:07:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:07:01,493 INFO L225 Difference]: With dead ends: 20 [2019-10-13 21:07:01,493 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 21:07:01,494 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=87, Invalid=340, Unknown=5, NotChecked=120, Total=552 [2019-10-13 21:07:01,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 21:07:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 21:07:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 21:07:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 21:07:01,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-13 21:07:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:07:01,495 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 21:07:01,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 21:07:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 21:07:01,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 21:07:01,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:07:01,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 21:07:07,941 WARN L191 SmtUtils]: Spent 6.16 s on a formula simplification. DAG size of input: 60 DAG size of output: 22 [2019-10-13 21:07:07,948 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:07:07,949 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:07:07,949 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:07:07,949 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 21:07:07,949 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 21:07:07,949 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 21:07:07,949 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 21:07:07,950 INFO L439 ceAbstractionStarter]: At program point L33(lines 25 54) the Hoare annotation is: (and (forall ((main_~main__n~0 Int)) (let ((.cse0 (+ main_~main__i~0 1))) (or (= (* main_~main__n~0 (+ main_~main__n~0 1)) (+ (* 2 main_~main__sum~0) (* 4 main_~main__i~0) 2)) (< main_~main__n~0 .cse0) (< .cse0 main_~main__n~0)))) (<= 1 main_~main__n~0) (or (= (* main_~main__n~0 (+ main_~main__n~0 1)) (* 2 main_~main__sum~0)) (<= main_~main__i~0 main_~main__n~0))) [2019-10-13 21:07:07,950 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 8 56) the Hoare annotation is: true [2019-10-13 21:07:07,950 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 8 56) no Hoare annotation was computed. [2019-10-13 21:07:07,950 INFO L443 ceAbstractionStarter]: For program point L20(lines 20 54) no Hoare annotation was computed. [2019-10-13 21:07:07,951 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 55) no Hoare annotation was computed. [2019-10-13 21:07:07,951 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 8 56) no Hoare annotation was computed. [2019-10-13 21:07:07,951 INFO L443 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-10-13 21:07:07,951 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 51) no Hoare annotation was computed. [2019-10-13 21:07:07,951 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) no Hoare annotation was computed. [2019-10-13 21:07:07,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,971 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,972 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:07:07 BoogieIcfgContainer [2019-10-13 21:07:07,975 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 21:07:07,977 INFO L168 Benchmark]: Toolchain (without parser) took 19777.89 ms. Allocated memory was 138.4 MB in the beginning and 235.4 MB in the end (delta: 97.0 MB). Free memory was 103.7 MB in the beginning and 82.3 MB in the end (delta: 21.4 MB). Peak memory consumption was 118.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,978 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.37 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 94.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,980 INFO L168 Benchmark]: Boogie Preprocessor took 111.52 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 94.0 MB in the beginning and 181.2 MB in the end (delta: -87.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,981 INFO L168 Benchmark]: RCFGBuilder took 246.97 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 169.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,982 INFO L168 Benchmark]: TraceAbstraction took 19140.47 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 169.3 MB in the beginning and 82.3 MB in the end (delta: 87.0 MB). Peak memory consumption was 120.1 MB. Max. memory is 7.1 GB. [2019-10-13 21:07:07,986 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 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 274.37 ms. Allocated memory is still 138.4 MB. Free memory was 103.5 MB in the beginning and 94.0 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.52 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 94.0 MB in the beginning and 181.2 MB in the end (delta: -87.2 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 246.97 ms. Allocated memory is still 202.4 MB. Free memory was 181.2 MB in the beginning and 169.3 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19140.47 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 169.3 MB in the beginning and 82.3 MB in the end (delta: 87.0 MB). Peak memory consumption was 120.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: 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: 25]: Loop Invariant [2019-10-13 21:07:07,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,996 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,997 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,997 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] [2019-10-13 21:07:07,998 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~main__n~0,QUANTIFIED] Derived loop invariant: ((forall main_~main__n~0 : int :: (main_~main__n~0 * (main_~main__n~0 + 1) == 2 * main__sum + 4 * main__i + 2 || main_~main__n~0 < main__i + 1) || main__i + 1 < main_~main__n~0) && 1 <= main__n) && (main__n * (main__n + 1) == 2 * main__sum || main__i <= main__n) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 16 locations, 1 error locations. Result: SAFE, OverallTime: 19.0s, OverallIterations: 4, TraceHistogramMax: 6, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.2s, HoareTripleCheckerStatistics: 43 SDtfs, 23 SDslu, 144 SDs, 0 SdLazy, 145 SolverSat, 11 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 10.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 12 NumberOfFragments, 47 HoareAnnotationTreeSize, 5 FomulaSimplifications, 168 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 237 FormulaSimplificationTreeSizeReductionInter, 6.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 98 ConstructedInterpolants, 8 QuantifiedInterpolants, 6203 SizeOfPredicates, 20 NumberOfNonLiveVariables, 205 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 4/50 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...