/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/transmitter.07.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:30:18,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:30:18,950 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:30:19,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:30:19,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:30:19,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:30:19,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:30:19,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:30:19,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:30:19,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:30:19,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:30:19,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:30:19,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:30:19,039 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:30:19,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:30:19,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:30:19,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:30:19,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:30:19,054 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:30:19,060 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:30:19,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:30:19,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:30:19,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:30:19,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:30:19,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:30:19,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:30:19,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:30:19,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:30:19,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:30:19,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:30:19,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:30:19,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:30:19,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:30:19,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:30:19,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:30:19,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:30:19,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:30:19,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:30:19,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:30:19,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:30:19,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:30:19,115 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:30:19,158 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:30:19,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:30:19,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:30:19,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:30:19,162 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:30:19,163 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:30:19,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:30:19,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:30:19,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:30:19,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:30:19,164 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:30:19,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:30:19,165 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:30:19,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:30:19,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:30:19,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:30:19,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:30:19,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:30:19,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:30:19,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:30:19,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:30:19,166 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:30:19,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:30:19,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:30:19,167 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:30:19,167 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:30:19,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:30:19,624 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:30:19,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:30:19,628 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:30:19,629 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:30:19,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.07.cil.c [2021-01-06 19:30:19,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/653ab55c3/41078ae3eb5640d29cfd9a531aa4b1a7/FLAGb62348d0e [2021-01-06 19:30:20,358 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:30:20,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.07.cil.c [2021-01-06 19:30:20,372 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/653ab55c3/41078ae3eb5640d29cfd9a531aa4b1a7/FLAGb62348d0e [2021-01-06 19:30:20,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/653ab55c3/41078ae3eb5640d29cfd9a531aa4b1a7 [2021-01-06 19:30:20,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:30:20,672 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:30:20,674 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:30:20,675 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:30:20,682 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:30:20,683 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:30:20" (1/1) ... [2021-01-06 19:30:20,684 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a74417f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:20, skipping insertion in model container [2021-01-06 19:30:20,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:30:20" (1/1) ... [2021-01-06 19:30:20,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:30:20,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:30:20,900 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/transmitter.07.cil.c[401,414] 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_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~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[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] 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[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] 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[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_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[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~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[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~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[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~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[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~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[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_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[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~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[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~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[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_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~9,] [2021-01-06 19:30:21,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:30:21,085 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:30:21,099 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/transmitter.07.cil.c[401,414] 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_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~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[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] 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[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] 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[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_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[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~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[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~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[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~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[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~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[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_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[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~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[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~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[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_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~9,] [2021-01-06 19:30:21,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:30:21,207 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:30:21,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21 WrapperNode [2021-01-06 19:30:21,208 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:30:21,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:30:21,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:30:21,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:30:21,218 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:30:21" (1/1) ... [2021-01-06 19:30:21,231 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:30:21" (1/1) ... [2021-01-06 19:30:21,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:30:21,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:30:21,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:30:21,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:30:21,346 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21" (1/1) ... [2021-01-06 19:30:21,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21" (1/1) ... [2021-01-06 19:30:21,354 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21" (1/1) ... [2021-01-06 19:30:21,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21" (1/1) ... [2021-01-06 19:30:21,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21" (1/1) ... [2021-01-06 19:30:21,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21" (1/1) ... [2021-01-06 19:30:21,500 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21" (1/1) ... [2021-01-06 19:30:21,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:30:21,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:30:21,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:30:21,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:30:21,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21" (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:30:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:30:21,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:30:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:30:21,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:30:23,132 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:30:23,132 INFO L299 CfgBuilder]: Removed 259 assume(true) statements. [2021-01-06 19:30:23,135 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:30:23 BoogieIcfgContainer [2021-01-06 19:30:23,135 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:30:23,137 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:30:23,137 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:30:23,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:30:23,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:30:20" (1/3) ... [2021-01-06 19:30:23,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791c0e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:30:23, skipping insertion in model container [2021-01-06 19:30:23,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:21" (2/3) ... [2021-01-06 19:30:23,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@791c0e3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:30:23, skipping insertion in model container [2021-01-06 19:30:23,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:30:23" (3/3) ... [2021-01-06 19:30:23,143 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.07.cil.c [2021-01-06 19:30:23,150 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:30:23,155 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:30:23,174 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:30:23,212 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:30:23,212 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:30:23,212 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:30:23,212 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:30:23,212 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:30:23,212 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:30:23,213 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:30:23,213 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:30:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states. [2021-01-06 19:30:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:23,257 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:23,258 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:23,258 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:23,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash -684832828, now seen corresponding path program 1 times [2021-01-06 19:30:23,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:23,275 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411485904] [2021-01-06 19:30:23,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:23,608 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:30:23,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411485904] [2021-01-06 19:30:23,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:23,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:23,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126016736] [2021-01-06 19:30:23,616 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:23,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:23,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:23,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:23,633 INFO L87 Difference]: Start difference. First operand 752 states. Second operand 3 states. [2021-01-06 19:30:23,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:23,755 INFO L93 Difference]: Finished difference Result 1499 states and 2305 transitions. [2021-01-06 19:30:23,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:23,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2021-01-06 19:30:23,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:23,802 INFO L225 Difference]: With dead ends: 1499 [2021-01-06 19:30:23,802 INFO L226 Difference]: Without dead ends: 748 [2021-01-06 19:30:23,814 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:30:23,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2021-01-06 19:30:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2021-01-06 19:30:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2021-01-06 19:30:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1128 transitions. [2021-01-06 19:30:23,915 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1128 transitions. Word has length 109 [2021-01-06 19:30:23,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:23,915 INFO L481 AbstractCegarLoop]: Abstraction has 748 states and 1128 transitions. [2021-01-06 19:30:23,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1128 transitions. [2021-01-06 19:30:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:23,920 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:23,921 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:23,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:30:23,921 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:23,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:23,922 INFO L82 PathProgramCache]: Analyzing trace with hash -803274302, now seen corresponding path program 1 times [2021-01-06 19:30:23,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:23,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029434589] [2021-01-06 19:30:23,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:24,050 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:30:24,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029434589] [2021-01-06 19:30:24,051 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:24,051 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:24,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513346102] [2021-01-06 19:30:24,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:24,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:24,055 INFO L87 Difference]: Start difference. First operand 748 states and 1128 transitions. Second operand 3 states. [2021-01-06 19:30:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:24,163 INFO L93 Difference]: Finished difference Result 2078 states and 3124 transitions. [2021-01-06 19:30:24,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:24,163 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2021-01-06 19:30:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:24,170 INFO L225 Difference]: With dead ends: 2078 [2021-01-06 19:30:24,170 INFO L226 Difference]: Without dead ends: 1342 [2021-01-06 19:30:24,173 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:30:24,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2021-01-06 19:30:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1340. [2021-01-06 19:30:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:24,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 2002 transitions. [2021-01-06 19:30:24,230 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 2002 transitions. Word has length 109 [2021-01-06 19:30:24,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:24,230 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 2002 transitions. [2021-01-06 19:30:24,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 2002 transitions. [2021-01-06 19:30:24,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:24,243 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:24,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:24,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:30:24,244 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1243544479, now seen corresponding path program 1 times [2021-01-06 19:30:24,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:24,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338639092] [2021-01-06 19:30:24,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:24,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:24,405 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:30:24,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338639092] [2021-01-06 19:30:24,407 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:24,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:24,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775425469] [2021-01-06 19:30:24,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:24,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:24,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:24,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:24,414 INFO L87 Difference]: Start difference. First operand 1340 states and 2002 transitions. Second operand 4 states. [2021-01-06 19:30:24,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:24,651 INFO L93 Difference]: Finished difference Result 3258 states and 4855 transitions. [2021-01-06 19:30:24,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:24,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:24,662 INFO L225 Difference]: With dead ends: 3258 [2021-01-06 19:30:24,663 INFO L226 Difference]: Without dead ends: 1932 [2021-01-06 19:30:24,665 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:30:24,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2021-01-06 19:30:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1340. [2021-01-06 19:30:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:24,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1999 transitions. [2021-01-06 19:30:24,743 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1999 transitions. Word has length 109 [2021-01-06 19:30:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:24,751 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1999 transitions. [2021-01-06 19:30:24,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1999 transitions. [2021-01-06 19:30:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:24,754 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:24,755 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:24,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:30:24,755 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:24,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:24,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1994691615, now seen corresponding path program 1 times [2021-01-06 19:30:24,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:24,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262687983] [2021-01-06 19:30:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:24,877 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:30:24,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262687983] [2021-01-06 19:30:24,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:24,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:24,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289286889] [2021-01-06 19:30:24,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:24,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:24,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:24,880 INFO L87 Difference]: Start difference. First operand 1340 states and 1999 transitions. Second operand 4 states. [2021-01-06 19:30:25,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:25,059 INFO L93 Difference]: Finished difference Result 3256 states and 4845 transitions. [2021-01-06 19:30:25,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:25,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:25,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:25,070 INFO L225 Difference]: With dead ends: 3256 [2021-01-06 19:30:25,070 INFO L226 Difference]: Without dead ends: 1931 [2021-01-06 19:30:25,073 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:30:25,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2021-01-06 19:30:25,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1340. [2021-01-06 19:30:25,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1996 transitions. [2021-01-06 19:30:25,168 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1996 transitions. Word has length 109 [2021-01-06 19:30:25,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:25,168 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1996 transitions. [2021-01-06 19:30:25,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:25,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1996 transitions. [2021-01-06 19:30:25,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:25,169 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:25,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:25,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:30:25,170 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:25,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash -948890463, now seen corresponding path program 1 times [2021-01-06 19:30:25,171 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:25,171 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256677955] [2021-01-06 19:30:25,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:25,226 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:30:25,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256677955] [2021-01-06 19:30:25,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:25,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:25,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201338291] [2021-01-06 19:30:25,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:25,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:25,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:25,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:25,228 INFO L87 Difference]: Start difference. First operand 1340 states and 1996 transitions. Second operand 3 states. [2021-01-06 19:30:25,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:25,307 INFO L93 Difference]: Finished difference Result 2664 states and 3967 transitions. [2021-01-06 19:30:25,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:25,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2021-01-06 19:30:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:25,315 INFO L225 Difference]: With dead ends: 2664 [2021-01-06 19:30:25,315 INFO L226 Difference]: Without dead ends: 1340 [2021-01-06 19:30:25,318 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:30:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2021-01-06 19:30:25,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2021-01-06 19:30:25,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:25,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1988 transitions. [2021-01-06 19:30:25,379 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1988 transitions. Word has length 109 [2021-01-06 19:30:25,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:25,379 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1988 transitions. [2021-01-06 19:30:25,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:25,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1988 transitions. [2021-01-06 19:30:25,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:25,381 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:25,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:25,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:30:25,381 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:25,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:25,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1866265503, now seen corresponding path program 1 times [2021-01-06 19:30:25,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:25,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973409084] [2021-01-06 19:30:25,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:25,435 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:30:25,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973409084] [2021-01-06 19:30:25,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:25,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:25,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515568666] [2021-01-06 19:30:25,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:25,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:25,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:25,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:25,439 INFO L87 Difference]: Start difference. First operand 1340 states and 1988 transitions. Second operand 3 states. [2021-01-06 19:30:25,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:25,550 INFO L93 Difference]: Finished difference Result 2663 states and 3950 transitions. [2021-01-06 19:30:25,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:25,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2021-01-06 19:30:25,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:25,557 INFO L225 Difference]: With dead ends: 2663 [2021-01-06 19:30:25,557 INFO L226 Difference]: Without dead ends: 1340 [2021-01-06 19:30:25,560 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:30:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2021-01-06 19:30:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2021-01-06 19:30:25,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:25,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1980 transitions. [2021-01-06 19:30:25,638 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1980 transitions. Word has length 109 [2021-01-06 19:30:25,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:25,639 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1980 transitions. [2021-01-06 19:30:25,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1980 transitions. [2021-01-06 19:30:25,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:25,640 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:25,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:25,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:30:25,641 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:25,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1567825057, now seen corresponding path program 1 times [2021-01-06 19:30:25,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:25,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570676703] [2021-01-06 19:30:25,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:25,698 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:30:25,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570676703] [2021-01-06 19:30:25,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:25,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:25,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348596287] [2021-01-06 19:30:25,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:25,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:25,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:25,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:25,701 INFO L87 Difference]: Start difference. First operand 1340 states and 1980 transitions. Second operand 4 states. [2021-01-06 19:30:25,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:25,904 INFO L93 Difference]: Finished difference Result 3250 states and 4793 transitions. [2021-01-06 19:30:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:25,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:25,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:25,914 INFO L225 Difference]: With dead ends: 3250 [2021-01-06 19:30:25,914 INFO L226 Difference]: Without dead ends: 1928 [2021-01-06 19:30:25,918 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:30:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2021-01-06 19:30:25,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1340. [2021-01-06 19:30:25,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1977 transitions. [2021-01-06 19:30:26,003 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1977 transitions. Word has length 109 [2021-01-06 19:30:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:26,003 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1977 transitions. [2021-01-06 19:30:26,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:26,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1977 transitions. [2021-01-06 19:30:26,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:26,005 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:26,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,005 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:30:26,005 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:26,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:26,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1539324767, now seen corresponding path program 1 times [2021-01-06 19:30:26,006 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:26,006 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283908951] [2021-01-06 19:30:26,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:26,071 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:30:26,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283908951] [2021-01-06 19:30:26,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:26,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:26,072 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474569220] [2021-01-06 19:30:26,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:26,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:26,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:26,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:26,076 INFO L87 Difference]: Start difference. First operand 1340 states and 1977 transitions. Second operand 3 states. [2021-01-06 19:30:26,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:26,168 INFO L93 Difference]: Finished difference Result 2661 states and 3926 transitions. [2021-01-06 19:30:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:26,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2021-01-06 19:30:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:26,176 INFO L225 Difference]: With dead ends: 2661 [2021-01-06 19:30:26,176 INFO L226 Difference]: Without dead ends: 1340 [2021-01-06 19:30:26,179 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:30:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2021-01-06 19:30:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2021-01-06 19:30:26,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:26,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1969 transitions. [2021-01-06 19:30:26,280 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1969 transitions. Word has length 109 [2021-01-06 19:30:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:26,281 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1969 transitions. [2021-01-06 19:30:26,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1969 transitions. [2021-01-06 19:30:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:26,282 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:26,282 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:30:26,283 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:26,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:26,283 INFO L82 PathProgramCache]: Analyzing trace with hash -910730337, now seen corresponding path program 1 times [2021-01-06 19:30:26,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:26,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826818386] [2021-01-06 19:30:26,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:26,343 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:30:26,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826818386] [2021-01-06 19:30:26,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:26,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:26,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809117640] [2021-01-06 19:30:26,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:26,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:26,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:26,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:26,352 INFO L87 Difference]: Start difference. First operand 1340 states and 1969 transitions. Second operand 4 states. [2021-01-06 19:30:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:26,645 INFO L93 Difference]: Finished difference Result 3190 states and 4683 transitions. [2021-01-06 19:30:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:26,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:26,659 INFO L225 Difference]: With dead ends: 3190 [2021-01-06 19:30:26,659 INFO L226 Difference]: Without dead ends: 1870 [2021-01-06 19:30:26,663 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:30:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2021-01-06 19:30:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1340. [2021-01-06 19:30:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1966 transitions. [2021-01-06 19:30:26,794 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1966 transitions. Word has length 109 [2021-01-06 19:30:26,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:26,795 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1966 transitions. [2021-01-06 19:30:26,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:26,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1966 transitions. [2021-01-06 19:30:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:26,798 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:26,798 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:26,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:30:26,799 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:26,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:26,800 INFO L82 PathProgramCache]: Analyzing trace with hash 966332893, now seen corresponding path program 1 times [2021-01-06 19:30:26,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:26,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227441074] [2021-01-06 19:30:26,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:26,874 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:30:26,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227441074] [2021-01-06 19:30:26,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:26,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:26,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393465809] [2021-01-06 19:30:26,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:26,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:26,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:26,876 INFO L87 Difference]: Start difference. First operand 1340 states and 1966 transitions. Second operand 4 states. [2021-01-06 19:30:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:27,248 INFO L93 Difference]: Finished difference Result 3186 states and 4669 transitions. [2021-01-06 19:30:27,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:27,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:27,260 INFO L225 Difference]: With dead ends: 3186 [2021-01-06 19:30:27,261 INFO L226 Difference]: Without dead ends: 1868 [2021-01-06 19:30:27,264 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:30:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2021-01-06 19:30:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1340. [2021-01-06 19:30:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1963 transitions. [2021-01-06 19:30:27,358 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1963 transitions. Word has length 109 [2021-01-06 19:30:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:27,360 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1963 transitions. [2021-01-06 19:30:27,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:27,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1963 transitions. [2021-01-06 19:30:27,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:27,361 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:27,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:27,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:30:27,362 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:27,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:27,363 INFO L82 PathProgramCache]: Analyzing trace with hash -28360805, now seen corresponding path program 1 times [2021-01-06 19:30:27,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:27,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194797654] [2021-01-06 19:30:27,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:27,416 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:30:27,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194797654] [2021-01-06 19:30:27,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:27,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:27,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037250457] [2021-01-06 19:30:27,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:27,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:27,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:27,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:27,420 INFO L87 Difference]: Start difference. First operand 1340 states and 1963 transitions. Second operand 3 states. [2021-01-06 19:30:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:27,549 INFO L93 Difference]: Finished difference Result 2657 states and 3893 transitions. [2021-01-06 19:30:27,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:27,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2021-01-06 19:30:27,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:27,557 INFO L225 Difference]: With dead ends: 2657 [2021-01-06 19:30:27,557 INFO L226 Difference]: Without dead ends: 1340 [2021-01-06 19:30:27,559 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:30:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2021-01-06 19:30:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2021-01-06 19:30:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1939 transitions. [2021-01-06 19:30:27,662 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1939 transitions. Word has length 109 [2021-01-06 19:30:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:27,662 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1939 transitions. [2021-01-06 19:30:27,662 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:27,662 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1939 transitions. [2021-01-06 19:30:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:27,664 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:27,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:27,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:30:27,665 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:27,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:27,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1756284420, now seen corresponding path program 1 times [2021-01-06 19:30:27,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:27,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162574084] [2021-01-06 19:30:27,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:27,727 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:30:27,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162574084] [2021-01-06 19:30:27,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:27,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:27,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606921187] [2021-01-06 19:30:27,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:27,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:27,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:27,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:27,730 INFO L87 Difference]: Start difference. First operand 1340 states and 1939 transitions. Second operand 4 states. [2021-01-06 19:30:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:28,021 INFO L93 Difference]: Finished difference Result 3182 states and 4600 transitions. [2021-01-06 19:30:28,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:28,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:28,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:28,031 INFO L225 Difference]: With dead ends: 3182 [2021-01-06 19:30:28,031 INFO L226 Difference]: Without dead ends: 1866 [2021-01-06 19:30:28,035 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:30:28,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2021-01-06 19:30:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1340. [2021-01-06 19:30:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1936 transitions. [2021-01-06 19:30:28,135 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1936 transitions. Word has length 109 [2021-01-06 19:30:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:28,136 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1936 transitions. [2021-01-06 19:30:28,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1936 transitions. [2021-01-06 19:30:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:28,137 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:28,137 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:28,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:30:28,138 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:28,138 INFO L82 PathProgramCache]: Analyzing trace with hash 580108090, now seen corresponding path program 1 times [2021-01-06 19:30:28,139 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:28,139 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802332034] [2021-01-06 19:30:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:28,186 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:30:28,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802332034] [2021-01-06 19:30:28,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:28,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:28,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661325451] [2021-01-06 19:30:28,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:28,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:28,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:28,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:28,189 INFO L87 Difference]: Start difference. First operand 1340 states and 1936 transitions. Second operand 4 states. [2021-01-06 19:30:28,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:28,475 INFO L93 Difference]: Finished difference Result 3180 states and 4590 transitions. [2021-01-06 19:30:28,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:28,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:28,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:28,485 INFO L225 Difference]: With dead ends: 3180 [2021-01-06 19:30:28,485 INFO L226 Difference]: Without dead ends: 1865 [2021-01-06 19:30:28,492 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:30:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2021-01-06 19:30:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1340. [2021-01-06 19:30:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1933 transitions. [2021-01-06 19:30:28,618 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1933 transitions. Word has length 109 [2021-01-06 19:30:28,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:28,619 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1933 transitions. [2021-01-06 19:30:28,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1933 transitions. [2021-01-06 19:30:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:28,621 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:28,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:28,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:30:28,621 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:28,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:28,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1838376388, now seen corresponding path program 1 times [2021-01-06 19:30:28,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:28,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098843293] [2021-01-06 19:30:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:28,689 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:30:28,689 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098843293] [2021-01-06 19:30:28,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:28,690 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:28,690 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731959410] [2021-01-06 19:30:28,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:28,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:28,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:28,692 INFO L87 Difference]: Start difference. First operand 1340 states and 1933 transitions. Second operand 4 states. [2021-01-06 19:30:28,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:28,948 INFO L93 Difference]: Finished difference Result 3178 states and 4580 transitions. [2021-01-06 19:30:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:28,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:28,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:28,960 INFO L225 Difference]: With dead ends: 3178 [2021-01-06 19:30:28,960 INFO L226 Difference]: Without dead ends: 1864 [2021-01-06 19:30:28,964 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:30:28,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1864 states. [2021-01-06 19:30:29,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1864 to 1340. [2021-01-06 19:30:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2021-01-06 19:30:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1930 transitions. [2021-01-06 19:30:29,060 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1930 transitions. Word has length 109 [2021-01-06 19:30:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:29,061 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 1930 transitions. [2021-01-06 19:30:29,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1930 transitions. [2021-01-06 19:30:29,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:29,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:29,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:29,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:30:29,064 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:29,064 INFO L82 PathProgramCache]: Analyzing trace with hash 577459962, now seen corresponding path program 1 times [2021-01-06 19:30:29,064 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:29,064 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124210099] [2021-01-06 19:30:29,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:29,131 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:30:29,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124210099] [2021-01-06 19:30:29,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:29,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:29,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895810260] [2021-01-06 19:30:29,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:29,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:29,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:29,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:29,133 INFO L87 Difference]: Start difference. First operand 1340 states and 1930 transitions. Second operand 5 states. [2021-01-06 19:30:29,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:29,502 INFO L93 Difference]: Finished difference Result 4156 states and 6024 transitions. [2021-01-06 19:30:29,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:29,502 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 19:30:29,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:29,543 INFO L225 Difference]: With dead ends: 4156 [2021-01-06 19:30:29,543 INFO L226 Difference]: Without dead ends: 2849 [2021-01-06 19:30:29,548 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:30:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2849 states. [2021-01-06 19:30:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2849 to 1367. [2021-01-06 19:30:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2021-01-06 19:30:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1948 transitions. [2021-01-06 19:30:29,680 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1948 transitions. Word has length 109 [2021-01-06 19:30:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:29,680 INFO L481 AbstractCegarLoop]: Abstraction has 1367 states and 1948 transitions. [2021-01-06 19:30:29,681 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1948 transitions. [2021-01-06 19:30:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:29,682 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:29,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:29,682 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:30:29,683 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:29,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1416493624, now seen corresponding path program 1 times [2021-01-06 19:30:29,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:29,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221658514] [2021-01-06 19:30:29,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:29,738 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:30:29,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221658514] [2021-01-06 19:30:29,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:29,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:29,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411052463] [2021-01-06 19:30:29,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:29,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:29,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:29,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:29,743 INFO L87 Difference]: Start difference. First operand 1367 states and 1948 transitions. Second operand 5 states. [2021-01-06 19:30:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:30,221 INFO L93 Difference]: Finished difference Result 5052 states and 7218 transitions. [2021-01-06 19:30:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:30,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 19:30:30,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:30,238 INFO L225 Difference]: With dead ends: 5052 [2021-01-06 19:30:30,238 INFO L226 Difference]: Without dead ends: 3725 [2021-01-06 19:30:30,242 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:30:30,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2021-01-06 19:30:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 1421. [2021-01-06 19:30:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1421 states. [2021-01-06 19:30:30,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 2002 transitions. [2021-01-06 19:30:30,386 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 2002 transitions. Word has length 109 [2021-01-06 19:30:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:30,386 INFO L481 AbstractCegarLoop]: Abstraction has 1421 states and 2002 transitions. [2021-01-06 19:30:30,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 2002 transitions. [2021-01-06 19:30:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:30,388 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:30,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:30,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:30:30,390 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:30,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:30,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1493394422, now seen corresponding path program 1 times [2021-01-06 19:30:30,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:30,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689329564] [2021-01-06 19:30:30,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:30,443 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:30:30,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689329564] [2021-01-06 19:30:30,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:30,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:30,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031860898] [2021-01-06 19:30:30,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:30,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:30,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:30,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:30,446 INFO L87 Difference]: Start difference. First operand 1421 states and 2002 transitions. Second operand 4 states. [2021-01-06 19:30:30,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:30,931 INFO L93 Difference]: Finished difference Result 5219 states and 7348 transitions. [2021-01-06 19:30:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:30,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:30,941 INFO L225 Difference]: With dead ends: 5219 [2021-01-06 19:30:30,941 INFO L226 Difference]: Without dead ends: 3826 [2021-01-06 19:30:30,945 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:30:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3826 states. [2021-01-06 19:30:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3826 to 3614. [2021-01-06 19:30:31,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2021-01-06 19:30:31,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 5053 transitions. [2021-01-06 19:30:31,334 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 5053 transitions. Word has length 109 [2021-01-06 19:30:31,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:31,334 INFO L481 AbstractCegarLoop]: Abstraction has 3614 states and 5053 transitions. [2021-01-06 19:30:31,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 5053 transitions. [2021-01-06 19:30:31,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:31,336 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:31,336 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:31,337 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:30:31,337 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:31,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1894816427, now seen corresponding path program 1 times [2021-01-06 19:30:31,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:31,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350675387] [2021-01-06 19:30:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:31,397 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:30:31,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350675387] [2021-01-06 19:30:31,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:31,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:31,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551246219] [2021-01-06 19:30:31,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:31,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:31,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:31,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:31,401 INFO L87 Difference]: Start difference. First operand 3614 states and 5053 transitions. Second operand 5 states. [2021-01-06 19:30:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:32,074 INFO L93 Difference]: Finished difference Result 9353 states and 13129 transitions. [2021-01-06 19:30:32,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:32,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 19:30:32,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:32,087 INFO L225 Difference]: With dead ends: 9353 [2021-01-06 19:30:32,087 INFO L226 Difference]: Without dead ends: 5787 [2021-01-06 19:30:32,094 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:30:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2021-01-06 19:30:32,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 3665. [2021-01-06 19:30:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3665 states. [2021-01-06 19:30:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 5075 transitions. [2021-01-06 19:30:32,418 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 5075 transitions. Word has length 109 [2021-01-06 19:30:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:32,418 INFO L481 AbstractCegarLoop]: Abstraction has 3665 states and 5075 transitions. [2021-01-06 19:30:32,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 5075 transitions. [2021-01-06 19:30:32,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:32,420 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:32,420 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:32,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:30:32,420 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:32,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:32,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1668183443, now seen corresponding path program 1 times [2021-01-06 19:30:32,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:32,421 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832676722] [2021-01-06 19:30:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:32,472 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:30:32,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832676722] [2021-01-06 19:30:32,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:32,472 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:32,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035265470] [2021-01-06 19:30:32,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:32,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:32,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:32,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:32,475 INFO L87 Difference]: Start difference. First operand 3665 states and 5075 transitions. Second operand 5 states. [2021-01-06 19:30:33,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:33,443 INFO L93 Difference]: Finished difference Result 12950 states and 18069 transitions. [2021-01-06 19:30:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:33,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 19:30:33,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:33,463 INFO L225 Difference]: With dead ends: 12950 [2021-01-06 19:30:33,463 INFO L226 Difference]: Without dead ends: 9340 [2021-01-06 19:30:33,470 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:30:33,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2021-01-06 19:30:33,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 3803. [2021-01-06 19:30:33,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3803 states. [2021-01-06 19:30:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3803 states to 3803 states and 5213 transitions. [2021-01-06 19:30:33,925 INFO L78 Accepts]: Start accepts. Automaton has 3803 states and 5213 transitions. Word has length 109 [2021-01-06 19:30:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:33,926 INFO L481 AbstractCegarLoop]: Abstraction has 3803 states and 5213 transitions. [2021-01-06 19:30:33,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 3803 states and 5213 transitions. [2021-01-06 19:30:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:33,928 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:33,928 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:33,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:30:33,928 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:33,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1870007377, now seen corresponding path program 1 times [2021-01-06 19:30:33,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:33,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414324726] [2021-01-06 19:30:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:33,982 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:30:33,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414324726] [2021-01-06 19:30:33,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:33,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:33,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100291386] [2021-01-06 19:30:33,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:33,983 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:33,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:33,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:33,984 INFO L87 Difference]: Start difference. First operand 3803 states and 5213 transitions. Second operand 5 states. [2021-01-06 19:30:35,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:35,008 INFO L93 Difference]: Finished difference Result 10316 states and 14097 transitions. [2021-01-06 19:30:35,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:35,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 19:30:35,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:35,020 INFO L225 Difference]: With dead ends: 10316 [2021-01-06 19:30:35,020 INFO L226 Difference]: Without dead ends: 6578 [2021-01-06 19:30:35,025 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:30:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6578 states. [2021-01-06 19:30:35,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6578 to 3821. [2021-01-06 19:30:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3821 states. [2021-01-06 19:30:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3821 states to 3821 states and 5191 transitions. [2021-01-06 19:30:35,392 INFO L78 Accepts]: Start accepts. Automaton has 3821 states and 5191 transitions. Word has length 109 [2021-01-06 19:30:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:35,392 INFO L481 AbstractCegarLoop]: Abstraction has 3821 states and 5191 transitions. [2021-01-06 19:30:35,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3821 states and 5191 transitions. [2021-01-06 19:30:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:35,393 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:35,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:35,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:30:35,394 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:35,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1548940913, now seen corresponding path program 1 times [2021-01-06 19:30:35,394 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:35,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424247027] [2021-01-06 19:30:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:35,442 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:30:35,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424247027] [2021-01-06 19:30:35,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:35,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:35,443 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432183203] [2021-01-06 19:30:35,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:35,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:35,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:35,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:35,444 INFO L87 Difference]: Start difference. First operand 3821 states and 5191 transitions. Second operand 4 states. [2021-01-06 19:30:36,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:36,789 INFO L93 Difference]: Finished difference Result 14209 states and 19315 transitions. [2021-01-06 19:30:36,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:36,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:36,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:36,815 INFO L225 Difference]: With dead ends: 14209 [2021-01-06 19:30:36,815 INFO L226 Difference]: Without dead ends: 10455 [2021-01-06 19:30:36,821 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:30:36,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10455 states. [2021-01-06 19:30:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10455 to 10033. [2021-01-06 19:30:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10033 states. [2021-01-06 19:30:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10033 states to 10033 states and 13551 transitions. [2021-01-06 19:30:37,742 INFO L78 Accepts]: Start accepts. Automaton has 10033 states and 13551 transitions. Word has length 109 [2021-01-06 19:30:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:37,743 INFO L481 AbstractCegarLoop]: Abstraction has 10033 states and 13551 transitions. [2021-01-06 19:30:37,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10033 states and 13551 transitions. [2021-01-06 19:30:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:37,744 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:37,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:37,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:30:37,745 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:37,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:37,745 INFO L82 PathProgramCache]: Analyzing trace with hash 2044458158, now seen corresponding path program 1 times [2021-01-06 19:30:37,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:37,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652394139] [2021-01-06 19:30:37,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:37,800 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:30:37,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652394139] [2021-01-06 19:30:37,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:37,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:37,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123910698] [2021-01-06 19:30:37,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:37,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:37,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:37,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:37,805 INFO L87 Difference]: Start difference. First operand 10033 states and 13551 transitions. Second operand 5 states. [2021-01-06 19:30:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:39,431 INFO L93 Difference]: Finished difference Result 25104 states and 34124 transitions. [2021-01-06 19:30:39,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:39,432 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2021-01-06 19:30:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:39,461 INFO L225 Difference]: With dead ends: 25104 [2021-01-06 19:30:39,462 INFO L226 Difference]: Without dead ends: 15142 [2021-01-06 19:30:39,473 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:30:39,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15142 states. [2021-01-06 19:30:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15142 to 10168. [2021-01-06 19:30:40,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10168 states. [2021-01-06 19:30:40,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10168 states to 10168 states and 13611 transitions. [2021-01-06 19:30:40,378 INFO L78 Accepts]: Start accepts. Automaton has 10168 states and 13611 transitions. Word has length 109 [2021-01-06 19:30:40,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:40,379 INFO L481 AbstractCegarLoop]: Abstraction has 10168 states and 13611 transitions. [2021-01-06 19:30:40,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:40,379 INFO L276 IsEmpty]: Start isEmpty. Operand 10168 states and 13611 transitions. [2021-01-06 19:30:40,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-01-06 19:30:40,380 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:40,380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:40,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:30:40,380 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:40,381 INFO L82 PathProgramCache]: Analyzing trace with hash -311347092, now seen corresponding path program 1 times [2021-01-06 19:30:40,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:40,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941483319] [2021-01-06 19:30:40,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:40,430 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:30:40,430 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941483319] [2021-01-06 19:30:40,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:40,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:40,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462364964] [2021-01-06 19:30:40,431 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:40,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:40,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:40,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:40,432 INFO L87 Difference]: Start difference. First operand 10168 states and 13611 transitions. Second operand 4 states. [2021-01-06 19:30:43,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:43,164 INFO L93 Difference]: Finished difference Result 39957 states and 53344 transitions. [2021-01-06 19:30:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:43,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2021-01-06 19:30:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:43,210 INFO L225 Difference]: With dead ends: 39957 [2021-01-06 19:30:43,210 INFO L226 Difference]: Without dead ends: 29869 [2021-01-06 19:30:43,226 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:30:43,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29869 states. [2021-01-06 19:30:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29869 to 29233. [2021-01-06 19:30:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29233 states. [2021-01-06 19:30:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29233 states to 29233 states and 38712 transitions. [2021-01-06 19:30:45,748 INFO L78 Accepts]: Start accepts. Automaton has 29233 states and 38712 transitions. Word has length 109 [2021-01-06 19:30:45,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:45,748 INFO L481 AbstractCegarLoop]: Abstraction has 29233 states and 38712 transitions. [2021-01-06 19:30:45,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:45,749 INFO L276 IsEmpty]: Start isEmpty. Operand 29233 states and 38712 transitions. [2021-01-06 19:30:45,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:30:45,751 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:45,752 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:30:45,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:30:45,752 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:45,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:45,752 INFO L82 PathProgramCache]: Analyzing trace with hash -608903165, now seen corresponding path program 1 times [2021-01-06 19:30:45,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:45,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475925483] [2021-01-06 19:30:45,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:45,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:30:45,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475925483] [2021-01-06 19:30:45,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:45,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:45,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909350612] [2021-01-06 19:30:45,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:45,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:45,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:45,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:45,806 INFO L87 Difference]: Start difference. First operand 29233 states and 38712 transitions. Second operand 5 states. [2021-01-06 19:30:49,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:49,526 INFO L93 Difference]: Finished difference Result 70683 states and 94228 transitions. [2021-01-06 19:30:49,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:49,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2021-01-06 19:30:49,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:49,579 INFO L225 Difference]: With dead ends: 70683 [2021-01-06 19:30:49,580 INFO L226 Difference]: Without dead ends: 41534 [2021-01-06 19:30:49,604 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:30:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41534 states. [2021-01-06 19:30:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41534 to 29590. [2021-01-06 19:30:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29590 states. [2021-01-06 19:30:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29590 states to 29590 states and 38838 transitions. [2021-01-06 19:30:52,740 INFO L78 Accepts]: Start accepts. Automaton has 29590 states and 38838 transitions. Word has length 127 [2021-01-06 19:30:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:52,741 INFO L481 AbstractCegarLoop]: Abstraction has 29590 states and 38838 transitions. [2021-01-06 19:30:52,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 29590 states and 38838 transitions. [2021-01-06 19:30:52,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:30:52,744 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:52,744 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:30:52,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:30:52,744 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:52,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:52,745 INFO L82 PathProgramCache]: Analyzing trace with hash 267115841, now seen corresponding path program 1 times [2021-01-06 19:30:52,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:52,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362291294] [2021-01-06 19:30:52,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:30:52,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362291294] [2021-01-06 19:30:52,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:52,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:52,871 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128555504] [2021-01-06 19:30:52,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:52,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:52,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:52,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:52,872 INFO L87 Difference]: Start difference. First operand 29590 states and 38838 transitions. Second operand 4 states. [2021-01-06 19:30:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:56,951 INFO L93 Difference]: Finished difference Result 76796 states and 100217 transitions. [2021-01-06 19:30:56,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:56,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:30:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:57,002 INFO L225 Difference]: With dead ends: 76796 [2021-01-06 19:30:57,002 INFO L226 Difference]: Without dead ends: 47292 [2021-01-06 19:30:57,028 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:30:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47292 states. [2021-01-06 19:31:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47292 to 33861. [2021-01-06 19:31:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33861 states. [2021-01-06 19:31:00,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33861 states to 33861 states and 43881 transitions. [2021-01-06 19:31:00,157 INFO L78 Accepts]: Start accepts. Automaton has 33861 states and 43881 transitions. Word has length 127 [2021-01-06 19:31:00,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:00,158 INFO L481 AbstractCegarLoop]: Abstraction has 33861 states and 43881 transitions. [2021-01-06 19:31:00,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 33861 states and 43881 transitions. [2021-01-06 19:31:00,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:31:00,160 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:00,160 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:31:00,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:31:00,161 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:00,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1805455871, now seen corresponding path program 1 times [2021-01-06 19:31:00,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:00,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386319430] [2021-01-06 19:31:00,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:31:00,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386319430] [2021-01-06 19:31:00,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:00,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:00,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43469460] [2021-01-06 19:31:00,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:00,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:00,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:00,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:00,245 INFO L87 Difference]: Start difference. First operand 33861 states and 43881 transitions. Second operand 4 states. [2021-01-06 19:31:04,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:04,991 INFO L93 Difference]: Finished difference Result 83067 states and 107516 transitions. [2021-01-06 19:31:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:04,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:31:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:05,046 INFO L225 Difference]: With dead ends: 83067 [2021-01-06 19:31:05,047 INFO L226 Difference]: Without dead ends: 49366 [2021-01-06 19:31:05,071 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:31:05,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49366 states. [2021-01-06 19:31:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49366 to 33861. [2021-01-06 19:31:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33861 states. [2021-01-06 19:31:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33861 states to 33861 states and 43772 transitions. [2021-01-06 19:31:08,407 INFO L78 Accepts]: Start accepts. Automaton has 33861 states and 43772 transitions. Word has length 127 [2021-01-06 19:31:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:08,407 INFO L481 AbstractCegarLoop]: Abstraction has 33861 states and 43772 transitions. [2021-01-06 19:31:08,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 33861 states and 43772 transitions. [2021-01-06 19:31:08,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:31:08,411 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:08,411 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:31:08,411 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:31:08,411 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:08,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:08,412 INFO L82 PathProgramCache]: Analyzing trace with hash -223130239, now seen corresponding path program 1 times [2021-01-06 19:31:08,412 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:08,412 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456036757] [2021-01-06 19:31:08,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:08,465 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:31:08,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456036757] [2021-01-06 19:31:08,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:08,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:08,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584590682] [2021-01-06 19:31:08,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:08,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:08,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:08,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:08,467 INFO L87 Difference]: Start difference. First operand 33861 states and 43772 transitions. Second operand 4 states. [2021-01-06 19:31:13,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:13,307 INFO L93 Difference]: Finished difference Result 83063 states and 107266 transitions. [2021-01-06 19:31:13,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:13,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:31:13,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:13,352 INFO L225 Difference]: With dead ends: 83063 [2021-01-06 19:31:13,353 INFO L226 Difference]: Without dead ends: 49366 [2021-01-06 19:31:13,378 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:31:13,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49366 states. [2021-01-06 19:31:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49366 to 33861. [2021-01-06 19:31:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33861 states. [2021-01-06 19:31:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33861 states to 33861 states and 43663 transitions. [2021-01-06 19:31:16,681 INFO L78 Accepts]: Start accepts. Automaton has 33861 states and 43663 transitions. Word has length 127 [2021-01-06 19:31:16,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:16,682 INFO L481 AbstractCegarLoop]: Abstraction has 33861 states and 43663 transitions. [2021-01-06 19:31:16,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:16,682 INFO L276 IsEmpty]: Start isEmpty. Operand 33861 states and 43663 transitions. [2021-01-06 19:31:16,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:31:16,685 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:16,685 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:31:16,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:31:16,685 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:16,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:16,686 INFO L82 PathProgramCache]: Analyzing trace with hash -576218621, now seen corresponding path program 1 times [2021-01-06 19:31:16,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:16,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406838821] [2021-01-06 19:31:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:16,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:31:16,738 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406838821] [2021-01-06 19:31:16,738 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:16,738 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:16,739 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509241105] [2021-01-06 19:31:16,739 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:16,739 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:16,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:16,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:16,740 INFO L87 Difference]: Start difference. First operand 33861 states and 43663 transitions. Second operand 4 states. [2021-01-06 19:31:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:21,557 INFO L93 Difference]: Finished difference Result 81776 states and 105244 transitions. [2021-01-06 19:31:21,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:21,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:31:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:21,602 INFO L225 Difference]: With dead ends: 81776 [2021-01-06 19:31:21,602 INFO L226 Difference]: Without dead ends: 47980 [2021-01-06 19:31:21,619 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:31:21,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47980 states. [2021-01-06 19:31:24,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47980 to 32694. [2021-01-06 19:31:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32694 states. [2021-01-06 19:31:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32694 states to 32694 states and 41609 transitions. [2021-01-06 19:31:24,796 INFO L78 Accepts]: Start accepts. Automaton has 32694 states and 41609 transitions. Word has length 127 [2021-01-06 19:31:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:24,797 INFO L481 AbstractCegarLoop]: Abstraction has 32694 states and 41609 transitions. [2021-01-06 19:31:24,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 32694 states and 41609 transitions. [2021-01-06 19:31:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:31:24,799 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:24,799 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:31:24,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:31:24,800 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:24,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:24,800 INFO L82 PathProgramCache]: Analyzing trace with hash 317267717, now seen corresponding path program 1 times [2021-01-06 19:31:24,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:24,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80951462] [2021-01-06 19:31:24,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:24,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:24,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:31:24,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80951462] [2021-01-06 19:31:24,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:24,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:24,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572343884] [2021-01-06 19:31:24,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:24,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:24,854 INFO L87 Difference]: Start difference. First operand 32694 states and 41609 transitions. Second operand 3 states. [2021-01-06 19:31:27,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:27,948 INFO L93 Difference]: Finished difference Result 64966 states and 82655 transitions. [2021-01-06 19:31:27,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:27,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 19:31:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:27,978 INFO L225 Difference]: With dead ends: 64966 [2021-01-06 19:31:27,978 INFO L226 Difference]: Without dead ends: 32301 [2021-01-06 19:31:27,998 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:31:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32301 states. [2021-01-06 19:31:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32301 to 32301. [2021-01-06 19:31:31,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32301 states. [2021-01-06 19:31:31,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32301 states to 32301 states and 40735 transitions. [2021-01-06 19:31:31,210 INFO L78 Accepts]: Start accepts. Automaton has 32301 states and 40735 transitions. Word has length 127 [2021-01-06 19:31:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:31,210 INFO L481 AbstractCegarLoop]: Abstraction has 32301 states and 40735 transitions. [2021-01-06 19:31:31,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:31,210 INFO L276 IsEmpty]: Start isEmpty. Operand 32301 states and 40735 transitions. [2021-01-06 19:31:31,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:31:31,213 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:31,213 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:31:31,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:31:31,213 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:31,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:31,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1732120125, now seen corresponding path program 1 times [2021-01-06 19:31:31,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:31,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706696164] [2021-01-06 19:31:31,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:31:31,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706696164] [2021-01-06 19:31:31,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:31,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:31,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62311210] [2021-01-06 19:31:31,266 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:31,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:31,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:31,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:31,267 INFO L87 Difference]: Start difference. First operand 32301 states and 40735 transitions. Second operand 4 states. [2021-01-06 19:31:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:35,683 INFO L93 Difference]: Finished difference Result 77669 states and 97759 transitions. [2021-01-06 19:31:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:35,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:31:35,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:35,724 INFO L225 Difference]: With dead ends: 77669 [2021-01-06 19:31:35,724 INFO L226 Difference]: Without dead ends: 45459 [2021-01-06 19:31:35,741 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:31:35,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45459 states. [2021-01-06 19:31:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45459 to 31140. [2021-01-06 19:31:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31140 states. [2021-01-06 19:31:38,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31140 states to 31140 states and 38691 transitions. [2021-01-06 19:31:38,956 INFO L78 Accepts]: Start accepts. Automaton has 31140 states and 38691 transitions. Word has length 127 [2021-01-06 19:31:38,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:38,957 INFO L481 AbstractCegarLoop]: Abstraction has 31140 states and 38691 transitions. [2021-01-06 19:31:38,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:38,957 INFO L276 IsEmpty]: Start isEmpty. Operand 31140 states and 38691 transitions. [2021-01-06 19:31:38,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:31:38,959 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:38,959 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:31:38,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:31:38,960 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:38,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:38,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1665453893, now seen corresponding path program 1 times [2021-01-06 19:31:38,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:38,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060737472] [2021-01-06 19:31:38,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:31:39,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060737472] [2021-01-06 19:31:39,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:39,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:39,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823775506] [2021-01-06 19:31:39,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:39,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:39,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:39,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:39,013 INFO L87 Difference]: Start difference. First operand 31140 states and 38691 transitions. Second operand 4 states. [2021-01-06 19:31:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:43,243 INFO L93 Difference]: Finished difference Result 74574 states and 92712 transitions. [2021-01-06 19:31:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:43,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:31:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:43,283 INFO L225 Difference]: With dead ends: 74574 [2021-01-06 19:31:43,283 INFO L226 Difference]: Without dead ends: 43592 [2021-01-06 19:31:43,300 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:31:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43592 states. [2021-01-06 19:31:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43592 to 30747. [2021-01-06 19:31:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30747 states. [2021-01-06 19:31:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30747 states to 30747 states and 37927 transitions. [2021-01-06 19:31:46,316 INFO L78 Accepts]: Start accepts. Automaton has 30747 states and 37927 transitions. Word has length 127 [2021-01-06 19:31:46,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:46,316 INFO L481 AbstractCegarLoop]: Abstraction has 30747 states and 37927 transitions. [2021-01-06 19:31:46,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 30747 states and 37927 transitions. [2021-01-06 19:31:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:31:46,318 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:46,319 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:31:46,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:31:46,319 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:46,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:46,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2089100615, now seen corresponding path program 1 times [2021-01-06 19:31:46,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:46,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627219293] [2021-01-06 19:31:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:46,370 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:31:46,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627219293] [2021-01-06 19:31:46,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:46,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:46,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20919814] [2021-01-06 19:31:46,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:46,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:46,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:46,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:46,372 INFO L87 Difference]: Start difference. First operand 30747 states and 37927 transitions. Second operand 4 states. [2021-01-06 19:31:50,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:50,885 INFO L93 Difference]: Finished difference Result 75157 states and 92719 transitions. [2021-01-06 19:31:50,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:50,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:31:50,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:50,924 INFO L225 Difference]: With dead ends: 75157 [2021-01-06 19:31:50,924 INFO L226 Difference]: Without dead ends: 44535 [2021-01-06 19:31:50,939 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:31:50,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44535 states. [2021-01-06 19:31:54,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44535 to 30747. [2021-01-06 19:31:54,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30747 states. [2021-01-06 19:31:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30747 states to 30747 states and 37431 transitions. [2021-01-06 19:31:54,113 INFO L78 Accepts]: Start accepts. Automaton has 30747 states and 37431 transitions. Word has length 127 [2021-01-06 19:31:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:54,113 INFO L481 AbstractCegarLoop]: Abstraction has 30747 states and 37431 transitions. [2021-01-06 19:31:54,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 30747 states and 37431 transitions. [2021-01-06 19:31:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:31:54,115 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:54,116 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:31:54,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:31:54,116 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:54,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:54,116 INFO L82 PathProgramCache]: Analyzing trace with hash 717293317, now seen corresponding path program 1 times [2021-01-06 19:31:54,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:54,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851902040] [2021-01-06 19:31:54,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:31:54,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851902040] [2021-01-06 19:31:54,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:54,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:54,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570750526] [2021-01-06 19:31:54,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:54,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:54,175 INFO L87 Difference]: Start difference. First operand 30747 states and 37431 transitions. Second operand 4 states. [2021-01-06 19:31:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:58,624 INFO L93 Difference]: Finished difference Result 73426 states and 89468 transitions. [2021-01-06 19:31:58,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:58,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:31:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:58,663 INFO L225 Difference]: With dead ends: 73426 [2021-01-06 19:31:58,664 INFO L226 Difference]: Without dead ends: 42839 [2021-01-06 19:31:58,681 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:31:58,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42839 states. [2021-01-06 19:32:01,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42839 to 30390. [2021-01-06 19:32:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30390 states. [2021-01-06 19:32:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30390 states to 30390 states and 36727 transitions. [2021-01-06 19:32:01,898 INFO L78 Accepts]: Start accepts. Automaton has 30390 states and 36727 transitions. Word has length 127 [2021-01-06 19:32:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:01,898 INFO L481 AbstractCegarLoop]: Abstraction has 30390 states and 36727 transitions. [2021-01-06 19:32:01,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 30390 states and 36727 transitions. [2021-01-06 19:32:01,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:32:01,900 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:01,901 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 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] [2021-01-06 19:32:01,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:32:01,901 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:01,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:01,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1128073849, now seen corresponding path program 1 times [2021-01-06 19:32:01,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:01,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956379183] [2021-01-06 19:32:01,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:32:01,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956379183] [2021-01-06 19:32:01,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:01,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:01,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799521408] [2021-01-06 19:32:01,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:01,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:01,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:01,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:01,953 INFO L87 Difference]: Start difference. First operand 30390 states and 36727 transitions. Second operand 3 states. [2021-01-06 19:32:07,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:07,483 INFO L93 Difference]: Finished difference Result 89136 states and 106792 transitions. [2021-01-06 19:32:07,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:07,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2021-01-06 19:32:07,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:07,537 INFO L225 Difference]: With dead ends: 89136 [2021-01-06 19:32:07,537 INFO L226 Difference]: Without dead ends: 58906 [2021-01-06 19:32:07,554 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:32:07,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58906 states. [2021-01-06 19:32:13,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58906 to 58476. [2021-01-06 19:32:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58476 states. [2021-01-06 19:32:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58476 states to 58476 states and 69532 transitions. [2021-01-06 19:32:13,337 INFO L78 Accepts]: Start accepts. Automaton has 58476 states and 69532 transitions. Word has length 127 [2021-01-06 19:32:13,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:13,337 INFO L481 AbstractCegarLoop]: Abstraction has 58476 states and 69532 transitions. [2021-01-06 19:32:13,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:13,337 INFO L276 IsEmpty]: Start isEmpty. Operand 58476 states and 69532 transitions. [2021-01-06 19:32:13,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2021-01-06 19:32:13,340 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:13,341 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2021-01-06 19:32:13,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:32:13,341 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:13,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:13,341 INFO L82 PathProgramCache]: Analyzing trace with hash 436571511, now seen corresponding path program 1 times [2021-01-06 19:32:13,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:13,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339652691] [2021-01-06 19:32:13,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:32:13,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339652691] [2021-01-06 19:32:13,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:13,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:13,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229694804] [2021-01-06 19:32:13,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:13,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:13,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:13,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:13,393 INFO L87 Difference]: Start difference. First operand 58476 states and 69532 transitions. Second operand 3 states. [2021-01-06 19:32:23,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:23,980 INFO L93 Difference]: Finished difference Result 167264 states and 198274 transitions. [2021-01-06 19:32:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:23,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2021-01-06 19:32:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:24,241 INFO L225 Difference]: With dead ends: 167264 [2021-01-06 19:32:24,241 INFO L226 Difference]: Without dead ends: 109104 [2021-01-06 19:32:24,280 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:32:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109104 states. [2021-01-06 19:32:35,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109104 to 109102. [2021-01-06 19:32:35,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109102 states. [2021-01-06 19:32:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109102 states to 109102 states and 128826 transitions. [2021-01-06 19:32:35,354 INFO L78 Accepts]: Start accepts. Automaton has 109102 states and 128826 transitions. Word has length 129 [2021-01-06 19:32:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:35,355 INFO L481 AbstractCegarLoop]: Abstraction has 109102 states and 128826 transitions. [2021-01-06 19:32:35,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 109102 states and 128826 transitions. [2021-01-06 19:32:35,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:32:35,361 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:35,361 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2021-01-06 19:32:35,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:32:35,362 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:35,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:35,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1248147129, now seen corresponding path program 1 times [2021-01-06 19:32:35,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:35,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311863913] [2021-01-06 19:32:35,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:35,414 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:32:35,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311863913] [2021-01-06 19:32:35,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:35,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:35,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396782625] [2021-01-06 19:32:35,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:35,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:35,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:35,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:35,416 INFO L87 Difference]: Start difference. First operand 109102 states and 128826 transitions. Second operand 3 states.