/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive/Ackermann01-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 21:51:23,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 21:51:23,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 21:51:23,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 21:51:23,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 21:51:23,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 21:51:23,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 21:51:23,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 21:51:23,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 21:51:23,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 21:51:23,730 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 21:51:23,731 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 21:51:23,731 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 21:51:23,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 21:51:23,733 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 21:51:23,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 21:51:23,735 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 21:51:23,736 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 21:51:23,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 21:51:23,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 21:51:23,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 21:51:23,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 21:51:23,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 21:51:23,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 21:51:23,749 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 21:51:23,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 21:51:23,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 21:51:23,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 21:51:23,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 21:51:23,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 21:51:23,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 21:51:23,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 21:51:23,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 21:51:23,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 21:51:23,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 21:51:23,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 21:51:23,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 21:51:23,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 21:51:23,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 21:51:23,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 21:51:23,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 21:51:23,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 21:51:23,772 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 21:51:23,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 21:51:23,775 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 21:51:23,775 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 21:51:23,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 21:51:23,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 21:51:23,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 21:51:23,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 21:51:23,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 21:51:23,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 21:51:23,777 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 21:51:23,778 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 21:51:23,778 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 21:51:23,778 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 21:51:23,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 21:51:23,779 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 21:51:23,779 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 21:51:23,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 21:51:23,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 21:51:23,779 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 21:51:23,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 21:51:23,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 21:51:23,780 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-08-22 21:51:24,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 21:51:24,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 21:51:24,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 21:51:24,103 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 21:51:24,104 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 21:51:24,105 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-08-22 21:51:24,177 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375a773bd/c6712c2f52d244f69259d1956dee72fb/FLAGc1f89bad9 [2020-08-22 21:51:24,635 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 21:51:24,635 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-08-22 21:51:24,641 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375a773bd/c6712c2f52d244f69259d1956dee72fb/FLAGc1f89bad9 [2020-08-22 21:51:25,068 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/375a773bd/c6712c2f52d244f69259d1956dee72fb [2020-08-22 21:51:25,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 21:51:25,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 21:51:25,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 21:51:25,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 21:51:25,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 21:51:25,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:51:25" (1/1) ... [2020-08-22 21:51:25,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5729685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25, skipping insertion in model container [2020-08-22 21:51:25,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:51:25" (1/1) ... [2020-08-22 21:51:25,103 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 21:51:25,116 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 21:51:25,301 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:51:25,310 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 21:51:25,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:51:25,348 INFO L208 MainTranslator]: Completed translation [2020-08-22 21:51:25,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25 WrapperNode [2020-08-22 21:51:25,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 21:51:25,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 21:51:25,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 21:51:25,351 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 21:51:25,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25" (1/1) ... [2020-08-22 21:51:25,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25" (1/1) ... [2020-08-22 21:51:25,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25" (1/1) ... [2020-08-22 21:51:25,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25" (1/1) ... [2020-08-22 21:51:25,487 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25" (1/1) ... [2020-08-22 21:51:25,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25" (1/1) ... [2020-08-22 21:51:25,491 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25" (1/1) ... [2020-08-22 21:51:25,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 21:51:25,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 21:51:25,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 21:51:25,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 21:51:25,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 21:51:25,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 21:51:25,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 21:51:25,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-08-22 21:51:25,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 21:51:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 21:51:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 21:51:25,568 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-08-22 21:51:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 21:51:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 21:51:25,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 21:51:25,778 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 21:51:25,779 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 21:51:25,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:51:25 BoogieIcfgContainer [2020-08-22 21:51:25,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 21:51:25,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 21:51:25,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 21:51:25,788 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 21:51:25,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 09:51:25" (1/3) ... [2020-08-22 21:51:25,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6cd26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:51:25, skipping insertion in model container [2020-08-22 21:51:25,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:25" (2/3) ... [2020-08-22 21:51:25,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b6cd26c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:51:25, skipping insertion in model container [2020-08-22 21:51:25,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:51:25" (3/3) ... [2020-08-22 21:51:25,792 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-08-22 21:51:25,803 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 21:51:25,811 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 21:51:25,828 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 21:51:25,871 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 21:51:25,871 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 21:51:25,871 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 21:51:25,884 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 21:51:25,884 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 21:51:25,884 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 21:51:25,884 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 21:51:25,885 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 21:51:25,918 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-08-22 21:51:25,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-08-22 21:51:25,942 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:25,943 INFO L422 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] [2020-08-22 21:51:25,944 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:25,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:25,950 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-08-22 21:51:25,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:25,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150328266] [2020-08-22 21:51:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:26,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:26,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-08-22 21:51:26,223 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150328266] [2020-08-22 21:51:26,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 21:51:26,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-08-22 21:51:26,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191421810] [2020-08-22 21:51:26,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 21:51:26,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:26,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 21:51:26,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:51:26,248 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2020-08-22 21:51:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:26,462 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-08-22 21:51:26,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-08-22 21:51:26,464 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-08-22 21:51:26,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:26,476 INFO L225 Difference]: With dead ends: 61 [2020-08-22 21:51:26,477 INFO L226 Difference]: Without dead ends: 39 [2020-08-22 21:51:26,482 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-08-22 21:51:26,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-08-22 21:51:26,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-08-22 21:51:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-08-22 21:51:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-08-22 21:51:26,538 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2020-08-22 21:51:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:26,539 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-08-22 21:51:26,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 21:51:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-08-22 21:51:26,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-08-22 21:51:26,542 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:26,543 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:26,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 21:51:26,544 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:26,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-08-22 21:51:26,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:26,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [846922902] [2020-08-22 21:51:26,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:26,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:26,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:26,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:26,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:26,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:26,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-22 21:51:26,729 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [846922902] [2020-08-22 21:51:26,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 21:51:26,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-08-22 21:51:26,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144831677] [2020-08-22 21:51:26,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-08-22 21:51:26,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:26,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-08-22 21:51:26,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-08-22 21:51:26,733 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 8 states. [2020-08-22 21:51:26,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:26,967 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-08-22 21:51:26,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-08-22 21:51:26,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-08-22 21:51:26,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:26,970 INFO L225 Difference]: With dead ends: 50 [2020-08-22 21:51:26,970 INFO L226 Difference]: Without dead ends: 44 [2020-08-22 21:51:26,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-08-22 21:51:26,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-08-22 21:51:26,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-08-22 21:51:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-08-22 21:51:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-08-22 21:51:26,996 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2020-08-22 21:51:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:26,997 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-08-22 21:51:26,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-08-22 21:51:26,997 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-08-22 21:51:26,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-08-22 21:51:26,999 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:26,999 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 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, 1, 1, 1, 1] [2020-08-22 21:51:26,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 21:51:27,000 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:27,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2094172607, now seen corresponding path program 1 times [2020-08-22 21:51:27,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:27,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1226970283] [2020-08-22 21:51:27,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,098 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-08-22 21:51:27,099 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1226970283] [2020-08-22 21:51:27,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:27,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-22 21:51:27,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444784938] [2020-08-22 21:51:27,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 21:51:27,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:27,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 21:51:27,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 21:51:27,101 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2020-08-22 21:51:27,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:27,173 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2020-08-22 21:51:27,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 21:51:27,174 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-08-22 21:51:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:27,176 INFO L225 Difference]: With dead ends: 73 [2020-08-22 21:51:27,176 INFO L226 Difference]: Without dead ends: 44 [2020-08-22 21:51:27,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:51:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-08-22 21:51:27,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-08-22 21:51:27,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-08-22 21:51:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-08-22 21:51:27,191 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 43 [2020-08-22 21:51:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:27,192 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-08-22 21:51:27,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 21:51:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-08-22 21:51:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-08-22 21:51:27,194 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:27,200 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:27,200 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 21:51:27,200 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:27,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:27,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1685750542, now seen corresponding path program 1 times [2020-08-22 21:51:27,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:27,202 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [326439912] [2020-08-22 21:51:27,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:27,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-08-22 21:51:27,419 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [326439912] [2020-08-22 21:51:27,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:27,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-08-22 21:51:27,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014730286] [2020-08-22 21:51:27,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 21:51:27,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:27,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 21:51:27,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-08-22 21:51:27,422 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 13 states. [2020-08-22 21:51:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:28,001 INFO L93 Difference]: Finished difference Result 87 states and 120 transitions. [2020-08-22 21:51:28,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-08-22 21:51:28,002 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2020-08-22 21:51:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:28,005 INFO L225 Difference]: With dead ends: 87 [2020-08-22 21:51:28,006 INFO L226 Difference]: Without dead ends: 81 [2020-08-22 21:51:28,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2020-08-22 21:51:28,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-08-22 21:51:28,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2020-08-22 21:51:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-08-22 21:51:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2020-08-22 21:51:28,027 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 53 [2020-08-22 21:51:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:28,028 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2020-08-22 21:51:28,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 21:51:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2020-08-22 21:51:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-22 21:51:28,031 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:28,031 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:28,031 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 21:51:28,031 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:28,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:28,032 INFO L82 PathProgramCache]: Analyzing trace with hash 358541405, now seen corresponding path program 2 times [2020-08-22 21:51:28,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:28,032 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1795825356] [2020-08-22 21:51:28,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:28,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,065 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:28,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:28,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-08-22 21:51:28,194 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1795825356] [2020-08-22 21:51:28,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:28,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-08-22 21:51:28,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323828744] [2020-08-22 21:51:28,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-08-22 21:51:28,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:28,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-08-22 21:51:28,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-08-22 21:51:28,196 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 7 states. [2020-08-22 21:51:28,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:28,332 INFO L93 Difference]: Finished difference Result 125 states and 192 transitions. [2020-08-22 21:51:28,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 21:51:28,333 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-08-22 21:51:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:28,336 INFO L225 Difference]: With dead ends: 125 [2020-08-22 21:51:28,336 INFO L226 Difference]: Without dead ends: 81 [2020-08-22 21:51:28,341 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-08-22 21:51:28,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-08-22 21:51:28,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-08-22 21:51:28,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-08-22 21:51:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2020-08-22 21:51:28,378 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 63 [2020-08-22 21:51:28,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:28,381 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2020-08-22 21:51:28,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-08-22 21:51:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-08-22 21:51:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-08-22 21:51:28,384 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:28,384 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:28,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 21:51:28,385 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:28,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:28,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1096450289, now seen corresponding path program 3 times [2020-08-22 21:51:28,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:28,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177758200] [2020-08-22 21:51:28,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-08-22 21:51:28,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177758200] [2020-08-22 21:51:28,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:28,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-08-22 21:51:28,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039838055] [2020-08-22 21:51:28,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-08-22 21:51:28,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:28,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-08-22 21:51:28,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-08-22 21:51:28,582 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand 14 states. [2020-08-22 21:51:29,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:29,196 INFO L93 Difference]: Finished difference Result 154 states and 245 transitions. [2020-08-22 21:51:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-08-22 21:51:29,198 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2020-08-22 21:51:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:29,201 INFO L225 Difference]: With dead ends: 154 [2020-08-22 21:51:29,201 INFO L226 Difference]: Without dead ends: 148 [2020-08-22 21:51:29,204 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2020-08-22 21:51:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-08-22 21:51:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 79. [2020-08-22 21:51:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-08-22 21:51:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2020-08-22 21:51:29,263 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 63 [2020-08-22 21:51:29,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:29,264 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2020-08-22 21:51:29,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-08-22 21:51:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2020-08-22 21:51:29,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-08-22 21:51:29,270 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:29,273 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 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, 1, 1, 1] [2020-08-22 21:51:29,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 21:51:29,274 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:29,274 INFO L82 PathProgramCache]: Analyzing trace with hash 449882030, now seen corresponding path program 4 times [2020-08-22 21:51:29,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:29,275 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1980193056] [2020-08-22 21:51:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,360 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-08-22 21:51:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,385 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-08-22 21:51:29,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1980193056] [2020-08-22 21:51:29,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:29,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-08-22 21:51:29,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685618194] [2020-08-22 21:51:29,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-08-22 21:51:29,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:29,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-08-22 21:51:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-08-22 21:51:29,392 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand 4 states. [2020-08-22 21:51:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:29,449 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2020-08-22 21:51:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-08-22 21:51:29,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-08-22 21:51:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:29,453 INFO L225 Difference]: With dead ends: 144 [2020-08-22 21:51:29,453 INFO L226 Difference]: Without dead ends: 78 [2020-08-22 21:51:29,455 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-08-22 21:51:29,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-08-22 21:51:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-08-22 21:51:29,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-08-22 21:51:29,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2020-08-22 21:51:29,490 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 73 [2020-08-22 21:51:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:29,492 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2020-08-22 21:51:29,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-08-22 21:51:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-08-22 21:51:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-08-22 21:51:29,496 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:29,496 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:29,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 21:51:29,497 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash 990403329, now seen corresponding path program 5 times [2020-08-22 21:51:29,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:29,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [450912717] [2020-08-22 21:51:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:29,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 21:51:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 60 proven. 35 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-08-22 21:51:29,808 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [450912717] [2020-08-22 21:51:29,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:29,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-22 21:51:29,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946046244] [2020-08-22 21:51:29,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 21:51:29,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:29,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 21:51:29,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-08-22 21:51:29,810 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 16 states. [2020-08-22 21:51:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:30,477 INFO L93 Difference]: Finished difference Result 145 states and 234 transitions. [2020-08-22 21:51:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-22 21:51:30,484 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2020-08-22 21:51:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:30,486 INFO L225 Difference]: With dead ends: 145 [2020-08-22 21:51:30,486 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 21:51:30,491 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1181, Unknown=0, NotChecked=0, Total=1482 [2020-08-22 21:51:30,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 21:51:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 21:51:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 21:51:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 21:51:30,495 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2020-08-22 21:51:30,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:30,495 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 21:51:30,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 21:51:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 21:51:30,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 21:51:30,496 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 21:51:30,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 21:51:31,916 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2020-08-22 21:51:32,235 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-08-22 21:51:32,355 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-08-22 21:51:32,514 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2020-08-22 21:51:32,709 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2020-08-22 21:51:32,855 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2020-08-22 21:51:33,089 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2020-08-22 21:51:33,290 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2020-08-22 21:51:33,295 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 21:51:33,295 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 21:51:33,295 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 21:51:33,295 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 21:51:33,295 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 21:51:33,296 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 21:51:33,296 INFO L264 CegarLoopResult]: At program point ackermannEXIT(lines 15 23) the Hoare annotation is: (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= |ackermann_#in~m| 0))) (and (or (and (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) .cse0 .cse1) (not .cse2)) (let ((.cse3 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#res|) (= |ackermann_#in~n| 0) (<= ackermann_~m 1) .cse3 .cse0 .cse1) (and .cse3 .cse0 (<= 3 |ackermann_#res|) .cse1) .cse2)))) [2020-08-22 21:51:33,296 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (and (not (= ackermann_~m 0)) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-08-22 21:51:33,296 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2020-08-22 21:51:33,297 INFO L264 CegarLoopResult]: At program point L22-1(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (let ((.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (<= 1 |ackermann_#in~m|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse3 .cse1 .cse2))) (or (= |ackermann_#in~n| 1) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))))) [2020-08-22 21:51:33,297 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (not (= ackermann_~m 0)) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-08-22 21:51:33,297 INFO L264 CegarLoopResult]: At program point L22-2(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (let ((.cse3 (= ackermann_~n |ackermann_#in~n|)) (.cse1 (<= 1 |ackermann_#in~m|)) (.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse3 .cse1 .cse2))) (or (= |ackermann_#in~n| 1) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))))) [2020-08-22 21:51:33,297 INFO L264 CegarLoopResult]: At program point L19(lines 19 21) the Hoare annotation is: (and (not (= ackermann_~m 0)) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-08-22 21:51:33,297 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (and (or (<= 3 |ackermann_#t~ret0|) (<= ackermann_~m 1)) (= |ackermann_#in~n| 0) (<= 2 |ackermann_#t~ret0|) (<= 1 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-08-22 21:51:33,298 INFO L264 CegarLoopResult]: At program point L22-3(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (or (= |ackermann_#in~n| 1) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (<= 3 |ackermann_#t~ret2|) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse1) (and .cse0 .cse1))) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|))) [2020-08-22 21:51:33,298 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (and (or (<= 3 |ackermann_#t~ret0|) (<= ackermann_~m 1)) (= |ackermann_#in~n| 0) (<= 2 |ackermann_#t~ret0|) (<= 1 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-08-22 21:51:33,298 INFO L264 CegarLoopResult]: At program point L22-4(line 22) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (or (= |ackermann_#in~n| 1) .cse0 (and (<= 2 |ackermann_#res|) (<= (+ |ackermann_#in~n| 1) |ackermann_#res|))) (<= 3 |ackermann_#t~ret2|) (let ((.cse1 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse1) (and .cse0 .cse1))) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|))) [2020-08-22 21:51:33,298 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (= |ackermann_#in~m| 0)) [2020-08-22 21:51:33,298 INFO L264 CegarLoopResult]: At program point L20-3(line 20) the Hoare annotation is: (and (<= 2 |ackermann_#res|) (= |ackermann_#in~n| 0) (or (<= ackermann_~m 1) (and (<= 3 |ackermann_#t~ret0|) (<= 3 |ackermann_#res|))) (<= 2 |ackermann_#t~ret0|) (<= 1 |ackermann_#in~m|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-08-22 21:51:33,299 INFO L264 CegarLoopResult]: At program point L22-5(line 22) the Hoare annotation is: (and (<= 3 |ackermann_#t~ret2|) (let ((.cse0 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#t~ret1|) (<= ackermann_~m 1) .cse0) (and (<= 3 |ackermann_#t~ret1|) .cse0))) (<= 3 |ackermann_#res|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-08-22 21:51:33,299 INFO L264 CegarLoopResult]: At program point L16(lines 16 18) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-08-22 21:51:33,299 INFO L264 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (and (<= 3 |ackermann_#t~ret2|) (<= 3 |ackermann_#res|) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (<= 1 |ackermann_#in~m|)) [2020-08-22 21:51:33,299 INFO L264 CegarLoopResult]: At program point L15(lines 15 23) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-08-22 21:51:33,299 INFO L264 CegarLoopResult]: At program point ackermannFINAL(lines 15 23) the Hoare annotation is: (let ((.cse0 (= ackermann_~m |ackermann_#in~m|)) (.cse1 (= ackermann_~n |ackermann_#in~n|)) (.cse2 (= |ackermann_#in~m| 0))) (and (or (and (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) .cse0 .cse1) (not .cse2)) (let ((.cse3 (<= 1 |ackermann_#in~m|))) (or (and (<= 2 |ackermann_#res|) (= |ackermann_#in~n| 0) (<= ackermann_~m 1) .cse3 .cse0 .cse1) (and .cse3 .cse0 (<= 3 |ackermann_#res|) .cse1) .cse2)))) [2020-08-22 21:51:33,299 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-08-22 21:51:33,299 INFO L271 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-08-22 21:51:33,299 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-08-22 21:51:33,299 INFO L271 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-08-22 21:51:33,300 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-08-22 21:51:33,300 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-08-22 21:51:33,300 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 26 46) the Hoare annotation is: true [2020-08-22 21:51:33,300 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 26 46) the Hoare annotation is: true [2020-08-22 21:51:33,300 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: false [2020-08-22 21:51:33,300 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (<= 0 main_~n~0) [2020-08-22 21:51:33,300 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 main_~n~0) [2020-08-22 21:51:33,300 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-08-22 21:51:33,300 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-08-22 21:51:33,301 INFO L264 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-08-22 21:51:33,301 INFO L264 CegarLoopResult]: At program point L40-3(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|) (<= 1 main_~result~0)) [2020-08-22 21:51:33,301 INFO L271 CegarLoopResult]: At program point L34(lines 34 39) the Hoare annotation is: true [2020-08-22 21:51:33,301 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2020-08-22 21:51:33,301 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 46) the Hoare annotation is: true [2020-08-22 21:51:33,301 INFO L271 CegarLoopResult]: At program point L28(lines 28 32) the Hoare annotation is: true [2020-08-22 21:51:33,301 INFO L264 CegarLoopResult]: At program point L41(lines 41 45) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 main_~result~0)) [2020-08-22 21:51:33,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 09:51:33 BoogieIcfgContainer [2020-08-22 21:51:33,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 21:51:33,322 INFO L168 Benchmark]: Toolchain (without parser) took 8243.08 ms. Allocated memory was 138.4 MB in the beginning and 310.4 MB in the end (delta: 172.0 MB). Free memory was 102.7 MB in the beginning and 102.0 MB in the end (delta: 694.2 kB). Peak memory consumption was 180.5 MB. Max. memory is 7.1 GB. [2020-08-22 21:51:33,323 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 138.4 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 21:51:33,323 INFO L168 Benchmark]: CACSL2BoogieTranslator took 266.78 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 93.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-08-22 21:51:33,324 INFO L168 Benchmark]: Boogie Preprocessor took 142.13 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 181.5 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-08-22 21:51:33,325 INFO L168 Benchmark]: RCFGBuilder took 290.50 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 166.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2020-08-22 21:51:33,325 INFO L168 Benchmark]: TraceAbstraction took 7535.97 ms. Allocated memory was 202.9 MB in the beginning and 310.4 MB in the end (delta: 107.5 MB). Free memory was 166.9 MB in the beginning and 102.0 MB in the end (delta: 64.9 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB. [2020-08-22 21:51:33,329 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 138.4 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 266.78 ms. Allocated memory is still 138.4 MB. Free memory was 102.5 MB in the beginning and 93.0 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.13 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 93.0 MB in the beginning and 181.5 MB in the end (delta: -88.6 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 290.50 ms. Allocated memory is still 202.9 MB. Free memory was 181.5 MB in the beginning and 166.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7535.97 ms. Allocated memory was 202.9 MB in the beginning and 310.4 MB in the end (delta: 107.5 MB). Free memory was 166.9 MB in the beginning and 102.0 MB in the end (delta: 64.9 MB). Peak memory consumption was 180.3 MB. Max. memory is 7.1 GB. * 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 - ProcedureContractResult [Line: 15]: Procedure Contract for ackermann Derived contract for procedure ackermann: (((\old(n) + 1 <= \result && m == \old(m)) && n == \old(n)) || !(\old(m) == 0)) && (((((((2 <= \result && \old(n) == 0) && m <= 1) && 1 <= \old(m)) && m == \old(m)) && n == \old(n)) || (((1 <= \old(m) && m == \old(m)) && 3 <= \result) && n == \old(n))) || \old(m) == 0) - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 8, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 290 SDtfs, 344 SDslu, 1230 SDs, 0 SdLazy, 1321 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 95 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 566 PreInvPairs, 997 NumberOfFragments, 527 HoareAnnotationTreeSize, 566 FomulaSimplifications, 72363 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 44 FomulaSimplificationsInter, 2444 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 52851 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 355/435 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...