/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.13.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:28:24,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:28:24,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:28:25,007 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:28:25,008 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:28:25,012 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:28:25,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:28:25,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:28:25,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:28:25,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:28:25,037 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:28:25,038 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:28:25,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:28:25,040 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:28:25,041 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:28:25,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:28:25,043 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:28:25,044 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:28:25,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:28:25,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:28:25,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:28:25,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:28:25,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:28:25,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:28:25,083 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:28:25,083 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:28:25,083 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:28:25,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:28:25,085 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:28:25,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:28:25,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:28:25,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:28:25,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:28:25,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:28:25,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:28:25,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:28:25,094 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:28:25,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:28:25,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:28:25,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:28:25,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:28:25,099 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:28:25,149 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:28:25,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:28:25,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:28:25,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:28:25,154 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:28:25,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:28:25,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:28:25,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:28:25,155 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:28:25,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:28:25,157 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:28:25,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:28:25,157 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:28:25,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:28:25,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:28:25,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:28:25,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:28:25,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:28:25,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:28:25,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:28:25,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:28:25,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:28:25,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:28:25,160 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:28:25,160 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:28:25,160 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:28:25,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:28:25,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:28:25,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:28:25,617 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:28:25,617 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:28:25,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.13.cil-1.c [2021-01-06 19:28:25,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9fd8797c0/687aac87ecfb446dbebb9869159228d9/FLAGf9c92e2e7 [2021-01-06 19:28:26,381 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:28:26,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-1.c [2021-01-06 19:28:26,400 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9fd8797c0/687aac87ecfb446dbebb9869159228d9/FLAGf9c92e2e7 [2021-01-06 19:28:26,690 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9fd8797c0/687aac87ecfb446dbebb9869159228d9 [2021-01-06 19:28:26,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:28:26,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:28:26,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:28:26,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:28:26,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:28:26,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:26,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40522293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26, skipping insertion in model container [2021-01-06 19:28:26,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:26,716 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:28:26,799 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:28:26,950 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_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[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__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[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] 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[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] 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[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_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[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_13~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[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_13~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[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_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[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_13~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[~t13_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~15,] [2021-01-06 19:28:27,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:28:27,194 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:28:27,213 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_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[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__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[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] 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[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] 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[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_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[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_13~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[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_13~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[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_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[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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[~E_13~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[~t13_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~15,] [2021-01-06 19:28:27,369 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:28:27,467 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:28:27,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27 WrapperNode [2021-01-06 19:28:27,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:28:27,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:28:27,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:28:27,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:28:27,487 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:28:27" (1/1) ... [2021-01-06 19:28:27,527 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:28:27" (1/1) ... [2021-01-06 19:28:27,687 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:28:27,688 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:28:27,688 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:28:27,688 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:28:27,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27" (1/1) ... [2021-01-06 19:28:27,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27" (1/1) ... [2021-01-06 19:28:27,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27" (1/1) ... [2021-01-06 19:28:27,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27" (1/1) ... [2021-01-06 19:28:27,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27" (1/1) ... [2021-01-06 19:28:27,858 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27" (1/1) ... [2021-01-06 19:28:27,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27" (1/1) ... [2021-01-06 19:28:27,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:28:27,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:28:27,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:28:27,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:28:27,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27" (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:28:27,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:28:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:28:27,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:28:27,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:28:32,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:28:32,741 INFO L299 CfgBuilder]: Removed 622 assume(true) statements. [2021-01-06 19:28:32,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:28:32 BoogieIcfgContainer [2021-01-06 19:28:32,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:28:32,748 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:28:32,748 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:28:32,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:28:32,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:28:26" (1/3) ... [2021-01-06 19:28:32,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba109c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:28:32, skipping insertion in model container [2021-01-06 19:28:32,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:27" (2/3) ... [2021-01-06 19:28:32,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ba109c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:28:32, skipping insertion in model container [2021-01-06 19:28:32,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:28:32" (3/3) ... [2021-01-06 19:28:32,755 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-1.c [2021-01-06 19:28:32,762 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:28:32,768 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 19:28:32,788 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 19:28:32,827 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:28:32,827 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:28:32,827 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:28:32,827 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:28:32,827 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:28:32,827 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:28:32,828 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:28:32,828 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:28:32,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states. [2021-01-06 19:28:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:32,887 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:32,888 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, 1, 1] [2021-01-06 19:28:32,889 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:32,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:32,896 INFO L82 PathProgramCache]: Analyzing trace with hash 585149193, now seen corresponding path program 1 times [2021-01-06 19:28:32,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:32,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884836815] [2021-01-06 19:28:32,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:33,283 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:28:33,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884836815] [2021-01-06 19:28:33,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:33,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:33,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146999468] [2021-01-06 19:28:33,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:33,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:33,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:33,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:33,318 INFO L87 Difference]: Start difference. First operand 1996 states. Second operand 3 states. [2021-01-06 19:28:33,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:33,546 INFO L93 Difference]: Finished difference Result 3987 states and 5999 transitions. [2021-01-06 19:28:33,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:33,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:33,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:33,609 INFO L225 Difference]: With dead ends: 3987 [2021-01-06 19:28:33,610 INFO L226 Difference]: Without dead ends: 1992 [2021-01-06 19:28:33,625 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:28:33,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2021-01-06 19:28:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1992. [2021-01-06 19:28:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2021-01-06 19:28:33,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2964 transitions. [2021-01-06 19:28:33,806 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2964 transitions. Word has length 171 [2021-01-06 19:28:33,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:33,807 INFO L481 AbstractCegarLoop]: Abstraction has 1992 states and 2964 transitions. [2021-01-06 19:28:33,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:33,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2964 transitions. [2021-01-06 19:28:33,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:33,822 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:33,822 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, 1, 1] [2021-01-06 19:28:33,823 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:28:33,826 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:33,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:33,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1992875143, now seen corresponding path program 1 times [2021-01-06 19:28:33,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:33,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716185631] [2021-01-06 19:28:33,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:34,006 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:28:34,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716185631] [2021-01-06 19:28:34,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:34,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:34,008 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951099729] [2021-01-06 19:28:34,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:34,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:34,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:34,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:34,014 INFO L87 Difference]: Start difference. First operand 1992 states and 2964 transitions. Second operand 3 states. [2021-01-06 19:28:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:34,111 INFO L93 Difference]: Finished difference Result 3971 states and 5906 transitions. [2021-01-06 19:28:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:34,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:34,123 INFO L225 Difference]: With dead ends: 3971 [2021-01-06 19:28:34,123 INFO L226 Difference]: Without dead ends: 1992 [2021-01-06 19:28:34,128 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:28:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2021-01-06 19:28:34,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1992. [2021-01-06 19:28:34,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2021-01-06 19:28:34,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2963 transitions. [2021-01-06 19:28:34,205 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2963 transitions. Word has length 171 [2021-01-06 19:28:34,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:34,208 INFO L481 AbstractCegarLoop]: Abstraction has 1992 states and 2963 transitions. [2021-01-06 19:28:34,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2963 transitions. [2021-01-06 19:28:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:34,214 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:34,215 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, 1, 1] [2021-01-06 19:28:34,215 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:28:34,215 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:34,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:34,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1325493253, now seen corresponding path program 1 times [2021-01-06 19:28:34,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:34,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039173230] [2021-01-06 19:28:34,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:34,393 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:28:34,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039173230] [2021-01-06 19:28:34,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:34,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:34,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274880383] [2021-01-06 19:28:34,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:34,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:34,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:34,396 INFO L87 Difference]: Start difference. First operand 1992 states and 2963 transitions. Second operand 3 states. [2021-01-06 19:28:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:34,642 INFO L93 Difference]: Finished difference Result 5688 states and 8435 transitions. [2021-01-06 19:28:34,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:34,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:34,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:34,665 INFO L225 Difference]: With dead ends: 5688 [2021-01-06 19:28:34,666 INFO L226 Difference]: Without dead ends: 3714 [2021-01-06 19:28:34,674 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:28:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3714 states. [2021-01-06 19:28:34,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3714 to 3710. [2021-01-06 19:28:34,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5497 transitions. [2021-01-06 19:28:34,842 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5497 transitions. Word has length 171 [2021-01-06 19:28:34,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:34,850 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5497 transitions. [2021-01-06 19:28:34,851 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:34,851 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5497 transitions. [2021-01-06 19:28:34,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:34,853 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:34,853 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, 1, 1] [2021-01-06 19:28:34,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:28:34,854 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash 962370689, now seen corresponding path program 1 times [2021-01-06 19:28:34,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:34,856 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173189113] [2021-01-06 19:28:34,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:35,021 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:28:35,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173189113] [2021-01-06 19:28:35,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:35,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:35,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714685349] [2021-01-06 19:28:35,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:35,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:35,026 INFO L87 Difference]: Start difference. First operand 3710 states and 5497 transitions. Second operand 4 states. [2021-01-06 19:28:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:35,516 INFO L93 Difference]: Finished difference Result 9122 states and 13498 transitions. [2021-01-06 19:28:35,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:35,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:35,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:35,549 INFO L225 Difference]: With dead ends: 9122 [2021-01-06 19:28:35,550 INFO L226 Difference]: Without dead ends: 5431 [2021-01-06 19:28:35,557 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:28:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5431 states. [2021-01-06 19:28:35,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5431 to 3710. [2021-01-06 19:28:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5494 transitions. [2021-01-06 19:28:35,761 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5494 transitions. Word has length 171 [2021-01-06 19:28:35,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:35,762 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5494 transitions. [2021-01-06 19:28:35,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5494 transitions. [2021-01-06 19:28:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:35,764 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:35,765 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, 1, 1] [2021-01-06 19:28:35,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:28:35,765 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:35,767 INFO L82 PathProgramCache]: Analyzing trace with hash -442820989, now seen corresponding path program 1 times [2021-01-06 19:28:35,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:35,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228004715] [2021-01-06 19:28:35,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:35,921 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:28:35,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228004715] [2021-01-06 19:28:35,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:35,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:35,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015013113] [2021-01-06 19:28:35,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:35,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:35,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:35,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:35,926 INFO L87 Difference]: Start difference. First operand 3710 states and 5494 transitions. Second operand 4 states. [2021-01-06 19:28:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:36,353 INFO L93 Difference]: Finished difference Result 9120 states and 13488 transitions. [2021-01-06 19:28:36,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:36,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:36,384 INFO L225 Difference]: With dead ends: 9120 [2021-01-06 19:28:36,384 INFO L226 Difference]: Without dead ends: 5430 [2021-01-06 19:28:36,393 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:28:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5430 states. [2021-01-06 19:28:36,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5430 to 3710. [2021-01-06 19:28:36,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5491 transitions. [2021-01-06 19:28:36,593 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5491 transitions. Word has length 171 [2021-01-06 19:28:36,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:36,593 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5491 transitions. [2021-01-06 19:28:36,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5491 transitions. [2021-01-06 19:28:36,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:36,596 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:36,596 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, 1, 1] [2021-01-06 19:28:36,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:28:36,596 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:36,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1451512897, now seen corresponding path program 1 times [2021-01-06 19:28:36,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:36,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857405570] [2021-01-06 19:28:36,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:36,736 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:28:36,737 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857405570] [2021-01-06 19:28:36,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:36,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:36,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564684492] [2021-01-06 19:28:36,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:36,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:36,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:36,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:36,739 INFO L87 Difference]: Start difference. First operand 3710 states and 5491 transitions. Second operand 3 states. [2021-01-06 19:28:37,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:37,006 INFO L93 Difference]: Finished difference Result 7398 states and 10946 transitions. [2021-01-06 19:28:37,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:37,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:37,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:37,032 INFO L225 Difference]: With dead ends: 7398 [2021-01-06 19:28:37,033 INFO L226 Difference]: Without dead ends: 3710 [2021-01-06 19:28:37,042 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:28:37,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2021-01-06 19:28:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2021-01-06 19:28:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5483 transitions. [2021-01-06 19:28:37,312 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5483 transitions. Word has length 171 [2021-01-06 19:28:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:37,312 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5483 transitions. [2021-01-06 19:28:37,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:37,313 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5483 transitions. [2021-01-06 19:28:37,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:37,315 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:37,315 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:37,315 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:28:37,316 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash -501013827, now seen corresponding path program 1 times [2021-01-06 19:28:37,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:37,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841549101] [2021-01-06 19:28:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:37,491 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:28:37,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841549101] [2021-01-06 19:28:37,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:37,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:37,494 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835127536] [2021-01-06 19:28:37,495 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:37,495 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:37,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:37,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:37,497 INFO L87 Difference]: Start difference. First operand 3710 states and 5483 transitions. Second operand 3 states. [2021-01-06 19:28:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:37,758 INFO L93 Difference]: Finished difference Result 7397 states and 10929 transitions. [2021-01-06 19:28:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:37,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:37,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:37,803 INFO L225 Difference]: With dead ends: 7397 [2021-01-06 19:28:37,803 INFO L226 Difference]: Without dead ends: 3710 [2021-01-06 19:28:37,814 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:28:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2021-01-06 19:28:38,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2021-01-06 19:28:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:38,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5475 transitions. [2021-01-06 19:28:38,045 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5475 transitions. Word has length 171 [2021-01-06 19:28:38,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:38,045 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5475 transitions. [2021-01-06 19:28:38,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:38,045 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5475 transitions. [2021-01-06 19:28:38,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:38,048 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:38,048 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, 1, 1] [2021-01-06 19:28:38,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:28:38,048 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:38,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:38,049 INFO L82 PathProgramCache]: Analyzing trace with hash 544380097, now seen corresponding path program 1 times [2021-01-06 19:28:38,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:38,050 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070608939] [2021-01-06 19:28:38,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:38,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:38,144 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:28:38,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070608939] [2021-01-06 19:28:38,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:38,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:38,145 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998267249] [2021-01-06 19:28:38,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:38,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:38,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:38,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:38,147 INFO L87 Difference]: Start difference. First operand 3710 states and 5475 transitions. Second operand 4 states. [2021-01-06 19:28:38,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:38,541 INFO L93 Difference]: Finished difference Result 9112 states and 13432 transitions. [2021-01-06 19:28:38,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:38,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:38,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:38,558 INFO L225 Difference]: With dead ends: 9112 [2021-01-06 19:28:38,558 INFO L226 Difference]: Without dead ends: 5426 [2021-01-06 19:28:38,568 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:28:38,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2021-01-06 19:28:38,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 3710. [2021-01-06 19:28:38,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5472 transitions. [2021-01-06 19:28:38,797 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5472 transitions. Word has length 171 [2021-01-06 19:28:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:38,797 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5472 transitions. [2021-01-06 19:28:38,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:38,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5472 transitions. [2021-01-06 19:28:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:38,800 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:38,800 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, 1, 1] [2021-01-06 19:28:38,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:28:38,800 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:38,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:38,801 INFO L82 PathProgramCache]: Analyzing trace with hash 279732607, now seen corresponding path program 1 times [2021-01-06 19:28:38,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:38,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715055781] [2021-01-06 19:28:38,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:38,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:28:38,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715055781] [2021-01-06 19:28:38,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:38,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:38,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060605900] [2021-01-06 19:28:38,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:38,896 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:38,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:38,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:38,897 INFO L87 Difference]: Start difference. First operand 3710 states and 5472 transitions. Second operand 4 states. [2021-01-06 19:28:39,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:39,317 INFO L93 Difference]: Finished difference Result 9110 states and 13422 transitions. [2021-01-06 19:28:39,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:39,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:39,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:39,333 INFO L225 Difference]: With dead ends: 9110 [2021-01-06 19:28:39,334 INFO L226 Difference]: Without dead ends: 5425 [2021-01-06 19:28:39,343 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:28:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5425 states. [2021-01-06 19:28:39,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5425 to 3710. [2021-01-06 19:28:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5469 transitions. [2021-01-06 19:28:39,549 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5469 transitions. Word has length 171 [2021-01-06 19:28:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:39,554 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5469 transitions. [2021-01-06 19:28:39,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:39,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5469 transitions. [2021-01-06 19:28:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:39,556 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:39,557 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, 1, 1] [2021-01-06 19:28:39,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:28:39,557 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:39,558 INFO L82 PathProgramCache]: Analyzing trace with hash -2084109055, now seen corresponding path program 1 times [2021-01-06 19:28:39,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:39,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850683429] [2021-01-06 19:28:39,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:39,665 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:28:39,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850683429] [2021-01-06 19:28:39,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:39,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:39,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301933419] [2021-01-06 19:28:39,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:39,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:39,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:39,668 INFO L87 Difference]: Start difference. First operand 3710 states and 5469 transitions. Second operand 4 states. [2021-01-06 19:28:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:40,064 INFO L93 Difference]: Finished difference Result 9108 states and 13412 transitions. [2021-01-06 19:28:40,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:40,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:40,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:40,079 INFO L225 Difference]: With dead ends: 9108 [2021-01-06 19:28:40,079 INFO L226 Difference]: Without dead ends: 5424 [2021-01-06 19:28:40,089 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:28:40,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5424 states. [2021-01-06 19:28:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5424 to 3710. [2021-01-06 19:28:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5466 transitions. [2021-01-06 19:28:40,373 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5466 transitions. Word has length 171 [2021-01-06 19:28:40,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:40,373 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5466 transitions. [2021-01-06 19:28:40,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:40,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5466 transitions. [2021-01-06 19:28:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:40,376 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:40,376 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, 1, 1] [2021-01-06 19:28:40,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:28:40,376 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:40,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:40,377 INFO L82 PathProgramCache]: Analyzing trace with hash 887679295, now seen corresponding path program 1 times [2021-01-06 19:28:40,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:40,378 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226606459] [2021-01-06 19:28:40,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:40,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226606459] [2021-01-06 19:28:40,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:40,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:40,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010419093] [2021-01-06 19:28:40,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:40,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:40,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:40,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:40,475 INFO L87 Difference]: Start difference. First operand 3710 states and 5466 transitions. Second operand 4 states. [2021-01-06 19:28:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:40,907 INFO L93 Difference]: Finished difference Result 9106 states and 13402 transitions. [2021-01-06 19:28:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:40,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:40,920 INFO L225 Difference]: With dead ends: 9106 [2021-01-06 19:28:40,920 INFO L226 Difference]: Without dead ends: 5423 [2021-01-06 19:28:40,929 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:28:40,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5423 states. [2021-01-06 19:28:41,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5423 to 3710. [2021-01-06 19:28:41,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5463 transitions. [2021-01-06 19:28:41,185 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5463 transitions. Word has length 171 [2021-01-06 19:28:41,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:41,186 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5463 transitions. [2021-01-06 19:28:41,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:41,186 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5463 transitions. [2021-01-06 19:28:41,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:41,188 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:41,189 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, 1, 1] [2021-01-06 19:28:41,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:28:41,189 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:41,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:41,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1510308543, now seen corresponding path program 1 times [2021-01-06 19:28:41,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:41,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209439564] [2021-01-06 19:28:41,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:41,290 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:28:41,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209439564] [2021-01-06 19:28:41,291 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:41,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:41,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035827069] [2021-01-06 19:28:41,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:41,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:41,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:41,294 INFO L87 Difference]: Start difference. First operand 3710 states and 5463 transitions. Second operand 3 states. [2021-01-06 19:28:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:41,514 INFO L93 Difference]: Finished difference Result 7392 states and 10884 transitions. [2021-01-06 19:28:41,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:41,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:41,524 INFO L225 Difference]: With dead ends: 7392 [2021-01-06 19:28:41,524 INFO L226 Difference]: Without dead ends: 3710 [2021-01-06 19:28:41,531 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:28:41,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2021-01-06 19:28:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2021-01-06 19:28:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5455 transitions. [2021-01-06 19:28:41,759 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5455 transitions. Word has length 171 [2021-01-06 19:28:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:41,759 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5455 transitions. [2021-01-06 19:28:41,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5455 transitions. [2021-01-06 19:28:41,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:41,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:41,762 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, 1, 1] [2021-01-06 19:28:41,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:28:41,763 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:41,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:41,763 INFO L82 PathProgramCache]: Analyzing trace with hash -897261379, now seen corresponding path program 1 times [2021-01-06 19:28:41,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:41,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615026879] [2021-01-06 19:28:41,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:41,878 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:28:41,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615026879] [2021-01-06 19:28:41,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:41,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:41,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975810540] [2021-01-06 19:28:41,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:41,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:41,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:41,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:41,881 INFO L87 Difference]: Start difference. First operand 3710 states and 5455 transitions. Second operand 4 states. [2021-01-06 19:28:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:42,325 INFO L93 Difference]: Finished difference Result 9100 states and 13367 transitions. [2021-01-06 19:28:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:42,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:42,341 INFO L225 Difference]: With dead ends: 9100 [2021-01-06 19:28:42,341 INFO L226 Difference]: Without dead ends: 5420 [2021-01-06 19:28:42,354 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:28:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2021-01-06 19:28:42,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 3710. [2021-01-06 19:28:42,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:42,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5452 transitions. [2021-01-06 19:28:42,619 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5452 transitions. Word has length 171 [2021-01-06 19:28:42,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:42,619 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5452 transitions. [2021-01-06 19:28:42,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:42,620 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5452 transitions. [2021-01-06 19:28:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:42,622 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:42,622 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, 1, 1] [2021-01-06 19:28:42,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:28:42,622 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1437690885, now seen corresponding path program 1 times [2021-01-06 19:28:42,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:42,623 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857703291] [2021-01-06 19:28:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:42,691 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:28:42,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857703291] [2021-01-06 19:28:42,692 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:42,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:42,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198541296] [2021-01-06 19:28:42,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:42,693 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:42,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:42,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:42,694 INFO L87 Difference]: Start difference. First operand 3710 states and 5452 transitions. Second operand 3 states. [2021-01-06 19:28:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:42,919 INFO L93 Difference]: Finished difference Result 7389 states and 10858 transitions. [2021-01-06 19:28:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:42,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:42,929 INFO L225 Difference]: With dead ends: 7389 [2021-01-06 19:28:42,929 INFO L226 Difference]: Without dead ends: 3710 [2021-01-06 19:28:42,936 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:28:42,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2021-01-06 19:28:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2021-01-06 19:28:43,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5444 transitions. [2021-01-06 19:28:43,210 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5444 transitions. Word has length 171 [2021-01-06 19:28:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:43,210 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5444 transitions. [2021-01-06 19:28:43,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5444 transitions. [2021-01-06 19:28:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:43,212 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:43,212 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, 1, 1] [2021-01-06 19:28:43,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:28:43,213 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:43,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:43,213 INFO L82 PathProgramCache]: Analyzing trace with hash -207468033, now seen corresponding path program 1 times [2021-01-06 19:28:43,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:43,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446257480] [2021-01-06 19:28:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:43,305 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:28:43,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446257480] [2021-01-06 19:28:43,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:43,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:43,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074213524] [2021-01-06 19:28:43,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:43,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:43,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:43,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:43,309 INFO L87 Difference]: Start difference. First operand 3710 states and 5444 transitions. Second operand 4 states. [2021-01-06 19:28:44,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:44,016 INFO L93 Difference]: Finished difference Result 8998 states and 13196 transitions. [2021-01-06 19:28:44,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:44,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:44,032 INFO L225 Difference]: With dead ends: 8998 [2021-01-06 19:28:44,032 INFO L226 Difference]: Without dead ends: 5320 [2021-01-06 19:28:44,042 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:28:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5320 states. [2021-01-06 19:28:44,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5320 to 3710. [2021-01-06 19:28:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:44,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5441 transitions. [2021-01-06 19:28:44,285 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5441 transitions. Word has length 171 [2021-01-06 19:28:44,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:44,285 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5441 transitions. [2021-01-06 19:28:44,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:44,285 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5441 transitions. [2021-01-06 19:28:44,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:44,287 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:44,287 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, 1, 1] [2021-01-06 19:28:44,287 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:28:44,287 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash 203142333, now seen corresponding path program 1 times [2021-01-06 19:28:44,288 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:44,288 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499533959] [2021-01-06 19:28:44,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:44,414 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:28:44,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499533959] [2021-01-06 19:28:44,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:44,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:44,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470092188] [2021-01-06 19:28:44,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:44,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:44,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:44,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:44,416 INFO L87 Difference]: Start difference. First operand 3710 states and 5441 transitions. Second operand 4 states. [2021-01-06 19:28:44,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:44,991 INFO L93 Difference]: Finished difference Result 8996 states and 13186 transitions. [2021-01-06 19:28:44,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:44,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:44,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:45,005 INFO L225 Difference]: With dead ends: 8996 [2021-01-06 19:28:45,006 INFO L226 Difference]: Without dead ends: 5319 [2021-01-06 19:28:45,014 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:28:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2021-01-06 19:28:45,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 3710. [2021-01-06 19:28:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5438 transitions. [2021-01-06 19:28:45,248 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5438 transitions. Word has length 171 [2021-01-06 19:28:45,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:45,248 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5438 transitions. [2021-01-06 19:28:45,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:45,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5438 transitions. [2021-01-06 19:28:45,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:45,249 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:45,250 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, 1, 1] [2021-01-06 19:28:45,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:28:45,250 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:45,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:45,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1584727489, now seen corresponding path program 1 times [2021-01-06 19:28:45,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:45,251 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632830500] [2021-01-06 19:28:45,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:45,320 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:28:45,320 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632830500] [2021-01-06 19:28:45,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:45,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:45,321 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561750295] [2021-01-06 19:28:45,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:45,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:45,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:45,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:45,322 INFO L87 Difference]: Start difference. First operand 3710 states and 5438 transitions. Second operand 3 states. [2021-01-06 19:28:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:45,674 INFO L93 Difference]: Finished difference Result 7386 states and 10827 transitions. [2021-01-06 19:28:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:45,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:45,685 INFO L225 Difference]: With dead ends: 7386 [2021-01-06 19:28:45,685 INFO L226 Difference]: Without dead ends: 3710 [2021-01-06 19:28:45,691 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:28:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2021-01-06 19:28:45,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2021-01-06 19:28:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5400 transitions. [2021-01-06 19:28:45,939 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5400 transitions. Word has length 171 [2021-01-06 19:28:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:45,940 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5400 transitions. [2021-01-06 19:28:45,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5400 transitions. [2021-01-06 19:28:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:45,941 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:45,942 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, 1, 1] [2021-01-06 19:28:45,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:28:45,942 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:45,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:45,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1653021692, now seen corresponding path program 1 times [2021-01-06 19:28:45,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:45,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617356656] [2021-01-06 19:28:45,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:45,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:46,016 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:28:46,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617356656] [2021-01-06 19:28:46,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:46,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:46,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680716806] [2021-01-06 19:28:46,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:46,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:46,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:46,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:46,021 INFO L87 Difference]: Start difference. First operand 3710 states and 5400 transitions. Second operand 4 states. [2021-01-06 19:28:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:46,637 INFO L93 Difference]: Finished difference Result 8992 states and 13082 transitions. [2021-01-06 19:28:46,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:46,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:46,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:46,653 INFO L225 Difference]: With dead ends: 8992 [2021-01-06 19:28:46,653 INFO L226 Difference]: Without dead ends: 5317 [2021-01-06 19:28:46,660 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:28:46,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5317 states. [2021-01-06 19:28:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5317 to 3710. [2021-01-06 19:28:46,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5397 transitions. [2021-01-06 19:28:46,917 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5397 transitions. Word has length 171 [2021-01-06 19:28:46,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:46,917 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5397 transitions. [2021-01-06 19:28:46,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:46,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5397 transitions. [2021-01-06 19:28:46,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:46,918 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:46,919 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, 1, 1] [2021-01-06 19:28:46,919 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:28:46,919 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:46,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:46,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1722669566, now seen corresponding path program 1 times [2021-01-06 19:28:46,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:46,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811814942] [2021-01-06 19:28:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:46,995 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:28:46,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811814942] [2021-01-06 19:28:46,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:46,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:46,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972419412] [2021-01-06 19:28:46,997 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:46,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:46,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:46,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:46,998 INFO L87 Difference]: Start difference. First operand 3710 states and 5397 transitions. Second operand 4 states. [2021-01-06 19:28:47,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:47,717 INFO L93 Difference]: Finished difference Result 8990 states and 13072 transitions. [2021-01-06 19:28:47,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:47,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:47,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:47,730 INFO L225 Difference]: With dead ends: 8990 [2021-01-06 19:28:47,730 INFO L226 Difference]: Without dead ends: 5316 [2021-01-06 19:28:47,736 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:28:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5316 states. [2021-01-06 19:28:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5316 to 3710. [2021-01-06 19:28:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5394 transitions. [2021-01-06 19:28:48,109 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5394 transitions. Word has length 171 [2021-01-06 19:28:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:48,110 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5394 transitions. [2021-01-06 19:28:48,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:48,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5394 transitions. [2021-01-06 19:28:48,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:48,111 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:48,112 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, 1, 1] [2021-01-06 19:28:48,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:28:48,112 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:48,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:48,113 INFO L82 PathProgramCache]: Analyzing trace with hash 2140558268, now seen corresponding path program 1 times [2021-01-06 19:28:48,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:48,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993377127] [2021-01-06 19:28:48,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:48,207 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:28:48,208 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993377127] [2021-01-06 19:28:48,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:48,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:48,209 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450178862] [2021-01-06 19:28:48,209 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:48,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:48,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:48,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:48,210 INFO L87 Difference]: Start difference. First operand 3710 states and 5394 transitions. Second operand 4 states. [2021-01-06 19:28:48,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:48,874 INFO L93 Difference]: Finished difference Result 8986 states and 13058 transitions. [2021-01-06 19:28:48,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:48,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:48,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:48,885 INFO L225 Difference]: With dead ends: 8986 [2021-01-06 19:28:48,885 INFO L226 Difference]: Without dead ends: 5314 [2021-01-06 19:28:48,893 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:28:48,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2021-01-06 19:28:49,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 3710. [2021-01-06 19:28:49,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5391 transitions. [2021-01-06 19:28:49,193 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5391 transitions. Word has length 171 [2021-01-06 19:28:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:49,194 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5391 transitions. [2021-01-06 19:28:49,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5391 transitions. [2021-01-06 19:28:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:49,195 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:49,195 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, 1, 1] [2021-01-06 19:28:49,195 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:28:49,195 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:49,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash 523117818, now seen corresponding path program 1 times [2021-01-06 19:28:49,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:49,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239909102] [2021-01-06 19:28:49,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:49,265 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:28:49,266 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239909102] [2021-01-06 19:28:49,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:49,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:49,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567434876] [2021-01-06 19:28:49,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:49,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:49,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:49,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:49,268 INFO L87 Difference]: Start difference. First operand 3710 states and 5391 transitions. Second operand 4 states. [2021-01-06 19:28:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:49,880 INFO L93 Difference]: Finished difference Result 8984 states and 13048 transitions. [2021-01-06 19:28:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:49,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:49,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:49,890 INFO L225 Difference]: With dead ends: 8984 [2021-01-06 19:28:49,890 INFO L226 Difference]: Without dead ends: 5313 [2021-01-06 19:28:49,896 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:28:49,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2021-01-06 19:28:50,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 3710. [2021-01-06 19:28:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:50,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5388 transitions. [2021-01-06 19:28:50,168 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5388 transitions. Word has length 171 [2021-01-06 19:28:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:50,168 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5388 transitions. [2021-01-06 19:28:50,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5388 transitions. [2021-01-06 19:28:50,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:50,169 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:50,169 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, 1, 1] [2021-01-06 19:28:50,169 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:28:50,169 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:50,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:50,170 INFO L82 PathProgramCache]: Analyzing trace with hash 886584316, now seen corresponding path program 1 times [2021-01-06 19:28:50,170 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:50,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976213099] [2021-01-06 19:28:50,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:50,241 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:28:50,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976213099] [2021-01-06 19:28:50,242 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:50,242 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:50,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117938306] [2021-01-06 19:28:50,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:50,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:50,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:50,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:50,244 INFO L87 Difference]: Start difference. First operand 3710 states and 5388 transitions. Second operand 4 states. [2021-01-06 19:28:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:50,919 INFO L93 Difference]: Finished difference Result 8982 states and 13038 transitions. [2021-01-06 19:28:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:50,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:50,927 INFO L225 Difference]: With dead ends: 8982 [2021-01-06 19:28:50,927 INFO L226 Difference]: Without dead ends: 5312 [2021-01-06 19:28:50,932 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:28:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2021-01-06 19:28:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 3710. [2021-01-06 19:28:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5385 transitions. [2021-01-06 19:28:51,159 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5385 transitions. Word has length 171 [2021-01-06 19:28:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:51,159 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5385 transitions. [2021-01-06 19:28:51,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5385 transitions. [2021-01-06 19:28:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:51,160 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:51,160 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, 1, 1] [2021-01-06 19:28:51,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:28:51,160 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:51,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:51,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1175403706, now seen corresponding path program 1 times [2021-01-06 19:28:51,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:51,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025663704] [2021-01-06 19:28:51,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:51,229 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:28:51,229 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025663704] [2021-01-06 19:28:51,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:51,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:51,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476253424] [2021-01-06 19:28:51,230 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:51,230 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:51,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:51,231 INFO L87 Difference]: Start difference. First operand 3710 states and 5385 transitions. Second operand 4 states. [2021-01-06 19:28:51,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:51,856 INFO L93 Difference]: Finished difference Result 8980 states and 13028 transitions. [2021-01-06 19:28:51,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:51,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:51,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:51,862 INFO L225 Difference]: With dead ends: 8980 [2021-01-06 19:28:51,862 INFO L226 Difference]: Without dead ends: 5311 [2021-01-06 19:28:51,866 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:28:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2021-01-06 19:28:52,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 3710. [2021-01-06 19:28:52,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:52,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5382 transitions. [2021-01-06 19:28:52,079 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5382 transitions. Word has length 171 [2021-01-06 19:28:52,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:52,080 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5382 transitions. [2021-01-06 19:28:52,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5382 transitions. [2021-01-06 19:28:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:52,080 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:52,081 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, 1, 1] [2021-01-06 19:28:52,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:28:52,081 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:52,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:52,082 INFO L82 PathProgramCache]: Analyzing trace with hash 630531132, now seen corresponding path program 1 times [2021-01-06 19:28:52,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:52,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175028943] [2021-01-06 19:28:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:52,151 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:28:52,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175028943] [2021-01-06 19:28:52,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:52,152 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:52,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180179852] [2021-01-06 19:28:52,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:52,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:52,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:52,153 INFO L87 Difference]: Start difference. First operand 3710 states and 5382 transitions. Second operand 4 states. [2021-01-06 19:28:52,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:52,743 INFO L93 Difference]: Finished difference Result 8978 states and 13018 transitions. [2021-01-06 19:28:52,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:52,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:52,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:52,750 INFO L225 Difference]: With dead ends: 8978 [2021-01-06 19:28:52,750 INFO L226 Difference]: Without dead ends: 5310 [2021-01-06 19:28:52,754 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:28:52,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5310 states. [2021-01-06 19:28:53,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5310 to 3710. [2021-01-06 19:28:53,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5379 transitions. [2021-01-06 19:28:53,119 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5379 transitions. Word has length 171 [2021-01-06 19:28:53,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:53,119 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5379 transitions. [2021-01-06 19:28:53,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5379 transitions. [2021-01-06 19:28:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:53,120 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:53,121 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, 1, 1] [2021-01-06 19:28:53,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:28:53,121 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:53,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1305691258, now seen corresponding path program 1 times [2021-01-06 19:28:53,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:53,122 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707098498] [2021-01-06 19:28:53,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:53,215 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:28:53,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707098498] [2021-01-06 19:28:53,216 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:53,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:53,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382838394] [2021-01-06 19:28:53,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:53,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:53,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:53,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:53,218 INFO L87 Difference]: Start difference. First operand 3710 states and 5379 transitions. Second operand 4 states. [2021-01-06 19:28:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:53,775 INFO L93 Difference]: Finished difference Result 8976 states and 13008 transitions. [2021-01-06 19:28:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:53,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:53,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:53,782 INFO L225 Difference]: With dead ends: 8976 [2021-01-06 19:28:53,782 INFO L226 Difference]: Without dead ends: 5309 [2021-01-06 19:28:53,787 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:28:53,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5309 states. [2021-01-06 19:28:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5309 to 3710. [2021-01-06 19:28:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:54,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5376 transitions. [2021-01-06 19:28:54,028 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5376 transitions. Word has length 171 [2021-01-06 19:28:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:54,029 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5376 transitions. [2021-01-06 19:28:54,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:54,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5376 transitions. [2021-01-06 19:28:54,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:54,030 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:54,030 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, 1, 1] [2021-01-06 19:28:54,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:28:54,030 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:54,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:54,031 INFO L82 PathProgramCache]: Analyzing trace with hash 357639292, now seen corresponding path program 1 times [2021-01-06 19:28:54,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:54,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758657191] [2021-01-06 19:28:54,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:54,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:54,124 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:28:54,124 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758657191] [2021-01-06 19:28:54,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:54,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:54,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937116604] [2021-01-06 19:28:54,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:54,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:54,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:54,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:54,127 INFO L87 Difference]: Start difference. First operand 3710 states and 5376 transitions. Second operand 3 states. [2021-01-06 19:28:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:54,511 INFO L93 Difference]: Finished difference Result 7376 states and 10692 transitions. [2021-01-06 19:28:54,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:54,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:54,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:54,515 INFO L225 Difference]: With dead ends: 7376 [2021-01-06 19:28:54,515 INFO L226 Difference]: Without dead ends: 3710 [2021-01-06 19:28:54,520 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:28:54,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2021-01-06 19:28:54,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3710. [2021-01-06 19:28:54,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3710 states. [2021-01-06 19:28:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3710 states to 3710 states and 5338 transitions. [2021-01-06 19:28:54,751 INFO L78 Accepts]: Start accepts. Automaton has 3710 states and 5338 transitions. Word has length 171 [2021-01-06 19:28:54,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:54,751 INFO L481 AbstractCegarLoop]: Abstraction has 3710 states and 5338 transitions. [2021-01-06 19:28:54,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3710 states and 5338 transitions. [2021-01-06 19:28:54,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:54,753 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:54,753 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, 1, 1] [2021-01-06 19:28:54,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:28:54,753 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:54,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:54,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1248200712, now seen corresponding path program 1 times [2021-01-06 19:28:54,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:54,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867288082] [2021-01-06 19:28:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:54,815 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:28:54,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867288082] [2021-01-06 19:28:54,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:54,816 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:54,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753816946] [2021-01-06 19:28:54,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:54,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:54,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:54,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:54,817 INFO L87 Difference]: Start difference. First operand 3710 states and 5338 transitions. Second operand 3 states. [2021-01-06 19:28:55,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:55,413 INFO L93 Difference]: Finished difference Result 10862 states and 15608 transitions. [2021-01-06 19:28:55,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:55,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:55,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:55,420 INFO L225 Difference]: With dead ends: 10862 [2021-01-06 19:28:55,420 INFO L226 Difference]: Without dead ends: 7199 [2021-01-06 19:28:55,424 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:28:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7199 states. [2021-01-06 19:28:55,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7199 to 7007. [2021-01-06 19:28:55,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7007 states. [2021-01-06 19:28:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7007 states to 7007 states and 10032 transitions. [2021-01-06 19:28:55,892 INFO L78 Accepts]: Start accepts. Automaton has 7007 states and 10032 transitions. Word has length 171 [2021-01-06 19:28:55,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:55,892 INFO L481 AbstractCegarLoop]: Abstraction has 7007 states and 10032 transitions. [2021-01-06 19:28:55,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 7007 states and 10032 transitions. [2021-01-06 19:28:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:28:55,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:55,900 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:55,900 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:28:55,900 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1901972393, now seen corresponding path program 1 times [2021-01-06 19:28:55,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:55,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322649706] [2021-01-06 19:28:55,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:56,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:56,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322649706] [2021-01-06 19:28:56,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:56,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:56,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727806964] [2021-01-06 19:28:56,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:56,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:56,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:56,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:56,012 INFO L87 Difference]: Start difference. First operand 7007 states and 10032 transitions. Second operand 5 states. [2021-01-06 19:28:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:57,658 INFO L93 Difference]: Finished difference Result 20770 states and 29750 transitions. [2021-01-06 19:28:57,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:57,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:28:57,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:57,675 INFO L225 Difference]: With dead ends: 20770 [2021-01-06 19:28:57,676 INFO L226 Difference]: Without dead ends: 13814 [2021-01-06 19:28:57,685 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:28:57,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13814 states. [2021-01-06 19:28:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13814 to 7100. [2021-01-06 19:28:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7100 states. [2021-01-06 19:28:58,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7100 states to 7100 states and 10095 transitions. [2021-01-06 19:28:58,370 INFO L78 Accepts]: Start accepts. Automaton has 7100 states and 10095 transitions. Word has length 279 [2021-01-06 19:28:58,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:58,370 INFO L481 AbstractCegarLoop]: Abstraction has 7100 states and 10095 transitions. [2021-01-06 19:28:58,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:58,370 INFO L276 IsEmpty]: Start isEmpty. Operand 7100 states and 10095 transitions. [2021-01-06 19:28:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:28:58,376 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:58,376 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28:58,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:28:58,376 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:58,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash 831621293, now seen corresponding path program 1 times [2021-01-06 19:28:58,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:58,377 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240176295] [2021-01-06 19:28:58,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:58,514 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:58,514 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240176295] [2021-01-06 19:28:58,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:58,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:58,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332791414] [2021-01-06 19:28:58,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:58,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:58,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:58,516 INFO L87 Difference]: Start difference. First operand 7100 states and 10095 transitions. Second operand 5 states. [2021-01-06 19:28:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:59,711 INFO L93 Difference]: Finished difference Result 16851 states and 23960 transitions. [2021-01-06 19:28:59,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:59,711 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:28:59,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:59,721 INFO L225 Difference]: With dead ends: 16851 [2021-01-06 19:28:59,722 INFO L226 Difference]: Without dead ends: 9816 [2021-01-06 19:28:59,732 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:28:59,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9816 states. [2021-01-06 19:29:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9816 to 7112. [2021-01-06 19:29:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7112 states. [2021-01-06 19:29:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7112 states to 7112 states and 10050 transitions. [2021-01-06 19:29:00,283 INFO L78 Accepts]: Start accepts. Automaton has 7112 states and 10050 transitions. Word has length 279 [2021-01-06 19:29:00,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:00,283 INFO L481 AbstractCegarLoop]: Abstraction has 7112 states and 10050 transitions. [2021-01-06 19:29:00,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:00,283 INFO L276 IsEmpty]: Start isEmpty. Operand 7112 states and 10050 transitions. [2021-01-06 19:29:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:00,290 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:00,290 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:00,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:29:00,290 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:00,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:00,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1814713423, now seen corresponding path program 1 times [2021-01-06 19:29:00,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:00,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31632448] [2021-01-06 19:29:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:00,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31632448] [2021-01-06 19:29:00,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:00,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:00,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22263761] [2021-01-06 19:29:00,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:00,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:00,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:00,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:00,411 INFO L87 Difference]: Start difference. First operand 7112 states and 10050 transitions. Second operand 5 states. [2021-01-06 19:29:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:02,400 INFO L93 Difference]: Finished difference Result 26357 states and 37400 transitions. [2021-01-06 19:29:02,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:02,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:02,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:02,421 INFO L225 Difference]: With dead ends: 26357 [2021-01-06 19:29:02,421 INFO L226 Difference]: Without dead ends: 19317 [2021-01-06 19:29:02,443 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:29:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19317 states. [2021-01-06 19:29:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19317 to 7295. [2021-01-06 19:29:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7295 states. [2021-01-06 19:29:03,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7295 states to 7295 states and 10233 transitions. [2021-01-06 19:29:03,322 INFO L78 Accepts]: Start accepts. Automaton has 7295 states and 10233 transitions. Word has length 279 [2021-01-06 19:29:03,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:03,323 INFO L481 AbstractCegarLoop]: Abstraction has 7295 states and 10233 transitions. [2021-01-06 19:29:03,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:03,323 INFO L276 IsEmpty]: Start isEmpty. Operand 7295 states and 10233 transitions. [2021-01-06 19:29:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:03,329 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:03,329 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:03,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:29:03,330 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1684848845, now seen corresponding path program 1 times [2021-01-06 19:29:03,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:03,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364858440] [2021-01-06 19:29:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:03,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364858440] [2021-01-06 19:29:03,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:03,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:03,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624089047] [2021-01-06 19:29:03,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:03,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:03,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:03,459 INFO L87 Difference]: Start difference. First operand 7295 states and 10233 transitions. Second operand 4 states. [2021-01-06 19:29:05,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,574 INFO L93 Difference]: Finished difference Result 24796 states and 34728 transitions. [2021-01-06 19:29:05,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:05,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2021-01-06 19:29:05,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,594 INFO L225 Difference]: With dead ends: 24796 [2021-01-06 19:29:05,594 INFO L226 Difference]: Without dead ends: 17578 [2021-01-06 19:29:05,604 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:29:05,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17578 states. [2021-01-06 19:29:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17578 to 13936. [2021-01-06 19:29:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13936 states. [2021-01-06 19:29:06,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13936 states to 13936 states and 19473 transitions. [2021-01-06 19:29:06,892 INFO L78 Accepts]: Start accepts. Automaton has 13936 states and 19473 transitions. Word has length 279 [2021-01-06 19:29:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:06,892 INFO L481 AbstractCegarLoop]: Abstraction has 13936 states and 19473 transitions. [2021-01-06 19:29:06,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 13936 states and 19473 transitions. [2021-01-06 19:29:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:06,902 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:06,902 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:06,902 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:29:06,902 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1833167988, now seen corresponding path program 1 times [2021-01-06 19:29:06,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:06,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348505776] [2021-01-06 19:29:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:06,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:07,032 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348505776] [2021-01-06 19:29:07,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:07,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:07,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616372390] [2021-01-06 19:29:07,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:07,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:07,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:07,034 INFO L87 Difference]: Start difference. First operand 13936 states and 19473 transitions. Second operand 5 states. [2021-01-06 19:29:09,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:09,775 INFO L93 Difference]: Finished difference Result 39557 states and 55516 transitions. [2021-01-06 19:29:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:09,776 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:09,804 INFO L225 Difference]: With dead ends: 39557 [2021-01-06 19:29:09,804 INFO L226 Difference]: Without dead ends: 25702 [2021-01-06 19:29:09,818 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:29:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2021-01-06 19:29:11,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 14116. [2021-01-06 19:29:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14116 states. [2021-01-06 19:29:11,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14116 states to 14116 states and 19596 transitions. [2021-01-06 19:29:11,240 INFO L78 Accepts]: Start accepts. Automaton has 14116 states and 19596 transitions. Word has length 279 [2021-01-06 19:29:11,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:11,240 INFO L481 AbstractCegarLoop]: Abstraction has 14116 states and 19596 transitions. [2021-01-06 19:29:11,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:11,240 INFO L276 IsEmpty]: Start isEmpty. Operand 14116 states and 19596 transitions. [2021-01-06 19:29:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:11,248 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:11,249 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:11,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:29:11,249 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:11,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:11,250 INFO L82 PathProgramCache]: Analyzing trace with hash 697223542, now seen corresponding path program 1 times [2021-01-06 19:29:11,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:11,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604869947] [2021-01-06 19:29:11,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:11,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:11,358 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604869947] [2021-01-06 19:29:11,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:11,359 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:11,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498897310] [2021-01-06 19:29:11,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:11,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:11,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:11,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:11,360 INFO L87 Difference]: Start difference. First operand 14116 states and 19596 transitions. Second operand 5 states. [2021-01-06 19:29:15,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:15,483 INFO L93 Difference]: Finished difference Result 50475 states and 70550 transitions. [2021-01-06 19:29:15,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:15,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:15,522 INFO L225 Difference]: With dead ends: 50475 [2021-01-06 19:29:15,522 INFO L226 Difference]: Without dead ends: 36447 [2021-01-06 19:29:15,540 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:29:15,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36447 states. [2021-01-06 19:29:17,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36447 to 14467. [2021-01-06 19:29:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14467 states. [2021-01-06 19:29:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14467 states to 14467 states and 19947 transitions. [2021-01-06 19:29:17,169 INFO L78 Accepts]: Start accepts. Automaton has 14467 states and 19947 transitions. Word has length 279 [2021-01-06 19:29:17,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:17,169 INFO L481 AbstractCegarLoop]: Abstraction has 14467 states and 19947 transitions. [2021-01-06 19:29:17,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14467 states and 19947 transitions. [2021-01-06 19:29:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:17,176 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:17,177 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:17,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:29:17,177 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:17,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:17,178 INFO L82 PathProgramCache]: Analyzing trace with hash 981209080, now seen corresponding path program 1 times [2021-01-06 19:29:17,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:17,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043502622] [2021-01-06 19:29:17,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:17,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:17,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:17,318 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043502622] [2021-01-06 19:29:17,318 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:17,318 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:17,318 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143636829] [2021-01-06 19:29:17,319 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:17,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:17,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:17,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:17,320 INFO L87 Difference]: Start difference. First operand 14467 states and 19947 transitions. Second operand 3 states. [2021-01-06 19:29:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:20,658 INFO L93 Difference]: Finished difference Result 42168 states and 58114 transitions. [2021-01-06 19:29:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:20,659 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2021-01-06 19:29:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:20,689 INFO L225 Difference]: With dead ends: 42168 [2021-01-06 19:29:20,689 INFO L226 Difference]: Without dead ends: 27794 [2021-01-06 19:29:20,705 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:29:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27794 states. [2021-01-06 19:29:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27794 to 27774. [2021-01-06 19:29:23,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27774 states. [2021-01-06 19:29:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27774 states to 27774 states and 38152 transitions. [2021-01-06 19:29:23,720 INFO L78 Accepts]: Start accepts. Automaton has 27774 states and 38152 transitions. Word has length 279 [2021-01-06 19:29:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:23,721 INFO L481 AbstractCegarLoop]: Abstraction has 27774 states and 38152 transitions. [2021-01-06 19:29:23,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27774 states and 38152 transitions. [2021-01-06 19:29:23,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:23,731 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:23,731 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:23,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:29:23,732 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:23,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:23,732 INFO L82 PathProgramCache]: Analyzing trace with hash -304228679, now seen corresponding path program 1 times [2021-01-06 19:29:23,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:23,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471986893] [2021-01-06 19:29:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:23,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:23,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:23,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471986893] [2021-01-06 19:29:23,858 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:23,858 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:23,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401074742] [2021-01-06 19:29:23,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:23,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:23,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:23,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:23,861 INFO L87 Difference]: Start difference. First operand 27774 states and 38152 transitions. Second operand 5 states. [2021-01-06 19:29:29,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:29,657 INFO L93 Difference]: Finished difference Result 77147 states and 106580 transitions. [2021-01-06 19:29:29,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:29,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:29,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:29,716 INFO L225 Difference]: With dead ends: 77147 [2021-01-06 19:29:29,716 INFO L226 Difference]: Without dead ends: 49470 [2021-01-06 19:29:29,743 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:29:29,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49470 states. [2021-01-06 19:29:33,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49470 to 28122. [2021-01-06 19:29:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28122 states. [2021-01-06 19:29:33,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28122 states to 28122 states and 38391 transitions. [2021-01-06 19:29:33,077 INFO L78 Accepts]: Start accepts. Automaton has 28122 states and 38391 transitions. Word has length 279 [2021-01-06 19:29:33,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:33,078 INFO L481 AbstractCegarLoop]: Abstraction has 28122 states and 38391 transitions. [2021-01-06 19:29:33,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 28122 states and 38391 transitions. [2021-01-06 19:29:33,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:33,089 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:33,089 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:33,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:29:33,089 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:33,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:33,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1417528765, now seen corresponding path program 1 times [2021-01-06 19:29:33,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:33,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132847954] [2021-01-06 19:29:33,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:33,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:33,220 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:33,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132847954] [2021-01-06 19:29:33,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:33,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:33,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322291675] [2021-01-06 19:29:33,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:33,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:33,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:33,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:33,222 INFO L87 Difference]: Start difference. First operand 28122 states and 38391 transitions. Second operand 4 states. [2021-01-06 19:29:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:41,383 INFO L93 Difference]: Finished difference Result 96080 states and 130976 transitions. [2021-01-06 19:29:41,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:41,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2021-01-06 19:29:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:41,445 INFO L225 Difference]: With dead ends: 96080 [2021-01-06 19:29:41,445 INFO L226 Difference]: Without dead ends: 68057 [2021-01-06 19:29:41,466 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:29:41,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68057 states. [2021-01-06 19:29:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68057 to 54097. [2021-01-06 19:29:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54097 states. [2021-01-06 19:29:47,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54097 states to 54097 states and 73584 transitions. [2021-01-06 19:29:47,791 INFO L78 Accepts]: Start accepts. Automaton has 54097 states and 73584 transitions. Word has length 279 [2021-01-06 19:29:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:47,792 INFO L481 AbstractCegarLoop]: Abstraction has 54097 states and 73584 transitions. [2021-01-06 19:29:47,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:47,792 INFO L276 IsEmpty]: Start isEmpty. Operand 54097 states and 73584 transitions. [2021-01-06 19:29:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:47,810 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:47,811 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:47,811 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:29:47,811 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:47,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:47,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1966111681, now seen corresponding path program 1 times [2021-01-06 19:29:47,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:47,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743281831] [2021-01-06 19:29:47,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:47,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743281831] [2021-01-06 19:29:47,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:47,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:47,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243906198] [2021-01-06 19:29:47,904 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:47,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:47,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:47,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:47,905 INFO L87 Difference]: Start difference. First operand 54097 states and 73584 transitions. Second operand 5 states. [2021-01-06 19:29:58,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:58,814 INFO L93 Difference]: Finished difference Result 148875 states and 203790 transitions. [2021-01-06 19:29:58,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:58,815 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:58,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:58,912 INFO L225 Difference]: With dead ends: 148875 [2021-01-06 19:29:58,913 INFO L226 Difference]: Without dead ends: 94881 [2021-01-06 19:29:58,954 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:29:59,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94881 states. [2021-01-06 19:30:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94881 to 54769. [2021-01-06 19:30:05,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54769 states. [2021-01-06 19:30:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54769 states to 54769 states and 74047 transitions. [2021-01-06 19:30:06,038 INFO L78 Accepts]: Start accepts. Automaton has 54769 states and 74047 transitions. Word has length 279 [2021-01-06 19:30:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:06,038 INFO L481 AbstractCegarLoop]: Abstraction has 54769 states and 74047 transitions. [2021-01-06 19:30:06,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 54769 states and 74047 transitions. [2021-01-06 19:30:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:30:06,057 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:06,057 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:06,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 19:30:06,058 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:06,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1480587709, now seen corresponding path program 1 times [2021-01-06 19:30:06,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:06,059 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495622559] [2021-01-06 19:30:06,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:30:06,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495622559] [2021-01-06 19:30:06,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:06,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:06,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492195176] [2021-01-06 19:30:06,187 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:06,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:06,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:06,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:06,188 INFO L87 Difference]: Start difference. First operand 54769 states and 74047 transitions. Second operand 4 states. [2021-01-06 19:30:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:22,026 INFO L93 Difference]: Finished difference Result 186901 states and 252316 transitions. [2021-01-06 19:30:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:22,026 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2021-01-06 19:30:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:22,171 INFO L225 Difference]: With dead ends: 186901 [2021-01-06 19:30:22,171 INFO L226 Difference]: Without dead ends: 132244 [2021-01-06 19:30:22,220 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:22,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132244 states. [2021-01-06 19:30:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132244 to 105408. [2021-01-06 19:30:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105408 states. [2021-01-06 19:30:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105408 states to 105408 states and 142012 transitions. [2021-01-06 19:30:35,634 INFO L78 Accepts]: Start accepts. Automaton has 105408 states and 142012 transitions. Word has length 279 [2021-01-06 19:30:35,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:35,635 INFO L481 AbstractCegarLoop]: Abstraction has 105408 states and 142012 transitions. [2021-01-06 19:30:35,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 105408 states and 142012 transitions. [2021-01-06 19:30:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:30:35,660 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:35,661 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:35,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:30:35,661 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1542059973, now seen corresponding path program 1 times [2021-01-06 19:30:35,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:35,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493455690] [2021-01-06 19:30:35,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:30:36,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493455690] [2021-01-06 19:30:36,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:36,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:36,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89531362] [2021-01-06 19:30:36,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:36,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:36,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:36,025 INFO L87 Difference]: Start difference. First operand 105408 states and 142012 transitions. Second operand 5 states. [2021-01-06 19:30:58,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:58,225 INFO L93 Difference]: Finished difference Result 284228 states and 385306 transitions. [2021-01-06 19:30:58,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:58,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:30:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:58,473 INFO L225 Difference]: With dead ends: 284228 [2021-01-06 19:30:58,474 INFO L226 Difference]: Without dead ends: 178936 [2021-01-06 19:30:58,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:30:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178936 states. [2021-01-06 19:31:12,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178936 to 106704. [2021-01-06 19:31:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106704 states. [2021-01-06 19:31:13,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106704 states to 106704 states and 142907 transitions. [2021-01-06 19:31:13,038 INFO L78 Accepts]: Start accepts. Automaton has 106704 states and 142907 transitions. Word has length 279 [2021-01-06 19:31:13,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:13,038 INFO L481 AbstractCegarLoop]: Abstraction has 106704 states and 142907 transitions. [2021-01-06 19:31:13,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:13,038 INFO L276 IsEmpty]: Start isEmpty. Operand 106704 states and 142907 transitions. [2021-01-06 19:31:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:31:13,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:13,308 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 19:31:13,308 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:13,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:13,310 INFO L82 PathProgramCache]: Analyzing trace with hash -466985015, now seen corresponding path program 1 times [2021-01-06 19:31:13,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:13,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101088572] [2021-01-06 19:31:13,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:13,474 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:31:13,474 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101088572] [2021-01-06 19:31:13,474 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:13,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:13,474 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882414739] [2021-01-06 19:31:13,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:13,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:13,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:13,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:13,476 INFO L87 Difference]: Start difference. First operand 106704 states and 142907 transitions. Second operand 5 states. [2021-01-06 19:31:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:44,006 INFO L93 Difference]: Finished difference Result 351026 states and 474159 transitions. [2021-01-06 19:31:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:44,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:31:44,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:44,563 INFO L225 Difference]: With dead ends: 351026 [2021-01-06 19:31:44,564 INFO L226 Difference]: Without dead ends: 244445 [2021-01-06 19:31:44,665 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:44,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244445 states.