/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-3af5e1f [2020-09-04 21:37:41,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:37:41,345 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:37:41,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:37:41,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:37:41,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:37:41,393 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:37:41,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:37:41,400 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:37:41,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:37:41,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:37:41,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:37:41,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:37:41,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:37:41,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:37:41,409 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:37:41,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:37:41,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:37:41,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:37:41,413 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:37:41,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:37:41,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:37:41,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:37:41,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:37:41,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:37:41,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:37:41,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:37:41,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:37:41,422 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:37:41,423 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:37:41,423 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:37:41,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:37:41,424 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:37:41,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:37:41,426 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:37:41,426 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:37:41,427 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:37:41,427 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:37:41,427 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:37:41,428 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:37:41,429 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:37:41,429 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:37:41,440 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:37:41,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:37:41,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:37:41,442 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:37:41,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:37:41,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:37:41,442 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:37:41,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:37:41,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:37:41,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:37:41,443 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:37:41,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:37:41,443 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:37:41,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:37:41,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:37:41,444 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:37:41,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:37:41,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:37:41,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:37:41,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:37:41,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:37:41,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:37:41,445 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-09-04 21:37:41,877 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:37:41,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:37:41,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:37:41,910 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:37:41,910 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:37:41,911 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-09-04 21:37:42,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59da4c83b/52790123ba11438590933e935c42640e/FLAG57141231e [2020-09-04 21:37:42,520 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:37:42,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive/Ackermann01-2.c [2020-09-04 21:37:42,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59da4c83b/52790123ba11438590933e935c42640e/FLAG57141231e [2020-09-04 21:37:42,862 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/59da4c83b/52790123ba11438590933e935c42640e [2020-09-04 21:37:42,879 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:37:42,882 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:37:42,884 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:37:42,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:37:42,889 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:37:42,890 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:37:42" (1/1) ... [2020-09-04 21:37:42,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d72532b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:42, skipping insertion in model container [2020-09-04 21:37:42,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:37:42" (1/1) ... [2020-09-04 21:37:42,905 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:37:42,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:37:43,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:37:43,137 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:37:43,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:37:43,176 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:37:43,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43 WrapperNode [2020-09-04 21:37:43,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:37:43,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:37:43,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:37:43,178 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:37:43,195 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43" (1/1) ... [2020-09-04 21:37:43,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43" (1/1) ... [2020-09-04 21:37:43,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43" (1/1) ... [2020-09-04 21:37:43,276 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43" (1/1) ... [2020-09-04 21:37:43,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43" (1/1) ... [2020-09-04 21:37:43,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43" (1/1) ... [2020-09-04 21:37:43,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43" (1/1) ... [2020-09-04 21:37:43,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:37:43,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:37:43,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:37:43,286 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:37:43,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 21:37:43,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:37:43,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:37:43,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-09-04 21:37:43,363 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:37:43,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:37:43,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:37:43,364 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-09-04 21:37:43,364 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:37:43,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:37:43,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:37:43,601 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:37:43,601 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:37:43,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:37:43 BoogieIcfgContainer [2020-09-04 21:37:43,607 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:37:43,608 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:37:43,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:37:43,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:37:43,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:37:42" (1/3) ... [2020-09-04 21:37:43,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737e9d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:37:43, skipping insertion in model container [2020-09-04 21:37:43,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:37:43" (2/3) ... [2020-09-04 21:37:43,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@737e9d7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:37:43, skipping insertion in model container [2020-09-04 21:37:43,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:37:43" (3/3) ... [2020-09-04 21:37:43,616 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2020-09-04 21:37:43,628 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:37:43,640 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:37:43,668 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:37:43,701 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:37:43,702 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:37:43,702 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:37:43,702 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:37:43,703 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:37:43,703 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:37:43,703 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:37:43,703 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:37:43,730 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-09-04 21:37:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-09-04 21:37:43,747 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:43,748 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-09-04 21:37:43,749 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:43,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:43,757 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-09-04 21:37:43,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:43,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599836297] [2020-09-04 21:37:43,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:43,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 21:37:44,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599836297] [2020-09-04 21:37:44,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:37:44,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 21:37:44,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322777006] [2020-09-04 21:37:44,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:37:44,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:44,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:37:44,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:37:44,118 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 7 states. [2020-09-04 21:37:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:44,395 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-09-04 21:37:44,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 21:37:44,397 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-09-04 21:37:44,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:44,412 INFO L225 Difference]: With dead ends: 61 [2020-09-04 21:37:44,412 INFO L226 Difference]: Without dead ends: 39 [2020-09-04 21:37:44,417 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-09-04 21:37:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-09-04 21:37:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-09-04 21:37:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-09-04 21:37:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-09-04 21:37:44,482 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 24 [2020-09-04 21:37:44,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:44,483 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-09-04 21:37:44,483 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:37:44,483 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-09-04 21:37:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-09-04 21:37:44,486 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:44,487 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-09-04 21:37:44,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:37:44,488 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:44,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:44,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-09-04 21:37:44,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:44,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [440836482] [2020-09-04 21:37:44,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:44,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,613 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:44,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-09-04 21:37:44,692 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [440836482] [2020-09-04 21:37:44,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:37:44,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 21:37:44,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606571212] [2020-09-04 21:37:44,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 21:37:44,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 21:37:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-09-04 21:37:44,699 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 8 states. [2020-09-04 21:37:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:44,960 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2020-09-04 21:37:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 21:37:44,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2020-09-04 21:37:44,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:44,965 INFO L225 Difference]: With dead ends: 50 [2020-09-04 21:37:44,965 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 21:37:44,966 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-09-04 21:37:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 21:37:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2020-09-04 21:37:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-09-04 21:37:44,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2020-09-04 21:37:44,980 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 34 [2020-09-04 21:37:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:44,981 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2020-09-04 21:37:44,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 21:37:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2020-09-04 21:37:44,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-09-04 21:37:44,983 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:44,984 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-09-04 21:37:44,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:37:44,984 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:44,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:44,985 INFO L82 PathProgramCache]: Analyzing trace with hash 2094172607, now seen corresponding path program 1 times [2020-09-04 21:37:44,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:44,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1890599873] [2020-09-04 21:37:44,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,026 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:45,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 21:37:45,090 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1890599873] [2020-09-04 21:37:45,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:45,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-09-04 21:37:45,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369717368] [2020-09-04 21:37:45,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 21:37:45,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:45,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 21:37:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 21:37:45,092 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 5 states. [2020-09-04 21:37:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:45,164 INFO L93 Difference]: Finished difference Result 73 states and 90 transitions. [2020-09-04 21:37:45,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 21:37:45,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2020-09-04 21:37:45,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:45,166 INFO L225 Difference]: With dead ends: 73 [2020-09-04 21:37:45,167 INFO L226 Difference]: Without dead ends: 44 [2020-09-04 21:37:45,168 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-09-04 21:37:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-09-04 21:37:45,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2020-09-04 21:37:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-09-04 21:37:45,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2020-09-04 21:37:45,186 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 43 [2020-09-04 21:37:45,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:45,186 INFO L479 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2020-09-04 21:37:45,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 21:37:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-09-04 21:37:45,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-09-04 21:37:45,189 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:45,189 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-09-04 21:37:45,190 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:37:45,190 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:45,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1685750542, now seen corresponding path program 1 times [2020-09-04 21:37:45,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:45,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2132977897] [2020-09-04 21:37:45,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:45,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-09-04 21:37:45,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2132977897] [2020-09-04 21:37:45,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:45,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-09-04 21:37:45,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326975744] [2020-09-04 21:37:45,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:37:45,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:45,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:37:45,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:37:45,452 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 13 states. [2020-09-04 21:37:46,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:46,094 INFO L93 Difference]: Finished difference Result 89 states and 122 transitions. [2020-09-04 21:37:46,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:37:46,095 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2020-09-04 21:37:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:46,101 INFO L225 Difference]: With dead ends: 89 [2020-09-04 21:37:46,101 INFO L226 Difference]: Without dead ends: 83 [2020-09-04 21:37:46,102 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:37:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-09-04 21:37:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 57. [2020-09-04 21:37:46,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-09-04 21:37:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 74 transitions. [2020-09-04 21:37:46,144 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 74 transitions. Word has length 53 [2020-09-04 21:37:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:46,144 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 74 transitions. [2020-09-04 21:37:46,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:37:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 74 transitions. [2020-09-04 21:37:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 21:37:46,150 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:46,150 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-09-04 21:37:46,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:37:46,150 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:46,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash 358541405, now seen corresponding path program 2 times [2020-09-04 21:37:46,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:46,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [379268345] [2020-09-04 21:37:46,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,350 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-09-04 21:37:46,351 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [379268345] [2020-09-04 21:37:46,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:46,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-09-04 21:37:46,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635513301] [2020-09-04 21:37:46,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 21:37:46,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:46,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 21:37:46,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-09-04 21:37:46,353 INFO L87 Difference]: Start difference. First operand 57 states and 74 transitions. Second operand 7 states. [2020-09-04 21:37:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:46,468 INFO L93 Difference]: Finished difference Result 125 states and 192 transitions. [2020-09-04 21:37:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 21:37:46,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2020-09-04 21:37:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:46,471 INFO L225 Difference]: With dead ends: 125 [2020-09-04 21:37:46,471 INFO L226 Difference]: Without dead ends: 81 [2020-09-04 21:37:46,474 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-09-04 21:37:46,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-09-04 21:37:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-09-04 21:37:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-09-04 21:37:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 110 transitions. [2020-09-04 21:37:46,496 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 110 transitions. Word has length 63 [2020-09-04 21:37:46,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:46,496 INFO L479 AbstractCegarLoop]: Abstraction has 81 states and 110 transitions. [2020-09-04 21:37:46,497 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 21:37:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 110 transitions. [2020-09-04 21:37:46,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 21:37:46,499 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:46,500 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-09-04 21:37:46,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:37:46,500 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:46,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:46,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1096450289, now seen corresponding path program 3 times [2020-09-04 21:37:46,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:46,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2074581204] [2020-09-04 21:37:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,610 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:46,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 23 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2020-09-04 21:37:46,723 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2074581204] [2020-09-04 21:37:46,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:46,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-09-04 21:37:46,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843524497] [2020-09-04 21:37:46,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 21:37:46,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:46,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 21:37:46,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-09-04 21:37:46,725 INFO L87 Difference]: Start difference. First operand 81 states and 110 transitions. Second operand 14 states. [2020-09-04 21:37:47,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:47,339 INFO L93 Difference]: Finished difference Result 157 states and 248 transitions. [2020-09-04 21:37:47,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 21:37:47,341 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 63 [2020-09-04 21:37:47,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:47,348 INFO L225 Difference]: With dead ends: 157 [2020-09-04 21:37:47,348 INFO L226 Difference]: Without dead ends: 151 [2020-09-04 21:37:47,351 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2020-09-04 21:37:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2020-09-04 21:37:47,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 79. [2020-09-04 21:37:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-09-04 21:37:47,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2020-09-04 21:37:47,409 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 63 [2020-09-04 21:37:47,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:47,411 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2020-09-04 21:37:47,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 21:37:47,411 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2020-09-04 21:37:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-09-04 21:37:47,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:47,414 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-09-04 21:37:47,414 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:37:47,414 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:47,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:47,415 INFO L82 PathProgramCache]: Analyzing trace with hash 449882030, now seen corresponding path program 4 times [2020-09-04 21:37:47,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:47,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [133378734] [2020-09-04 21:37:47,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,492 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2020-09-04 21:37:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 22 proven. 19 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2020-09-04 21:37:47,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [133378734] [2020-09-04 21:37:47,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:47,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2020-09-04 21:37:47,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131878418] [2020-09-04 21:37:47,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-09-04 21:37:47,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:47,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-09-04 21:37:47,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-09-04 21:37:47,563 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand 4 states. [2020-09-04 21:37:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:47,626 INFO L93 Difference]: Finished difference Result 144 states and 218 transitions. [2020-09-04 21:37:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-09-04 21:37:47,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2020-09-04 21:37:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:47,630 INFO L225 Difference]: With dead ends: 144 [2020-09-04 21:37:47,631 INFO L226 Difference]: Without dead ends: 78 [2020-09-04 21:37:47,633 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-09-04 21:37:47,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-09-04 21:37:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2020-09-04 21:37:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-09-04 21:37:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 104 transitions. [2020-09-04 21:37:47,661 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 104 transitions. Word has length 73 [2020-09-04 21:37:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:47,662 INFO L479 AbstractCegarLoop]: Abstraction has 78 states and 104 transitions. [2020-09-04 21:37:47,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-09-04 21:37:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 104 transitions. [2020-09-04 21:37:47,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-09-04 21:37:47,664 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:37:47,664 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-09-04 21:37:47,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:37:47,665 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:37:47,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:37:47,666 INFO L82 PathProgramCache]: Analyzing trace with hash 990403329, now seen corresponding path program 5 times [2020-09-04 21:37:47,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:37:47,666 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1610251248] [2020-09-04 21:37:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:37:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:37:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-09-04 21:37:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-09-04 21:37:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-09-04 21:37:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-09-04 21:37:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:37:47,991 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 60 proven. 35 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2020-09-04 21:37:47,992 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1610251248] [2020-09-04 21:37:47,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:37:47,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-09-04 21:37:47,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344885516] [2020-09-04 21:37:47,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 21:37:47,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:37:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 21:37:47,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-09-04 21:37:47,994 INFO L87 Difference]: Start difference. First operand 78 states and 104 transitions. Second operand 16 states. [2020-09-04 21:37:48,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:37:48,683 INFO L93 Difference]: Finished difference Result 146 states and 235 transitions. [2020-09-04 21:37:48,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 21:37:48,687 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 92 [2020-09-04 21:37:48,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:37:48,688 INFO L225 Difference]: With dead ends: 146 [2020-09-04 21:37:48,688 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:37:48,691 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1242, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 21:37:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:37:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:37:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:37:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:37:48,693 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 92 [2020-09-04 21:37:48,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:37:48,693 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:37:48,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 21:37:48,693 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:37:48,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:37:48,694 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:37:48,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:37:51,941 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 24 [2020-09-04 21:37:52,044 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2020-09-04 21:37:52,400 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-09-04 21:37:52,570 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-09-04 21:37:52,783 WARN L193 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2020-09-04 21:37:52,899 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2020-09-04 21:37:53,014 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 18 [2020-09-04 21:37:53,203 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2020-09-04 21:37:53,478 WARN L193 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2020-09-04 21:37:53,700 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 26 [2020-09-04 21:37:53,706 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:37:53,706 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:37:53,706 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:37:53,706 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:37:53,706 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:37:53,707 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:37:53,707 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-09-04 21:37:53,707 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-09-04 21:37:53,708 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 15 23) the Hoare annotation is: true [2020-09-04 21:37:53,708 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-09-04 21:37:53,709 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-09-04 21:37:53,709 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-09-04 21:37:53,709 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-09-04 21:37:53,710 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-09-04 21:37:53,710 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-09-04 21:37:53,710 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-09-04 21:37:53,710 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-09-04 21:37:53,710 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (= |ackermann_#in~m| 0)) [2020-09-04 21:37:53,711 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-09-04 21:37:53,711 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-09-04 21:37:53,711 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-09-04 21:37:53,711 INFO L264 CegarLoopResult]: At program point L22-6(line 22) the Hoare annotation is: (and (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-09-04 21:37:53,712 INFO L264 CegarLoopResult]: At program point L15(lines 15 23) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-09-04 21:37:53,712 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-09-04 21:37:53,712 INFO L271 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-09-04 21:37:53,712 INFO L271 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: true [2020-09-04 21:37:53,712 INFO L271 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: true [2020-09-04 21:37:53,712 INFO L271 CegarLoopResult]: At program point L33-2(line 33) the Hoare annotation is: true [2020-09-04 21:37:53,713 INFO L271 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: true [2020-09-04 21:37:53,713 INFO L271 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: true [2020-09-04 21:37:53,713 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 26 46) the Hoare annotation is: true [2020-09-04 21:37:53,713 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 26 46) the Hoare annotation is: true [2020-09-04 21:37:53,713 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: false [2020-09-04 21:37:53,714 INFO L264 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (<= 0 main_~n~0) [2020-09-04 21:37:53,714 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (<= 0 main_~n~0) [2020-09-04 21:37:53,714 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-09-04 21:37:53,714 INFO L271 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-09-04 21:37:53,714 INFO L264 CegarLoopResult]: At program point L40-2(line 40) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 |main_#t~ret5|)) [2020-09-04 21:37:53,714 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-09-04 21:37:53,715 INFO L271 CegarLoopResult]: At program point L34(lines 34 39) the Hoare annotation is: true [2020-09-04 21:37:53,715 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 44) the Hoare annotation is: false [2020-09-04 21:37:53,715 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 26 46) the Hoare annotation is: true [2020-09-04 21:37:53,715 INFO L271 CegarLoopResult]: At program point L28(lines 28 32) the Hoare annotation is: true [2020-09-04 21:37:53,715 INFO L264 CegarLoopResult]: At program point L41(lines 41 45) the Hoare annotation is: (and (<= 0 main_~n~0) (<= 1 main_~result~0)) [2020-09-04 21:37:53,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 09:37:53 BoogieIcfgContainer [2020-09-04 21:37:53,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 21:37:53,747 INFO L168 Benchmark]: Toolchain (without parser) took 10862.48 ms. Allocated memory was 138.9 MB in the beginning and 316.7 MB in the end (delta: 177.7 MB). Free memory was 103.6 MB in the beginning and 95.3 MB in the end (delta: 8.3 MB). Peak memory consumption was 186.7 MB. Max. memory is 7.1 GB. [2020-09-04 21:37:53,748 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 21:37:53,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.38 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:37:53,750 INFO L168 Benchmark]: Boogie Preprocessor took 107.99 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 93.8 MB in the beginning and 180.6 MB in the end (delta: -86.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:37:53,755 INFO L168 Benchmark]: RCFGBuilder took 320.63 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 165.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2020-09-04 21:37:53,756 INFO L168 Benchmark]: TraceAbstraction took 10133.46 ms. Allocated memory was 201.9 MB in the beginning and 316.7 MB in the end (delta: 114.8 MB). Free memory was 164.9 MB in the beginning and 95.3 MB in the end (delta: 69.6 MB). Peak memory consumption was 185.1 MB. Max. memory is 7.1 GB. [2020-09-04 21:37:53,769 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.93 ms. Allocated memory is still 138.9 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 293.38 ms. Allocated memory is still 138.9 MB. Free memory was 103.4 MB in the beginning and 93.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.99 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 93.8 MB in the beginning and 180.6 MB in the end (delta: -86.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 320.63 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 165.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10133.46 ms. Allocated memory was 201.9 MB in the beginning and 316.7 MB in the end (delta: 114.8 MB). Free memory was 164.9 MB in the beginning and 95.3 MB in the end (delta: 69.6 MB). Peak memory consumption was 185.1 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.9s, OverallIterations: 8, TraceHistogramMax: 8, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 289 SDtfs, 352 SDslu, 1204 SDs, 0 SdLazy, 1291 SolverSat, 226 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 246 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.6s 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, 100 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 566 PreInvPairs, 1015 NumberOfFragments, 539 HoareAnnotationTreeSize, 566 FomulaSimplifications, 76054 FormulaSimplificationTreeSizeReduction, 3.0s HoareSimplificationTime, 44 FomulaSimplificationsInter, 2584 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s 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...