/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.12.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:31:19,815 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:31:19,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:31:19,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:31:19,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:31:19,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:31:19,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:31:19,898 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:31:19,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:31:19,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:31:19,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:31:19,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:31:19,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:31:19,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:31:19,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:31:19,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:31:19,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:31:19,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:31:19,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:31:19,934 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:31:19,937 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:31:19,939 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:31:19,940 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:31:19,942 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:31:19,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:31:19,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:31:19,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:31:19,958 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:31:19,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:31:19,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:31:19,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:31:19,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:31:19,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:31:19,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:31:19,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:31:19,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:31:19,968 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:31:19,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:31:19,972 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:31:19,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:31:19,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:31:19,978 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:31:20,024 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:31:20,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:31:20,028 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:31:20,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:31:20,029 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:31:20,029 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:31:20,029 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:31:20,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:31:20,030 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:31:20,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:31:20,031 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:31:20,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:31:20,032 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:31:20,032 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:31:20,032 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:31:20,032 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:31:20,033 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:31:20,033 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:31:20,033 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:31:20,033 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:31:20,034 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:31:20,034 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:31:20,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:31:20,034 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:31:20,035 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:31:20,035 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:31:20,506 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:31:20,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:31:20,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:31:20,560 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:31:20,560 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:31:20,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.12.cil.c [2021-01-06 19:31:20,652 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e0f7948fc/f585bc021a2e4e889747098baab718cb/FLAG5b83b9af5 [2021-01-06 19:31:21,423 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:31:21,423 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.12.cil.c [2021-01-06 19:31:21,447 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e0f7948fc/f585bc021a2e4e889747098baab718cb/FLAG5b83b9af5 [2021-01-06 19:31:21,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e0f7948fc/f585bc021a2e4e889747098baab718cb [2021-01-06 19:31:21,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:31:21,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:31:21,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:31:21,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:31:21,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:31:21,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:31:21" (1/1) ... [2021-01-06 19:31:21,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63cd256a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:21, skipping insertion in model container [2021-01-06 19:31:21,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:31:21" (1/1) ... [2021-01-06 19:31:21,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:31:21,752 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:31:21,910 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.12.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[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_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[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] 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[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] 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[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_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[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_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[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~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[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_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[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~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[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_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[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_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[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~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[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_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~14,] [2021-01-06 19:31:22,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:31:22,114 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:31:22,126 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.12.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[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_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[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] 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[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] 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[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_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[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_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[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~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[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_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[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~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[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_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[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_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[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~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[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_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~14,] [2021-01-06 19:31:22,229 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:31:22,272 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:31:22,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22 WrapperNode [2021-01-06 19:31:22,272 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:31:22,274 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:31:22,274 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:31:22,274 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:31:22,282 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:31:22" (1/1) ... [2021-01-06 19:31:22,298 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:31:22" (1/1) ... [2021-01-06 19:31:22,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:31:22,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:31:22,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:31:22,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:31:22,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22" (1/1) ... [2021-01-06 19:31:22,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22" (1/1) ... [2021-01-06 19:31:22,506 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22" (1/1) ... [2021-01-06 19:31:22,507 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22" (1/1) ... [2021-01-06 19:31:22,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22" (1/1) ... [2021-01-06 19:31:22,617 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22" (1/1) ... [2021-01-06 19:31:22,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22" (1/1) ... [2021-01-06 19:31:22,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:31:22,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:31:22,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:31:22,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:31:22,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22" (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:31:22,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:31:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:31:22,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:31:22,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:31:25,674 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:31:25,674 INFO L299 CfgBuilder]: Removed 524 assume(true) statements. [2021-01-06 19:31:25,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:31:25 BoogieIcfgContainer [2021-01-06 19:31:25,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:31:25,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:31:25,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:31:25,685 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:31:25,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:31:21" (1/3) ... [2021-01-06 19:31:25,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c14ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:31:25, skipping insertion in model container [2021-01-06 19:31:25,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:31:22" (2/3) ... [2021-01-06 19:31:25,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c14ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:31:25, skipping insertion in model container [2021-01-06 19:31:25,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:31:25" (3/3) ... [2021-01-06 19:31:25,689 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.12.cil.c [2021-01-06 19:31:25,696 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:31:25,703 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:31:25,724 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:31:25,763 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:31:25,763 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:31:25,763 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:31:25,763 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:31:25,764 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:31:25,764 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:31:25,764 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:31:25,764 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:31:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1662 states. [2021-01-06 19:31:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:25,823 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:25,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,824 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:25,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:25,831 INFO L82 PathProgramCache]: Analyzing trace with hash -166317093, now seen corresponding path program 1 times [2021-01-06 19:31:25,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:25,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055964488] [2021-01-06 19:31:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:26,246 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:31:26,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055964488] [2021-01-06 19:31:26,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:26,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:26,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168765600] [2021-01-06 19:31:26,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:26,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:26,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:26,273 INFO L87 Difference]: Start difference. First operand 1662 states. Second operand 3 states. [2021-01-06 19:31:26,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:26,485 INFO L93 Difference]: Finished difference Result 3319 states and 5015 transitions. [2021-01-06 19:31:26,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:26,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:26,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:26,515 INFO L225 Difference]: With dead ends: 3319 [2021-01-06 19:31:26,515 INFO L226 Difference]: Without dead ends: 1658 [2021-01-06 19:31:26,528 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:31:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2021-01-06 19:31:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2021-01-06 19:31:26,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2021-01-06 19:31:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2473 transitions. [2021-01-06 19:31:26,721 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2473 transitions. Word has length 169 [2021-01-06 19:31:26,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:26,721 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 2473 transitions. [2021-01-06 19:31:26,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:26,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2473 transitions. [2021-01-06 19:31:26,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:26,738 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:26,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:26,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:31:26,739 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:26,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1756933337, now seen corresponding path program 1 times [2021-01-06 19:31:26,743 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:26,743 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379269876] [2021-01-06 19:31:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:26,914 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:31:26,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379269876] [2021-01-06 19:31:26,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:26,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:26,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364527407] [2021-01-06 19:31:26,917 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:26,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:26,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:26,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:26,918 INFO L87 Difference]: Start difference. First operand 1658 states and 2473 transitions. Second operand 3 states. [2021-01-06 19:31:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:27,002 INFO L93 Difference]: Finished difference Result 3303 states and 4924 transitions. [2021-01-06 19:31:27,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:27,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:27,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:27,012 INFO L225 Difference]: With dead ends: 3303 [2021-01-06 19:31:27,013 INFO L226 Difference]: Without dead ends: 1658 [2021-01-06 19:31:27,017 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:31:27,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2021-01-06 19:31:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1658. [2021-01-06 19:31:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2021-01-06 19:31:27,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2472 transitions. [2021-01-06 19:31:27,112 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2472 transitions. Word has length 169 [2021-01-06 19:31:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:27,114 INFO L481 AbstractCegarLoop]: Abstraction has 1658 states and 2472 transitions. [2021-01-06 19:31:27,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2472 transitions. [2021-01-06 19:31:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:27,118 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:27,118 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:31:27,119 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:27,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:27,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1412105175, now seen corresponding path program 1 times [2021-01-06 19:31:27,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:27,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47183482] [2021-01-06 19:31:27,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:27,278 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:31:27,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47183482] [2021-01-06 19:31:27,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:27,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:27,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400665077] [2021-01-06 19:31:27,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:27,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:27,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:27,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:27,281 INFO L87 Difference]: Start difference. First operand 1658 states and 2472 transitions. Second operand 3 states. [2021-01-06 19:31:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:27,520 INFO L93 Difference]: Finished difference Result 4708 states and 6998 transitions. [2021-01-06 19:31:27,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:27,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:27,536 INFO L225 Difference]: With dead ends: 4708 [2021-01-06 19:31:27,536 INFO L226 Difference]: Without dead ends: 3067 [2021-01-06 19:31:27,540 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:27,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3067 states. [2021-01-06 19:31:27,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3067 to 3065. [2021-01-06 19:31:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4536 transitions. [2021-01-06 19:31:27,669 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4536 transitions. Word has length 169 [2021-01-06 19:31:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:27,676 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4536 transitions. [2021-01-06 19:31:27,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4536 transitions. [2021-01-06 19:31:27,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:27,680 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:27,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:31:27,681 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:27,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash -474166761, now seen corresponding path program 1 times [2021-01-06 19:31:27,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:27,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050803085] [2021-01-06 19:31:27,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:27,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:27,888 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:31:27,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050803085] [2021-01-06 19:31:27,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:27,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:27,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172185595] [2021-01-06 19:31:27,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:27,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:27,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:27,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:27,895 INFO L87 Difference]: Start difference. First operand 3065 states and 4536 transitions. Second operand 4 states. [2021-01-06 19:31:28,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:28,242 INFO L93 Difference]: Finished difference Result 7520 states and 11108 transitions. [2021-01-06 19:31:28,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:28,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:28,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:28,267 INFO L225 Difference]: With dead ends: 7520 [2021-01-06 19:31:28,267 INFO L226 Difference]: Without dead ends: 4473 [2021-01-06 19:31:28,278 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:28,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4473 states. [2021-01-06 19:31:28,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4473 to 3065. [2021-01-06 19:31:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4533 transitions. [2021-01-06 19:31:28,444 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4533 transitions. Word has length 169 [2021-01-06 19:31:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:28,444 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4533 transitions. [2021-01-06 19:31:28,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4533 transitions. [2021-01-06 19:31:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:28,447 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:28,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:31:28,447 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:28,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:28,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1420167125, now seen corresponding path program 1 times [2021-01-06 19:31:28,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:28,449 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358473804] [2021-01-06 19:31:28,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:28,612 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:31:28,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358473804] [2021-01-06 19:31:28,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:28,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:28,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376183173] [2021-01-06 19:31:28,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:28,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:28,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:28,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:28,616 INFO L87 Difference]: Start difference. First operand 3065 states and 4533 transitions. Second operand 4 states. [2021-01-06 19:31:28,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:28,984 INFO L93 Difference]: Finished difference Result 7518 states and 11098 transitions. [2021-01-06 19:31:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:28,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:29,009 INFO L225 Difference]: With dead ends: 7518 [2021-01-06 19:31:29,010 INFO L226 Difference]: Without dead ends: 4472 [2021-01-06 19:31:29,017 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:29,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4472 states. [2021-01-06 19:31:29,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4472 to 3065. [2021-01-06 19:31:29,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4530 transitions. [2021-01-06 19:31:29,222 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4530 transitions. Word has length 169 [2021-01-06 19:31:29,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:29,223 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4530 transitions. [2021-01-06 19:31:29,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:29,223 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4530 transitions. [2021-01-06 19:31:29,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:29,226 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:29,226 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,226 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:31:29,227 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:29,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1428219305, now seen corresponding path program 1 times [2021-01-06 19:31:29,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:29,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895434750] [2021-01-06 19:31:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:29,328 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:31:29,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895434750] [2021-01-06 19:31:29,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:29,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:29,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797162338] [2021-01-06 19:31:29,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:29,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:29,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:29,331 INFO L87 Difference]: Start difference. First operand 3065 states and 4530 transitions. Second operand 4 states. [2021-01-06 19:31:29,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:29,736 INFO L93 Difference]: Finished difference Result 7516 states and 11088 transitions. [2021-01-06 19:31:29,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:29,737 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:29,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:29,759 INFO L225 Difference]: With dead ends: 7516 [2021-01-06 19:31:29,759 INFO L226 Difference]: Without dead ends: 4471 [2021-01-06 19:31:29,766 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:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4471 states. [2021-01-06 19:31:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4471 to 3065. [2021-01-06 19:31:29,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4527 transitions. [2021-01-06 19:31:29,972 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4527 transitions. Word has length 169 [2021-01-06 19:31:29,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:29,972 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4527 transitions. [2021-01-06 19:31:29,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:29,972 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4527 transitions. [2021-01-06 19:31:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:29,975 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:29,975 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:31:29,976 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:29,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:29,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1943580565, now seen corresponding path program 1 times [2021-01-06 19:31:29,981 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:29,982 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154498505] [2021-01-06 19:31:29,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:30,056 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:31:30,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154498505] [2021-01-06 19:31:30,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:30,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:30,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865196373] [2021-01-06 19:31:30,058 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:30,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:30,060 INFO L87 Difference]: Start difference. First operand 3065 states and 4527 transitions. Second operand 3 states. [2021-01-06 19:31:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:30,230 INFO L93 Difference]: Finished difference Result 6108 states and 9019 transitions. [2021-01-06 19:31:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:30,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:30,247 INFO L225 Difference]: With dead ends: 6108 [2021-01-06 19:31:30,247 INFO L226 Difference]: Without dead ends: 3065 [2021-01-06 19:31:30,255 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:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2021-01-06 19:31:30,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2021-01-06 19:31:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4519 transitions. [2021-01-06 19:31:30,430 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4519 transitions. Word has length 169 [2021-01-06 19:31:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:30,431 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4519 transitions. [2021-01-06 19:31:30,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4519 transitions. [2021-01-06 19:31:30,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:30,433 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:30,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:31:30,434 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:30,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:30,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1722547883, now seen corresponding path program 1 times [2021-01-06 19:31:30,435 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:30,435 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286290570] [2021-01-06 19:31:30,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:30,533 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:31:30,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286290570] [2021-01-06 19:31:30,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:30,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:30,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537536793] [2021-01-06 19:31:30,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:30,535 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:30,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:30,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:30,536 INFO L87 Difference]: Start difference. First operand 3065 states and 4519 transitions. Second operand 4 states. [2021-01-06 19:31:30,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:30,924 INFO L93 Difference]: Finished difference Result 7510 states and 11053 transitions. [2021-01-06 19:31:30,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:30,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:30,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:30,948 INFO L225 Difference]: With dead ends: 7510 [2021-01-06 19:31:30,948 INFO L226 Difference]: Without dead ends: 4468 [2021-01-06 19:31:30,956 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:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2021-01-06 19:31:31,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 3065. [2021-01-06 19:31:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4516 transitions. [2021-01-06 19:31:31,149 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4516 transitions. Word has length 169 [2021-01-06 19:31:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:31,150 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4516 transitions. [2021-01-06 19:31:31,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:31,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4516 transitions. [2021-01-06 19:31:31,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:31,153 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:31,154 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:31:31,154 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:31,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:31,155 INFO L82 PathProgramCache]: Analyzing trace with hash 208577751, now seen corresponding path program 1 times [2021-01-06 19:31:31,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:31,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140904145] [2021-01-06 19:31:31,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:31,261 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:31:31,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140904145] [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 [2] imperfect sequences [] total 2 [2021-01-06 19:31:31,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618447953] [2021-01-06 19:31:31,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:31,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:31,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:31,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:31,271 INFO L87 Difference]: Start difference. First operand 3065 states and 4516 transitions. Second operand 3 states. [2021-01-06 19:31:31,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:31,450 INFO L93 Difference]: Finished difference Result 6106 states and 8995 transitions. [2021-01-06 19:31:31,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:31,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:31,478 INFO L225 Difference]: With dead ends: 6106 [2021-01-06 19:31:31,478 INFO L226 Difference]: Without dead ends: 3065 [2021-01-06 19:31:31,484 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:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2021-01-06 19:31:31,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2021-01-06 19:31:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4508 transitions. [2021-01-06 19:31:31,650 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4508 transitions. Word has length 169 [2021-01-06 19:31:31,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:31,655 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4508 transitions. [2021-01-06 19:31:31,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:31,655 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4508 transitions. [2021-01-06 19:31:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:31,657 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:31,658 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:31:31,658 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:31,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:31,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2011994473, now seen corresponding path program 1 times [2021-01-06 19:31:31,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:31,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336953873] [2021-01-06 19:31:31,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:31,731 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:31:31,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336953873] [2021-01-06 19:31:31,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:31,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:31,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679194736] [2021-01-06 19:31:31,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:31,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:31,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:31,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:31,734 INFO L87 Difference]: Start difference. First operand 3065 states and 4508 transitions. Second operand 3 states. [2021-01-06 19:31:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:31,957 INFO L93 Difference]: Finished difference Result 6105 states and 8978 transitions. [2021-01-06 19:31:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:31,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:31,968 INFO L225 Difference]: With dead ends: 6105 [2021-01-06 19:31:31,968 INFO L226 Difference]: Without dead ends: 3065 [2021-01-06 19:31:31,975 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:31,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2021-01-06 19:31:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2021-01-06 19:31:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:32,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4500 transitions. [2021-01-06 19:31:32,203 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4500 transitions. Word has length 169 [2021-01-06 19:31:32,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:32,203 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4500 transitions. [2021-01-06 19:31:32,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:32,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4500 transitions. [2021-01-06 19:31:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:32,206 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:32,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,207 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:31:32,207 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:32,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:32,208 INFO L82 PathProgramCache]: Analyzing trace with hash 133131479, now seen corresponding path program 1 times [2021-01-06 19:31:32,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:32,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31651290] [2021-01-06 19:31:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:32,313 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:31:32,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31651290] [2021-01-06 19:31:32,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:32,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:32,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835546970] [2021-01-06 19:31:32,315 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:32,315 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:32,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:32,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:32,318 INFO L87 Difference]: Start difference. First operand 3065 states and 4500 transitions. Second operand 3 states. [2021-01-06 19:31:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:32,498 INFO L93 Difference]: Finished difference Result 6104 states and 8961 transitions. [2021-01-06 19:31:32,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:32,499 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:32,506 INFO L225 Difference]: With dead ends: 6104 [2021-01-06 19:31:32,506 INFO L226 Difference]: Without dead ends: 3065 [2021-01-06 19:31:32,512 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:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2021-01-06 19:31:32,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2021-01-06 19:31:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:32,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4492 transitions. [2021-01-06 19:31:32,698 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4492 transitions. Word has length 169 [2021-01-06 19:31:32,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:32,699 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4492 transitions. [2021-01-06 19:31:32,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:32,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4492 transitions. [2021-01-06 19:31:32,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:32,702 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:32,702 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:31:32,703 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:32,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:32,703 INFO L82 PathProgramCache]: Analyzing trace with hash 895065751, now seen corresponding path program 1 times [2021-01-06 19:31:32,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:32,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295736667] [2021-01-06 19:31:32,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:32,849 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:31:32,850 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295736667] [2021-01-06 19:31:32,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:32,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:32,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504311087] [2021-01-06 19:31:32,851 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:32,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:32,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:32,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:32,852 INFO L87 Difference]: Start difference. First operand 3065 states and 4492 transitions. Second operand 3 states. [2021-01-06 19:31:33,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:33,042 INFO L93 Difference]: Finished difference Result 6103 states and 8944 transitions. [2021-01-06 19:31:33,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:33,043 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:33,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:33,051 INFO L225 Difference]: With dead ends: 6103 [2021-01-06 19:31:33,052 INFO L226 Difference]: Without dead ends: 3065 [2021-01-06 19:31:33,059 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:33,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2021-01-06 19:31:33,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2021-01-06 19:31:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4484 transitions. [2021-01-06 19:31:33,252 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4484 transitions. Word has length 169 [2021-01-06 19:31:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:33,252 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4484 transitions. [2021-01-06 19:31:33,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4484 transitions. [2021-01-06 19:31:33,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:33,255 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:33,256 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:31:33,256 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:33,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:33,257 INFO L82 PathProgramCache]: Analyzing trace with hash -50187049, now seen corresponding path program 1 times [2021-01-06 19:31:33,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:33,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399972198] [2021-01-06 19:31:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:33,337 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:31:33,338 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399972198] [2021-01-06 19:31:33,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:33,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:33,339 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145767288] [2021-01-06 19:31:33,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:33,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:33,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:33,341 INFO L87 Difference]: Start difference. First operand 3065 states and 4484 transitions. Second operand 4 states. [2021-01-06 19:31:33,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:33,766 INFO L93 Difference]: Finished difference Result 7500 states and 10959 transitions. [2021-01-06 19:31:33,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:33,766 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:33,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:33,778 INFO L225 Difference]: With dead ends: 7500 [2021-01-06 19:31:33,778 INFO L226 Difference]: Without dead ends: 4463 [2021-01-06 19:31:33,789 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:33,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4463 states. [2021-01-06 19:31:33,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4463 to 3065. [2021-01-06 19:31:33,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:33,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4481 transitions. [2021-01-06 19:31:33,995 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4481 transitions. Word has length 169 [2021-01-06 19:31:33,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:33,997 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4481 transitions. [2021-01-06 19:31:33,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4481 transitions. [2021-01-06 19:31:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:34,000 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:34,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:31:34,001 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:34,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash -590616555, now seen corresponding path program 1 times [2021-01-06 19:31:34,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:34,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679987865] [2021-01-06 19:31:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:34,072 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:31:34,072 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679987865] [2021-01-06 19:31:34,072 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:34,072 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:34,073 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452784238] [2021-01-06 19:31:34,073 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:34,073 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:34,074 INFO L87 Difference]: Start difference. First operand 3065 states and 4481 transitions. Second operand 4 states. [2021-01-06 19:31:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:34,571 INFO L93 Difference]: Finished difference Result 7405 states and 10816 transitions. [2021-01-06 19:31:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:34,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:34,582 INFO L225 Difference]: With dead ends: 7405 [2021-01-06 19:31:34,582 INFO L226 Difference]: Without dead ends: 4370 [2021-01-06 19:31:34,590 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:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4370 states. [2021-01-06 19:31:34,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4370 to 3065. [2021-01-06 19:31:34,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4478 transitions. [2021-01-06 19:31:34,780 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4478 transitions. Word has length 169 [2021-01-06 19:31:34,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:34,780 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4478 transitions. [2021-01-06 19:31:34,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4478 transitions. [2021-01-06 19:31:34,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:34,783 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:34,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:31:34,784 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:34,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:34,784 INFO L82 PathProgramCache]: Analyzing trace with hash -180006189, now seen corresponding path program 1 times [2021-01-06 19:31:34,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:34,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375795390] [2021-01-06 19:31:34,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:34,869 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:31:34,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375795390] [2021-01-06 19:31:34,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:34,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:34,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114097693] [2021-01-06 19:31:34,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:34,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:34,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:34,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:34,873 INFO L87 Difference]: Start difference. First operand 3065 states and 4478 transitions. Second operand 3 states. [2021-01-06 19:31:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:35,146 INFO L93 Difference]: Finished difference Result 6099 states and 8911 transitions. [2021-01-06 19:31:35,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:35,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:35,158 INFO L225 Difference]: With dead ends: 6099 [2021-01-06 19:31:35,158 INFO L226 Difference]: Without dead ends: 3065 [2021-01-06 19:31:35,166 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:35,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2021-01-06 19:31:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2021-01-06 19:31:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4444 transitions. [2021-01-06 19:31:35,482 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4444 transitions. Word has length 169 [2021-01-06 19:31:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:35,483 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4444 transitions. [2021-01-06 19:31:35,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:35,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4444 transitions. [2021-01-06 19:31:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:35,486 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:35,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:31:35,488 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:35,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1967876011, now seen corresponding path program 1 times [2021-01-06 19:31:35,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:35,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697673073] [2021-01-06 19:31:35,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:35,592 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:31:35,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697673073] [2021-01-06 19:31:35,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:35,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:35,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904467304] [2021-01-06 19:31:35,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:35,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:35,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:35,598 INFO L87 Difference]: Start difference. First operand 3065 states and 4444 transitions. Second operand 4 states. [2021-01-06 19:31:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:36,171 INFO L93 Difference]: Finished difference Result 7401 states and 10722 transitions. [2021-01-06 19:31:36,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:36,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:36,181 INFO L225 Difference]: With dead ends: 7401 [2021-01-06 19:31:36,181 INFO L226 Difference]: Without dead ends: 4368 [2021-01-06 19:31:36,188 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:36,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4368 states. [2021-01-06 19:31:36,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4368 to 3065. [2021-01-06 19:31:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:36,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4441 transitions. [2021-01-06 19:31:36,387 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4441 transitions. Word has length 169 [2021-01-06 19:31:36,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:36,388 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4441 transitions. [2021-01-06 19:31:36,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:36,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4441 transitions. [2021-01-06 19:31:36,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:36,391 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:36,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:31:36,392 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:36,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:36,393 INFO L82 PathProgramCache]: Analyzing trace with hash 191208083, now seen corresponding path program 1 times [2021-01-06 19:31:36,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:36,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363326222] [2021-01-06 19:31:36,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:36,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:36,474 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:31:36,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363326222] [2021-01-06 19:31:36,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:36,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:36,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653294052] [2021-01-06 19:31:36,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:36,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:36,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:36,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:36,477 INFO L87 Difference]: Start difference. First operand 3065 states and 4441 transitions. Second operand 3 states. [2021-01-06 19:31:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:36,755 INFO L93 Difference]: Finished difference Result 6097 states and 8835 transitions. [2021-01-06 19:31:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:36,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:36,762 INFO L225 Difference]: With dead ends: 6097 [2021-01-06 19:31:36,762 INFO L226 Difference]: Without dead ends: 3065 [2021-01-06 19:31:36,768 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:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2021-01-06 19:31:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2021-01-06 19:31:36,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4407 transitions. [2021-01-06 19:31:36,978 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4407 transitions. Word has length 169 [2021-01-06 19:31:36,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:36,979 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4407 transitions. [2021-01-06 19:31:36,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4407 transitions. [2021-01-06 19:31:36,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:36,981 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:36,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:31:36,984 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:36,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1983127341, now seen corresponding path program 1 times [2021-01-06 19:31:36,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:36,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428729283] [2021-01-06 19:31:36,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:37,070 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:31:37,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428729283] [2021-01-06 19:31:37,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:37,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:37,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516098197] [2021-01-06 19:31:37,074 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:37,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:37,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:37,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:37,075 INFO L87 Difference]: Start difference. First operand 3065 states and 4407 transitions. Second operand 4 states. [2021-01-06 19:31:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:37,590 INFO L93 Difference]: Finished difference Result 7397 states and 10628 transitions. [2021-01-06 19:31:37,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:37,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:37,599 INFO L225 Difference]: With dead ends: 7397 [2021-01-06 19:31:37,600 INFO L226 Difference]: Without dead ends: 4366 [2021-01-06 19:31:37,606 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:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4366 states. [2021-01-06 19:31:37,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4366 to 3065. [2021-01-06 19:31:37,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4404 transitions. [2021-01-06 19:31:37,856 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4404 transitions. Word has length 169 [2021-01-06 19:31:37,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:37,856 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4404 transitions. [2021-01-06 19:31:37,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:37,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4404 transitions. [2021-01-06 19:31:37,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:37,859 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:37,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:31:37,860 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:37,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:37,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1565238639, now seen corresponding path program 1 times [2021-01-06 19:31:37,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:37,863 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675206621] [2021-01-06 19:31:37,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:37,940 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:31:37,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675206621] [2021-01-06 19:31:37,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:37,941 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:37,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426106622] [2021-01-06 19:31:37,943 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:37,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:37,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:37,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:37,944 INFO L87 Difference]: Start difference. First operand 3065 states and 4404 transitions. Second operand 4 states. [2021-01-06 19:31:38,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:38,478 INFO L93 Difference]: Finished difference Result 7395 states and 10618 transitions. [2021-01-06 19:31:38,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:38,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:38,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:38,487 INFO L225 Difference]: With dead ends: 7395 [2021-01-06 19:31:38,487 INFO L226 Difference]: Without dead ends: 4365 [2021-01-06 19:31:38,494 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:38,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4365 states. [2021-01-06 19:31:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4365 to 3065. [2021-01-06 19:31:38,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4401 transitions. [2021-01-06 19:31:38,700 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4401 transitions. Word has length 169 [2021-01-06 19:31:38,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:38,700 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4401 transitions. [2021-01-06 19:31:38,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4401 transitions. [2021-01-06 19:31:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:38,702 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:38,703 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:31:38,703 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:38,703 INFO L82 PathProgramCache]: Analyzing trace with hash -166285037, now seen corresponding path program 1 times [2021-01-06 19:31:38,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:38,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462317914] [2021-01-06 19:31:38,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:38,804 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:31:38,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462317914] [2021-01-06 19:31:38,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:38,804 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:38,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921883117] [2021-01-06 19:31:38,805 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:38,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:38,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:38,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:38,806 INFO L87 Difference]: Start difference. First operand 3065 states and 4401 transitions. Second operand 4 states. [2021-01-06 19:31:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:39,354 INFO L93 Difference]: Finished difference Result 7393 states and 10608 transitions. [2021-01-06 19:31:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:39,354 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:39,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:39,363 INFO L225 Difference]: With dead ends: 7393 [2021-01-06 19:31:39,364 INFO L226 Difference]: Without dead ends: 4364 [2021-01-06 19:31:39,370 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:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4364 states. [2021-01-06 19:31:39,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4364 to 3065. [2021-01-06 19:31:39,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:39,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4398 transitions. [2021-01-06 19:31:39,582 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4398 transitions. Word has length 169 [2021-01-06 19:31:39,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:39,582 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4398 transitions. [2021-01-06 19:31:39,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:39,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4398 transitions. [2021-01-06 19:31:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:39,585 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:39,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:31:39,586 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:39,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1783725487, now seen corresponding path program 1 times [2021-01-06 19:31:39,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:39,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954693002] [2021-01-06 19:31:39,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:39,671 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:31:39,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954693002] [2021-01-06 19:31:39,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:39,672 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:39,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496063170] [2021-01-06 19:31:39,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:39,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:39,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:39,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:39,675 INFO L87 Difference]: Start difference. First operand 3065 states and 4398 transitions. Second operand 4 states. [2021-01-06 19:31:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:40,280 INFO L93 Difference]: Finished difference Result 7389 states and 10594 transitions. [2021-01-06 19:31:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:40,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:40,291 INFO L225 Difference]: With dead ends: 7389 [2021-01-06 19:31:40,292 INFO L226 Difference]: Without dead ends: 4362 [2021-01-06 19:31:40,298 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:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4362 states. [2021-01-06 19:31:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4362 to 3065. [2021-01-06 19:31:40,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4395 transitions. [2021-01-06 19:31:40,589 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4395 transitions. Word has length 169 [2021-01-06 19:31:40,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:40,589 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4395 transitions. [2021-01-06 19:31:40,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:40,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4395 transitions. [2021-01-06 19:31:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:40,592 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:40,593 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:31:40,593 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:40,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:40,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1494906097, now seen corresponding path program 1 times [2021-01-06 19:31:40,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:40,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616116030] [2021-01-06 19:31:40,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:40,678 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:31:40,679 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616116030] [2021-01-06 19:31:40,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:40,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:40,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286202340] [2021-01-06 19:31:40,680 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:40,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:40,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:40,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:40,681 INFO L87 Difference]: Start difference. First operand 3065 states and 4395 transitions. Second operand 4 states. [2021-01-06 19:31:41,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:41,172 INFO L93 Difference]: Finished difference Result 7387 states and 10584 transitions. [2021-01-06 19:31:41,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:41,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:41,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:41,185 INFO L225 Difference]: With dead ends: 7387 [2021-01-06 19:31:41,185 INFO L226 Difference]: Without dead ends: 4361 [2021-01-06 19:31:41,191 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:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2021-01-06 19:31:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 3065. [2021-01-06 19:31:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:41,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4392 transitions. [2021-01-06 19:31:41,484 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4392 transitions. Word has length 169 [2021-01-06 19:31:41,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:41,485 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4392 transitions. [2021-01-06 19:31:41,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4392 transitions. [2021-01-06 19:31:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:41,487 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:41,488 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,488 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:31:41,488 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:41,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:41,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2039778671, now seen corresponding path program 1 times [2021-01-06 19:31:41,489 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:41,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787676805] [2021-01-06 19:31:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:41,549 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:31:41,549 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787676805] [2021-01-06 19:31:41,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:41,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:41,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194696836] [2021-01-06 19:31:41,550 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:41,551 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:41,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:41,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:41,551 INFO L87 Difference]: Start difference. First operand 3065 states and 4392 transitions. Second operand 4 states. [2021-01-06 19:31:42,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:42,003 INFO L93 Difference]: Finished difference Result 7385 states and 10574 transitions. [2021-01-06 19:31:42,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:42,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:42,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:42,014 INFO L225 Difference]: With dead ends: 7385 [2021-01-06 19:31:42,014 INFO L226 Difference]: Without dead ends: 4360 [2021-01-06 19:31:42,020 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:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4360 states. [2021-01-06 19:31:42,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4360 to 3065. [2021-01-06 19:31:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4389 transitions. [2021-01-06 19:31:42,272 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4389 transitions. Word has length 169 [2021-01-06 19:31:42,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:42,272 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4389 transitions. [2021-01-06 19:31:42,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:42,272 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4389 transitions. [2021-01-06 19:31:42,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:42,275 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:42,275 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:31:42,275 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:42,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:42,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1364618545, now seen corresponding path program 1 times [2021-01-06 19:31:42,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:42,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864916165] [2021-01-06 19:31:42,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:42,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:42,333 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:31:42,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864916165] [2021-01-06 19:31:42,333 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:42,333 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:42,334 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057448697] [2021-01-06 19:31:42,334 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:42,334 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:42,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:42,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:42,335 INFO L87 Difference]: Start difference. First operand 3065 states and 4389 transitions. Second operand 3 states. [2021-01-06 19:31:42,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:42,624 INFO L93 Difference]: Finished difference Result 6089 states and 8722 transitions. [2021-01-06 19:31:42,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:42,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2021-01-06 19:31:42,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:42,627 INFO L225 Difference]: With dead ends: 6089 [2021-01-06 19:31:42,627 INFO L226 Difference]: Without dead ends: 3065 [2021-01-06 19:31:42,630 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:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2021-01-06 19:31:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 3065. [2021-01-06 19:31:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3065 states. [2021-01-06 19:31:42,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3065 states to 3065 states and 4355 transitions. [2021-01-06 19:31:42,836 INFO L78 Accepts]: Start accepts. Automaton has 3065 states and 4355 transitions. Word has length 169 [2021-01-06 19:31:42,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:42,836 INFO L481 AbstractCegarLoop]: Abstraction has 3065 states and 4355 transitions. [2021-01-06 19:31:42,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:42,836 INFO L276 IsEmpty]: Start isEmpty. Operand 3065 states and 4355 transitions. [2021-01-06 19:31:42,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:42,837 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:42,838 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:31:42,838 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:42,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash 936207760, now seen corresponding path program 1 times [2021-01-06 19:31:42,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:42,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310259507] [2021-01-06 19:31:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:42,900 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:31:42,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310259507] [2021-01-06 19:31:42,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:42,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:42,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444568955] [2021-01-06 19:31:42,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:42,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:42,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:42,902 INFO L87 Difference]: Start difference. First operand 3065 states and 4355 transitions. Second operand 4 states. [2021-01-06 19:31:43,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:43,710 INFO L93 Difference]: Finished difference Result 11622 states and 16491 transitions. [2021-01-06 19:31:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:43,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:43,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:43,720 INFO L225 Difference]: With dead ends: 11622 [2021-01-06 19:31:43,720 INFO L226 Difference]: Without dead ends: 8600 [2021-01-06 19:31:43,726 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,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8600 states. [2021-01-06 19:31:44,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8600 to 8240. [2021-01-06 19:31:44,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8240 states. [2021-01-06 19:31:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8240 states to 8240 states and 11623 transitions. [2021-01-06 19:31:44,320 INFO L78 Accepts]: Start accepts. Automaton has 8240 states and 11623 transitions. Word has length 169 [2021-01-06 19:31:44,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:44,320 INFO L481 AbstractCegarLoop]: Abstraction has 8240 states and 11623 transitions. [2021-01-06 19:31:44,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:44,320 INFO L276 IsEmpty]: Start isEmpty. Operand 8240 states and 11623 transitions. [2021-01-06 19:31:44,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:44,322 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:44,322 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:31:44,322 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1513950673, now seen corresponding path program 1 times [2021-01-06 19:31:44,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:44,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985443257] [2021-01-06 19:31:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:44,386 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:31:44,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985443257] [2021-01-06 19:31:44,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:44,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:44,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715958275] [2021-01-06 19:31:44,388 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:44,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:44,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:44,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:44,389 INFO L87 Difference]: Start difference. First operand 8240 states and 11623 transitions. Second operand 5 states. [2021-01-06 19:31:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:45,904 INFO L93 Difference]: Finished difference Result 21811 states and 30808 transitions. [2021-01-06 19:31:45,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:45,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2021-01-06 19:31:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:45,921 INFO L225 Difference]: With dead ends: 21811 [2021-01-06 19:31:45,922 INFO L226 Difference]: Without dead ends: 13624 [2021-01-06 19:31:45,933 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:31:45,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13624 states. [2021-01-06 19:31:46,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13624 to 8321. [2021-01-06 19:31:46,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8321 states. [2021-01-06 19:31:46,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8321 states to 8321 states and 11655 transitions. [2021-01-06 19:31:46,616 INFO L78 Accepts]: Start accepts. Automaton has 8321 states and 11655 transitions. Word has length 169 [2021-01-06 19:31:46,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:46,616 INFO L481 AbstractCegarLoop]: Abstraction has 8321 states and 11655 transitions. [2021-01-06 19:31:46,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 8321 states and 11655 transitions. [2021-01-06 19:31:46,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:46,618 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:46,619 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:31:46,619 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:46,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:46,619 INFO L82 PathProgramCache]: Analyzing trace with hash -208052013, now seen corresponding path program 1 times [2021-01-06 19:31:46,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:46,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613978933] [2021-01-06 19:31:46,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:46,678 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:31:46,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613978933] [2021-01-06 19:31:46,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:46,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:46,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46342002] [2021-01-06 19:31:46,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:46,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:46,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:46,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:46,680 INFO L87 Difference]: Start difference. First operand 8321 states and 11655 transitions. Second operand 5 states. [2021-01-06 19:31:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:47,486 INFO L93 Difference]: Finished difference Result 17986 states and 25170 transitions. [2021-01-06 19:31:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:47,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2021-01-06 19:31:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:47,497 INFO L225 Difference]: With dead ends: 17986 [2021-01-06 19:31:47,498 INFO L226 Difference]: Without dead ends: 9725 [2021-01-06 19:31:47,508 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:31:47,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9725 states. [2021-01-06 19:31:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9725 to 8327. [2021-01-06 19:31:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8327 states. [2021-01-06 19:31:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8327 states to 8327 states and 11587 transitions. [2021-01-06 19:31:48,206 INFO L78 Accepts]: Start accepts. Automaton has 8327 states and 11587 transitions. Word has length 169 [2021-01-06 19:31:48,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:48,206 INFO L481 AbstractCegarLoop]: Abstraction has 8327 states and 11587 transitions. [2021-01-06 19:31:48,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:48,206 INFO L276 IsEmpty]: Start isEmpty. Operand 8327 states and 11587 transitions. [2021-01-06 19:31:48,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:48,207 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:48,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:31:48,208 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:48,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1855414955, now seen corresponding path program 1 times [2021-01-06 19:31:48,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:48,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382848294] [2021-01-06 19:31:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:48,280 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:31:48,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382848294] [2021-01-06 19:31:48,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:48,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:48,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648003760] [2021-01-06 19:31:48,281 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:48,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:48,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:48,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:48,282 INFO L87 Difference]: Start difference. First operand 8327 states and 11587 transitions. Second operand 4 states. [2021-01-06 19:31:50,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:50,394 INFO L93 Difference]: Finished difference Result 32053 states and 44558 transitions. [2021-01-06 19:31:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:50,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:31:50,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:50,418 INFO L225 Difference]: With dead ends: 32053 [2021-01-06 19:31:50,418 INFO L226 Difference]: Without dead ends: 23788 [2021-01-06 19:31:50,427 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,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23788 states. [2021-01-06 19:31:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23788 to 22956. [2021-01-06 19:31:52,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22956 states. [2021-01-06 19:31:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22956 states to 22956 states and 31727 transitions. [2021-01-06 19:31:52,233 INFO L78 Accepts]: Start accepts. Automaton has 22956 states and 31727 transitions. Word has length 169 [2021-01-06 19:31:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:52,233 INFO L481 AbstractCegarLoop]: Abstraction has 22956 states and 31727 transitions. [2021-01-06 19:31:52,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 22956 states and 31727 transitions. [2021-01-06 19:31:52,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:52,235 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:52,235 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:31:52,236 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1474944790, now seen corresponding path program 1 times [2021-01-06 19:31:52,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:52,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750198520] [2021-01-06 19:31:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:52,300 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:31:52,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750198520] [2021-01-06 19:31:52,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:52,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:52,301 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299147158] [2021-01-06 19:31:52,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:52,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:52,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:52,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:52,303 INFO L87 Difference]: Start difference. First operand 22956 states and 31727 transitions. Second operand 5 states. [2021-01-06 19:31:55,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:55,291 INFO L93 Difference]: Finished difference Result 59922 states and 83158 transitions. [2021-01-06 19:31:55,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:55,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2021-01-06 19:31:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:55,326 INFO L225 Difference]: With dead ends: 59922 [2021-01-06 19:31:55,326 INFO L226 Difference]: Without dead ends: 37032 [2021-01-06 19:31:55,345 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:31:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37032 states. [2021-01-06 19:31:57,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37032 to 23181. [2021-01-06 19:31:57,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23181 states. [2021-01-06 19:31:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23181 states to 23181 states and 31817 transitions. [2021-01-06 19:31:57,585 INFO L78 Accepts]: Start accepts. Automaton has 23181 states and 31817 transitions. Word has length 169 [2021-01-06 19:31:57,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:57,585 INFO L481 AbstractCegarLoop]: Abstraction has 23181 states and 31817 transitions. [2021-01-06 19:31:57,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 23181 states and 31817 transitions. [2021-01-06 19:31:57,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:31:57,587 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:57,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:31:57,588 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:57,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:57,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1593386264, now seen corresponding path program 1 times [2021-01-06 19:31:57,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:57,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451539363] [2021-01-06 19:31:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:57,651 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:31:57,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451539363] [2021-01-06 19:31:57,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:57,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:57,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12955143] [2021-01-06 19:31:57,653 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:57,653 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:57,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:57,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:57,653 INFO L87 Difference]: Start difference. First operand 23181 states and 31817 transitions. Second operand 5 states. [2021-01-06 19:31:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:59,969 INFO L93 Difference]: Finished difference Result 51179 states and 70048 transitions. [2021-01-06 19:31:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:59,969 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2021-01-06 19:31:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:59,997 INFO L225 Difference]: With dead ends: 51179 [2021-01-06 19:31:59,997 INFO L226 Difference]: Without dead ends: 28071 [2021-01-06 19:32:00,024 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:32:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28071 states. [2021-01-06 19:32:02,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28071 to 23199. [2021-01-06 19:32:02,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23199 states. [2021-01-06 19:32:02,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23199 states to 23199 states and 31631 transitions. [2021-01-06 19:32:02,157 INFO L78 Accepts]: Start accepts. Automaton has 23199 states and 31631 transitions. Word has length 169 [2021-01-06 19:32:02,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:02,157 INFO L481 AbstractCegarLoop]: Abstraction has 23199 states and 31631 transitions. [2021-01-06 19:32:02,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:02,157 INFO L276 IsEmpty]: Start isEmpty. Operand 23199 states and 31631 transitions. [2021-01-06 19:32:02,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:32:02,158 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:02,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,159 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:32:02,159 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:02,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:02,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1670540134, now seen corresponding path program 1 times [2021-01-06 19:32:02,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:02,160 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799728816] [2021-01-06 19:32:02,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:02,382 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:32:02,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799728816] [2021-01-06 19:32:02,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:02,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:02,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638400215] [2021-01-06 19:32:02,384 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:02,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:02,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:02,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:02,385 INFO L87 Difference]: Start difference. First operand 23199 states and 31631 transitions. Second operand 4 states. [2021-01-06 19:32:07,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:07,988 INFO L93 Difference]: Finished difference Result 89594 states and 122107 transitions. [2021-01-06 19:32:07,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:07,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:32:07,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:08,058 INFO L225 Difference]: With dead ends: 89594 [2021-01-06 19:32:08,058 INFO L226 Difference]: Without dead ends: 66470 [2021-01-06 19:32:08,078 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:32:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66470 states. [2021-01-06 19:32:13,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66470 to 64590. [2021-01-06 19:32:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64590 states. [2021-01-06 19:32:13,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64590 states to 64590 states and 87548 transitions. [2021-01-06 19:32:13,631 INFO L78 Accepts]: Start accepts. Automaton has 64590 states and 87548 transitions. Word has length 169 [2021-01-06 19:32:13,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:13,631 INFO L481 AbstractCegarLoop]: Abstraction has 64590 states and 87548 transitions. [2021-01-06 19:32:13,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:13,631 INFO L276 IsEmpty]: Start isEmpty. Operand 64590 states and 87548 transitions. [2021-01-06 19:32:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:32:13,633 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:13,633 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:32:13,633 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:13,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:13,634 INFO L82 PathProgramCache]: Analyzing trace with hash 763015131, now seen corresponding path program 1 times [2021-01-06 19:32:13,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:13,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762273479] [2021-01-06 19:32:13,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:13,693 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:32:13,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762273479] [2021-01-06 19:32:13,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:13,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:13,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478517773] [2021-01-06 19:32:13,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:13,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:13,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:13,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:13,695 INFO L87 Difference]: Start difference. First operand 64590 states and 87548 transitions. Second operand 5 states. [2021-01-06 19:32:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:22,165 INFO L93 Difference]: Finished difference Result 165880 states and 226232 transitions. [2021-01-06 19:32:22,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:22,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2021-01-06 19:32:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:22,426 INFO L225 Difference]: With dead ends: 165880 [2021-01-06 19:32:22,427 INFO L226 Difference]: Without dead ends: 101369 [2021-01-06 19:32:22,463 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:32:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101369 states. [2021-01-06 19:32:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101369 to 65217. [2021-01-06 19:32:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65217 states. [2021-01-06 19:32:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65217 states to 65217 states and 87800 transitions. [2021-01-06 19:32:28,724 INFO L78 Accepts]: Start accepts. Automaton has 65217 states and 87800 transitions. Word has length 169 [2021-01-06 19:32:28,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:28,724 INFO L481 AbstractCegarLoop]: Abstraction has 65217 states and 87800 transitions. [2021-01-06 19:32:28,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 65217 states and 87800 transitions. [2021-01-06 19:32:28,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:32:28,726 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:28,727 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:32:28,727 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:28,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:28,728 INFO L82 PathProgramCache]: Analyzing trace with hash -120493859, now seen corresponding path program 1 times [2021-01-06 19:32:28,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:28,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421145392] [2021-01-06 19:32:28,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:28,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:28,793 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:32:28,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421145392] [2021-01-06 19:32:28,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:28,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:28,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554982063] [2021-01-06 19:32:28,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:28,794 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:28,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:28,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:28,795 INFO L87 Difference]: Start difference. First operand 65217 states and 87800 transitions. Second operand 5 states. [2021-01-06 19:32:43,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:43,209 INFO L93 Difference]: Finished difference Result 230390 states and 313754 transitions. [2021-01-06 19:32:43,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:43,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 169 [2021-01-06 19:32:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:43,405 INFO L225 Difference]: With dead ends: 230390 [2021-01-06 19:32:43,405 INFO L226 Difference]: Without dead ends: 165259 [2021-01-06 19:32:43,465 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:32:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165259 states. [2021-01-06 19:32:50,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165259 to 66969. [2021-01-06 19:32:50,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66969 states. [2021-01-06 19:32:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66969 states to 66969 states and 89552 transitions. [2021-01-06 19:32:50,820 INFO L78 Accepts]: Start accepts. Automaton has 66969 states and 89552 transitions. Word has length 169 [2021-01-06 19:32:50,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:50,821 INFO L481 AbstractCegarLoop]: Abstraction has 66969 states and 89552 transitions. [2021-01-06 19:32:50,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 66969 states and 89552 transitions. [2021-01-06 19:32:50,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:32:50,822 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:50,823 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:32:50,823 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:50,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:50,823 INFO L82 PathProgramCache]: Analyzing trace with hash -706770081, now seen corresponding path program 1 times [2021-01-06 19:32:50,824 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:50,824 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038439467] [2021-01-06 19:32:50,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:50,895 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:32:50,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038439467] [2021-01-06 19:32:50,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:50,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:50,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203095857] [2021-01-06 19:32:50,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:50,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:50,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:50,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:50,897 INFO L87 Difference]: Start difference. First operand 66969 states and 89552 transitions. Second operand 4 states. [2021-01-06 19:33:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:09,277 INFO L93 Difference]: Finished difference Result 258106 states and 345114 transitions. [2021-01-06 19:33:09,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:33:09,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2021-01-06 19:33:09,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:09,514 INFO L225 Difference]: With dead ends: 258106 [2021-01-06 19:33:09,514 INFO L226 Difference]: Without dead ends: 191228 [2021-01-06 19:33:09,575 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:33:09,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191228 states. [2021-01-06 19:33:28,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191228 to 187064. [2021-01-06 19:33:28,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187064 states. [2021-01-06 19:33:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187064 states to 187064 states and 248853 transitions. [2021-01-06 19:33:28,791 INFO L78 Accepts]: Start accepts. Automaton has 187064 states and 248853 transitions. Word has length 169 [2021-01-06 19:33:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:28,792 INFO L481 AbstractCegarLoop]: Abstraction has 187064 states and 248853 transitions. [2021-01-06 19:33:28,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 187064 states and 248853 transitions. [2021-01-06 19:33:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2021-01-06 19:33:28,794 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:28,794 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:28,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:33:28,794 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:28,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1923956704, now seen corresponding path program 1 times [2021-01-06 19:33:28,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:28,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591162168] [2021-01-06 19:33:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:28,873 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:33:28,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591162168] [2021-01-06 19:33:28,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:28,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:33:28,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201100339] [2021-01-06 19:33:28,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:28,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:28,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:28,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:28,876 INFO L87 Difference]: Start difference. First operand 187064 states and 248853 transitions. Second operand 5 states.