/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_25x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 16:31:23,871 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 16:31:23,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 16:31:23,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 16:31:23,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 16:31:23,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 16:31:23,933 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 16:31:23,937 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 16:31:23,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 16:31:23,943 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 16:31:23,944 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 16:31:23,945 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 16:31:23,945 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 16:31:23,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 16:31:23,951 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 16:31:23,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 16:31:23,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 16:31:23,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 16:31:23,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 16:31:23,966 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 16:31:23,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 16:31:23,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 16:31:23,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 16:31:23,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 16:31:23,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 16:31:23,983 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 16:31:23,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 16:31:23,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 16:31:23,987 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 16:31:23,988 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 16:31:23,988 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 16:31:23,989 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 16:31:23,989 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 16:31:23,991 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 16:31:23,992 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 16:31:23,992 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 16:31:23,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 16:31:23,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 16:31:23,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 16:31:23,995 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 16:31:23,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 16:31:23,997 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:24,018 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 16:31:24,018 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 16:31:24,021 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 16:31:24,021 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 16:31:24,021 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 16:31:24,021 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 16:31:24,022 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 16:31:24,022 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 16:31:24,022 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 16:31:24,022 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 16:31:24,023 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 16:31:24,024 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 16:31:24,024 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 16:31:24,024 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 16:31:24,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 16:31:24,025 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 16:31:24,025 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 16:31:24,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 16:31:24,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 16:31:24,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 16:31:24,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 16:31:24,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 16:31:24,026 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-09-04 16:31:24,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 16:31:24,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 16:31:24,485 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 16:31:24,486 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 16:31:24,487 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 16:31:24,488 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/sum_25x0-2.c [2020-09-04 16:31:24,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4ad66939a/45e1b952a00c4377989e7e0fa3b66871/FLAG83634b8aa [2020-09-04 16:31:25,168 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 16:31:25,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/sum_25x0-2.c [2020-09-04 16:31:25,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4ad66939a/45e1b952a00c4377989e7e0fa3b66871/FLAG83634b8aa [2020-09-04 16:31:25,556 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4ad66939a/45e1b952a00c4377989e7e0fa3b66871 [2020-09-04 16:31:25,571 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 16:31:25,575 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 16:31:25,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 16:31:25,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 16:31:25,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 16:31:25,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:31:25" (1/1) ... [2020-09-04 16:31:25,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a067aa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:25, skipping insertion in model container [2020-09-04 16:31:25,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 04:31:25" (1/1) ... [2020-09-04 16:31:25,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 16:31:25,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 16:31:25,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:31:25,834 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 16:31:25,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 16:31:25,872 INFO L208 MainTranslator]: Completed translation [2020-09-04 16:31:25,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:25 WrapperNode [2020-09-04 16:31:25,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 16:31:25,874 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 16:31:25,874 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 16:31:25,874 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 16:31:25,892 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:25" (1/1) ... [2020-09-04 16:31:25,893 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:25" (1/1) ... [2020-09-04 16:31:25,899 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:25" (1/1) ... [2020-09-04 16:31:25,900 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:25" (1/1) ... [2020-09-04 16:31:25,903 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:25" (1/1) ... [2020-09-04 16:31:25,906 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:25" (1/1) ... [2020-09-04 16:31:25,907 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:25" (1/1) ... [2020-09-04 16:31:25,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 16:31:25,909 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 16:31:25,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 16:31:25,910 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 16:31:25,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:25" (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:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 16:31:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 16:31:26,069 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2020-09-04 16:31:26,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 16:31:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 16:31:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2020-09-04 16:31:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 16:31:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 16:31:26,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 16:31:26,276 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 16:31:26,277 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 16:31:26,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:31:26 BoogieIcfgContainer [2020-09-04 16:31:26,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 16:31:26,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 16:31:26,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 16:31:26,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 16:31:26,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 04:31:25" (1/3) ... [2020-09-04 16:31:26,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e3b609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:31:26, skipping insertion in model container [2020-09-04 16:31:26,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 04:31:25" (2/3) ... [2020-09-04 16:31:26,291 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e3b609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 04:31:26, skipping insertion in model container [2020-09-04 16:31:26,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 04:31:26" (3/3) ... [2020-09-04 16:31:26,294 INFO L109 eAbstractionObserver]: Analyzing ICFG sum_25x0-2.c [2020-09-04 16:31:26,307 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 16:31:26,318 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 16:31:26,345 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 16:31:26,383 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 16:31:26,383 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 16:31:26,384 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-09-04 16:31:26,384 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 16:31:26,384 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 16:31:26,384 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 16:31:26,384 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 16:31:26,384 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 16:31:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2020-09-04 16:31:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-09-04 16:31:26,422 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:26,423 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:26,424 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:26,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:26,433 INFO L82 PathProgramCache]: Analyzing trace with hash 989240825, now seen corresponding path program 1 times [2020-09-04 16:31:26,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:26,447 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1142593074] [2020-09-04 16:31:26,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:26,529 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:26,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:26,716 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:26,720 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1142593074] [2020-09-04 16:31:26,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:26,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 16:31:26,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152996434] [2020-09-04 16:31:26,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 16:31:26,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:26,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 16:31:26,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 16:31:26,756 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 5 states. [2020-09-04 16:31:26,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:26,876 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2020-09-04 16:31:26,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 16:31:26,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-09-04 16:31:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:26,893 INFO L225 Difference]: With dead ends: 39 [2020-09-04 16:31:26,893 INFO L226 Difference]: Without dead ends: 25 [2020-09-04 16:31:26,898 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:26,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-09-04 16:31:26,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-09-04 16:31:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-09-04 16:31:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-09-04 16:31:26,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 18 [2020-09-04 16:31:26,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:26,955 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-09-04 16:31:26,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 16:31:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-09-04 16:31:26,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 16:31:26,959 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:26,959 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:26,960 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 16:31:26,960 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:26,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1852726759, now seen corresponding path program 1 times [2020-09-04 16:31:26,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:26,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705883809] [2020-09-04 16:31:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:26,964 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,112 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:27,113 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705883809] [2020-09-04 16:31:27,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:27,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-09-04 16:31:27,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998539426] [2020-09-04 16:31:27,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-09-04 16:31:27,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:27,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-09-04 16:31:27,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-09-04 16:31:27,116 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 6 states. [2020-09-04 16:31:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:27,196 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2020-09-04 16:31:27,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-09-04 16:31:27,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2020-09-04 16:31:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:27,199 INFO L225 Difference]: With dead ends: 36 [2020-09-04 16:31:27,200 INFO L226 Difference]: Without dead ends: 30 [2020-09-04 16:31:27,202 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:27,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-09-04 16:31:27,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-09-04 16:31:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-09-04 16:31:27,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2020-09-04 16:31:27,226 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 27 [2020-09-04 16:31:27,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:27,227 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2020-09-04 16:31:27,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-09-04 16:31:27,227 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2020-09-04 16:31:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-09-04 16:31:27,231 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:27,232 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:27,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 16:31:27,232 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:27,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:27,234 INFO L82 PathProgramCache]: Analyzing trace with hash -175020829, now seen corresponding path program 2 times [2020-09-04 16:31:27,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:27,235 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [539238044] [2020-09-04 16:31:27,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:27,239 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,385 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,416 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:27,417 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [539238044] [2020-09-04 16:31:27,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:27,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-09-04 16:31:27,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687720449] [2020-09-04 16:31:27,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 16:31:27,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 16:31:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-09-04 16:31:27,420 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2020-09-04 16:31:27,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:27,506 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2020-09-04 16:31:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 16:31:27,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-09-04 16:31:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:27,508 INFO L225 Difference]: With dead ends: 41 [2020-09-04 16:31:27,509 INFO L226 Difference]: Without dead ends: 35 [2020-09-04 16:31:27,510 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:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-09-04 16:31:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-09-04 16:31:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-09-04 16:31:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2020-09-04 16:31:27,522 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 36 [2020-09-04 16:31:27,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:27,522 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2020-09-04 16:31:27,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 16:31:27,523 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2020-09-04 16:31:27,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-09-04 16:31:27,524 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:27,524 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:27,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 16:31:27,525 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:27,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1021564803, now seen corresponding path program 3 times [2020-09-04 16:31:27,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:27,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1435541467] [2020-09-04 16:31:27,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:27,528 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,782 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:27,783 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1435541467] [2020-09-04 16:31:27,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:27,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-09-04 16:31:27,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784418919] [2020-09-04 16:31:27,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-09-04 16:31:27,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:27,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-09-04 16:31:27,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-09-04 16:31:27,785 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 8 states. [2020-09-04 16:31:27,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:27,876 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2020-09-04 16:31:27,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 16:31:27,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2020-09-04 16:31:27,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:27,878 INFO L225 Difference]: With dead ends: 46 [2020-09-04 16:31:27,878 INFO L226 Difference]: Without dead ends: 40 [2020-09-04 16:31:27,879 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:27,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-09-04 16:31:27,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-09-04 16:31:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-09-04 16:31:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2020-09-04 16:31:27,890 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 45 [2020-09-04 16:31:27,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:27,891 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2020-09-04 16:31:27,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-09-04 16:31:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2020-09-04 16:31:27,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-09-04 16:31:27,893 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:27,893 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:27,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 16:31:27,894 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:27,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:27,894 INFO L82 PathProgramCache]: Analyzing trace with hash -263249715, now seen corresponding path program 4 times [2020-09-04 16:31:27,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:27,895 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1393356290] [2020-09-04 16:31:27,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:27,897 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:27,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,221 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:28,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1393356290] [2020-09-04 16:31:28,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:28,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-09-04 16:31:28,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058524351] [2020-09-04 16:31:28,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 16:31:28,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:28,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 16:31:28,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 16:31:28,224 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 9 states. [2020-09-04 16:31:28,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:28,319 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2020-09-04 16:31:28,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-09-04 16:31:28,320 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2020-09-04 16:31:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:28,321 INFO L225 Difference]: With dead ends: 51 [2020-09-04 16:31:28,322 INFO L226 Difference]: Without dead ends: 45 [2020-09-04 16:31:28,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:31:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-09-04 16:31:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-09-04 16:31:28,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-09-04 16:31:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-09-04 16:31:28,333 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 54 [2020-09-04 16:31:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:28,334 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-09-04 16:31:28,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 16:31:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-09-04 16:31:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-09-04 16:31:28,336 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:28,336 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:28,337 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 16:31:28,337 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:28,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1884999187, now seen corresponding path program 5 times [2020-09-04 16:31:28,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:28,338 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1330622933] [2020-09-04 16:31:28,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:28,340 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,475 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,558 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:28,559 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1330622933] [2020-09-04 16:31:28,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:28,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 16:31:28,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461347472] [2020-09-04 16:31:28,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 16:31:28,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:28,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 16:31:28,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-09-04 16:31:28,562 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 10 states. [2020-09-04 16:31:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:28,685 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2020-09-04 16:31:28,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-09-04 16:31:28,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-09-04 16:31:28,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:28,687 INFO L225 Difference]: With dead ends: 56 [2020-09-04 16:31:28,687 INFO L226 Difference]: Without dead ends: 50 [2020-09-04 16:31:28,688 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:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-09-04 16:31:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-09-04 16:31:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 16:31:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2020-09-04 16:31:28,699 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 63 [2020-09-04 16:31:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:28,700 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2020-09-04 16:31:28,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 16:31:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2020-09-04 16:31:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2020-09-04 16:31:28,702 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:28,702 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:28,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 16:31:28,703 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:28,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:28,703 INFO L82 PathProgramCache]: Analyzing trace with hash -441437769, now seen corresponding path program 6 times [2020-09-04 16:31:28,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:28,704 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2097607916] [2020-09-04 16:31:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:28,706 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:28,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:28,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,048 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:29,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2097607916] [2020-09-04 16:31:29,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:29,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-09-04 16:31:29,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577466847] [2020-09-04 16:31:29,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 16:31:29,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 16:31:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-09-04 16:31:29,054 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 11 states. [2020-09-04 16:31:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:29,201 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2020-09-04 16:31:29,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 16:31:29,202 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2020-09-04 16:31:29,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:29,204 INFO L225 Difference]: With dead ends: 61 [2020-09-04 16:31:29,204 INFO L226 Difference]: Without dead ends: 55 [2020-09-04 16:31:29,207 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:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-09-04 16:31:29,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-09-04 16:31:29,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-09-04 16:31:29,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2020-09-04 16:31:29,224 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 72 [2020-09-04 16:31:29,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:29,224 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2020-09-04 16:31:29,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 16:31:29,224 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2020-09-04 16:31:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-09-04 16:31:29,226 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:29,226 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:29,226 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 16:31:29,227 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash 999943849, now seen corresponding path program 7 times [2020-09-04 16:31:29,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:29,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1059288119] [2020-09-04 16:31:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:29,230 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:29,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,551 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:29,552 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1059288119] [2020-09-04 16:31:29,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:29,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-09-04 16:31:29,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247235463] [2020-09-04 16:31:29,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 16:31:29,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:29,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 16:31:29,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2020-09-04 16:31:29,554 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 12 states. [2020-09-04 16:31:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:29,694 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2020-09-04 16:31:29,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 16:31:29,695 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2020-09-04 16:31:29,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:29,697 INFO L225 Difference]: With dead ends: 66 [2020-09-04 16:31:29,697 INFO L226 Difference]: Without dead ends: 60 [2020-09-04 16:31:29,698 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:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-09-04 16:31:29,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-09-04 16:31:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-09-04 16:31:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2020-09-04 16:31:29,709 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 81 [2020-09-04 16:31:29,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:29,710 INFO L479 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2020-09-04 16:31:29,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 16:31:29,710 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2020-09-04 16:31:29,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-09-04 16:31:29,712 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:29,712 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:29,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 16:31:29,712 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:29,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:29,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1356134305, now seen corresponding path program 8 times [2020-09-04 16:31:29,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:29,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1208363089] [2020-09-04 16:31:29,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:29,716 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:29,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:29,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,068 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,153 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:30,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1208363089] [2020-09-04 16:31:30,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:30,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 16:31:30,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57066954] [2020-09-04 16:31:30,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 16:31:30,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:30,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 16:31:30,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2020-09-04 16:31:30,166 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 13 states. [2020-09-04 16:31:30,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:30,326 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2020-09-04 16:31:30,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-09-04 16:31:30,327 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 90 [2020-09-04 16:31:30,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:30,329 INFO L225 Difference]: With dead ends: 71 [2020-09-04 16:31:30,329 INFO L226 Difference]: Without dead ends: 65 [2020-09-04 16:31:30,330 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:30,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-09-04 16:31:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-09-04 16:31:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-09-04 16:31:30,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-09-04 16:31:30,340 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 90 [2020-09-04 16:31:30,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:30,341 INFO L479 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-09-04 16:31:30,341 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 16:31:30,341 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-09-04 16:31:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-09-04 16:31:30,343 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:30,343 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:30,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 16:31:30,343 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:30,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:30,344 INFO L82 PathProgramCache]: Analyzing trace with hash -928437697, now seen corresponding path program 9 times [2020-09-04 16:31:30,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:30,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1668767426] [2020-09-04 16:31:30,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:30,346 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,445 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:30,773 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:30,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1668767426] [2020-09-04 16:31:30,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:30,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-09-04 16:31:30,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817319628] [2020-09-04 16:31:30,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-09-04 16:31:30,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:30,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-09-04 16:31:30,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2020-09-04 16:31:30,776 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-09-04 16:31:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:30,983 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2020-09-04 16:31:30,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-09-04 16:31:30,984 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 99 [2020-09-04 16:31:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:30,986 INFO L225 Difference]: With dead ends: 76 [2020-09-04 16:31:30,986 INFO L226 Difference]: Without dead ends: 70 [2020-09-04 16:31:30,987 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:30,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-09-04 16:31:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-09-04 16:31:30,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-09-04 16:31:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2020-09-04 16:31:30,997 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 99 [2020-09-04 16:31:30,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:30,998 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2020-09-04 16:31:30,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-09-04 16:31:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2020-09-04 16:31:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-09-04 16:31:30,999 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:30,999 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:30,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 16:31:31,000 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:31,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash -276966773, now seen corresponding path program 10 times [2020-09-04 16:31:31,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:31,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1169398639] [2020-09-04 16:31:31,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:31,003 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,378 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,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,510 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:31,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1169398639] [2020-09-04 16:31:31,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:31,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 16:31:31,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931385173] [2020-09-04 16:31:31,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 16:31:31,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:31,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 16:31:31,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2020-09-04 16:31:31,513 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 15 states. [2020-09-04 16:31:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:31,697 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2020-09-04 16:31:31,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 16:31:31,698 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 108 [2020-09-04 16:31:31,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:31,699 INFO L225 Difference]: With dead ends: 81 [2020-09-04 16:31:31,699 INFO L226 Difference]: Without dead ends: 75 [2020-09-04 16:31:31,700 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:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-09-04 16:31:31,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-09-04 16:31:31,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-09-04 16:31:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2020-09-04 16:31:31,710 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 108 [2020-09-04 16:31:31,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:31,710 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2020-09-04 16:31:31,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 16:31:31,711 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2020-09-04 16:31:31,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2020-09-04 16:31:31,712 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:31,712 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:31,712 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-09-04 16:31:31,713 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:31,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1749540651, now seen corresponding path program 11 times [2020-09-04 16:31:31,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:31,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [254163054] [2020-09-04 16:31:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:31,715 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:31,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,151 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,373 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:32,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [254163054] [2020-09-04 16:31:32,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:32,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-09-04 16:31:32,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104306742] [2020-09-04 16:31:32,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-09-04 16:31:32,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:32,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-09-04 16:31:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=145, Unknown=0, NotChecked=0, Total=240 [2020-09-04 16:31:32,377 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 16 states. [2020-09-04 16:31:32,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:32,575 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2020-09-04 16:31:32,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 16:31:32,576 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2020-09-04 16:31:32,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:32,577 INFO L225 Difference]: With dead ends: 86 [2020-09-04 16:31:32,577 INFO L226 Difference]: Without dead ends: 80 [2020-09-04 16:31:32,578 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:32,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-09-04 16:31:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-09-04 16:31:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-09-04 16:31:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2020-09-04 16:31:32,587 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 117 [2020-09-04 16:31:32,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:32,587 INFO L479 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2020-09-04 16:31:32,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-09-04 16:31:32,587 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2020-09-04 16:31:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-09-04 16:31:32,589 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:32,589 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:32,589 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-09-04 16:31:32,589 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:32,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1141580405, now seen corresponding path program 12 times [2020-09-04 16:31:32,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:32,590 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263363608] [2020-09-04 16:31:32,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:32,592 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:32,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:32,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,769 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,948 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:32,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,277 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:33,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263363608] [2020-09-04 16:31:33,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:33,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-09-04 16:31:33,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32086067] [2020-09-04 16:31:33,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-09-04 16:31:33,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-09-04 16:31:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=163, Unknown=0, NotChecked=0, Total=272 [2020-09-04 16:31:33,280 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 17 states. [2020-09-04 16:31:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:33,493 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2020-09-04 16:31:33,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-09-04 16:31:33,493 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 126 [2020-09-04 16:31:33,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:33,495 INFO L225 Difference]: With dead ends: 91 [2020-09-04 16:31:33,495 INFO L226 Difference]: Without dead ends: 85 [2020-09-04 16:31:33,496 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=317, Invalid=553, Unknown=0, NotChecked=0, Total=870 [2020-09-04 16:31:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-09-04 16:31:33,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2020-09-04 16:31:33,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-09-04 16:31:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2020-09-04 16:31:33,505 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 126 [2020-09-04 16:31:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:33,505 INFO L479 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2020-09-04 16:31:33,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-09-04 16:31:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2020-09-04 16:31:33,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-09-04 16:31:33,507 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:33,508 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:33,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 16:31:33,508 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:33,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:33,508 INFO L82 PathProgramCache]: Analyzing trace with hash 55997035, now seen corresponding path program 13 times [2020-09-04 16:31:33,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:33,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854702877] [2020-09-04 16:31:33,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:33,511 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:33,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,636 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:33,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,263 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:34,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854702877] [2020-09-04 16:31:34,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:34,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-09-04 16:31:34,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425191947] [2020-09-04 16:31:34,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-09-04 16:31:34,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-09-04 16:31:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=182, Unknown=0, NotChecked=0, Total=306 [2020-09-04 16:31:34,266 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 18 states. [2020-09-04 16:31:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:34,478 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2020-09-04 16:31:34,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 16:31:34,478 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2020-09-04 16:31:34,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:34,479 INFO L225 Difference]: With dead ends: 96 [2020-09-04 16:31:34,480 INFO L226 Difference]: Without dead ends: 90 [2020-09-04 16:31:34,481 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:34,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-09-04 16:31:34,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-09-04 16:31:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-09-04 16:31:34,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2020-09-04 16:31:34,492 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 135 [2020-09-04 16:31:34,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:34,492 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2020-09-04 16:31:34,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-09-04 16:31:34,493 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2020-09-04 16:31:34,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2020-09-04 16:31:34,495 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:34,495 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:34,495 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-09-04 16:31:34,496 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:34,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:34,496 INFO L82 PathProgramCache]: Analyzing trace with hash 394086239, now seen corresponding path program 14 times [2020-09-04 16:31:34,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:34,497 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1125212087] [2020-09-04 16:31:34,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:34,499 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,565 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,689 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:34,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,219 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,249 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,383 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:35,384 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1125212087] [2020-09-04 16:31:35,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:35,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2020-09-04 16:31:35,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370222586] [2020-09-04 16:31:35,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 16:31:35,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:35,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 16:31:35,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=202, Unknown=0, NotChecked=0, Total=342 [2020-09-04 16:31:35,386 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 19 states. [2020-09-04 16:31:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:35,631 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2020-09-04 16:31:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 16:31:35,631 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 144 [2020-09-04 16:31:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:35,633 INFO L225 Difference]: With dead ends: 101 [2020-09-04 16:31:35,633 INFO L226 Difference]: Without dead ends: 95 [2020-09-04 16:31:35,634 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:35,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-09-04 16:31:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-09-04 16:31:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-09-04 16:31:35,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2020-09-04 16:31:35,653 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 144 [2020-09-04 16:31:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:35,657 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2020-09-04 16:31:35,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 16:31:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2020-09-04 16:31:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2020-09-04 16:31:35,660 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:35,661 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:35,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-09-04 16:31:35,661 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1047772929, now seen corresponding path program 15 times [2020-09-04 16:31:35,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:35,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1243873758] [2020-09-04 16:31:35,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:35,668 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:35,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:35,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:35,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:36,635 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:36,635 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1243873758] [2020-09-04 16:31:36,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:36,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-09-04 16:31:36,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229428180] [2020-09-04 16:31:36,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 16:31:36,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 16:31:36,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=223, Unknown=0, NotChecked=0, Total=380 [2020-09-04 16:31:36,637 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 20 states. [2020-09-04 16:31:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:36,925 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2020-09-04 16:31:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-09-04 16:31:36,926 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2020-09-04 16:31:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:36,928 INFO L225 Difference]: With dead ends: 106 [2020-09-04 16:31:36,928 INFO L226 Difference]: Without dead ends: 100 [2020-09-04 16:31:36,931 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:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-09-04 16:31:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2020-09-04 16:31:36,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-09-04 16:31:36,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2020-09-04 16:31:36,940 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 153 [2020-09-04 16:31:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:36,941 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2020-09-04 16:31:36,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 16:31:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2020-09-04 16:31:36,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2020-09-04 16:31:36,943 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:36,943 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:36,943 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-09-04 16:31:36,943 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:36,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:36,944 INFO L82 PathProgramCache]: Analyzing trace with hash -76242615, now seen corresponding path program 16 times [2020-09-04 16:31:36,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:36,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [978095300] [2020-09-04 16:31:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:36,946 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,189 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,704 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:37,964 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:37,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [978095300] [2020-09-04 16:31:37,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:37,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-09-04 16:31:37,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193961031] [2020-09-04 16:31:37,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 16:31:37,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:37,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 16:31:37,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=245, Unknown=0, NotChecked=0, Total=420 [2020-09-04 16:31:37,967 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 21 states. [2020-09-04 16:31:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:38,325 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2020-09-04 16:31:38,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-09-04 16:31:38,326 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 162 [2020-09-04 16:31:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:38,328 INFO L225 Difference]: With dead ends: 111 [2020-09-04 16:31:38,328 INFO L226 Difference]: Without dead ends: 105 [2020-09-04 16:31:38,331 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:38,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-09-04 16:31:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2020-09-04 16:31:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-09-04 16:31:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2020-09-04 16:31:38,347 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 162 [2020-09-04 16:31:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:38,347 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2020-09-04 16:31:38,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 16:31:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2020-09-04 16:31:38,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2020-09-04 16:31:38,352 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:38,353 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:38,353 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-09-04 16:31:38,353 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:38,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:38,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1382000279, now seen corresponding path program 17 times [2020-09-04 16:31:38,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:38,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [215569548] [2020-09-04 16:31:38,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:38,358 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:38,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,022 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:39,630 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:39,630 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [215569548] [2020-09-04 16:31:39,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:39,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2020-09-04 16:31:39,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982931185] [2020-09-04 16:31:39,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-09-04 16:31:39,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:39,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-09-04 16:31:39,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=268, Unknown=0, NotChecked=0, Total=462 [2020-09-04 16:31:39,632 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 22 states. [2020-09-04 16:31:39,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:39,981 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2020-09-04 16:31:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 16:31:39,982 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 171 [2020-09-04 16:31:39,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:39,983 INFO L225 Difference]: With dead ends: 116 [2020-09-04 16:31:39,984 INFO L226 Difference]: Without dead ends: 110 [2020-09-04 16:31:39,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=572, Invalid=988, Unknown=0, NotChecked=0, Total=1560 [2020-09-04 16:31:39,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-09-04 16:31:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-09-04 16:31:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-09-04 16:31:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2020-09-04 16:31:39,995 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 171 [2020-09-04 16:31:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:39,996 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2020-09-04 16:31:39,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-09-04 16:31:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2020-09-04 16:31:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2020-09-04 16:31:39,998 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:39,999 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:39,999 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-09-04 16:31:39,999 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:39,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:40,000 INFO L82 PathProgramCache]: Analyzing trace with hash -869167053, now seen corresponding path program 18 times [2020-09-04 16:31:40,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:40,000 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [870324627] [2020-09-04 16:31:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:40,002 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:40,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,479 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:40,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:41,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,556 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:41,557 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [870324627] [2020-09-04 16:31:41,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:41,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2020-09-04 16:31:41,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791668228] [2020-09-04 16:31:41,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-09-04 16:31:41,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:41,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-09-04 16:31:41,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=292, Unknown=0, NotChecked=0, Total=506 [2020-09-04 16:31:41,561 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 23 states. [2020-09-04 16:31:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:41,868 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2020-09-04 16:31:41,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-09-04 16:31:41,870 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 180 [2020-09-04 16:31:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:41,871 INFO L225 Difference]: With dead ends: 121 [2020-09-04 16:31:41,872 INFO L226 Difference]: Without dead ends: 115 [2020-09-04 16:31:41,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=632, Invalid=1090, Unknown=0, NotChecked=0, Total=1722 [2020-09-04 16:31:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2020-09-04 16:31:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2020-09-04 16:31:41,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2020-09-04 16:31:41,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2020-09-04 16:31:41,884 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 180 [2020-09-04 16:31:41,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:41,885 INFO L479 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2020-09-04 16:31:41,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-09-04 16:31:41,885 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2020-09-04 16:31:41,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2020-09-04 16:31:41,887 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:41,887 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:41,887 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-09-04 16:31:41,887 INFO L427 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:41,888 INFO L82 PathProgramCache]: Analyzing trace with hash 482986285, now seen corresponding path program 19 times [2020-09-04 16:31:41,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:41,888 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1870555] [2020-09-04 16:31:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:41,892 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:41,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:41,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,070 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,390 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:42,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,354 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:43,355 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1870555] [2020-09-04 16:31:43,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:43,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-09-04 16:31:43,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542268738] [2020-09-04 16:31:43,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 16:31:43,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 16:31:43,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=317, Unknown=0, NotChecked=0, Total=552 [2020-09-04 16:31:43,359 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 24 states. [2020-09-04 16:31:43,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:43,741 INFO L93 Difference]: Finished difference Result 126 states and 127 transitions. [2020-09-04 16:31:43,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-09-04 16:31:43,741 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 189 [2020-09-04 16:31:43,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:43,743 INFO L225 Difference]: With dead ends: 126 [2020-09-04 16:31:43,743 INFO L226 Difference]: Without dead ends: 120 [2020-09-04 16:31:43,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=695, Invalid=1197, Unknown=0, NotChecked=0, Total=1892 [2020-09-04 16:31:43,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2020-09-04 16:31:43,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2020-09-04 16:31:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-09-04 16:31:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2020-09-04 16:31:43,754 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 189 [2020-09-04 16:31:43,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:43,754 INFO L479 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2020-09-04 16:31:43,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 16:31:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2020-09-04 16:31:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2020-09-04 16:31:43,757 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:43,757 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:43,758 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-09-04 16:31:43,758 INFO L427 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:43,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash 848589853, now seen corresponding path program 20 times [2020-09-04 16:31:43,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:43,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1829740368] [2020-09-04 16:31:43,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:43,760 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:43,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,207 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,625 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,665 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:44,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,121 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:45,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1829740368] [2020-09-04 16:31:45,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:45,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-09-04 16:31:45,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284800799] [2020-09-04 16:31:45,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 16:31:45,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:45,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 16:31:45,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=343, Unknown=0, NotChecked=0, Total=600 [2020-09-04 16:31:45,124 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 25 states. [2020-09-04 16:31:45,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:45,578 INFO L93 Difference]: Finished difference Result 131 states and 132 transitions. [2020-09-04 16:31:45,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-09-04 16:31:45,579 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 198 [2020-09-04 16:31:45,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:45,580 INFO L225 Difference]: With dead ends: 131 [2020-09-04 16:31:45,581 INFO L226 Difference]: Without dead ends: 125 [2020-09-04 16:31:45,584 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=761, Invalid=1309, Unknown=0, NotChecked=0, Total=2070 [2020-09-04 16:31:45,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-09-04 16:31:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-09-04 16:31:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-09-04 16:31:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2020-09-04 16:31:45,593 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 198 [2020-09-04 16:31:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:45,595 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2020-09-04 16:31:45,595 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 16:31:45,595 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2020-09-04 16:31:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2020-09-04 16:31:45,598 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:45,598 INFO L422 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:45,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-09-04 16:31:45,599 INFO L427 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:45,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:45,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1304544963, now seen corresponding path program 21 times [2020-09-04 16:31:45,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:45,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2122578702] [2020-09-04 16:31:45,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:45,602 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:45,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,698 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:45,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,619 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:46,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:47,121 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2020-09-04 16:31:47,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2122578702] [2020-09-04 16:31:47,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:47,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2020-09-04 16:31:47,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466136974] [2020-09-04 16:31:47,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-09-04 16:31:47,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:47,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-09-04 16:31:47,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=370, Unknown=0, NotChecked=0, Total=650 [2020-09-04 16:31:47,124 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 26 states. [2020-09-04 16:31:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:47,577 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2020-09-04 16:31:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-09-04 16:31:47,577 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 207 [2020-09-04 16:31:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:47,579 INFO L225 Difference]: With dead ends: 136 [2020-09-04 16:31:47,579 INFO L226 Difference]: Without dead ends: 130 [2020-09-04 16:31:47,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=830, Invalid=1426, Unknown=0, NotChecked=0, Total=2256 [2020-09-04 16:31:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2020-09-04 16:31:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2020-09-04 16:31:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2020-09-04 16:31:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2020-09-04 16:31:47,588 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 207 [2020-09-04 16:31:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:47,589 INFO L479 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2020-09-04 16:31:47,589 INFO L480 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-09-04 16:31:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2020-09-04 16:31:47,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2020-09-04 16:31:47,591 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:47,592 INFO L422 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:47,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-09-04 16:31:47,592 INFO L427 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:47,592 INFO L82 PathProgramCache]: Analyzing trace with hash 639479047, now seen corresponding path program 22 times [2020-09-04 16:31:47,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:47,593 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [771063205] [2020-09-04 16:31:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:47,595 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:47,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:47,684 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:47,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:47,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:47,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:48,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:49,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:49,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:49,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:49,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:49,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:49,356 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2020-09-04 16:31:49,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [771063205] [2020-09-04 16:31:49,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:49,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-09-04 16:31:49,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523366210] [2020-09-04 16:31:49,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 16:31:49,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:49,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 16:31:49,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=398, Unknown=0, NotChecked=0, Total=702 [2020-09-04 16:31:49,359 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 27 states. [2020-09-04 16:31:49,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:49,853 INFO L93 Difference]: Finished difference Result 141 states and 142 transitions. [2020-09-04 16:31:49,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 16:31:49,854 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 216 [2020-09-04 16:31:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:49,856 INFO L225 Difference]: With dead ends: 141 [2020-09-04 16:31:49,856 INFO L226 Difference]: Without dead ends: 135 [2020-09-04 16:31:49,858 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=902, Invalid=1548, Unknown=0, NotChecked=0, Total=2450 [2020-09-04 16:31:49,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2020-09-04 16:31:49,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2020-09-04 16:31:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-09-04 16:31:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2020-09-04 16:31:49,866 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 216 [2020-09-04 16:31:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:49,866 INFO L479 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2020-09-04 16:31:49,866 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 16:31:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2020-09-04 16:31:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2020-09-04 16:31:49,868 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:49,868 INFO L422 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:49,868 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-09-04 16:31:49,869 INFO L427 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1706508121, now seen corresponding path program 23 times [2020-09-04 16:31:49,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:49,869 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2094594556] [2020-09-04 16:31:49,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:49,871 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:49,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:49,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,469 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,662 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,720 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:50,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:50,988 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:51,042 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:51,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:51,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:51,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:51,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:51,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:51,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2020-09-04 16:31:51,969 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2094594556] [2020-09-04 16:31:51,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:51,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2020-09-04 16:31:51,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138335286] [2020-09-04 16:31:51,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-09-04 16:31:51,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-09-04 16:31:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=427, Unknown=0, NotChecked=0, Total=756 [2020-09-04 16:31:51,972 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 28 states. [2020-09-04 16:31:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:52,471 INFO L93 Difference]: Finished difference Result 146 states and 147 transitions. [2020-09-04 16:31:52,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2020-09-04 16:31:52,477 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 225 [2020-09-04 16:31:52,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:52,479 INFO L225 Difference]: With dead ends: 146 [2020-09-04 16:31:52,479 INFO L226 Difference]: Without dead ends: 140 [2020-09-04 16:31:52,481 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=977, Invalid=1675, Unknown=0, NotChecked=0, Total=2652 [2020-09-04 16:31:52,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-09-04 16:31:52,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2020-09-04 16:31:52,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2020-09-04 16:31:52,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2020-09-04 16:31:52,490 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 225 [2020-09-04 16:31:52,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:52,490 INFO L479 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2020-09-04 16:31:52,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-09-04 16:31:52,490 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2020-09-04 16:31:52,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2020-09-04 16:31:52,492 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:52,492 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:52,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-09-04 16:31:52,492 INFO L427 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1861065457, now seen corresponding path program 24 times [2020-09-04 16:31:52,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:52,493 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [830525026] [2020-09-04 16:31:52,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:52,495 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:52,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:52,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 16:31:52,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:52,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-09-04 16:31:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:52,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:52,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:52,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:52,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,245 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,299 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,585 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:53,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:54,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:54,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:54,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 16:31:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 16:31:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2020-09-04 16:31:54,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [830525026] [2020-09-04 16:31:54,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 16:31:54,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2020-09-04 16:31:54,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795720692] [2020-09-04 16:31:54,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2020-09-04 16:31:54,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 16:31:54,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2020-09-04 16:31:54,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=457, Unknown=0, NotChecked=0, Total=812 [2020-09-04 16:31:54,455 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 29 states. [2020-09-04 16:31:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 16:31:55,001 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2020-09-04 16:31:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 16:31:55,002 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 234 [2020-09-04 16:31:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 16:31:55,004 INFO L225 Difference]: With dead ends: 151 [2020-09-04 16:31:55,004 INFO L226 Difference]: Without dead ends: 145 [2020-09-04 16:31:55,006 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1055, Invalid=1807, Unknown=0, NotChecked=0, Total=2862 [2020-09-04 16:31:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2020-09-04 16:31:55,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2020-09-04 16:31:55,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-09-04 16:31:55,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2020-09-04 16:31:55,017 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 234 [2020-09-04 16:31:55,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 16:31:55,018 INFO L479 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2020-09-04 16:31:55,018 INFO L480 AbstractCegarLoop]: Interpolant automaton has 29 states. [2020-09-04 16:31:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2020-09-04 16:31:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2020-09-04 16:31:55,020 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 16:31:55,020 INFO L422 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 16:31:55,021 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-09-04 16:31:55,021 INFO L427 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 16:31:55,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 16:31:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1283861777, now seen corresponding path program 25 times [2020-09-04 16:31:55,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 16:31:55,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1318432910] [2020-09-04 16:31:55,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 16:31:55,024 INFO L283 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-09-04 16:31:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:31:55,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:31:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 16:31:55,171 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 16:31:55,249 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-09-04 16:31:55,249 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 16:31:55,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-09-04 16:31:55,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 04:31:55 BoogieIcfgContainer [2020-09-04 16:31:55,306 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 16:31:55,309 INFO L168 Benchmark]: Toolchain (without parser) took 29734.20 ms. Allocated memory was 139.5 MB in the beginning and 784.3 MB in the end (delta: 644.9 MB). Free memory was 101.9 MB in the beginning and 691.9 MB in the end (delta: -590.0 MB). Peak memory consumption was 54.9 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:55,310 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 16:31:55,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.03 ms. Allocated memory is still 139.5 MB. Free memory was 101.7 MB in the beginning and 92.4 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:55,311 INFO L168 Benchmark]: Boogie Preprocessor took 34.80 ms. Allocated memory is still 139.5 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:55,317 INFO L168 Benchmark]: RCFGBuilder took 373.04 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 91.0 MB in the beginning and 170.8 MB in the end (delta: -79.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:55,320 INFO L168 Benchmark]: TraceAbstraction took 29022.25 ms. Allocated memory was 203.4 MB in the beginning and 784.3 MB in the end (delta: 580.9 MB). Free memory was 170.1 MB in the beginning and 691.9 MB in the end (delta: -521.7 MB). Peak memory consumption was 59.2 MB. Max. memory is 7.1 GB. [2020-09-04 16:31:55,323 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 139.5 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.03 ms. Allocated memory is still 139.5 MB. Free memory was 101.7 MB in the beginning and 92.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.80 ms. Allocated memory is still 139.5 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 373.04 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 91.0 MB in the beginning and 170.8 MB in the end (delta: -79.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29022.25 ms. Allocated memory was 203.4 MB in the beginning and 784.3 MB in the end (delta: 580.9 MB). Free memory was 170.1 MB in the beginning and 691.9 MB in the end (delta: -521.7 MB). Peak memory consumption was 59.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int a = 25; [L13] int b = 0; [L14] CALL, EXPR sum(a, b) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND FALSE !(n <= 0) [L7] CALL, EXPR sum(n - 1, m + 1) [L4] COND TRUE n <= 0 [L5] return m + n; [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L7] RET, EXPR sum(n - 1, m + 1) [L7] return sum(n - 1, m + 1); [L14] RET, EXPR sum(a, b) [L14] int result = sum(a, b); [L15] COND TRUE result == a + b [L16] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28.8s, OverallIterations: 26, TraceHistogramMax: 26, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 453 SDtfs, 1562 SDslu, 2581 SDs, 0 SdLazy, 1111 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1425 GetRequests, 725 SyntacticMatches, 0 SemanticMatches, 700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 incorrect! Received shutdown request...