/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/Ackermann04.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 21:51:29,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 21:51:29,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 21:51:29,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 21:51:29,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 21:51:29,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 21:51:29,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 21:51:29,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 21:51:29,859 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 21:51:29,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 21:51:29,863 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 21:51:29,865 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 21:51:29,865 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 21:51:29,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 21:51:29,868 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 21:51:29,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 21:51:29,870 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 21:51:29,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 21:51:29,873 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 21:51:29,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 21:51:29,878 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 21:51:29,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 21:51:29,881 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 21:51:29,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 21:51:29,887 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 21:51:29,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 21:51:29,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 21:51:29,892 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 21:51:29,892 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 21:51:29,894 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 21:51:29,894 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 21:51:29,894 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 21:51:29,895 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 21:51:29,896 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 21:51:29,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 21:51:29,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 21:51:29,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 21:51:29,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 21:51:29,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 21:51:29,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 21:51:29,900 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 21:51:29,901 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:29,917 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 21:51:29,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 21:51:29,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 21:51:29,919 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 21:51:29,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 21:51:29,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 21:51:29,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 21:51:29,919 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 21:51:29,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 21:51:29,920 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 21:51:29,921 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 21:51:29,921 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 21:51:29,921 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 21:51:29,921 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 21:51:29,922 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 21:51:29,922 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 21:51:29,922 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 21:51:29,922 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 21:51:29,922 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 21:51:29,923 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 21:51:29,923 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 21:51:29,923 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 21:51:29,923 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:30,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 21:51:30,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 21:51:30,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 21:51:30,230 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 21:51:30,230 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 21:51:30,231 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Ackermann04.c [2020-08-22 21:51:30,292 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae891540e/827f559983634b42b9f18aa0f379b5c9/FLAG29fe369e2 [2020-08-22 21:51:30,705 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 21:51:30,706 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Ackermann04.c [2020-08-22 21:51:30,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae891540e/827f559983634b42b9f18aa0f379b5c9/FLAG29fe369e2 [2020-08-22 21:51:31,101 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae891540e/827f559983634b42b9f18aa0f379b5c9 [2020-08-22 21:51:31,109 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 21:51:31,111 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 21:51:31,112 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 21:51:31,112 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 21:51:31,115 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 21:51:31,116 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:51:31" (1/1) ... [2020-08-22 21:51:31,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63d87313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:31, skipping insertion in model container [2020-08-22 21:51:31,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 09:51:31" (1/1) ... [2020-08-22 21:51:31,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 21:51:31,141 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 21:51:31,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:51:31,321 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 21:51:31,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 21:51:31,353 INFO L208 MainTranslator]: Completed translation [2020-08-22 21:51:31,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:31 WrapperNode [2020-08-22 21:51:31,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 21:51:31,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 21:51:31,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 21:51:31,355 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 21:51:31,368 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:31" (1/1) ... [2020-08-22 21:51:31,368 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:31" (1/1) ... [2020-08-22 21:51:31,451 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:31" (1/1) ... [2020-08-22 21:51:31,451 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:31" (1/1) ... [2020-08-22 21:51:31,455 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:31" (1/1) ... [2020-08-22 21:51:31,457 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:31" (1/1) ... [2020-08-22 21:51:31,458 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:31" (1/1) ... [2020-08-22 21:51:31,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 21:51:31,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 21:51:31,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 21:51:31,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 21:51:31,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 09:51:31" (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:31,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 21:51:31,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 21:51:31,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2020-08-22 21:51:31,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 21:51:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 21:51:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 21:51:31,514 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2020-08-22 21:51:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 21:51:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 21:51:31,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 21:51:31,759 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 21:51:31,760 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 21:51:31,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:51:31 BoogieIcfgContainer [2020-08-22 21:51:31,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 21:51:31,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 21:51:31,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 21:51:31,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 21:51:31,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 09:51:31" (1/3) ... [2020-08-22 21:51:31,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335b86d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:51:31, skipping insertion in model container [2020-08-22 21:51:31,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:31" (2/3) ... [2020-08-22 21:51:31,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@335b86d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 09:51:31, skipping insertion in model container [2020-08-22 21:51:31,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 09:51:31" (3/3) ... [2020-08-22 21:51:31,794 INFO L109 eAbstractionObserver]: Analyzing ICFG Ackermann04.c [2020-08-22 21:51:31,817 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 21:51:31,831 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 21:51:31,842 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 21:51:31,860 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 21:51:31,860 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 21:51:31,861 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-08-22 21:51:31,861 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 21:51:31,861 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 21:51:31,861 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 21:51:31,861 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 21:51:31,862 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 21:51:31,876 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2020-08-22 21:51:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-08-22 21:51:31,887 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:31,888 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:31,889 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:31,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:31,895 INFO L82 PathProgramCache]: Analyzing trace with hash -852610024, now seen corresponding path program 1 times [2020-08-22 21:51:31,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:31,904 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1588578159] [2020-08-22 21:51:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:32,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,142 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:32,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1588578159] [2020-08-22 21:51:32,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 21:51:32,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-08-22 21:51:32,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295541280] [2020-08-22 21:51:32,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 21:51:32,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:32,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 21:51:32,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 21:51:32,171 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 5 states. [2020-08-22 21:51:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:32,313 INFO L93 Difference]: Finished difference Result 88 states and 110 transitions. [2020-08-22 21:51:32,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 21:51:32,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-08-22 21:51:32,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:32,327 INFO L225 Difference]: With dead ends: 88 [2020-08-22 21:51:32,327 INFO L226 Difference]: Without dead ends: 45 [2020-08-22 21:51:32,332 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:51:32,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-08-22 21:51:32,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-08-22 21:51:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-08-22 21:51:32,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2020-08-22 21:51:32,380 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 24 [2020-08-22 21:51:32,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:32,381 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2020-08-22 21:51:32,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 21:51:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2020-08-22 21:51:32,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-08-22 21:51:32,385 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:32,385 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:32,386 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 21:51:32,386 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:32,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1574290279, now seen corresponding path program 1 times [2020-08-22 21:51:32,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:32,388 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1228508429] [2020-08-22 21:51:32,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:32,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-08-22 21:51:32,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1228508429] [2020-08-22 21:51:32,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:32,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-08-22 21:51:32,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223242097] [2020-08-22 21:51:32,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-08-22 21:51:32,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:32,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-08-22 21:51:32,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-08-22 21:51:32,544 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 5 states. [2020-08-22 21:51:32,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:32,685 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2020-08-22 21:51:32,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-08-22 21:51:32,690 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-08-22 21:51:32,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:32,695 INFO L225 Difference]: With dead ends: 83 [2020-08-22 21:51:32,695 INFO L226 Difference]: Without dead ends: 47 [2020-08-22 21:51:32,700 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:51:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-08-22 21:51:32,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-08-22 21:51:32,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-08-22 21:51:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2020-08-22 21:51:32,730 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 34 [2020-08-22 21:51:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:32,730 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2020-08-22 21:51:32,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-08-22 21:51:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2020-08-22 21:51:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-08-22 21:51:32,735 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:32,736 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:32,736 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 21:51:32,737 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:32,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:32,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1685750542, now seen corresponding path program 1 times [2020-08-22 21:51:32,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:32,738 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660313048] [2020-08-22 21:51:32,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:32,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-08-22 21:51:32,899 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660313048] [2020-08-22 21:51:32,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:32,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 21:51:32,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599904969] [2020-08-22 21:51:32,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 21:51:32,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:32,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 21:51:32,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:51:32,902 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand 6 states. [2020-08-22 21:51:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:33,030 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2020-08-22 21:51:33,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 21:51:33,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2020-08-22 21:51:33,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:33,035 INFO L225 Difference]: With dead ends: 75 [2020-08-22 21:51:33,035 INFO L226 Difference]: Without dead ends: 69 [2020-08-22 21:51:33,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-22 21:51:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-08-22 21:51:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-08-22 21:51:33,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-08-22 21:51:33,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2020-08-22 21:51:33,072 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 53 [2020-08-22 21:51:33,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:33,073 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2020-08-22 21:51:33,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 21:51:33,073 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2020-08-22 21:51:33,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-08-22 21:51:33,082 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:33,082 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:33,083 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 21:51:33,083 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:33,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:33,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1817818703, now seen corresponding path program 2 times [2020-08-22 21:51:33,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:33,084 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1027863668] [2020-08-22 21:51:33,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:33,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:33,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 21:51:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2020-08-22 21:51:33,274 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1027863668] [2020-08-22 21:51:33,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:33,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-08-22 21:51:33,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080548151] [2020-08-22 21:51:33,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-08-22 21:51:33,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:33,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-08-22 21:51:33,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-08-22 21:51:33,277 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand 6 states. [2020-08-22 21:51:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:33,403 INFO L93 Difference]: Finished difference Result 107 states and 159 transitions. [2020-08-22 21:51:33,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-08-22 21:51:33,404 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2020-08-22 21:51:33,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:33,409 INFO L225 Difference]: With dead ends: 107 [2020-08-22 21:51:33,409 INFO L226 Difference]: Without dead ends: 101 [2020-08-22 21:51:33,410 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-08-22 21:51:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-08-22 21:51:33,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2020-08-22 21:51:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-08-22 21:51:33,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2020-08-22 21:51:33,439 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 72 [2020-08-22 21:51:33,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:33,440 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2020-08-22 21:51:33,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-08-22 21:51:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2020-08-22 21:51:33,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-08-22 21:51:33,449 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:33,450 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 11, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:33,450 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 21:51:33,450 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1454565455, now seen corresponding path program 3 times [2020-08-22 21:51:33,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:33,452 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1901336235] [2020-08-22 21:51:33,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:33,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 21:51:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2020-08-22 21:51:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:33,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,058 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 197 proven. 298 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2020-08-22 21:51:34,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1901336235] [2020-08-22 21:51:34,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:34,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-08-22 21:51:34,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025717470] [2020-08-22 21:51:34,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-08-22 21:51:34,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:34,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-08-22 21:51:34,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-08-22 21:51:34,062 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. Second operand 9 states. [2020-08-22 21:51:34,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:34,416 INFO L93 Difference]: Finished difference Result 220 states and 441 transitions. [2020-08-22 21:51:34,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-08-22 21:51:34,417 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 179 [2020-08-22 21:51:34,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:34,423 INFO L225 Difference]: With dead ends: 220 [2020-08-22 21:51:34,423 INFO L226 Difference]: Without dead ends: 117 [2020-08-22 21:51:34,428 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2020-08-22 21:51:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2020-08-22 21:51:34,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2020-08-22 21:51:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-08-22 21:51:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2020-08-22 21:51:34,455 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 179 [2020-08-22 21:51:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:34,456 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2020-08-22 21:51:34,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-08-22 21:51:34,456 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2020-08-22 21:51:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-22 21:51:34,459 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:34,459 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:34,459 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 21:51:34,459 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1778048969, now seen corresponding path program 4 times [2020-08-22 21:51:34,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:34,460 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2093119801] [2020-08-22 21:51:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:34,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 21:51:34,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2020-08-22 21:51:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 110 proven. 71 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2020-08-22 21:51:34,779 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2093119801] [2020-08-22 21:51:34,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:34,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-22 21:51:34,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476963474] [2020-08-22 21:51:34,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 21:51:34,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:34,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 21:51:34,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2020-08-22 21:51:34,781 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand 15 states. [2020-08-22 21:51:35,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:35,437 INFO L93 Difference]: Finished difference Result 255 states and 430 transitions. [2020-08-22 21:51:35,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-08-22 21:51:35,437 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 121 [2020-08-22 21:51:35,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:35,445 INFO L225 Difference]: With dead ends: 255 [2020-08-22 21:51:35,445 INFO L226 Difference]: Without dead ends: 156 [2020-08-22 21:51:35,448 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2020-08-22 21:51:35,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2020-08-22 21:51:35,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 116. [2020-08-22 21:51:35,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-08-22 21:51:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 158 transitions. [2020-08-22 21:51:35,503 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 158 transitions. Word has length 121 [2020-08-22 21:51:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:35,504 INFO L479 AbstractCegarLoop]: Abstraction has 116 states and 158 transitions. [2020-08-22 21:51:35,504 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 21:51:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 158 transitions. [2020-08-22 21:51:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2020-08-22 21:51:35,508 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:35,509 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 9, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:35,509 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 21:51:35,509 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:35,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1276982865, now seen corresponding path program 5 times [2020-08-22 21:51:35,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:35,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1143250422] [2020-08-22 21:51:35,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,597 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:35,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,753 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:35,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 21:51:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:35,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2020-08-22 21:51:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:35,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:35,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:35,915 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 134 proven. 193 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2020-08-22 21:51:35,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1143250422] [2020-08-22 21:51:35,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:35,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-08-22 21:51:35,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839295608] [2020-08-22 21:51:35,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 21:51:35,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:35,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 21:51:35,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2020-08-22 21:51:35,923 INFO L87 Difference]: Start difference. First operand 116 states and 158 transitions. Second operand 15 states. [2020-08-22 21:51:36,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:36,861 INFO L93 Difference]: Finished difference Result 272 states and 442 transitions. [2020-08-22 21:51:36,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2020-08-22 21:51:36,861 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 159 [2020-08-22 21:51:36,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:36,865 INFO L225 Difference]: With dead ends: 272 [2020-08-22 21:51:36,866 INFO L226 Difference]: Without dead ends: 173 [2020-08-22 21:51:36,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=564, Invalid=1886, Unknown=0, NotChecked=0, Total=2450 [2020-08-22 21:51:36,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-08-22 21:51:36,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 129. [2020-08-22 21:51:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2020-08-22 21:51:36,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2020-08-22 21:51:36,893 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 159 [2020-08-22 21:51:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:36,894 INFO L479 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2020-08-22 21:51:36,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 21:51:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2020-08-22 21:51:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2020-08-22 21:51:36,897 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:36,897 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 11, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:36,897 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 21:51:36,897 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:36,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:36,898 INFO L82 PathProgramCache]: Analyzing trace with hash 2003866823, now seen corresponding path program 6 times [2020-08-22 21:51:36,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:36,898 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1928831082] [2020-08-22 21:51:36,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:36,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:36,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:36,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 21:51:37,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,185 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 21:51:37,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2020-08-22 21:51:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:37,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 21:51:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:37,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 180 proven. 344 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2020-08-22 21:51:37,318 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1928831082] [2020-08-22 21:51:37,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:37,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-08-22 21:51:37,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75213607] [2020-08-22 21:51:37,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-08-22 21:51:37,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:37,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-08-22 21:51:37,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2020-08-22 21:51:37,321 INFO L87 Difference]: Start difference. First operand 129 states and 173 transitions. Second operand 16 states. [2020-08-22 21:51:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:38,429 INFO L93 Difference]: Finished difference Result 320 states and 507 transitions. [2020-08-22 21:51:38,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-08-22 21:51:38,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 197 [2020-08-22 21:51:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:38,436 INFO L225 Difference]: With dead ends: 320 [2020-08-22 21:51:38,436 INFO L226 Difference]: Without dead ends: 197 [2020-08-22 21:51:38,439 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=732, Invalid=2574, Unknown=0, NotChecked=0, Total=3306 [2020-08-22 21:51:38,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-08-22 21:51:38,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 153. [2020-08-22 21:51:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-08-22 21:51:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 207 transitions. [2020-08-22 21:51:38,467 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 207 transitions. Word has length 197 [2020-08-22 21:51:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:38,468 INFO L479 AbstractCegarLoop]: Abstraction has 153 states and 207 transitions. [2020-08-22 21:51:38,468 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-08-22 21:51:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 207 transitions. [2020-08-22 21:51:38,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2020-08-22 21:51:38,472 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:38,472 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 13, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:38,473 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 21:51:38,473 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:38,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:38,473 INFO L82 PathProgramCache]: Analyzing trace with hash 159100369, now seen corresponding path program 7 times [2020-08-22 21:51:38,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:38,474 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2055814901] [2020-08-22 21:51:38,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:38,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 21:51:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,956 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 21:51:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:38,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 21:51:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:39,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-08-22 21:51:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:39,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:39,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:39,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:39,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:39,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:39,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:39,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 21:51:39,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:39,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 21:51:39,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1664 backedges. 525 proven. 337 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2020-08-22 21:51:39,238 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2055814901] [2020-08-22 21:51:39,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:39,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-08-22 21:51:39,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345266250] [2020-08-22 21:51:39,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-08-22 21:51:39,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:39,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-08-22 21:51:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2020-08-22 21:51:39,241 INFO L87 Difference]: Start difference. First operand 153 states and 207 transitions. Second operand 22 states. [2020-08-22 21:51:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:41,506 INFO L93 Difference]: Finished difference Result 404 states and 637 transitions. [2020-08-22 21:51:41,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2020-08-22 21:51:41,506 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 235 [2020-08-22 21:51:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:41,512 INFO L225 Difference]: With dead ends: 404 [2020-08-22 21:51:41,512 INFO L226 Difference]: Without dead ends: 269 [2020-08-22 21:51:41,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1621, Invalid=6935, Unknown=0, NotChecked=0, Total=8556 [2020-08-22 21:51:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2020-08-22 21:51:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 189. [2020-08-22 21:51:41,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-08-22 21:51:41,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2020-08-22 21:51:41,556 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 235 [2020-08-22 21:51:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:41,557 INFO L479 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2020-08-22 21:51:41,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-08-22 21:51:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2020-08-22 21:51:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2020-08-22 21:51:41,562 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:41,562 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 14, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:41,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 21:51:41,563 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:41,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:41,563 INFO L82 PathProgramCache]: Analyzing trace with hash 29784778, now seen corresponding path program 8 times [2020-08-22 21:51:41,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:41,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1410574063] [2020-08-22 21:51:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 21:51:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:41,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:41,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:41,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 21:51:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 21:51:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-08-22 21:51:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,181 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 21:51:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 21:51:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-08-22 21:51:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1985 backedges. 588 proven. 448 refuted. 0 times theorem prover too weak. 949 trivial. 0 not checked. [2020-08-22 21:51:42,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1410574063] [2020-08-22 21:51:42,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:42,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-08-22 21:51:42,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810540018] [2020-08-22 21:51:42,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-08-22 21:51:42,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:42,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-08-22 21:51:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2020-08-22 21:51:42,387 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand 23 states. [2020-08-22 21:51:44,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:44,740 INFO L93 Difference]: Finished difference Result 476 states and 780 transitions. [2020-08-22 21:51:44,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2020-08-22 21:51:44,740 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 254 [2020-08-22 21:51:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:44,746 INFO L225 Difference]: With dead ends: 476 [2020-08-22 21:51:44,747 INFO L226 Difference]: Without dead ends: 305 [2020-08-22 21:51:44,753 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2986 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1883, Invalid=8217, Unknown=0, NotChecked=0, Total=10100 [2020-08-22 21:51:44,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-08-22 21:51:44,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 213. [2020-08-22 21:51:44,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2020-08-22 21:51:44,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2020-08-22 21:51:44,786 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 254 [2020-08-22 21:51:44,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:44,787 INFO L479 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2020-08-22 21:51:44,787 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-08-22 21:51:44,787 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2020-08-22 21:51:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2020-08-22 21:51:44,791 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 21:51:44,791 INFO L422 BasicCegarLoop]: trace histogram [27, 27, 27, 15, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 21:51:44,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 21:51:44,791 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 21:51:44,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 21:51:44,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1139770503, now seen corresponding path program 9 times [2020-08-22 21:51:44,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 21:51:44,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1608322314] [2020-08-22 21:51:44,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 21:51:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:44,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 21:51:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:44,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-08-22 21:51:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2020-08-22 21:51:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,057 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 21:51:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 21:51:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2020-08-22 21:51:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,337 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-08-22 21:51:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2020-08-22 21:51:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 21:51:45,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2020-08-22 21:51:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2020-08-22 21:51:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2020-08-22 21:51:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 21:51:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2335 backedges. 865 proven. 70 refuted. 0 times theorem prover too weak. 1400 trivial. 0 not checked. [2020-08-22 21:51:45,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1608322314] [2020-08-22 21:51:45,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-08-22 21:51:45,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-08-22 21:51:45,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358182246] [2020-08-22 21:51:45,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-08-22 21:51:45,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 21:51:45,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-08-22 21:51:45,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2020-08-22 21:51:45,560 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand 25 states. [2020-08-22 21:51:47,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 21:51:47,090 INFO L93 Difference]: Finished difference Result 305 states and 430 transitions. [2020-08-22 21:51:47,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2020-08-22 21:51:47,090 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 273 [2020-08-22 21:51:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 21:51:47,092 INFO L225 Difference]: With dead ends: 305 [2020-08-22 21:51:47,092 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 21:51:47,100 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1039 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1063, Invalid=4339, Unknown=0, NotChecked=0, Total=5402 [2020-08-22 21:51:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 21:51:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 21:51:47,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 21:51:47,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 21:51:47,101 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 273 [2020-08-22 21:51:47,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 21:51:47,102 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 21:51:47,102 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-08-22 21:51:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 21:51:47,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 21:51:47,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-08-22 21:51:47,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 21:51:47,548 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 69 [2020-08-22 21:51:47,950 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 36 [2020-08-22 21:51:48,188 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 84 [2020-08-22 21:51:48,802 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 86 [2020-08-22 21:51:55,518 WARN L193 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 187 DAG size of output: 42 [2020-08-22 21:51:56,782 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 187 DAG size of output: 42 [2020-08-22 21:51:58,427 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 231 DAG size of output: 52 [2020-08-22 21:51:58,602 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-08-22 21:52:00,361 WARN L193 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 231 DAG size of output: 52 [2020-08-22 21:52:00,536 WARN L193 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-08-22 21:52:01,522 WARN L193 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 51 [2020-08-22 21:52:01,683 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 23 [2020-08-22 21:52:02,849 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 132 DAG size of output: 47 [2020-08-22 21:52:03,780 WARN L193 SmtUtils]: Spent 861.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2020-08-22 21:52:04,618 WARN L193 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 55 [2020-08-22 21:52:04,623 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 21:52:04,623 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 21:52:04,623 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 21:52:04,623 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 21:52:04,623 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 21:52:04,623 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 21:52:04,624 INFO L264 CegarLoopResult]: At program point ackermannEXIT(lines 14 22) the Hoare annotation is: (let ((.cse5 (= |ackermann_#in~n| 0)) (.cse4 (<= |ackermann_#in~n| 1)) (.cse10 (<= |ackermann_#in~m| 1)) (.cse6 (<= 3 |ackermann_#res|)) (.cse11 (<= 1 |ackermann_#in~m|)) (.cse8 (= ackermann_~m |ackermann_#in~m|)) (.cse9 (= ackermann_~n |ackermann_#in~n|))) (let ((.cse7 (= |ackermann_#in~m| 0)) (.cse1 (<= 7 |ackermann_#res|)) (.cse2 (and .cse4 .cse10 .cse6 .cse11 .cse8 .cse9)) (.cse0 (<= 5 |ackermann_#res|)) (.cse3 (and (<= 2 |ackermann_#res|) .cse10 .cse5 .cse11 .cse8 .cse9))) (and (or (and (<= |ackermann_#in~m| 2) .cse0) .cse1 .cse2 .cse3 (not .cse4) (and .cse5 .cse6) .cse7) (or (and .cse1 .cse8 .cse9) (and .cse10 .cse8) (and .cse4 .cse8 .cse9)) (or (and .cse9 .cse7) .cse11) (or (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) (not .cse7)) (or (and .cse1 .cse9) (not .cse10) (and (<= 6 |ackermann_#res|) .cse9 (<= |ackermann_#in~n| 4)) .cse2 (and (<= |ackermann_#in~n| 3) .cse0 .cse9) .cse3 (and (<= 4 |ackermann_#res|) (<= |ackermann_#in~n| 2) .cse9) (not .cse11))))) [2020-08-22 21:52:04,624 INFO L271 CegarLoopResult]: At program point ackermannENTRY(lines 14 22) the Hoare annotation is: true [2020-08-22 21:52:04,625 INFO L264 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= |ackermann_#in~m| 0))) [2020-08-22 21:52:04,625 INFO L264 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (or (= |ackermann_#in~n| 1) (<= 2 |ackermann_#res|) .cse0) (let ((.cse6 (<= |ackermann_#in~n| 1)) (.cse1 (<= |ackermann_#in~m| 1)) (.cse3 (<= 1 |ackermann_#in~m|)) (.cse2 (<= |ackermann_#in~n| 2)) (.cse8 (<= 5 |ackermann_#t~ret1|)) (.cse4 (= ackermann_~m |ackermann_#in~m|)) (.cse5 (= ackermann_~n |ackermann_#in~n|)) (.cse7 (<= 2 |ackermann_#in~m|))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 (<= 2 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse4 .cse5 .cse7) (and (<= 6 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse1 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse5 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~m| 2) .cse2 .cse8 .cse4 .cse5 .cse7))))) [2020-08-22 21:52:04,625 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|) (not (= |ackermann_#in~m| 0))) [2020-08-22 21:52:04,626 INFO L264 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (let ((.cse0 (<= 3 |ackermann_#t~ret1|))) (and (or (= |ackermann_#in~n| 1) (<= 2 |ackermann_#res|) .cse0) (let ((.cse6 (<= |ackermann_#in~n| 1)) (.cse1 (<= |ackermann_#in~m| 1)) (.cse3 (<= 1 |ackermann_#in~m|)) (.cse2 (<= |ackermann_#in~n| 2)) (.cse8 (<= 5 |ackermann_#t~ret1|)) (.cse4 (= ackermann_~m |ackermann_#in~m|)) (.cse5 (= ackermann_~n |ackermann_#in~n|)) (.cse7 (<= 2 |ackermann_#in~m|))) (or (and .cse1 .cse0 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse1 (<= 2 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse6 .cse0 .cse4 .cse5 .cse7) (and (<= 6 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse1 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret1|) .cse3 .cse4 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse5 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~m| 2) .cse2 .cse8 .cse4 .cse5 .cse7))))) [2020-08-22 21:52:04,626 INFO L264 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (not (= |ackermann_#in~m| 0))) [2020-08-22 21:52:04,626 INFO L264 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (<= 2 |ackermann_#t~ret0|) (or (and (<= |ackermann_#in~m| 1) (<= 1 |ackermann_#in~m|)) (and (<= 3 |ackermann_#t~ret0|) (<= 2 |ackermann_#in~m|))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-08-22 21:52:04,626 INFO L264 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (let ((.cse5 (<= 5 |ackermann_#t~ret2|)) (.cse3 (<= |ackermann_#in~n| 1)) (.cse0 (<= 3 |ackermann_#t~ret1|)) (.cse1 (<= |ackermann_#in~n| 2)) (.cse4 (<= 5 |ackermann_#t~ret1|)) (.cse6 (<= 6 |ackermann_#t~ret1|)) (.cse7 (<= 7 |ackermann_#t~ret2|))) (and (let ((.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 (<= 4 |ackermann_#t~ret2|)) (and .cse3 (<= 2 |ackermann_#t~ret1|) (<= 3 |ackermann_#t~ret2|) .cse2) (and (<= 6 |ackermann_#t~ret2|) .cse4 .cse2 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~n| 3) .cse5 (<= 4 |ackermann_#t~ret1|) .cse2) (and .cse6 .cse7 .cse2))) (or (= |ackermann_#in~n| 1) (<= 2 |ackermann_#res|) .cse0) (= ackermann_~n |ackermann_#in~n|) (let ((.cse8 (<= |ackermann_#in~m| 2)) (.cse9 (<= 2 |ackermann_#in~m|))) (or (and .cse3 .cse0 .cse5 .cse8 .cse9) (and (<= |ackermann_#in~m| 1) (<= 1 |ackermann_#in~m|)) (and .cse3 .cse0 .cse7 .cse9) (and .cse1 .cse4 .cse8 .cse7 .cse9) (and .cse6 .cse7 .cse9))))) [2020-08-22 21:52:04,626 INFO L264 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (and (= |ackermann_#in~n| 0) (<= 2 |ackermann_#t~ret0|) (or (and (<= |ackermann_#in~m| 1) (<= 1 |ackermann_#in~m|)) (and (<= 3 |ackermann_#t~ret0|) (<= 2 |ackermann_#in~m|))) (= ackermann_~n |ackermann_#in~n|) (= ackermann_~m |ackermann_#in~m|)) [2020-08-22 21:52:04,626 INFO L264 CegarLoopResult]: At program point L21-4(line 21) the Hoare annotation is: (let ((.cse5 (<= 5 |ackermann_#t~ret2|)) (.cse3 (<= |ackermann_#in~n| 1)) (.cse0 (<= 3 |ackermann_#t~ret1|)) (.cse1 (<= |ackermann_#in~n| 2)) (.cse4 (<= 5 |ackermann_#t~ret1|)) (.cse6 (<= 6 |ackermann_#t~ret1|)) (.cse7 (<= 7 |ackermann_#t~ret2|))) (and (let ((.cse2 (= ackermann_~m |ackermann_#in~m|))) (or (and .cse0 .cse1 .cse2 (<= 4 |ackermann_#t~ret2|)) (and .cse3 (<= 2 |ackermann_#t~ret1|) (<= 3 |ackermann_#t~ret2|) .cse2) (and (<= 6 |ackermann_#t~ret2|) .cse4 .cse2 (<= |ackermann_#in~n| 4)) (and (<= |ackermann_#in~n| 3) .cse5 (<= 4 |ackermann_#t~ret1|) .cse2) (and .cse6 .cse7 .cse2))) (or (= |ackermann_#in~n| 1) (<= 2 |ackermann_#res|) .cse0) (= ackermann_~n |ackermann_#in~n|) (let ((.cse8 (<= |ackermann_#in~m| 2)) (.cse9 (<= 2 |ackermann_#in~m|))) (or (and .cse3 .cse0 .cse5 .cse8 .cse9) (and (<= |ackermann_#in~m| 1) (<= 1 |ackermann_#in~m|)) (and .cse3 .cse0 .cse7 .cse9) (and .cse1 .cse4 .cse8 .cse7 .cse9) (and .cse6 .cse7 .cse9))))) [2020-08-22 21:52:04,627 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (= |ackermann_#in~m| 0)) [2020-08-22 21:52:04,627 INFO L264 CegarLoopResult]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse0 (= |ackermann_#in~n| 0)) (.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|))) (or (and (<= 2 |ackermann_#res|) (<= |ackermann_#in~m| 1) .cse0 (<= 2 |ackermann_#t~ret0|) (<= 1 |ackermann_#in~m|) .cse1 .cse2) (and .cse0 (<= 3 |ackermann_#t~ret0|) (<= 3 |ackermann_#res|) .cse1 .cse2 (<= 2 |ackermann_#in~m|)))) [2020-08-22 21:52:04,627 INFO L264 CegarLoopResult]: At program point L21-5(line 21) the Hoare annotation is: (and (let ((.cse4 (<= 5 |ackermann_#t~ret2|)) (.cse6 (<= 5 |ackermann_#res|)) (.cse0 (<= |ackermann_#in~m| 1)) (.cse2 (<= |ackermann_#in~n| 1)) (.cse3 (<= 3 |ackermann_#t~ret1|)) (.cse8 (<= 7 |ackermann_#res|)) (.cse7 (<= |ackermann_#in~n| 2)) (.cse1 (<= 5 |ackermann_#t~ret1|)) (.cse5 (<= |ackermann_#in~m| 2)) (.cse9 (<= 7 |ackermann_#t~ret2|))) (or (and (<= 6 |ackermann_#t~ret2|) .cse0 .cse1 (<= 6 |ackermann_#res|) (<= |ackermann_#in~n| 4)) (and .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse0 (<= 2 |ackermann_#t~ret1|) (<= 3 |ackermann_#t~ret2|) (<= 3 |ackermann_#res|)) (and .cse0 .cse4 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret1|) .cse6) (and .cse0 (<= 4 |ackermann_#res|) .cse3 .cse7 (<= 4 |ackermann_#t~ret2|)) (and .cse8 (<= 6 |ackermann_#t~ret1|) .cse9) (and .cse2 .cse8 .cse3 .cse9) (and .cse8 .cse7 .cse1 .cse5 .cse9))) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|) (<= 1 |ackermann_#in~m|)) [2020-08-22 21:52:04,627 INFO L264 CegarLoopResult]: At program point L15(lines 15 17) the Hoare annotation is: (and (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)) [2020-08-22 21:52:04,627 INFO L264 CegarLoopResult]: At program point L21-6(line 21) the Hoare annotation is: (let ((.cse3 (<= |ackermann_#in~m| 1)) (.cse1 (<= 5 |ackermann_#res|)) (.cse9 (<= 1 |ackermann_#in~m|))) (let ((.cse0 (<= |ackermann_#in~m| 2)) (.cse8 (<= 5 |ackermann_#t~ret1|)) (.cse4 (and .cse3 (<= |ackermann_#in~n| 3) (<= 4 |ackermann_#t~ret1|) .cse1 .cse9)) (.cse5 (<= |ackermann_#in~n| 1)) (.cse2 (<= 7 |ackermann_#res|)) (.cse6 (<= 6 |ackermann_#t~ret1|)) (.cse7 (<= |ackermann_#in~n| 2))) (and (or (and .cse0 .cse1) .cse2 .cse3) (or .cse4 .cse5 (and .cse2 .cse6) (and .cse3 (<= 6 |ackermann_#res|)) (and .cse2 .cse7 .cse8 .cse0) (and .cse3 (<= 4 |ackermann_#res|) .cse7)) (let ((.cse10 (<= 3 |ackermann_#res|))) (or (and .cse8 .cse1 .cse9 (<= |ackermann_#in~n| 4)) .cse4 (and .cse5 .cse3 (<= 2 |ackermann_#t~ret1|) .cse9 .cse10) (and .cse2 .cse6 .cse9) (and (<= 3 |ackermann_#t~ret1|) .cse7 .cse10 .cse9))) (= ackermann_~m |ackermann_#in~m|) (= ackermann_~n |ackermann_#in~n|)))) [2020-08-22 21:52:04,627 INFO L264 CegarLoopResult]: At program point L14(lines 14 22) the Hoare annotation is: (= ackermann_~m |ackermann_#in~m|) [2020-08-22 21:52:04,628 INFO L264 CegarLoopResult]: At program point ackermannFINAL(lines 14 22) the Hoare annotation is: (let ((.cse11 (= |ackermann_#in~n| 0)) (.cse4 (<= |ackermann_#in~n| 1)) (.cse3 (<= |ackermann_#in~m| 1)) (.cse12 (<= 3 |ackermann_#res|)) (.cse6 (<= 1 |ackermann_#in~m|)) (.cse1 (= ackermann_~m |ackermann_#in~m|)) (.cse2 (= ackermann_~n |ackermann_#in~n|)) (.cse7 (= |ackermann_#in~m| 0))) (let ((.cse5 (and .cse2 .cse7)) (.cse0 (<= 7 |ackermann_#res|)) (.cse9 (and .cse4 .cse3 .cse12 .cse6 .cse1 .cse2)) (.cse8 (<= 5 |ackermann_#res|)) (.cse10 (and (<= 2 |ackermann_#res|) .cse3 .cse11 .cse6 .cse1 .cse2))) (and (or (and .cse0 .cse1 .cse2) (and .cse3 .cse1) (and .cse4 .cse1 .cse2)) (or .cse5 .cse6) (or (<= (+ |ackermann_#in~n| 1) |ackermann_#res|) (not .cse7)) (or (and (<= |ackermann_#in~m| 2) .cse8) .cse5 .cse0 .cse9 .cse10 (not .cse4) (and .cse11 .cse12)) (or (and .cse0 .cse2) (not .cse3) (and (<= 6 |ackermann_#res|) .cse2 (<= |ackermann_#in~n| 4)) .cse9 (and (<= |ackermann_#in~n| 3) .cse8 .cse2) .cse10 (and (<= 4 |ackermann_#res|) (<= |ackermann_#in~n| 2) .cse2) (not .cse6))))) [2020-08-22 21:52:04,628 INFO L271 CegarLoopResult]: At program point L33(lines 33 38) the Hoare annotation is: true [2020-08-22 21:52:04,628 INFO L271 CegarLoopResult]: At program point L27(lines 27 31) the Hoare annotation is: true [2020-08-22 21:52:04,628 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 25 45) the Hoare annotation is: true [2020-08-22 21:52:04,628 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 25 45) the Hoare annotation is: true [2020-08-22 21:52:04,628 INFO L264 CegarLoopResult]: At program point L40(lines 40 44) the Hoare annotation is: (or (<= 7 main_~result~0) (<= main_~m~0 1) (<= main_~n~0 1)) [2020-08-22 21:52:04,628 INFO L271 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: true [2020-08-22 21:52:04,629 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 43) the Hoare annotation is: false [2020-08-22 21:52:04,629 INFO L271 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: true [2020-08-22 21:52:04,629 INFO L271 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: true [2020-08-22 21:52:04,629 INFO L271 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: true [2020-08-22 21:52:04,629 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 25 45) the Hoare annotation is: true [2020-08-22 21:52:04,629 INFO L271 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-08-22 21:52:04,629 INFO L271 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: true [2020-08-22 21:52:04,629 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: false [2020-08-22 21:52:04,630 INFO L271 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: true [2020-08-22 21:52:04,630 INFO L271 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: true [2020-08-22 21:52:04,630 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (or (<= main_~m~0 1) (<= 7 |main_#t~ret5|) (<= main_~n~0 1)) [2020-08-22 21:52:04,630 INFO L271 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-08-22 21:52:04,630 INFO L264 CegarLoopResult]: At program point L39-2(line 39) the Hoare annotation is: (or (<= main_~m~0 1) (<= 7 |main_#t~ret5|) (<= main_~n~0 1)) [2020-08-22 21:52:04,630 INFO L264 CegarLoopResult]: At program point L39-3(line 39) the Hoare annotation is: (or (<= main_~m~0 1) (and (<= 7 main_~result~0) (<= 7 |main_#t~ret5|)) (<= main_~n~0 1)) [2020-08-22 21:52:04,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.08 09:52:04 BoogieIcfgContainer [2020-08-22 21:52:04,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-08-22 21:52:04,653 INFO L168 Benchmark]: Toolchain (without parser) took 33542.55 ms. Allocated memory was 140.0 MB in the beginning and 671.6 MB in the end (delta: 531.6 MB). Free memory was 103.9 MB in the beginning and 352.7 MB in the end (delta: -248.8 MB). Peak memory consumption was 550.1 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:04,654 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-08-22 21:52:04,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 242.50 ms. Allocated memory is still 140.0 MB. Free memory was 103.6 MB in the beginning and 94.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:04,656 INFO L168 Benchmark]: Boogie Preprocessor took 105.08 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 182.1 MB in the end (delta: -88.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:04,657 INFO L168 Benchmark]: RCFGBuilder took 304.78 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 167.7 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:04,658 INFO L168 Benchmark]: TraceAbstraction took 32876.02 ms. Allocated memory was 203.4 MB in the beginning and 671.6 MB in the end (delta: 468.2 MB). Free memory was 167.1 MB in the beginning and 352.7 MB in the end (delta: -185.6 MB). Peak memory consumption was 549.9 MB. Max. memory is 7.1 GB. [2020-08-22 21:52:04,662 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.19 ms. Allocated memory is still 140.0 MB. Free memory was 122.5 MB in the beginning and 122.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 242.50 ms. Allocated memory is still 140.0 MB. Free memory was 103.6 MB in the beginning and 94.1 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 105.08 ms. Allocated memory was 140.0 MB in the beginning and 203.4 MB in the end (delta: 63.4 MB). Free memory was 94.1 MB in the beginning and 182.1 MB in the end (delta: -88.0 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 304.78 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 167.7 MB in the end (delta: 14.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32876.02 ms. Allocated memory was 203.4 MB in the beginning and 671.6 MB in the end (delta: 468.2 MB). Free memory was 167.1 MB in the beginning and 352.7 MB in the end (delta: -185.6 MB). Peak memory consumption was 549.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: 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: 14]: Procedure Contract for ackermann Derived contract for procedure ackermann: ((((((((((\old(m) <= 2 && 5 <= \result) || 7 <= \result) || (((((\old(n) <= 1 && \old(m) <= 1) && 3 <= \result) && 1 <= \old(m)) && m == \old(m)) && n == \old(n))) || (((((2 <= \result && \old(m) <= 1) && \old(n) == 0) && 1 <= \old(m)) && m == \old(m)) && n == \old(n))) || !(\old(n) <= 1)) || (\old(n) == 0 && 3 <= \result)) || \old(m) == 0) && ((((7 <= \result && m == \old(m)) && n == \old(n)) || (\old(m) <= 1 && m == \old(m))) || ((\old(n) <= 1 && m == \old(m)) && n == \old(n)))) && ((n == \old(n) && \old(m) == 0) || 1 <= \old(m))) && (\old(n) + 1 <= \result || !(\old(m) == 0))) && ((((((((7 <= \result && n == \old(n)) || !(\old(m) <= 1)) || ((6 <= \result && n == \old(n)) && \old(n) <= 4)) || (((((\old(n) <= 1 && \old(m) <= 1) && 3 <= \result) && 1 <= \old(m)) && m == \old(m)) && n == \old(n))) || ((\old(n) <= 3 && 5 <= \result) && n == \old(n))) || (((((2 <= \result && \old(m) <= 1) && \old(n) == 0) && 1 <= \old(m)) && m == \old(m)) && n == \old(n))) || ((4 <= \result && \old(n) <= 2) && n == \old(n))) || !(1 <= \old(m))) - ProcedureContractResult [Line: 25]: 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: 15.2s, OverallIterations: 11, TraceHistogramMax: 27, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 513 SDtfs, 859 SDslu, 2447 SDs, 0 SdLazy, 3979 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 437 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8124 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 301 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 2564 PreInvPairs, 8126 NumberOfFragments, 1448 HoareAnnotationTreeSize, 2564 FomulaSimplifications, 3165247 FormulaSimplificationTreeSizeReduction, 7.0s HoareSimplificationTime, 44 FomulaSimplificationsInter, 479367 FormulaSimplificationTreeSizeReductionInter, 10.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1601 NumberOfCodeBlocks, 1601 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1590 ConstructedInterpolants, 0 QuantifiedInterpolants, 567666 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 7311/9115 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...