/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 -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/recursive-simple/sum_20x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:31:12,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:31:12,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:31:12,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:31:12,616 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:31:12,617 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:31:12,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:31:12,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:31:12,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:31:12,623 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:31:12,624 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:31:12,626 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:31:12,626 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:31:12,627 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:31:12,628 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:31:12,630 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:31:12,631 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:31:12,632 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:31:12,634 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:31:12,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:31:12,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:31:12,643 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:31:12,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:31:12,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:31:12,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:31:12,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:31:12,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:31:12,657 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:31:12,657 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:31:12,660 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:31:12,661 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:31:12,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:31:12,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:31:12,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:31:12,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:31:12,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:31:12,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:31:12,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:31:12,668 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:31:12,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:31:12,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:31:12,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 16:31:12,708 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:31:12,708 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:31:12,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:31:12,710 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:31:12,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:31:12,713 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:31:12,713 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:31:12,713 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:31:12,713 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:31:12,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:31:12,714 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:31:12,714 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:31:12,714 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:31:12,714 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:31:12,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:31:12,716 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:31:12,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:31:12,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:31:12,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:31:12,717 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:31:12,717 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:31:12,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:31:12,717 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:31:13,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:31:13,249 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:31:13,253 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:31:13,255 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:31:13,256 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:31:13,257 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_20x0-2.c [2020-09-04 16:31:13,352 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2ba4b408e/b15948eba3334f0d8824010931fc3eb5/FLAGe1c21b7e1 [2020-09-04 16:31:13,938 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:31:13,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_20x0-2.c [2020-09-04 16:31:13,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2ba4b408e/b15948eba3334f0d8824010931fc3eb5/FLAGe1c21b7e1 [2020-09-04 16:31:14,288 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/2ba4b408e/b15948eba3334f0d8824010931fc3eb5 [2020-09-04 16:31:14,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:31:14,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:31:14,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:31:14,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:31:14,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:31:14,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:31:14" (1/1) ... [2020-09-04 16:31:14,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577beca0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14, skipping insertion in model container [2020-09-04 16:31:14,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:31:14" (1/1) ... [2020-09-04 16:31:14,334 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:31:14,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:31:14,590 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:31:14,596 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:31:14,613 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:31:14,629 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:31:14,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14 WrapperNode [2020-09-04 16:31:14,630 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:31:14,631 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:31:14,631 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:31:14,631 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:31:14,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14" (1/1) ... [2020-09-04 16:31:14,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14" (1/1) ... [2020-09-04 16:31:14,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14" (1/1) ... [2020-09-04 16:31:14,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14" (1/1) ... [2020-09-04 16:31:14,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14" (1/1) ... [2020-09-04 16:31:14,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14" (1/1) ... [2020-09-04 16:31:14,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14" (1/1) ... [2020-09-04 16:31:14,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:31:14,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:31:14,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:31:14,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:31:14,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:31:14,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:31:14,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:31:14,850 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-04 16:31:14,850 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:31:14,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:31:14,851 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-04 16:31:14,851 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:31:14,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:31:14,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:31:15,061 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:31:15,061 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:31:15,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:31:15 BoogieIcfgContainer [2020-09-04 16:31:15,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:31:15,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:31:15,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:31:15,073 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:31:15,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:31:14" (1/3) ... [2020-09-04 16:31:15,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff0671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:31:15, skipping insertion in model container [2020-09-04 16:31:15,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:14" (2/3) ... [2020-09-04 16:31:15,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dff0671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:31:15, skipping insertion in model container [2020-09-04 16:31:15,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:31:15" (3/3) ... [2020-09-04 16:31:15,078 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_20x0-2.c [2020-09-04 16:31:15,093 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:31:15,104 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:31:15,127 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:31:15,155 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:31:15,156 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:31:15,156 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:31:15,156 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:31:15,156 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:31:15,156 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:31:15,156 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:31:15,157 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:31:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-09-04 16:31:15,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 16:31:15,186 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:15,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:15,188 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:15,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:15,195 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-09-04 16:31:15,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:15,208 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384147031] [2020-09-04 16:31:15,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:15,284 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 16:31:15,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1384147031] [2020-09-04 16:31:15,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:15,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:31:15,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709203202] [2020-09-04 16:31:15,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:31:15,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:15,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:31:15,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:31:15,540 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-09-04 16:31:15,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:15,689 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-09-04 16:31:15,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:31:15,692 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-09-04 16:31:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:15,705 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:31:15,705 INFO L226 Difference]: Without dead ends: 25 [2020-09-04 16:31:15,710 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-09-04 16:31:15,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-09-04 16:31:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-09-04 16:31:15,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-09-04 16:31:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-09-04 16:31:15,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-09-04 16:31:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:15,762 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-09-04 16:31:15,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:31:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-09-04 16:31:15,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 16:31:15,765 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:15,765 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] [2020-09-04 16:31:15,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:31:15,766 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-09-04 16:31:15,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:15,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [11097241] [2020-09-04 16:31:15,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:15,770 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-09-04 16:31:15,917 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [11097241] [2020-09-04 16:31:15,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:15,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:31:15,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401768061] [2020-09-04 16:31:15,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:31:15,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:15,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:31:15,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:31:15,920 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-09-04 16:31:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:16,021 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-09-04 16:31:16,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:31:16,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 16:31:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:16,023 INFO L225 Difference]: With dead ends: 36 [2020-09-04 16:31:16,024 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:31:16,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-09-04 16:31:16,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:31:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 16:31:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 16:31:16,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 16:31:16,053 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-09-04 16:31:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:16,053 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 16:31:16,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:31:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 16:31:16,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 16:31:16,056 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:16,057 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:16,058 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:31:16,058 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:16,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-09-04 16:31:16,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:16,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [109403839] [2020-09-04 16:31:16,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:16,069 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-09-04 16:31:16,314 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [109403839] [2020-09-04 16:31:16,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:16,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:31:16,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160666619] [2020-09-04 16:31:16,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:31:16,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:16,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:31:16,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:31:16,316 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-09-04 16:31:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:16,400 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-09-04 16:31:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:31:16,401 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-09-04 16:31:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:16,403 INFO L225 Difference]: With dead ends: 41 [2020-09-04 16:31:16,403 INFO L226 Difference]: Without dead ends: 35 [2020-09-04 16:31:16,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:31:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-09-04 16:31:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-09-04 16:31:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-09-04 16:31:16,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-09-04 16:31:16,417 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-09-04 16:31:16,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:16,418 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-09-04 16:31:16,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:31:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-09-04 16:31:16,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 16:31:16,420 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:16,420 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:16,420 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:31:16,421 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:16,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-09-04 16:31:16,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:16,422 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1896603916] [2020-09-04 16:31:16,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:16,424 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:16,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,665 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-09-04 16:31:16,666 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1896603916] [2020-09-04 16:31:16,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:16,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:31:16,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822788622] [2020-09-04 16:31:16,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:31:16,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:16,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:31:16,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:31:16,670 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-09-04 16:31:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:16,796 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-04 16:31:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:31:16,797 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-09-04 16:31:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:16,800 INFO L225 Difference]: With dead ends: 46 [2020-09-04 16:31:16,800 INFO L226 Difference]: Without dead ends: 40 [2020-09-04 16:31:16,801 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:31:16,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-09-04 16:31:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-09-04 16:31:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-09-04 16:31:16,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-09-04 16:31:16,818 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-09-04 16:31:16,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:16,819 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-09-04 16:31:16,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:31:16,819 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-09-04 16:31:16,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 16:31:16,826 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:16,827 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:16,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:31:16,827 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:16,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-09-04 16:31:16,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:16,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1020081258] [2020-09-04 16:31:16,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:16,831 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:16,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,137 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2020-09-04 16:31:17,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1020081258] [2020-09-04 16:31:17,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:17,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:31:17,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631711315] [2020-09-04 16:31:17,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:31:17,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:17,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:31:17,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:31:17,140 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-09-04 16:31:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:17,228 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 16:31:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:31:17,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-09-04 16:31:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:17,230 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:31:17,230 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 16:31:17,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:31:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 16:31:17,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-04 16:31:17,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 16:31:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-04 16:31:17,253 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-09-04 16:31:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:17,254 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-04 16:31:17,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:31:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-04 16:31:17,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:31:17,256 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:17,256 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:17,256 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:31:17,256 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:17,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-09-04 16:31:17,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:17,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [595485972] [2020-09-04 16:31:17,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:17,259 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,366 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2020-09-04 16:31:17,489 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [595485972] [2020-09-04 16:31:17,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:17,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:31:17,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172807016] [2020-09-04 16:31:17,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:31:17,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:17,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:31:17,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:31:17,492 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-09-04 16:31:17,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:17,611 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-09-04 16:31:17,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:31:17,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-09-04 16:31:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:17,614 INFO L225 Difference]: With dead ends: 56 [2020-09-04 16:31:17,614 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:31:17,615 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:31:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:31:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 16:31:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 16:31:17,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 16:31:17,627 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-09-04 16:31:17,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:17,628 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 16:31:17,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:31:17,629 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 16:31:17,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:31:17,630 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:17,631 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:17,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:31:17,631 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-09-04 16:31:17,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:17,633 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1960201032] [2020-09-04 16:31:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:17,635 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:17,898 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2020-09-04 16:31:17,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1960201032] [2020-09-04 16:31:17,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:17,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:31:17,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300517080] [2020-09-04 16:31:17,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:31:17,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:17,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:31:17,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:31:17,901 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-09-04 16:31:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:18,028 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-04 16:31:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:31:18,028 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-09-04 16:31:18,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:18,030 INFO L225 Difference]: With dead ends: 61 [2020-09-04 16:31:18,030 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 16:31:18,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:31:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 16:31:18,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-09-04 16:31:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 16:31:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-09-04 16:31:18,041 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-09-04 16:31:18,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:18,042 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-09-04 16:31:18,042 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:31:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-09-04 16:31:18,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 16:31:18,043 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:18,044 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:18,044 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:31:18,044 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:18,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:18,045 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-09-04 16:31:18,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:18,045 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618917921] [2020-09-04 16:31:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:18,047 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,280 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2020-09-04 16:31:18,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618917921] [2020-09-04 16:31:18,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:18,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:31:18,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055289285] [2020-09-04 16:31:18,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:31:18,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:18,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:31:18,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:31:18,357 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-09-04 16:31:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:18,510 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-09-04 16:31:18,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:31:18,510 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-09-04 16:31:18,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:18,512 INFO L225 Difference]: With dead ends: 66 [2020-09-04 16:31:18,512 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 16:31:18,513 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:31:18,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 16:31:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-04 16:31:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 16:31:18,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-04 16:31:18,534 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-09-04 16:31:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:18,536 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-04 16:31:18,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:31:18,536 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-04 16:31:18,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 16:31:18,539 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:18,540 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:18,541 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:31:18,541 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-09-04 16:31:18,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:18,543 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [39248591] [2020-09-04 16:31:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:18,549 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,896 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:18,972 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2020-09-04 16:31:18,973 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [39248591] [2020-09-04 16:31:18,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:18,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:31:18,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820312058] [2020-09-04 16:31:18,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:31:18,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:18,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:31:18,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:31:18,993 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-09-04 16:31:19,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:19,162 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-09-04 16:31:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:31:19,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-09-04 16:31:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:19,164 INFO L225 Difference]: With dead ends: 71 [2020-09-04 16:31:19,164 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 16:31:19,165 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:31:19,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 16:31:19,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-09-04 16:31:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 16:31:19,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-09-04 16:31:19,175 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-09-04 16:31:19,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:19,176 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-09-04 16:31:19,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:31:19,176 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-09-04 16:31:19,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-04 16:31:19,178 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:19,178 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:19,178 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:31:19,178 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:19,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:19,179 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-09-04 16:31:19,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:19,179 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [341184482] [2020-09-04 16:31:19,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:19,181 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,364 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2020-09-04 16:31:19,602 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [341184482] [2020-09-04 16:31:19,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:19,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:31:19,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617039727] [2020-09-04 16:31:19,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:31:19,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:19,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:31:19,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:31:19,604 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-09-04 16:31:19,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:19,781 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-04 16:31:19,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:31:19,782 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-09-04 16:31:19,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:19,784 INFO L225 Difference]: With dead ends: 76 [2020-09-04 16:31:19,784 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:31:19,787 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=200, Invalid=352, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:31:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:31:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:31:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:31:19,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 16:31:19,802 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-09-04 16:31:19,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:19,802 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 16:31:19,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:31:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 16:31:19,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:31:19,804 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:19,804 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:19,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:31:19,805 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:19,805 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-09-04 16:31:19,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:19,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [789032666] [2020-09-04 16:31:19,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:19,811 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:19,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,009 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2020-09-04 16:31:20,309 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [789032666] [2020-09-04 16:31:20,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:20,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:31:20,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800921712] [2020-09-04 16:31:20,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:31:20,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:20,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:31:20,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:31:20,311 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-09-04 16:31:20,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:20,516 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-09-04 16:31:20,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:31:20,517 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-09-04 16:31:20,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:20,519 INFO L225 Difference]: With dead ends: 81 [2020-09-04 16:31:20,519 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 16:31:20,520 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=236, Invalid=414, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:31:20,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 16:31:20,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-04 16:31:20,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 16:31:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-09-04 16:31:20,532 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-09-04 16:31:20,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:20,533 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-09-04 16:31:20,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:31:20,533 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-09-04 16:31:20,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-04 16:31:20,535 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:20,535 INFO L422 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:20,535 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:31:20,536 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:20,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-09-04 16:31:20,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:20,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2130646] [2020-09-04 16:31:20,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:20,554 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,614 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:20,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2020-09-04 16:31:21,138 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2130646] [2020-09-04 16:31:21,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:21,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:31:21,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261073064] [2020-09-04 16:31:21,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:31:21,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:21,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:31:21,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:31:21,141 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-09-04 16:31:21,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:21,373 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-09-04 16:31:21,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:31:21,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-09-04 16:31:21,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:21,375 INFO L225 Difference]: With dead ends: 86 [2020-09-04 16:31:21,375 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 16:31:21,376 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=275, Invalid=481, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:31:21,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 16:31:21,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-09-04 16:31:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-04 16:31:21,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-09-04 16:31:21,385 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-09-04 16:31:21,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:21,386 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-09-04 16:31:21,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:31:21,386 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-09-04 16:31:21,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-04 16:31:21,388 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:21,388 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:21,388 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:31:21,388 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:21,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:21,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-09-04 16:31:21,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:21,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [563380818] [2020-09-04 16:31:21,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:21,391 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:21,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:21,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2020-09-04 16:31:22,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [563380818] [2020-09-04 16:31:22,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:22,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:31:22,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074909133] [2020-09-04 16:31:22,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:31:22,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:22,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:31:22,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:31:22,192 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-09-04 16:31:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:22,415 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-09-04 16:31:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:31:22,415 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-09-04 16:31:22,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:22,417 INFO L225 Difference]: With dead ends: 91 [2020-09-04 16:31:22,417 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 16:31:22,418 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:31:22,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 16:31:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-09-04 16:31:22,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 16:31:22,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-09-04 16:31:22,435 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-09-04 16:31:22,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:22,435 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-09-04 16:31:22,435 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:31:22,435 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-09-04 16:31:22,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 16:31:22,437 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:22,437 INFO L422 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:22,437 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:31:22,438 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-09-04 16:31:22,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:22,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [780603596] [2020-09-04 16:31:22,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:22,445 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:22,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,236 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2020-09-04 16:31:23,237 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [780603596] [2020-09-04 16:31:23,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:23,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:31:23,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420105929] [2020-09-04 16:31:23,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:31:23,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:23,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:31:23,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:31:23,238 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-09-04 16:31:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:23,482 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-09-04 16:31:23,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:31:23,483 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-09-04 16:31:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:23,484 INFO L225 Difference]: With dead ends: 96 [2020-09-04 16:31:23,484 INFO L226 Difference]: Without dead ends: 90 [2020-09-04 16:31:23,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=630, Unknown=0, NotChecked=0, Total=992 [2020-09-04 16:31:23,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-04 16:31:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-09-04 16:31:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 16:31:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-09-04 16:31:23,499 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-09-04 16:31:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:23,500 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-09-04 16:31:23,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:31:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-09-04 16:31:23,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 16:31:23,503 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:23,503 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:23,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:31:23,503 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:23,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:23,504 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-09-04 16:31:23,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:23,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1475761753] [2020-09-04 16:31:23,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:23,507 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:23,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2020-09-04 16:31:24,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1475761753] [2020-09-04 16:31:24,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:24,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:31:24,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176784347] [2020-09-04 16:31:24,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:31:24,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:24,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:31:24,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:31:24,394 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-09-04 16:31:24,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:24,737 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-09-04 16:31:24,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:31:24,737 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-09-04 16:31:24,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:24,739 INFO L225 Difference]: With dead ends: 101 [2020-09-04 16:31:24,739 INFO L226 Difference]: Without dead ends: 95 [2020-09-04 16:31:24,741 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=712, Unknown=0, NotChecked=0, Total=1122 [2020-09-04 16:31:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-09-04 16:31:24,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-09-04 16:31:24,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 16:31:24,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-09-04 16:31:24,758 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-09-04 16:31:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:24,762 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-09-04 16:31:24,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:31:24,763 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-09-04 16:31:24,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 16:31:24,765 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:24,765 INFO L422 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:24,765 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:31:24,766 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:24,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:24,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-09-04 16:31:24,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:24,767 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [429540658] [2020-09-04 16:31:24,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:24,768 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:24,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,470 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:25,700 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2020-09-04 16:31:25,700 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [429540658] [2020-09-04 16:31:25,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:25,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:31:25,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453625019] [2020-09-04 16:31:25,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:31:25,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:25,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:31:25,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:31:25,702 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 20 states. [2020-09-04 16:31:26,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:26,004 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-09-04 16:31:26,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:31:26,004 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-09-04 16:31:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:26,006 INFO L225 Difference]: With dead ends: 106 [2020-09-04 16:31:26,006 INFO L226 Difference]: Without dead ends: 100 [2020-09-04 16:31:26,007 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=461, Invalid=799, Unknown=0, NotChecked=0, Total=1260 [2020-09-04 16:31:26,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-09-04 16:31:26,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-09-04 16:31:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 16:31:26,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2020-09-04 16:31:26,017 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 153 [2020-09-04 16:31:26,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:26,020 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2020-09-04 16:31:26,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:31:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2020-09-04 16:31:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-09-04 16:31:26,023 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:26,023 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:26,023 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:31:26,023 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:26,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:26,024 INFO L82 PathProgramCache]: Analyzing trace with hash -76242615, now seen corresponding path program 16 times [2020-09-04 16:31:26,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:26,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [908016009] [2020-09-04 16:31:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:26,026 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2020-09-04 16:31:27,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [908016009] [2020-09-04 16:31:27,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:27,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:31:27,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933929313] [2020-09-04 16:31:27,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:31:27,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:27,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:31:27,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:31:27,202 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2020-09-04 16:31:27,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:27,512 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-09-04 16:31:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:31:27,512 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-09-04 16:31:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:27,514 INFO L225 Difference]: With dead ends: 111 [2020-09-04 16:31:27,514 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 16:31:27,515 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=891, Unknown=0, NotChecked=0, Total=1406 [2020-09-04 16:31:27,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 16:31:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 16:31:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 16:31:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2020-09-04 16:31:27,524 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 162 [2020-09-04 16:31:27,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:27,524 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2020-09-04 16:31:27,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:31:27,524 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2020-09-04 16:31:27,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-09-04 16:31:27,526 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:27,527 INFO L422 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:27,527 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:31:27,527 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:27,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:27,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1382000279, now seen corresponding path program 17 times [2020-09-04 16:31:27,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:27,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1824082226] [2020-09-04 16:31:27,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:27,530 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,291 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,741 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2020-09-04 16:31:28,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1824082226] [2020-09-04 16:31:28,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:28,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:31:28,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837203272] [2020-09-04 16:31:28,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:31:28,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:28,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:31:28,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:31:28,745 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 22 states. [2020-09-04 16:31:29,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:29,091 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-09-04 16:31:29,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:31:29,091 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-09-04 16:31:29,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:29,093 INFO L225 Difference]: With dead ends: 116 [2020-09-04 16:31:29,093 INFO L226 Difference]: Without dead ends: 110 [2020-09-04 16:31:29,094 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 16:31:29,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-09-04 16:31:29,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-09-04 16:31:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 16:31:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2020-09-04 16:31:29,103 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 171 [2020-09-04 16:31:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:29,103 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2020-09-04 16:31:29,103 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:31:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2020-09-04 16:31:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:31:29,106 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:29,106 INFO L422 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:29,106 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:31:29,106 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:29,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash -869167053, now seen corresponding path program 18 times [2020-09-04 16:31:29,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:29,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [578383826] [2020-09-04 16:31:29,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:29,109 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2020-09-04 16:31:30,358 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [578383826] [2020-09-04 16:31:30,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:30,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:31:30,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125543634] [2020-09-04 16:31:30,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:31:30,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:30,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:31:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:31:30,360 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 23 states. [2020-09-04 16:31:30,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:30,682 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-09-04 16:31:30,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:31:30,685 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-09-04 16:31:30,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:30,686 INFO L225 Difference]: With dead ends: 121 [2020-09-04 16:31:30,686 INFO L226 Difference]: Without dead ends: 115 [2020-09-04 16:31:30,688 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 16:31:30,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-09-04 16:31:30,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-09-04 16:31:30,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 16:31:30,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2020-09-04 16:31:30,699 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 180 [2020-09-04 16:31:30,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:30,699 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2020-09-04 16:31:30,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:31:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2020-09-04 16:31:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-09-04 16:31:30,702 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:30,702 INFO L422 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:30,702 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:31:30,703 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:30,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:30,703 INFO L82 PathProgramCache]: Analyzing trace with hash 482986285, now seen corresponding path program 19 times [2020-09-04 16:31:30,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:30,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [889540857] [2020-09-04 16:31:30,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:30,706 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,370 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2020-09-04 16:31:32,273 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [889540857] [2020-09-04 16:31:32,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:32,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:31:32,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113642680] [2020-09-04 16:31:32,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:31:32,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:32,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:31:32,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:31:32,275 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 24 states. [2020-09-04 16:31:32,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:32,607 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-09-04 16:31:32,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:31:32,607 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-09-04 16:31:32,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:32,609 INFO L225 Difference]: With dead ends: 126 [2020-09-04 16:31:32,609 INFO L226 Difference]: Without dead ends: 120 [2020-09-04 16:31:32,610 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 16:31:32,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-09-04 16:31:32,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-09-04 16:31:32,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-09-04 16:31:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2020-09-04 16:31:32,620 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 189 [2020-09-04 16:31:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:32,620 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2020-09-04 16:31:32,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:31:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2020-09-04 16:31:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-09-04 16:31:32,623 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:32,623 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:32,623 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:31:32,624 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:32,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash 848589853, now seen corresponding path program 20 times [2020-09-04 16:31:32,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:32,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [968985998] [2020-09-04 16:31:32,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:32,626 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,774 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,010 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,982 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2020-09-04 16:31:34,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [968985998] [2020-09-04 16:31:34,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:34,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:31:34,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632305707] [2020-09-04 16:31:34,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:31:34,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:34,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:31:34,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:31:34,984 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 9 states. [2020-09-04 16:31:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:35,193 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2020-09-04 16:31:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:31:35,193 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2020-09-04 16:31:35,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:35,194 INFO L225 Difference]: With dead ends: 120 [2020-09-04 16:31:35,194 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 16:31:35,195 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:31:35,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 16:31:35,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 16:31:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 16:31:35,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 16:31:35,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 198 [2020-09-04 16:31:35,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:35,196 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 16:31:35,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:31:35,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 16:31:35,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 16:31:35,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:31:35,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 16:31:36,094 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:31:36,095 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:31:36,095 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 16:31:36,095 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 16:31:36,095 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 16:31:36,095 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 16:31:36,096 INFO L264 CegarLoopResult]: At program point sumEXIT(lines 3 9) the Hoare annotation is: (let ((.cse0 (+ |sum_#in~n| |sum_#in~m|))) (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= .cse0 |sum_#res|) (<= |sum_#res| .cse0))) [2020-09-04 16:31:36,096 INFO L264 CegarLoopResult]: At program point L7(line 7) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-09-04 16:31:36,096 INFO L264 CegarLoopResult]: At program point L7-1(line 7) the Hoare annotation is: (let ((.cse0 (+ |sum_#in~n| |sum_#in~m|))) (and (= sum_~n |sum_#in~n|) (<= .cse0 |sum_#t~ret0|) (<= |sum_#t~ret0| .cse0) (= sum_~m |sum_#in~m|))) [2020-09-04 16:31:36,096 INFO L264 CegarLoopResult]: At program point L5(line 5) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (<= |sum_#in~n| 0) (= sum_~m |sum_#in~m|)) [2020-09-04 16:31:36,096 INFO L264 CegarLoopResult]: At program point L7-2(line 7) the Hoare annotation is: (let ((.cse0 (+ |sum_#in~n| |sum_#in~m|))) (and (= sum_~n |sum_#in~n|) (<= .cse0 |sum_#t~ret0|) (<= |sum_#t~ret0| .cse0) (= sum_~m |sum_#in~m|))) [2020-09-04 16:31:36,097 INFO L264 CegarLoopResult]: At program point L4(lines 4 8) the Hoare annotation is: (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|)) [2020-09-04 16:31:36,097 INFO L264 CegarLoopResult]: At program point L7-3(line 7) the Hoare annotation is: (let ((.cse0 (+ |sum_#in~n| |sum_#in~m|))) (and (= sum_~n |sum_#in~n|) (<= .cse0 |sum_#t~ret0|) (<= |sum_#t~ret0| .cse0) (= sum_~m |sum_#in~m|) (<= .cse0 |sum_#res|) (<= |sum_#res| .cse0))) [2020-09-04 16:31:36,097 INFO L264 CegarLoopResult]: At program point L3(lines 3 9) the Hoare annotation is: (= sum_~n |sum_#in~n|) [2020-09-04 16:31:36,097 INFO L264 CegarLoopResult]: At program point sumFINAL(lines 3 9) the Hoare annotation is: (let ((.cse0 (+ |sum_#in~n| |sum_#in~m|))) (and (= sum_~n |sum_#in~n|) (= sum_~m |sum_#in~m|) (<= .cse0 |sum_#res|) (<= |sum_#res| .cse0))) [2020-09-04 16:31:36,097 INFO L271 CegarLoopResult]: At program point sumENTRY(lines 3 9) the Hoare annotation is: true [2020-09-04 16:31:36,098 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: false [2020-09-04 16:31:36,098 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2020-09-04 16:31:36,098 INFO L264 CegarLoopResult]: At program point mainEXIT(lines 11 18) the Hoare annotation is: (<= 20 main_~a~0) [2020-09-04 16:31:36,098 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: false [2020-09-04 16:31:36,098 INFO L264 CegarLoopResult]: At program point L15(lines 15 17) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 main_~result~0) (<= main_~a~0 20) (<= 20 main_~a~0) (<= main_~result~0 .cse0))) [2020-09-04 16:31:36,098 INFO L264 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: (and (<= main_~a~0 20) (<= 20 main_~a~0)) [2020-09-04 16:31:36,099 INFO L264 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (and (<= main_~a~0 20) (<= 20 main_~a~0)) [2020-09-04 16:31:36,099 INFO L264 CegarLoopResult]: At program point L14-1(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= |main_#t~ret1| .cse0) (<= .cse0 |main_#t~ret1|) (<= main_~a~0 20) (<= 20 main_~a~0))) [2020-09-04 16:31:36,099 INFO L264 CegarLoopResult]: At program point L15-2(lines 11 18) the Hoare annotation is: (<= 20 main_~a~0) [2020-09-04 16:31:36,099 INFO L264 CegarLoopResult]: At program point L14-2(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= |main_#t~ret1| .cse0) (<= .cse0 |main_#t~ret1|) (<= main_~a~0 20) (<= 20 main_~a~0))) [2020-09-04 16:31:36,099 INFO L264 CegarLoopResult]: At program point L14-3(line 14) the Hoare annotation is: (let ((.cse0 (+ main_~a~0 main_~b~0))) (and (<= .cse0 main_~result~0) (<= |main_#t~ret1| .cse0) (<= .cse0 |main_#t~ret1|) (<= main_~a~0 20) (<= 20 main_~a~0) (<= main_~result~0 .cse0))) [2020-09-04 16:31:36,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:31:36 BoogieIcfgContainer [2020-09-04 16:31:36,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:31:36,128 INFO L168 Benchmark]: Toolchain (without parser) took 21820.84 ms. Allocated memory was 138.4 MB in the beginning and 608.2 MB in the end (delta: 469.8 MB). Free memory was 102.3 MB in the beginning and 316.0 MB in the end (delta: -213.7 MB). Peak memory consumption was 256.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:36,129 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. [2020-09-04 16:31:36,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.56 ms. Allocated memory is still 138.4 MB. Free memory was 102.3 MB in the beginning and 93.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:36,130 INFO L168 Benchmark]: Boogie Preprocessor took 123.63 ms. Allocated memory was 138.4 MB in the beginning and 199.8 MB in the end (delta: 61.3 MB). Free memory was 93.0 MB in the beginning and 178.6 MB in the end (delta: -85.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:36,130 INFO L168 Benchmark]: RCFGBuilder took 312.26 ms. Allocated memory is still 199.8 MB. Free memory was 178.6 MB in the beginning and 165.7 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:36,131 INFO L168 Benchmark]: TraceAbstraction took 21056.00 ms. Allocated memory was 199.8 MB in the beginning and 608.2 MB in the end (delta: 408.4 MB). Free memory was 165.7 MB in the beginning and 316.0 MB in the end (delta: -150.3 MB). Peak memory consumption was 258.1 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:36,134 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.28 ms. Allocated memory is still 138.4 MB. Free memory was 121.0 MB in the beginning and 120.6 MB in the end (delta: 419.5 kB). Peak memory consumption was 419.5 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 319.56 ms. Allocated memory is still 138.4 MB. Free memory was 102.3 MB in the beginning and 93.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.63 ms. Allocated memory was 138.4 MB in the beginning and 199.8 MB in the end (delta: 61.3 MB). Free memory was 93.0 MB in the beginning and 178.6 MB in the end (delta: -85.6 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 312.26 ms. Allocated memory is still 199.8 MB. Free memory was 178.6 MB in the beginning and 165.7 MB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 21056.00 ms. Allocated memory was 199.8 MB in the beginning and 608.2 MB in the end (delta: 408.4 MB). Free memory was 165.7 MB in the beginning and 316.0 MB in the end (delta: -150.3 MB). Peak memory consumption was 258.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: 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: 3]: Procedure Contract for sum Derived contract for procedure sum: ((n == \old(n) && m == \old(m)) && \old(n) + \old(m) <= \result) && \result <= \old(n) + \old(m) - ProcedureContractResult [Line: 11]: Procedure Contract for main Derived contract for procedure main: 20 <= a - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 20.0s, OverallIterations: 21, TraceHistogramMax: 21, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 376 SDtfs, 1061 SDslu, 1900 SDs, 0 SdLazy, 896 SolverSat, 41 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1057 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 473 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 37 PreInvPairs, 337 NumberOfFragments, 230 HoareAnnotationTreeSize, 37 FomulaSimplifications, 4276 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 27 FomulaSimplificationsInter, 779 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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...