/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.04.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:25:23,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:25:23,541 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:25:23,596 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:25:23,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:25:23,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:25:23,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:25:23,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:25:23,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:25:23,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:25:23,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:25:23,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:25:23,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:25:23,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:25:23,629 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:25:23,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:25:23,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:25:23,637 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:25:23,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:25:23,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:25:23,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:25:23,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:25:23,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:25:23,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:25:23,680 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:25:23,680 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:25:23,680 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:25:23,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:25:23,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:25:23,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:25:23,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:25:23,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:25:23,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:25:23,691 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:25:23,692 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:25:23,692 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:25:23,693 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:25:23,693 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:25:23,693 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:25:23,694 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:25:23,695 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:25:23,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:25:23,746 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:25:23,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:25:23,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:25:23,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:25:23,751 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:25:23,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:25:23,752 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:25:23,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:25:23,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:25:23,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:25:23,753 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:25:23,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:25:23,754 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:25:23,754 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:25:23,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:25:23,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:25:23,754 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:25:23,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:25:23,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:25:23,755 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:25:23,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:25:23,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:25:23,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:25:23,756 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:25:23,756 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:25:23,756 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:25:24,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:25:24,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:25:24,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:25:24,243 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:25:24,244 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:25:24,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2021-01-06 19:25:24,331 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/68be74ad0/a5eb2b3fd2de44d99cde0a1568ff2788/FLAG8e7481933 [2021-01-06 19:25:25,035 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:25:25,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c [2021-01-06 19:25:25,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/68be74ad0/a5eb2b3fd2de44d99cde0a1568ff2788/FLAG8e7481933 [2021-01-06 19:25:25,378 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/68be74ad0/a5eb2b3fd2de44d99cde0a1568ff2788 [2021-01-06 19:25:25,383 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:25:25,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:25:25,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:25:25,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:25:25,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:25:25,394 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b33875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25, skipping insertion in model container [2021-01-06 19:25:25,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:25:25,466 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:25:25,605 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] [2021-01-06 19:25:25,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:25:25,714 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:25:25,726 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-2.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] [2021-01-06 19:25:25,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:25:25,852 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:25:25,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25 WrapperNode [2021-01-06 19:25:25,853 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:25:25,854 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:25:25,854 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:25:25,854 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:25:25,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,964 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:25:25,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:25:25,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:25:25,966 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:25:25,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,984 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,984 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:26,002 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:26,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:26,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:26,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:25:26,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:25:26,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:25:26,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:25:26,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/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 [2021-01-06 19:25:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:25:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:25:26,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:25:26,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:25:27,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:25:27,522 INFO L299 CfgBuilder]: Removed 163 assume(true) statements. [2021-01-06 19:25:27,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:25:27 BoogieIcfgContainer [2021-01-06 19:25:27,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:25:27,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:25:27,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:25:27,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:25:27,538 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:25:25" (1/3) ... [2021-01-06 19:25:27,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3a49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:25:27, skipping insertion in model container [2021-01-06 19:25:27,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (2/3) ... [2021-01-06 19:25:27,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3a49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:25:27, skipping insertion in model container [2021-01-06 19:25:27,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:25:27" (3/3) ... [2021-01-06 19:25:27,541 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-2.c [2021-01-06 19:25:27,547 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:25:27,553 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 19:25:27,575 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 19:25:27,610 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:25:27,610 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:25:27,610 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:25:27,610 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:25:27,611 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:25:27,611 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:25:27,611 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:25:27,611 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:25:27,639 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states. [2021-01-06 19:25:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:27,650 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:27,652 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:27,652 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:27,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1090379614, now seen corresponding path program 1 times [2021-01-06 19:25:27,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:27,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928950355] [2021-01-06 19:25:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:27,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928950355] [2021-01-06 19:25:27,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:27,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:27,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495646385] [2021-01-06 19:25:27,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:27,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:27,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:27,962 INFO L87 Difference]: Start difference. First operand 421 states. Second operand 3 states. [2021-01-06 19:25:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:28,064 INFO L93 Difference]: Finished difference Result 837 states and 1301 transitions. [2021-01-06 19:25:28,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:28,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:28,085 INFO L225 Difference]: With dead ends: 837 [2021-01-06 19:25:28,085 INFO L226 Difference]: Without dead ends: 417 [2021-01-06 19:25:28,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:28,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2021-01-06 19:25:28,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2021-01-06 19:25:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2021-01-06 19:25:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 633 transitions. [2021-01-06 19:25:28,235 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 633 transitions. Word has length 72 [2021-01-06 19:25:28,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:28,235 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 633 transitions. [2021-01-06 19:25:28,235 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:28,235 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 633 transitions. [2021-01-06 19:25:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:28,241 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:28,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:28,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:25:28,244 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:28,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash 136439456, now seen corresponding path program 1 times [2021-01-06 19:25:28,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:28,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542614096] [2021-01-06 19:25:28,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:28,367 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542614096] [2021-01-06 19:25:28,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:28,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:28,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529783759] [2021-01-06 19:25:28,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:28,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:28,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:28,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:28,371 INFO L87 Difference]: Start difference. First operand 417 states and 633 transitions. Second operand 3 states. [2021-01-06 19:25:28,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:28,431 INFO L93 Difference]: Finished difference Result 1143 states and 1731 transitions. [2021-01-06 19:25:28,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:28,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:28,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:28,437 INFO L225 Difference]: With dead ends: 1143 [2021-01-06 19:25:28,438 INFO L226 Difference]: Without dead ends: 735 [2021-01-06 19:25:28,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2021-01-06 19:25:28,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 731. [2021-01-06 19:25:28,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:25:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1106 transitions. [2021-01-06 19:25:28,481 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1106 transitions. Word has length 72 [2021-01-06 19:25:28,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:28,482 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1106 transitions. [2021-01-06 19:25:28,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1106 transitions. [2021-01-06 19:25:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:28,484 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:28,484 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:28,484 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:25:28,484 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:28,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:28,485 INFO L82 PathProgramCache]: Analyzing trace with hash -51966948, now seen corresponding path program 1 times [2021-01-06 19:25:28,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:28,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948100858] [2021-01-06 19:25:28,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:28,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:28,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948100858] [2021-01-06 19:25:28,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:28,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:28,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327539308] [2021-01-06 19:25:28,622 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:28,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:28,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:28,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:28,627 INFO L87 Difference]: Start difference. First operand 731 states and 1106 transitions. Second operand 4 states. [2021-01-06 19:25:28,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:28,794 INFO L93 Difference]: Finished difference Result 1769 states and 2672 transitions. [2021-01-06 19:25:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:28,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:28,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:28,806 INFO L225 Difference]: With dead ends: 1769 [2021-01-06 19:25:28,807 INFO L226 Difference]: Without dead ends: 1048 [2021-01-06 19:25:28,808 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:28,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-01-06 19:25:28,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 731. [2021-01-06 19:25:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:25:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1103 transitions. [2021-01-06 19:25:28,864 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1103 transitions. Word has length 72 [2021-01-06 19:25:28,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:28,870 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1103 transitions. [2021-01-06 19:25:28,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:28,871 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1103 transitions. [2021-01-06 19:25:28,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:28,874 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:28,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:28,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:25:28,874 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:28,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash -469363554, now seen corresponding path program 1 times [2021-01-06 19:25:28,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:28,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47616139] [2021-01-06 19:25:28,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:28,988 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47616139] [2021-01-06 19:25:28,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:28,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:28,989 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394893047] [2021-01-06 19:25:28,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:28,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:28,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:28,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:28,990 INFO L87 Difference]: Start difference. First operand 731 states and 1103 transitions. Second operand 4 states. [2021-01-06 19:25:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,095 INFO L93 Difference]: Finished difference Result 1767 states and 2662 transitions. [2021-01-06 19:25:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:29,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,102 INFO L225 Difference]: With dead ends: 1767 [2021-01-06 19:25:29,102 INFO L226 Difference]: Without dead ends: 1047 [2021-01-06 19:25:29,104 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2021-01-06 19:25:29,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 731. [2021-01-06 19:25:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:25:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1100 transitions. [2021-01-06 19:25:29,146 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1100 transitions. Word has length 72 [2021-01-06 19:25:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:29,146 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1100 transitions. [2021-01-06 19:25:29,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1100 transitions. [2021-01-06 19:25:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:29,148 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:29,148 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:29,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:25:29,148 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:29,149 INFO L82 PathProgramCache]: Analyzing trace with hash 209908700, now seen corresponding path program 1 times [2021-01-06 19:25:29,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:29,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786942431] [2021-01-06 19:25:29,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:29,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:29,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786942431] [2021-01-06 19:25:29,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:29,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:29,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890606641] [2021-01-06 19:25:29,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:29,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:29,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:29,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,199 INFO L87 Difference]: Start difference. First operand 731 states and 1100 transitions. Second operand 3 states. [2021-01-06 19:25:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,252 INFO L93 Difference]: Finished difference Result 1450 states and 2183 transitions. [2021-01-06 19:25:29,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:29,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,257 INFO L225 Difference]: With dead ends: 1450 [2021-01-06 19:25:29,257 INFO L226 Difference]: Without dead ends: 731 [2021-01-06 19:25:29,258 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-01-06 19:25:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2021-01-06 19:25:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:25:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1092 transitions. [2021-01-06 19:25:29,313 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1092 transitions. Word has length 72 [2021-01-06 19:25:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:29,313 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1092 transitions. [2021-01-06 19:25:29,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1092 transitions. [2021-01-06 19:25:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:29,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:29,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:29,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:25:29,315 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:29,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:29,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1700782112, now seen corresponding path program 1 times [2021-01-06 19:25:29,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:29,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620651583] [2021-01-06 19:25:29,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:29,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620651583] [2021-01-06 19:25:29,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:29,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:29,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56897455] [2021-01-06 19:25:29,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:29,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:29,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:29,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,357 INFO L87 Difference]: Start difference. First operand 731 states and 1092 transitions. Second operand 3 states. [2021-01-06 19:25:29,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,430 INFO L93 Difference]: Finished difference Result 1448 states and 2164 transitions. [2021-01-06 19:25:29,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:29,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:29,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,434 INFO L225 Difference]: With dead ends: 1448 [2021-01-06 19:25:29,435 INFO L226 Difference]: Without dead ends: 731 [2021-01-06 19:25:29,436 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-01-06 19:25:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2021-01-06 19:25:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:25:29,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1072 transitions. [2021-01-06 19:25:29,479 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1072 transitions. Word has length 72 [2021-01-06 19:25:29,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:29,479 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1072 transitions. [2021-01-06 19:25:29,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:29,480 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1072 transitions. [2021-01-06 19:25:29,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:29,480 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:29,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:29,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:25:29,481 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:29,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:29,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1192162725, now seen corresponding path program 1 times [2021-01-06 19:25:29,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:29,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275871727] [2021-01-06 19:25:29,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:29,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:29,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:29,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275871727] [2021-01-06 19:25:29,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:29,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:29,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096047499] [2021-01-06 19:25:29,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:29,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:29,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:29,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:29,524 INFO L87 Difference]: Start difference. First operand 731 states and 1072 transitions. Second operand 4 states. [2021-01-06 19:25:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,670 INFO L93 Difference]: Finished difference Result 1724 states and 2528 transitions. [2021-01-06 19:25:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:29,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,677 INFO L225 Difference]: With dead ends: 1724 [2021-01-06 19:25:29,677 INFO L226 Difference]: Without dead ends: 1008 [2021-01-06 19:25:29,679 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:29,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2021-01-06 19:25:29,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 731. [2021-01-06 19:25:29,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:25:29,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1069 transitions. [2021-01-06 19:25:29,745 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1069 transitions. Word has length 72 [2021-01-06 19:25:29,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:29,745 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1069 transitions. [2021-01-06 19:25:29,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:29,746 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1069 transitions. [2021-01-06 19:25:29,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:29,746 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:29,747 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:29,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:25:29,747 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:29,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:29,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1625891811, now seen corresponding path program 1 times [2021-01-06 19:25:29,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:29,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484484550] [2021-01-06 19:25:29,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:29,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:29,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:29,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484484550] [2021-01-06 19:25:29,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:29,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:29,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143923155] [2021-01-06 19:25:29,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:29,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:29,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:29,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,790 INFO L87 Difference]: Start difference. First operand 731 states and 1069 transitions. Second operand 3 states. [2021-01-06 19:25:29,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,871 INFO L93 Difference]: Finished difference Result 1446 states and 2116 transitions. [2021-01-06 19:25:29,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:29,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:29,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,875 INFO L225 Difference]: With dead ends: 1446 [2021-01-06 19:25:29,875 INFO L226 Difference]: Without dead ends: 731 [2021-01-06 19:25:29,877 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-01-06 19:25:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2021-01-06 19:25:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:25:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1049 transitions. [2021-01-06 19:25:29,926 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1049 transitions. Word has length 72 [2021-01-06 19:25:29,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:29,926 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1049 transitions. [2021-01-06 19:25:29,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1049 transitions. [2021-01-06 19:25:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:29,927 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:29,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:29,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:25:29,927 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:29,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:29,928 INFO L82 PathProgramCache]: Analyzing trace with hash 813286440, now seen corresponding path program 1 times [2021-01-06 19:25:29,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:29,929 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070760569] [2021-01-06 19:25:29,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:29,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070760569] [2021-01-06 19:25:29,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:29,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:29,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300117489] [2021-01-06 19:25:29,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:29,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:29,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,968 INFO L87 Difference]: Start difference. First operand 731 states and 1049 transitions. Second operand 3 states. [2021-01-06 19:25:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:30,049 INFO L93 Difference]: Finished difference Result 1445 states and 2075 transitions. [2021-01-06 19:25:30,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:30,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:30,054 INFO L225 Difference]: With dead ends: 1445 [2021-01-06 19:25:30,054 INFO L226 Difference]: Without dead ends: 731 [2021-01-06 19:25:30,056 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2021-01-06 19:25:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 731. [2021-01-06 19:25:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:25:30,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1029 transitions. [2021-01-06 19:25:30,123 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1029 transitions. Word has length 72 [2021-01-06 19:25:30,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:30,124 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1029 transitions. [2021-01-06 19:25:30,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:30,124 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1029 transitions. [2021-01-06 19:25:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:30,125 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:30,125 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:30,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:25:30,126 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:30,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash -167107164, now seen corresponding path program 1 times [2021-01-06 19:25:30,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:30,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310823552] [2021-01-06 19:25:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:30,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310823552] [2021-01-06 19:25:30,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:30,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:30,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134767612] [2021-01-06 19:25:30,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:30,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:30,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:30,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:30,170 INFO L87 Difference]: Start difference. First operand 731 states and 1029 transitions. Second operand 4 states. [2021-01-06 19:25:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:30,366 INFO L93 Difference]: Finished difference Result 1718 states and 2420 transitions. [2021-01-06 19:25:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:30,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:30,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:30,375 INFO L225 Difference]: With dead ends: 1718 [2021-01-06 19:25:30,376 INFO L226 Difference]: Without dead ends: 1005 [2021-01-06 19:25:30,379 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:30,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2021-01-06 19:25:30,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 731. [2021-01-06 19:25:30,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2021-01-06 19:25:30,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1026 transitions. [2021-01-06 19:25:30,440 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1026 transitions. Word has length 72 [2021-01-06 19:25:30,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:30,441 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 1026 transitions. [2021-01-06 19:25:30,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:30,442 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1026 transitions. [2021-01-06 19:25:30,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:30,443 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:30,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:30,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:25:30,443 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:30,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:30,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1219678246, now seen corresponding path program 1 times [2021-01-06 19:25:30,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:30,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457475238] [2021-01-06 19:25:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:30,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457475238] [2021-01-06 19:25:30,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:30,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:30,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396635494] [2021-01-06 19:25:30,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:30,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:30,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:30,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:30,501 INFO L87 Difference]: Start difference. First operand 731 states and 1026 transitions. Second operand 5 states. [2021-01-06 19:25:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:30,695 INFO L93 Difference]: Finished difference Result 1819 states and 2574 transitions. [2021-01-06 19:25:30,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:30,696 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:25:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:30,703 INFO L225 Difference]: With dead ends: 1819 [2021-01-06 19:25:30,703 INFO L226 Difference]: Without dead ends: 1113 [2021-01-06 19:25:30,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:30,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2021-01-06 19:25:30,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 737. [2021-01-06 19:25:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2021-01-06 19:25:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1020 transitions. [2021-01-06 19:25:30,787 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1020 transitions. Word has length 72 [2021-01-06 19:25:30,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:30,787 INFO L481 AbstractCegarLoop]: Abstraction has 737 states and 1020 transitions. [2021-01-06 19:25:30,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1020 transitions. [2021-01-06 19:25:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:30,788 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:30,788 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:30,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:25:30,789 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:30,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:30,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1204159528, now seen corresponding path program 1 times [2021-01-06 19:25:30,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:30,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206792425] [2021-01-06 19:25:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:30,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206792425] [2021-01-06 19:25:30,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:30,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:30,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519034619] [2021-01-06 19:25:30,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:30,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:30,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:30,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:30,841 INFO L87 Difference]: Start difference. First operand 737 states and 1020 transitions. Second operand 5 states. [2021-01-06 19:25:31,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:31,140 INFO L93 Difference]: Finished difference Result 2641 states and 3665 transitions. [2021-01-06 19:25:31,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:31,140 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:25:31,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:31,150 INFO L225 Difference]: With dead ends: 2641 [2021-01-06 19:25:31,150 INFO L226 Difference]: Without dead ends: 1936 [2021-01-06 19:25:31,152 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:31,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2021-01-06 19:25:31,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 779. [2021-01-06 19:25:31,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2021-01-06 19:25:31,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1062 transitions. [2021-01-06 19:25:31,245 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1062 transitions. Word has length 72 [2021-01-06 19:25:31,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:31,245 INFO L481 AbstractCegarLoop]: Abstraction has 779 states and 1062 transitions. [2021-01-06 19:25:31,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:31,245 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1062 transitions. [2021-01-06 19:25:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:31,246 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:31,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:31,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:25:31,247 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:31,247 INFO L82 PathProgramCache]: Analyzing trace with hash 306766250, now seen corresponding path program 1 times [2021-01-06 19:25:31,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:31,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238171308] [2021-01-06 19:25:31,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:31,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238171308] [2021-01-06 19:25:31,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:31,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:31,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434767475] [2021-01-06 19:25:31,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:31,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:31,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:31,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:31,289 INFO L87 Difference]: Start difference. First operand 779 states and 1062 transitions. Second operand 5 states. [2021-01-06 19:25:31,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:31,506 INFO L93 Difference]: Finished difference Result 2052 states and 2811 transitions. [2021-01-06 19:25:31,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:31,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:25:31,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:31,514 INFO L225 Difference]: With dead ends: 2052 [2021-01-06 19:25:31,514 INFO L226 Difference]: Without dead ends: 1315 [2021-01-06 19:25:31,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:31,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2021-01-06 19:25:31,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 785. [2021-01-06 19:25:31,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2021-01-06 19:25:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1056 transitions. [2021-01-06 19:25:31,591 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1056 transitions. Word has length 72 [2021-01-06 19:25:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:31,591 INFO L481 AbstractCegarLoop]: Abstraction has 785 states and 1056 transitions. [2021-01-06 19:25:31,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1056 transitions. [2021-01-06 19:25:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:31,592 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:31,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:31,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:25:31,593 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:31,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:31,594 INFO L82 PathProgramCache]: Analyzing trace with hash 966297772, now seen corresponding path program 1 times [2021-01-06 19:25:31,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:31,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236587245] [2021-01-06 19:25:31,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:31,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:31,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236587245] [2021-01-06 19:25:31,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:31,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:31,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058016657] [2021-01-06 19:25:31,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:31,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:31,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:31,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:31,636 INFO L87 Difference]: Start difference. First operand 785 states and 1056 transitions. Second operand 5 states. [2021-01-06 19:25:31,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:31,872 INFO L93 Difference]: Finished difference Result 2119 states and 2861 transitions. [2021-01-06 19:25:31,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:31,872 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:25:31,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:31,879 INFO L225 Difference]: With dead ends: 2119 [2021-01-06 19:25:31,880 INFO L226 Difference]: Without dead ends: 1383 [2021-01-06 19:25:31,883 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2021-01-06 19:25:31,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2021-01-06 19:25:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2021-01-06 19:25:31,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1050 transitions. [2021-01-06 19:25:31,962 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1050 transitions. Word has length 72 [2021-01-06 19:25:31,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:31,964 INFO L481 AbstractCegarLoop]: Abstraction has 791 states and 1050 transitions. [2021-01-06 19:25:31,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:31,964 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1050 transitions. [2021-01-06 19:25:31,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:31,965 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:31,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:31,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:25:31,965 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1667897646, now seen corresponding path program 1 times [2021-01-06 19:25:31,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:31,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275475370] [2021-01-06 19:25:31,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:32,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275475370] [2021-01-06 19:25:32,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:32,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:32,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685412990] [2021-01-06 19:25:32,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:32,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:32,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:32,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:32,023 INFO L87 Difference]: Start difference. First operand 791 states and 1050 transitions. Second operand 4 states. [2021-01-06 19:25:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:32,384 INFO L93 Difference]: Finished difference Result 2803 states and 3720 transitions. [2021-01-06 19:25:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:32,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:32,400 INFO L225 Difference]: With dead ends: 2803 [2021-01-06 19:25:32,400 INFO L226 Difference]: Without dead ends: 2032 [2021-01-06 19:25:32,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:32,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2021-01-06 19:25:32,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1936. [2021-01-06 19:25:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2021-01-06 19:25:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2545 transitions. [2021-01-06 19:25:32,591 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2545 transitions. Word has length 72 [2021-01-06 19:25:32,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:32,592 INFO L481 AbstractCegarLoop]: Abstraction has 1936 states and 2545 transitions. [2021-01-06 19:25:32,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:32,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2545 transitions. [2021-01-06 19:25:32,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:32,593 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:32,594 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:32,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:25:32,594 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:32,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1599707443, now seen corresponding path program 1 times [2021-01-06 19:25:32,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:32,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664603797] [2021-01-06 19:25:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:32,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:32,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:25:32,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664603797] [2021-01-06 19:25:32,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:32,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:32,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557836777] [2021-01-06 19:25:32,657 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:32,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:32,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:32,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:32,658 INFO L87 Difference]: Start difference. First operand 1936 states and 2545 transitions. Second operand 5 states. [2021-01-06 19:25:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:33,111 INFO L93 Difference]: Finished difference Result 4730 states and 6262 transitions. [2021-01-06 19:25:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:33,111 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2021-01-06 19:25:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:33,125 INFO L225 Difference]: With dead ends: 4730 [2021-01-06 19:25:33,126 INFO L226 Difference]: Without dead ends: 2848 [2021-01-06 19:25:33,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2848 states. [2021-01-06 19:25:33,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2848 to 1975. [2021-01-06 19:25:33,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2021-01-06 19:25:33,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2563 transitions. [2021-01-06 19:25:33,346 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2563 transitions. Word has length 87 [2021-01-06 19:25:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:33,346 INFO L481 AbstractCegarLoop]: Abstraction has 1975 states and 2563 transitions. [2021-01-06 19:25:33,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:33,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2563 transitions. [2021-01-06 19:25:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:33,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:33,348 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:33,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:25:33,348 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:33,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:33,349 INFO L82 PathProgramCache]: Analyzing trace with hash 227900145, now seen corresponding path program 1 times [2021-01-06 19:25:33,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:33,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442135446] [2021-01-06 19:25:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:25:33,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442135446] [2021-01-06 19:25:33,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:33,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:33,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984809060] [2021-01-06 19:25:33,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:33,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:33,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:33,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:33,397 INFO L87 Difference]: Start difference. First operand 1975 states and 2563 transitions. Second operand 4 states. [2021-01-06 19:25:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:33,714 INFO L93 Difference]: Finished difference Result 4765 states and 6185 transitions. [2021-01-06 19:25:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:33,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 19:25:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:33,729 INFO L225 Difference]: With dead ends: 4765 [2021-01-06 19:25:33,729 INFO L226 Difference]: Without dead ends: 2847 [2021-01-06 19:25:33,732 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2847 states. [2021-01-06 19:25:33,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2847 to 1975. [2021-01-06 19:25:33,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2021-01-06 19:25:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2550 transitions. [2021-01-06 19:25:33,947 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2550 transitions. Word has length 87 [2021-01-06 19:25:33,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:33,947 INFO L481 AbstractCegarLoop]: Abstraction has 1975 states and 2550 transitions. [2021-01-06 19:25:33,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:33,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2550 transitions. [2021-01-06 19:25:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:33,949 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:33,949 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:33,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:25:33,950 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:33,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:33,950 INFO L82 PathProgramCache]: Analyzing trace with hash 887431667, now seen corresponding path program 1 times [2021-01-06 19:25:33,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:33,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253370005] [2021-01-06 19:25:33,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:33,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:25:34,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253370005] [2021-01-06 19:25:34,000 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:34,000 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:34,000 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064446187] [2021-01-06 19:25:34,001 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:34,001 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:34,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:34,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:34,002 INFO L87 Difference]: Start difference. First operand 1975 states and 2550 transitions. Second operand 3 states. [2021-01-06 19:25:34,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:34,244 INFO L93 Difference]: Finished difference Result 3937 states and 5082 transitions. [2021-01-06 19:25:34,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:34,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 19:25:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:34,256 INFO L225 Difference]: With dead ends: 3937 [2021-01-06 19:25:34,256 INFO L226 Difference]: Without dead ends: 1975 [2021-01-06 19:25:34,260 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:34,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2021-01-06 19:25:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1975. [2021-01-06 19:25:34,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1975 states. [2021-01-06 19:25:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1975 states to 1975 states and 2530 transitions. [2021-01-06 19:25:34,557 INFO L78 Accepts]: Start accepts. Automaton has 1975 states and 2530 transitions. Word has length 87 [2021-01-06 19:25:34,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:34,557 INFO L481 AbstractCegarLoop]: Abstraction has 1975 states and 2530 transitions. [2021-01-06 19:25:34,557 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:34,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1975 states and 2530 transitions. [2021-01-06 19:25:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:34,559 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:34,559 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:34,559 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:25:34,559 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:34,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:34,560 INFO L82 PathProgramCache]: Analyzing trace with hash 43426165, now seen corresponding path program 1 times [2021-01-06 19:25:34,560 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:34,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145858786] [2021-01-06 19:25:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:25:34,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145858786] [2021-01-06 19:25:34,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:34,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:34,628 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518343194] [2021-01-06 19:25:34,629 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:34,629 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:34,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:34,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:34,630 INFO L87 Difference]: Start difference. First operand 1975 states and 2530 transitions. Second operand 4 states. [2021-01-06 19:25:35,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:35,035 INFO L93 Difference]: Finished difference Result 4691 states and 5998 transitions. [2021-01-06 19:25:35,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:35,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 19:25:35,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:35,068 INFO L225 Difference]: With dead ends: 4691 [2021-01-06 19:25:35,068 INFO L226 Difference]: Without dead ends: 2747 [2021-01-06 19:25:35,075 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2747 states. [2021-01-06 19:25:35,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2747 to 1885. [2021-01-06 19:25:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1885 states. [2021-01-06 19:25:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1885 states to 1885 states and 2367 transitions. [2021-01-06 19:25:35,274 INFO L78 Accepts]: Start accepts. Automaton has 1885 states and 2367 transitions. Word has length 87 [2021-01-06 19:25:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:35,274 INFO L481 AbstractCegarLoop]: Abstraction has 1885 states and 2367 transitions. [2021-01-06 19:25:35,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:35,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1885 states and 2367 transitions. [2021-01-06 19:25:35,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:35,276 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:35,276 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:35,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:25:35,276 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:35,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:35,277 INFO L82 PathProgramCache]: Analyzing trace with hash -28960393, now seen corresponding path program 1 times [2021-01-06 19:25:35,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:35,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554502332] [2021-01-06 19:25:35,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:35,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:35,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554502332] [2021-01-06 19:25:35,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:35,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:35,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727980350] [2021-01-06 19:25:35,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:35,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:35,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:35,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:35,328 INFO L87 Difference]: Start difference. First operand 1885 states and 2367 transitions. Second operand 3 states. [2021-01-06 19:25:35,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:35,711 INFO L93 Difference]: Finished difference Result 5302 states and 6598 transitions. [2021-01-06 19:25:35,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:35,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 19:25:35,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:35,723 INFO L225 Difference]: With dead ends: 5302 [2021-01-06 19:25:35,723 INFO L226 Difference]: Without dead ends: 3478 [2021-01-06 19:25:35,728 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3478 states. [2021-01-06 19:25:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3478 to 3478. [2021-01-06 19:25:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3478 states. [2021-01-06 19:25:36,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 4277 transitions. [2021-01-06 19:25:36,212 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 4277 transitions. Word has length 87 [2021-01-06 19:25:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:36,212 INFO L481 AbstractCegarLoop]: Abstraction has 3478 states and 4277 transitions. [2021-01-06 19:25:36,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 4277 transitions. [2021-01-06 19:25:36,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 19:25:36,214 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:36,215 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:36,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:25:36,215 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:36,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:36,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1257798348, now seen corresponding path program 1 times [2021-01-06 19:25:36,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:36,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607509705] [2021-01-06 19:25:36,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:36,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:36,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607509705] [2021-01-06 19:25:36,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:36,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:36,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695292372] [2021-01-06 19:25:36,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:36,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:36,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:36,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:36,287 INFO L87 Difference]: Start difference. First operand 3478 states and 4277 transitions. Second operand 3 states. [2021-01-06 19:25:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:36,936 INFO L93 Difference]: Finished difference Result 9616 states and 11809 transitions. [2021-01-06 19:25:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:36,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 19:25:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:36,950 INFO L225 Difference]: With dead ends: 9616 [2021-01-06 19:25:36,950 INFO L226 Difference]: Without dead ends: 6256 [2021-01-06 19:25:36,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6256 states. [2021-01-06 19:25:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6256 to 6252. [2021-01-06 19:25:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6252 states. [2021-01-06 19:25:37,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6252 states to 6252 states and 7635 transitions. [2021-01-06 19:25:37,610 INFO L78 Accepts]: Start accepts. Automaton has 6252 states and 7635 transitions. Word has length 88 [2021-01-06 19:25:37,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:37,610 INFO L481 AbstractCegarLoop]: Abstraction has 6252 states and 7635 transitions. [2021-01-06 19:25:37,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:37,610 INFO L276 IsEmpty]: Start isEmpty. Operand 6252 states and 7635 transitions. [2021-01-06 19:25:37,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 19:25:37,612 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:37,612 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:37,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:25:37,613 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:37,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:37,613 INFO L82 PathProgramCache]: Analyzing trace with hash 657646591, now seen corresponding path program 1 times [2021-01-06 19:25:37,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:37,614 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438089883] [2021-01-06 19:25:37,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:37,653 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:37,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438089883] [2021-01-06 19:25:37,655 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:37,655 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:37,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680546127] [2021-01-06 19:25:37,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:37,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:37,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:37,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:37,660 INFO L87 Difference]: Start difference. First operand 6252 states and 7635 transitions. Second operand 3 states. [2021-01-06 19:25:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:38,856 INFO L93 Difference]: Finished difference Result 17538 states and 21399 transitions. [2021-01-06 19:25:38,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:38,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 19:25:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:38,884 INFO L225 Difference]: With dead ends: 17538 [2021-01-06 19:25:38,885 INFO L226 Difference]: Without dead ends: 11404 [2021-01-06 19:25:38,896 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:38,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11404 states. [2021-01-06 19:25:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11404 to 11400. [2021-01-06 19:25:39,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11400 states. [2021-01-06 19:25:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11400 states to 11400 states and 13855 transitions. [2021-01-06 19:25:39,966 INFO L78 Accepts]: Start accepts. Automaton has 11400 states and 13855 transitions. Word has length 89 [2021-01-06 19:25:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:39,967 INFO L481 AbstractCegarLoop]: Abstraction has 11400 states and 13855 transitions. [2021-01-06 19:25:39,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 11400 states and 13855 transitions. [2021-01-06 19:25:39,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 19:25:39,970 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:39,970 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:39,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:25:39,970 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:39,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:39,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1221484355, now seen corresponding path program 1 times [2021-01-06 19:25:39,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:39,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753594245] [2021-01-06 19:25:39,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:40,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:40,005 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753594245] [2021-01-06 19:25:40,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:40,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:40,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395698960] [2021-01-06 19:25:40,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:40,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:40,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:40,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:40,009 INFO L87 Difference]: Start difference. First operand 11400 states and 13855 transitions. Second operand 3 states. [2021-01-06 19:25:40,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:40,883 INFO L93 Difference]: Finished difference Result 22572 states and 27451 transitions. [2021-01-06 19:25:40,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:40,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 19:25:40,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:40,905 INFO L225 Difference]: With dead ends: 22572 [2021-01-06 19:25:40,905 INFO L226 Difference]: Without dead ends: 11290 [2021-01-06 19:25:40,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11290 states. [2021-01-06 19:25:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11290 to 11290. [2021-01-06 19:25:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11290 states. [2021-01-06 19:25:41,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11290 states to 11290 states and 13729 transitions. [2021-01-06 19:25:41,895 INFO L78 Accepts]: Start accepts. Automaton has 11290 states and 13729 transitions. Word has length 89 [2021-01-06 19:25:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:41,895 INFO L481 AbstractCegarLoop]: Abstraction has 11290 states and 13729 transitions. [2021-01-06 19:25:41,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 11290 states and 13729 transitions. [2021-01-06 19:25:41,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:25:41,898 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:41,898 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:41,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:25:41,899 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:41,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:41,900 INFO L82 PathProgramCache]: Analyzing trace with hash 965025050, now seen corresponding path program 1 times [2021-01-06 19:25:41,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:41,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080486353] [2021-01-06 19:25:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:41,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080486353] [2021-01-06 19:25:41,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:41,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:41,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770587019] [2021-01-06 19:25:41,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:41,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:41,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:41,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:41,950 INFO L87 Difference]: Start difference. First operand 11290 states and 13729 transitions. Second operand 3 states. [2021-01-06 19:25:43,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:43,557 INFO L93 Difference]: Finished difference Result 31756 states and 38669 transitions. [2021-01-06 19:25:43,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:43,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:25:43,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:43,590 INFO L225 Difference]: With dead ends: 31756 [2021-01-06 19:25:43,590 INFO L226 Difference]: Without dead ends: 20584 [2021-01-06 19:25:43,608 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20584 states. [2021-01-06 19:25:45,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20584 to 20580. [2021-01-06 19:25:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20580 states. [2021-01-06 19:25:45,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20580 states to 20580 states and 25005 transitions. [2021-01-06 19:25:45,232 INFO L78 Accepts]: Start accepts. Automaton has 20580 states and 25005 transitions. Word has length 90 [2021-01-06 19:25:45,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:45,232 INFO L481 AbstractCegarLoop]: Abstraction has 20580 states and 25005 transitions. [2021-01-06 19:25:45,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:45,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20580 states and 25005 transitions. [2021-01-06 19:25:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:25:45,236 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:45,236 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:45,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:25:45,237 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash -914105896, now seen corresponding path program 1 times [2021-01-06 19:25:45,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:45,238 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465318108] [2021-01-06 19:25:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:45,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465318108] [2021-01-06 19:25:45,267 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:45,267 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:45,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394446393] [2021-01-06 19:25:45,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:45,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:45,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:45,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:45,268 INFO L87 Difference]: Start difference. First operand 20580 states and 25005 transitions. Second operand 3 states. [2021-01-06 19:25:46,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:46,902 INFO L93 Difference]: Finished difference Result 40934 states and 49757 transitions. [2021-01-06 19:25:46,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:46,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:25:46,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:46,934 INFO L225 Difference]: With dead ends: 40934 [2021-01-06 19:25:46,934 INFO L226 Difference]: Without dead ends: 20472 [2021-01-06 19:25:46,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:46,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20472 states. [2021-01-06 19:25:48,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20472 to 20472. [2021-01-06 19:25:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20472 states. [2021-01-06 19:25:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20472 states to 20472 states and 24883 transitions. [2021-01-06 19:25:48,945 INFO L78 Accepts]: Start accepts. Automaton has 20472 states and 24883 transitions. Word has length 90 [2021-01-06 19:25:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:48,945 INFO L481 AbstractCegarLoop]: Abstraction has 20472 states and 24883 transitions. [2021-01-06 19:25:48,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 20472 states and 24883 transitions. [2021-01-06 19:25:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 19:25:48,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:48,948 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:48,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:25:48,948 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1266963889, now seen corresponding path program 1 times [2021-01-06 19:25:48,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:48,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94451171] [2021-01-06 19:25:48,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:48,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94451171] [2021-01-06 19:25:48,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:48,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:48,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682846052] [2021-01-06 19:25:48,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:48,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:48,997 INFO L87 Difference]: Start difference. First operand 20472 states and 24883 transitions. Second operand 3 states. [2021-01-06 19:25:51,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:51,264 INFO L93 Difference]: Finished difference Result 49428 states and 60301 transitions. [2021-01-06 19:25:51,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:51,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2021-01-06 19:25:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:51,303 INFO L225 Difference]: With dead ends: 49428 [2021-01-06 19:25:51,303 INFO L226 Difference]: Without dead ends: 34620 [2021-01-06 19:25:51,317 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:51,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34620 states. [2021-01-06 19:25:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34620 to 27842. [2021-01-06 19:25:53,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27842 states. [2021-01-06 19:25:53,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27842 states to 27842 states and 33821 transitions. [2021-01-06 19:25:53,804 INFO L78 Accepts]: Start accepts. Automaton has 27842 states and 33821 transitions. Word has length 91 [2021-01-06 19:25:53,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:53,804 INFO L481 AbstractCegarLoop]: Abstraction has 27842 states and 33821 transitions. [2021-01-06 19:25:53,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:53,804 INFO L276 IsEmpty]: Start isEmpty. Operand 27842 states and 33821 transitions. [2021-01-06 19:25:53,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 19:25:53,815 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:53,815 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:53,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:25:53,815 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:53,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:53,816 INFO L82 PathProgramCache]: Analyzing trace with hash 751901331, now seen corresponding path program 1 times [2021-01-06 19:25:53,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:53,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098902383] [2021-01-06 19:25:53,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:53,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098902383] [2021-01-06 19:25:53,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:53,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:53,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864192008] [2021-01-06 19:25:53,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:53,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:53,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:53,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:53,874 INFO L87 Difference]: Start difference. First operand 27842 states and 33821 transitions. Second operand 4 states. [2021-01-06 19:25:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:58,708 INFO L93 Difference]: Finished difference Result 88574 states and 107581 transitions. [2021-01-06 19:25:58,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:58,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2021-01-06 19:25:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:58,776 INFO L225 Difference]: With dead ends: 88574 [2021-01-06 19:25:58,776 INFO L226 Difference]: Without dead ends: 60780 [2021-01-06 19:25:58,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:58,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60780 states. [2021-01-06 19:26:02,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60780 to 52392. [2021-01-06 19:26:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52392 states. [2021-01-06 19:26:03,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52392 states to 52392 states and 63345 transitions. [2021-01-06 19:26:03,049 INFO L78 Accepts]: Start accepts. Automaton has 52392 states and 63345 transitions. Word has length 120 [2021-01-06 19:26:03,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:03,050 INFO L481 AbstractCegarLoop]: Abstraction has 52392 states and 63345 transitions. [2021-01-06 19:26:03,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:03,050 INFO L276 IsEmpty]: Start isEmpty. Operand 52392 states and 63345 transitions. [2021-01-06 19:26:03,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 19:26:03,067 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:03,067 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:03,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:26:03,068 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:03,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:03,068 INFO L82 PathProgramCache]: Analyzing trace with hash 805064470, now seen corresponding path program 1 times [2021-01-06 19:26:03,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:03,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224320334] [2021-01-06 19:26:03,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:03,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224320334] [2021-01-06 19:26:03,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:03,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:03,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311470200] [2021-01-06 19:26:03,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:03,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:03,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:03,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:03,126 INFO L87 Difference]: Start difference. First operand 52392 states and 63345 transitions. Second operand 3 states. [2021-01-06 19:26:10,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:10,554 INFO L93 Difference]: Finished difference Result 151352 states and 182661 transitions. [2021-01-06 19:26:10,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:10,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2021-01-06 19:26:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:10,684 INFO L225 Difference]: With dead ends: 151352 [2021-01-06 19:26:10,685 INFO L226 Difference]: Without dead ends: 99076 [2021-01-06 19:26:10,725 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:10,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99076 states. [2021-01-06 19:26:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99076 to 98688. [2021-01-06 19:26:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98688 states. [2021-01-06 19:26:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98688 states to 98688 states and 118753 transitions. [2021-01-06 19:26:18,770 INFO L78 Accepts]: Start accepts. Automaton has 98688 states and 118753 transitions. Word has length 120 [2021-01-06 19:26:18,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:18,770 INFO L481 AbstractCegarLoop]: Abstraction has 98688 states and 118753 transitions. [2021-01-06 19:26:18,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 98688 states and 118753 transitions. [2021-01-06 19:26:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 19:26:18,796 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:18,796 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:18,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:26:18,796 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:18,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1762757864, now seen corresponding path program 1 times [2021-01-06 19:26:18,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:18,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231322553] [2021-01-06 19:26:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:26:18,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231322553] [2021-01-06 19:26:18,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:18,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:18,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790767643] [2021-01-06 19:26:18,827 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:18,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:18,828 INFO L87 Difference]: Start difference. First operand 98688 states and 118753 transitions. Second operand 3 states. [2021-01-06 19:26:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:26,480 INFO L93 Difference]: Finished difference Result 197156 states and 237267 transitions. [2021-01-06 19:26:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:26,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2021-01-06 19:26:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:26,759 INFO L225 Difference]: With dead ends: 197156 [2021-01-06 19:26:26,760 INFO L226 Difference]: Without dead ends: 98584 [2021-01-06 19:26:26,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:26,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98584 states. [2021-01-06 19:26:34,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98584 to 98584. [2021-01-06 19:26:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98584 states. [2021-01-06 19:26:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98584 states to 98584 states and 118639 transitions. [2021-01-06 19:26:34,608 INFO L78 Accepts]: Start accepts. Automaton has 98584 states and 118639 transitions. Word has length 120 [2021-01-06 19:26:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:34,608 INFO L481 AbstractCegarLoop]: Abstraction has 98584 states and 118639 transitions. [2021-01-06 19:26:34,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:34,608 INFO L276 IsEmpty]: Start isEmpty. Operand 98584 states and 118639 transitions. [2021-01-06 19:26:34,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:26:34,620 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:34,620 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:34,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:26:34,621 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:34,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:34,621 INFO L82 PathProgramCache]: Analyzing trace with hash -209027543, now seen corresponding path program 1 times [2021-01-06 19:26:34,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:34,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399590938] [2021-01-06 19:26:34,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:34,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:34,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399590938] [2021-01-06 19:26:34,669 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:34,669 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:26:34,670 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396689065] [2021-01-06 19:26:34,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:34,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:34,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:34,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:34,671 INFO L87 Difference]: Start difference. First operand 98584 states and 118639 transitions. Second operand 4 states. [2021-01-06 19:26:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:42,271 INFO L93 Difference]: Finished difference Result 174016 states and 209403 transitions. [2021-01-06 19:26:42,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:26:42,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:26:42,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:42,364 INFO L225 Difference]: With dead ends: 174016 [2021-01-06 19:26:42,364 INFO L226 Difference]: Without dead ends: 75492 [2021-01-06 19:26:42,424 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75492 states. [2021-01-06 19:26:48,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75492 to 75488. [2021-01-06 19:26:48,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75488 states. [2021-01-06 19:26:48,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75488 states to 75488 states and 90314 transitions. [2021-01-06 19:26:48,419 INFO L78 Accepts]: Start accepts. Automaton has 75488 states and 90314 transitions. Word has length 121 [2021-01-06 19:26:48,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:48,420 INFO L481 AbstractCegarLoop]: Abstraction has 75488 states and 90314 transitions. [2021-01-06 19:26:48,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:48,420 INFO L276 IsEmpty]: Start isEmpty. Operand 75488 states and 90314 transitions. [2021-01-06 19:26:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-01-06 19:26:48,451 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:48,452 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:48,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:26:48,452 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash 2110558493, now seen corresponding path program 1 times [2021-01-06 19:26:48,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:48,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141871921] [2021-01-06 19:26:48,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:48,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141871921] [2021-01-06 19:26:48,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:48,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:26:48,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571391485] [2021-01-06 19:26:48,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:48,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:48,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:48,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:48,552 INFO L87 Difference]: Start difference. First operand 75488 states and 90314 transitions. Second operand 4 states. [2021-01-06 19:26:54,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:54,563 INFO L93 Difference]: Finished difference Result 151216 states and 180858 transitions. [2021-01-06 19:26:54,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:26:54,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2021-01-06 19:26:54,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:54,654 INFO L225 Difference]: With dead ends: 151216 [2021-01-06 19:26:54,654 INFO L226 Difference]: Without dead ends: 64096 [2021-01-06 19:26:54,705 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:54,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64096 states. [2021-01-06 19:26:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64096 to 63548. [2021-01-06 19:26:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63548 states. [2021-01-06 19:26:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63548 states to 63548 states and 75893 transitions. [2021-01-06 19:26:59,608 INFO L78 Accepts]: Start accepts. Automaton has 63548 states and 75893 transitions. Word has length 175 [2021-01-06 19:26:59,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:59,608 INFO L481 AbstractCegarLoop]: Abstraction has 63548 states and 75893 transitions. [2021-01-06 19:26:59,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 63548 states and 75893 transitions. [2021-01-06 19:26:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-01-06 19:26:59,625 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:59,626 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:59,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:26:59,626 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:59,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash -224407011, now seen corresponding path program 1 times [2021-01-06 19:26:59,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:59,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481952444] [2021-01-06 19:26:59,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:26:59,711 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481952444] [2021-01-06 19:26:59,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:59,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:59,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528168610] [2021-01-06 19:26:59,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:59,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:59,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:59,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:59,713 INFO L87 Difference]: Start difference. First operand 63548 states and 75893 transitions. Second operand 4 states. [2021-01-06 19:27:05,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:05,509 INFO L93 Difference]: Finished difference Result 134432 states and 160018 transitions. [2021-01-06 19:27:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:05,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2021-01-06 19:27:05,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:05,597 INFO L225 Difference]: With dead ends: 134432 [2021-01-06 19:27:05,597 INFO L226 Difference]: Without dead ends: 70944 [2021-01-06 19:27:05,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70944 states.