/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.04.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:25:23,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:25:23,233 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:25:23,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:25:23,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:25:23,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:25:23,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:25:23,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:25:23,288 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:25:23,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:25:23,291 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:25:23,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:25:23,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:25:23,296 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:25:23,299 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:25:23,301 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:25:23,302 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:25:23,303 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:25:23,305 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:25:23,307 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:25:23,309 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:25:23,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:25:23,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:25:23,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:25:23,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:25:23,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:25:23,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:25:23,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:25:23,318 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:25:23,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:25:23,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:25:23,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:25:23,321 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:25:23,322 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:25:23,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:25:23,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:25:23,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:25:23,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:25:23,325 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:25:23,326 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:25:23,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:25:23,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:25:23,365 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:25:23,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:25:23,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:25:23,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:25:23,368 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:25:23,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:25:23,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:25:23,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:25:23,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:25:23,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:25:23,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:25:23,371 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:25:23,371 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:25:23,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:25:23,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:25:23,372 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:25:23,372 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:25:23,372 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:25:23,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:25:23,373 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:25:23,374 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:25:23,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:25:23,375 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:25:23,375 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:25:23,375 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:25:23,375 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:25:23,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:25:23,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:25:23,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:25:23,790 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:25:23,791 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:25:23,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.04.cil-1.c [2021-01-06 19:25:23,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d0946f295/142add3335b74ece9ab5a9d4fa7bda6f/FLAG96f65573f [2021-01-06 19:25:24,573 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:25:24,574 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-1.c [2021-01-06 19:25:24,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d0946f295/142add3335b74ece9ab5a9d4fa7bda6f/FLAG96f65573f [2021-01-06 19:25:24,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d0946f295/142add3335b74ece9ab5a9d4fa7bda6f [2021-01-06 19:25:24,920 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:25:24,922 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:25:24,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:25:24,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:25:24,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:25:24,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:25:24" (1/1) ... [2021-01-06 19:25:24,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f5cd25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:24, skipping insertion in model container [2021-01-06 19:25:24,930 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:25:24" (1/1) ... [2021-01-06 19:25:24,939 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:25:24,974 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:25:25,120 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-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_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] [2021-01-06 19:25:25,225 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:25:25,237 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:25:25,247 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.04.cil-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_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] [2021-01-06 19:25:25,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:25:25,339 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:25:25,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25 WrapperNode [2021-01-06 19:25:25,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:25:25,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:25:25,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:25:25,345 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:25:25,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:25:25,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:25:25,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:25:25,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:25:25,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,453 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... [2021-01-06 19:25:25,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:25:25,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:25:25,524 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:25:25,524 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:25:25,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:25:25,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:25:25,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:25:25,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:25:25,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:25:27,321 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:25:27,321 INFO L299 CfgBuilder]: Removed 161 assume(true) statements. [2021-01-06 19:25:27,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:25:27 BoogieIcfgContainer [2021-01-06 19:25:27,325 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:25:27,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:25:27,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:25:27,334 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:25:27,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:25:24" (1/3) ... [2021-01-06 19:25:27,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e645bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:25:27, skipping insertion in model container [2021-01-06 19:25:27,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:25" (2/3) ... [2021-01-06 19:25:27,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e645bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:25:27, skipping insertion in model container [2021-01-06 19:25:27,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:25:27" (3/3) ... [2021-01-06 19:25:27,341 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.04.cil-1.c [2021-01-06 19:25:27,349 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:25:27,354 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:25:27,375 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:25:27,407 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:25:27,407 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:25:27,408 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:25:27,408 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:25:27,408 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:25:27,408 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:25:27,408 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:25:27,409 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:25:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states. [2021-01-06 19:25:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:27,449 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:27,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:27,451 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:27,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:27,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1090379614, now seen corresponding path program 1 times [2021-01-06 19:25:27,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:27,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723687615] [2021-01-06 19:25:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:27,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:27,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723687615] [2021-01-06 19:25:27,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:27,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:27,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801163315] [2021-01-06 19:25:27,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:27,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:27,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:27,803 INFO L87 Difference]: Start difference. First operand 414 states. Second operand 3 states. [2021-01-06 19:25:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:27,929 INFO L93 Difference]: Finished difference Result 823 states and 1277 transitions. [2021-01-06 19:25:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:27,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:27,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:27,952 INFO L225 Difference]: With dead ends: 823 [2021-01-06 19:25:27,953 INFO L226 Difference]: Without dead ends: 410 [2021-01-06 19:25:27,958 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-01-06 19:25:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2021-01-06 19:25:28,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2021-01-06 19:25:28,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 622 transitions. [2021-01-06 19:25:28,041 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 622 transitions. Word has length 72 [2021-01-06 19:25:28,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:28,042 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 622 transitions. [2021-01-06 19:25:28,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 622 transitions. [2021-01-06 19:25:28,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:28,045 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:28,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:28,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:25:28,045 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:28,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:28,046 INFO L82 PathProgramCache]: Analyzing trace with hash 136439456, now seen corresponding path program 1 times [2021-01-06 19:25:28,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:28,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393254423] [2021-01-06 19:25:28,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:28,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:28,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393254423] [2021-01-06 19:25:28,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:28,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:28,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699415160] [2021-01-06 19:25:28,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:28,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:28,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:28,134 INFO L87 Difference]: Start difference. First operand 410 states and 622 transitions. Second operand 3 states. [2021-01-06 19:25:28,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:28,235 INFO L93 Difference]: Finished difference Result 1122 states and 1698 transitions. [2021-01-06 19:25:28,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:28,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:28,248 INFO L225 Difference]: With dead ends: 1122 [2021-01-06 19:25:28,248 INFO L226 Difference]: Without dead ends: 721 [2021-01-06 19:25:28,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:28,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-01-06 19:25:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 719. [2021-01-06 19:25:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 19:25:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1085 transitions. [2021-01-06 19:25:28,336 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1085 transitions. Word has length 72 [2021-01-06 19:25:28,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:28,337 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1085 transitions. [2021-01-06 19:25:28,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:28,338 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1085 transitions. [2021-01-06 19:25:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:28,347 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:28,347 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:28,347 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:25:28,347 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:28,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:28,351 INFO L82 PathProgramCache]: Analyzing trace with hash -51966948, now seen corresponding path program 1 times [2021-01-06 19:25:28,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:28,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391100394] [2021-01-06 19:25:28,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:28,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391100394] [2021-01-06 19:25:28,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:28,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:28,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326458098] [2021-01-06 19:25:28,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:28,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:28,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:28,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:28,461 INFO L87 Difference]: Start difference. First operand 719 states and 1085 transitions. Second operand 4 states. [2021-01-06 19:25:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:28,609 INFO L93 Difference]: Finished difference Result 1738 states and 2619 transitions. [2021-01-06 19:25:28,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:28,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:28,617 INFO L225 Difference]: With dead ends: 1738 [2021-01-06 19:25:28,617 INFO L226 Difference]: Without dead ends: 1029 [2021-01-06 19:25:28,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2021-01-06 19:25:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 719. [2021-01-06 19:25:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 19:25:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1082 transitions. [2021-01-06 19:25:28,694 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1082 transitions. Word has length 72 [2021-01-06 19:25:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:28,694 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1082 transitions. [2021-01-06 19:25:28,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1082 transitions. [2021-01-06 19:25:28,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:28,695 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:28,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:28,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:25:28,696 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:28,697 INFO L82 PathProgramCache]: Analyzing trace with hash -469363554, now seen corresponding path program 1 times [2021-01-06 19:25:28,697 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:28,697 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548456034] [2021-01-06 19:25:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:28,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548456034] [2021-01-06 19:25:28,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:28,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:28,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592756651] [2021-01-06 19:25:28,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:28,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:28,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:28,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:28,764 INFO L87 Difference]: Start difference. First operand 719 states and 1082 transitions. Second operand 4 states. [2021-01-06 19:25:28,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:28,911 INFO L93 Difference]: Finished difference Result 1736 states and 2609 transitions. [2021-01-06 19:25:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:28,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:28,918 INFO L225 Difference]: With dead ends: 1736 [2021-01-06 19:25:28,919 INFO L226 Difference]: Without dead ends: 1028 [2021-01-06 19:25:28,921 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2021-01-06 19:25:28,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 719. [2021-01-06 19:25:28,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 19:25:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1079 transitions. [2021-01-06 19:25:28,968 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1079 transitions. Word has length 72 [2021-01-06 19:25:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:28,968 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1079 transitions. [2021-01-06 19:25:28,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1079 transitions. [2021-01-06 19:25:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:28,970 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:28,970 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:28,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:25:28,970 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:28,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:28,971 INFO L82 PathProgramCache]: Analyzing trace with hash 209908700, now seen corresponding path program 1 times [2021-01-06 19:25:28,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:28,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390327413] [2021-01-06 19:25:28,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:29,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390327413] [2021-01-06 19:25:29,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:29,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:29,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681068611] [2021-01-06 19:25:29,025 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:29,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:29,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:29,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,026 INFO L87 Difference]: Start difference. First operand 719 states and 1079 transitions. Second operand 3 states. [2021-01-06 19:25:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,095 INFO L93 Difference]: Finished difference Result 1426 states and 2141 transitions. [2021-01-06 19:25:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:29,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,101 INFO L225 Difference]: With dead ends: 1426 [2021-01-06 19:25:29,101 INFO L226 Difference]: Without dead ends: 719 [2021-01-06 19:25:29,103 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-01-06 19:25:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2021-01-06 19:25:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 19:25:29,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1071 transitions. [2021-01-06 19:25:29,149 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1071 transitions. Word has length 72 [2021-01-06 19:25:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:29,150 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1071 transitions. [2021-01-06 19:25:29,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:29,150 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1071 transitions. [2021-01-06 19:25:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:29,151 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:29,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:29,151 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:25:29,151 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:29,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1700782112, now seen corresponding path program 1 times [2021-01-06 19:25:29,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:29,152 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049606185] [2021-01-06 19:25:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:29,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:25:29,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049606185] [2021-01-06 19:25:29,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:29,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:29,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697058421] [2021-01-06 19:25:29,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:29,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:29,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:29,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,210 INFO L87 Difference]: Start difference. First operand 719 states and 1071 transitions. Second operand 3 states. [2021-01-06 19:25:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,332 INFO L93 Difference]: Finished difference Result 1424 states and 2122 transitions. [2021-01-06 19:25:29,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:29,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:29,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,337 INFO L225 Difference]: With dead ends: 1424 [2021-01-06 19:25:29,337 INFO L226 Difference]: Without dead ends: 719 [2021-01-06 19:25:29,339 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-01-06 19:25:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2021-01-06 19:25:29,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 19:25:29,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1051 transitions. [2021-01-06 19:25:29,386 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1051 transitions. Word has length 72 [2021-01-06 19:25:29,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:29,386 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1051 transitions. [2021-01-06 19:25:29,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:29,386 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1051 transitions. [2021-01-06 19:25:29,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:29,389 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:29,389 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:29,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:25:29,389 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:29,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:29,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1192162725, now seen corresponding path program 1 times [2021-01-06 19:25:29,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:29,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633560519] [2021-01-06 19:25:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:29,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:29,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633560519] [2021-01-06 19:25:29,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:29,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:29,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845965034] [2021-01-06 19:25:29,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:29,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:29,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:29,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:29,454 INFO L87 Difference]: Start difference. First operand 719 states and 1051 transitions. Second operand 4 states. [2021-01-06 19:25:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,677 INFO L93 Difference]: Finished difference Result 1693 states and 2475 transitions. [2021-01-06 19:25:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:29,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,684 INFO L225 Difference]: With dead ends: 1693 [2021-01-06 19:25:29,684 INFO L226 Difference]: Without dead ends: 989 [2021-01-06 19:25:29,687 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-01-06 19:25:29,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 719. [2021-01-06 19:25:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 19:25:29,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1048 transitions. [2021-01-06 19:25:29,742 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1048 transitions. Word has length 72 [2021-01-06 19:25:29,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:29,743 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1048 transitions. [2021-01-06 19:25:29,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1048 transitions. [2021-01-06 19:25:29,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:29,744 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:29,744 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:29,744 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:25:29,744 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1625891811, now seen corresponding path program 1 times [2021-01-06 19:25:29,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:29,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090386917] [2021-01-06 19:25:29,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:29,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:29,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090386917] [2021-01-06 19:25:29,824 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:29,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:29,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44393523] [2021-01-06 19:25:29,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:29,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:29,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:29,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,826 INFO L87 Difference]: Start difference. First operand 719 states and 1048 transitions. Second operand 3 states. [2021-01-06 19:25:29,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,928 INFO L93 Difference]: Finished difference Result 1422 states and 2074 transitions. [2021-01-06 19:25:29,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:29,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:29,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,933 INFO L225 Difference]: With dead ends: 1422 [2021-01-06 19:25:29,933 INFO L226 Difference]: Without dead ends: 719 [2021-01-06 19:25:29,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-01-06 19:25:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2021-01-06 19:25:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 19:25:29,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1028 transitions. [2021-01-06 19:25:29,985 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1028 transitions. Word has length 72 [2021-01-06 19:25:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:29,985 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1028 transitions. [2021-01-06 19:25:29,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1028 transitions. [2021-01-06 19:25:29,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:29,986 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:29,986 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:29,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:25:29,986 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:29,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:29,987 INFO L82 PathProgramCache]: Analyzing trace with hash 813286440, now seen corresponding path program 1 times [2021-01-06 19:25:29,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:29,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568136065] [2021-01-06 19:25:29,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:30,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:30,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:30,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568136065] [2021-01-06 19:25:30,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:30,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:30,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495191937] [2021-01-06 19:25:30,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:30,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:30,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:30,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:30,062 INFO L87 Difference]: Start difference. First operand 719 states and 1028 transitions. Second operand 3 states. [2021-01-06 19:25:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:30,148 INFO L93 Difference]: Finished difference Result 1421 states and 2033 transitions. [2021-01-06 19:25:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:30,148 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2021-01-06 19:25:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:30,153 INFO L225 Difference]: With dead ends: 1421 [2021-01-06 19:25:30,154 INFO L226 Difference]: Without dead ends: 719 [2021-01-06 19:25:30,155 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:30,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2021-01-06 19:25:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 719. [2021-01-06 19:25:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 19:25:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1008 transitions. [2021-01-06 19:25:30,209 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1008 transitions. Word has length 72 [2021-01-06 19:25:30,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:30,209 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1008 transitions. [2021-01-06 19:25:30,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1008 transitions. [2021-01-06 19:25:30,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:30,210 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:30,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:30,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:25:30,211 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:30,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:30,211 INFO L82 PathProgramCache]: Analyzing trace with hash -167107164, now seen corresponding path program 1 times [2021-01-06 19:25:30,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:30,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448919795] [2021-01-06 19:25:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:30,253 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448919795] [2021-01-06 19:25:30,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:30,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:30,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252397774] [2021-01-06 19:25:30,254 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:30,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:30,255 INFO L87 Difference]: Start difference. First operand 719 states and 1008 transitions. Second operand 4 states. [2021-01-06 19:25:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:30,451 INFO L93 Difference]: Finished difference Result 1687 states and 2367 transitions. [2021-01-06 19:25:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:30,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:30,461 INFO L225 Difference]: With dead ends: 1687 [2021-01-06 19:25:30,461 INFO L226 Difference]: Without dead ends: 986 [2021-01-06 19:25:30,463 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:30,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2021-01-06 19:25:30,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 719. [2021-01-06 19:25:30,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2021-01-06 19:25:30,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 1005 transitions. [2021-01-06 19:25:30,529 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 1005 transitions. Word has length 72 [2021-01-06 19:25:30,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:30,529 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 1005 transitions. [2021-01-06 19:25:30,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:30,529 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1005 transitions. [2021-01-06 19:25:30,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:30,530 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:30,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:30,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:25:30,531 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:30,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:30,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1219678246, now seen corresponding path program 1 times [2021-01-06 19:25:30,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:30,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070361521] [2021-01-06 19:25:30,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:30,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070361521] [2021-01-06 19:25:30,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:30,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:30,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211080317] [2021-01-06 19:25:30,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:30,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:30,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:30,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:30,597 INFO L87 Difference]: Start difference. First operand 719 states and 1005 transitions. Second operand 5 states. [2021-01-06 19:25:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:30,798 INFO L93 Difference]: Finished difference Result 1771 states and 2490 transitions. [2021-01-06 19:25:30,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:30,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:25:30,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:30,806 INFO L225 Difference]: With dead ends: 1771 [2021-01-06 19:25:30,806 INFO L226 Difference]: Without dead ends: 1077 [2021-01-06 19:25:30,809 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:30,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2021-01-06 19:25:30,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 725. [2021-01-06 19:25:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2021-01-06 19:25:30,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 999 transitions. [2021-01-06 19:25:30,873 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 999 transitions. Word has length 72 [2021-01-06 19:25:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:30,874 INFO L481 AbstractCegarLoop]: Abstraction has 725 states and 999 transitions. [2021-01-06 19:25:30,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:30,874 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 999 transitions. [2021-01-06 19:25:30,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:30,875 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:30,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:30,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:25:30,875 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:30,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:30,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1204159528, now seen corresponding path program 1 times [2021-01-06 19:25:30,876 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:30,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940479384] [2021-01-06 19:25:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:30,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940479384] [2021-01-06 19:25:30,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:30,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:30,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568530346] [2021-01-06 19:25:30,927 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:30,927 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:30,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:30,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:30,928 INFO L87 Difference]: Start difference. First operand 725 states and 999 transitions. Second operand 5 states. [2021-01-06 19:25:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:31,253 INFO L93 Difference]: Finished difference Result 2593 states and 3581 transitions. [2021-01-06 19:25:31,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:31,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:25:31,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:31,263 INFO L225 Difference]: With dead ends: 2593 [2021-01-06 19:25:31,264 INFO L226 Difference]: Without dead ends: 1900 [2021-01-06 19:25:31,266 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:31,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2021-01-06 19:25:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 767. [2021-01-06 19:25:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2021-01-06 19:25:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1041 transitions. [2021-01-06 19:25:31,343 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1041 transitions. Word has length 72 [2021-01-06 19:25:31,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:31,343 INFO L481 AbstractCegarLoop]: Abstraction has 767 states and 1041 transitions. [2021-01-06 19:25:31,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1041 transitions. [2021-01-06 19:25:31,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:31,344 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:31,344 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:31,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:25:31,345 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:31,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:31,345 INFO L82 PathProgramCache]: Analyzing trace with hash 306766250, now seen corresponding path program 1 times [2021-01-06 19:25:31,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:31,346 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860066547] [2021-01-06 19:25:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:31,382 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860066547] [2021-01-06 19:25:31,382 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:31,382 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:31,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621250419] [2021-01-06 19:25:31,383 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:31,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:31,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:31,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:31,384 INFO L87 Difference]: Start difference. First operand 767 states and 1041 transitions. Second operand 5 states. [2021-01-06 19:25:31,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:31,635 INFO L93 Difference]: Finished difference Result 2004 states and 2727 transitions. [2021-01-06 19:25:31,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:31,635 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:25:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:31,642 INFO L225 Difference]: With dead ends: 2004 [2021-01-06 19:25:31,642 INFO L226 Difference]: Without dead ends: 1279 [2021-01-06 19:25:31,649 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2021-01-06 19:25:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 773. [2021-01-06 19:25:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2021-01-06 19:25:31,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1035 transitions. [2021-01-06 19:25:31,740 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1035 transitions. Word has length 72 [2021-01-06 19:25:31,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:31,741 INFO L481 AbstractCegarLoop]: Abstraction has 773 states and 1035 transitions. [2021-01-06 19:25:31,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:31,741 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1035 transitions. [2021-01-06 19:25:31,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:31,743 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:31,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:31,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:25:31,744 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:31,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:31,745 INFO L82 PathProgramCache]: Analyzing trace with hash 966297772, now seen corresponding path program 1 times [2021-01-06 19:25:31,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:31,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331036778] [2021-01-06 19:25:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:31,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:31,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331036778] [2021-01-06 19:25:31,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:31,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:31,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895965187] [2021-01-06 19:25:31,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:31,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:31,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:31,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:31,802 INFO L87 Difference]: Start difference. First operand 773 states and 1035 transitions. Second operand 5 states. [2021-01-06 19:25:32,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:32,063 INFO L93 Difference]: Finished difference Result 2071 states and 2777 transitions. [2021-01-06 19:25:32,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:32,064 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2021-01-06 19:25:32,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:32,071 INFO L225 Difference]: With dead ends: 2071 [2021-01-06 19:25:32,071 INFO L226 Difference]: Without dead ends: 1347 [2021-01-06 19:25:32,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2021-01-06 19:25:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 779. [2021-01-06 19:25:32,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2021-01-06 19:25:32,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1029 transitions. [2021-01-06 19:25:32,158 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1029 transitions. Word has length 72 [2021-01-06 19:25:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:32,160 INFO L481 AbstractCegarLoop]: Abstraction has 779 states and 1029 transitions. [2021-01-06 19:25:32,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:32,160 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1029 transitions. [2021-01-06 19:25:32,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-01-06 19:25:32,161 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:32,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:32,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:25:32,161 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:32,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1667897646, now seen corresponding path program 1 times [2021-01-06 19:25:32,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:32,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41789914] [2021-01-06 19:25:32,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:32,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:32,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41789914] [2021-01-06 19:25:32,213 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:32,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:32,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812146064] [2021-01-06 19:25:32,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:32,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:32,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:32,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:32,214 INFO L87 Difference]: Start difference. First operand 779 states and 1029 transitions. Second operand 4 states. [2021-01-06 19:25:32,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:32,598 INFO L93 Difference]: Finished difference Result 2767 states and 3657 transitions. [2021-01-06 19:25:32,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:32,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2021-01-06 19:25:32,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:32,608 INFO L225 Difference]: With dead ends: 2767 [2021-01-06 19:25:32,608 INFO L226 Difference]: Without dead ends: 2008 [2021-01-06 19:25:32,610 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:32,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2021-01-06 19:25:32,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1914. [2021-01-06 19:25:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2021-01-06 19:25:32,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2504 transitions. [2021-01-06 19:25:32,819 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2504 transitions. Word has length 72 [2021-01-06 19:25:32,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:32,820 INFO L481 AbstractCegarLoop]: Abstraction has 1914 states and 2504 transitions. [2021-01-06 19:25:32,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:32,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2504 transitions. [2021-01-06 19:25:32,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:32,821 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:32,822 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:32,822 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:25:32,822 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:32,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:32,823 INFO L82 PathProgramCache]: Analyzing trace with hash 512348946, now seen corresponding path program 1 times [2021-01-06 19:25:32,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:32,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519477735] [2021-01-06 19:25:32,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:25:32,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519477735] [2021-01-06 19:25:32,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:32,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:32,863 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631689711] [2021-01-06 19:25:32,863 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:32,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:32,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:32,864 INFO L87 Difference]: Start difference. First operand 1914 states and 2504 transitions. Second operand 5 states. [2021-01-06 19:25:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:33,292 INFO L93 Difference]: Finished difference Result 4662 states and 6138 transitions. [2021-01-06 19:25:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:33,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2021-01-06 19:25:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:33,306 INFO L225 Difference]: With dead ends: 4662 [2021-01-06 19:25:33,306 INFO L226 Difference]: Without dead ends: 2802 [2021-01-06 19:25:33,309 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:25:33,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2021-01-06 19:25:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 1953. [2021-01-06 19:25:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2021-01-06 19:25:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2522 transitions. [2021-01-06 19:25:33,537 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2522 transitions. Word has length 87 [2021-01-06 19:25:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:33,537 INFO L481 AbstractCegarLoop]: Abstraction has 1953 states and 2522 transitions. [2021-01-06 19:25:33,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2522 transitions. [2021-01-06 19:25:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:33,538 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:33,539 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:33,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:25:33,539 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:33,540 INFO L82 PathProgramCache]: Analyzing trace with hash -859458352, now seen corresponding path program 1 times [2021-01-06 19:25:33,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:33,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170583979] [2021-01-06 19:25:33,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:25:33,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170583979] [2021-01-06 19:25:33,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:33,584 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:33,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896359369] [2021-01-06 19:25:33,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:33,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:33,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:33,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:33,585 INFO L87 Difference]: Start difference. First operand 1953 states and 2522 transitions. Second operand 4 states. [2021-01-06 19:25:33,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:33,998 INFO L93 Difference]: Finished difference Result 4709 states and 6082 transitions. [2021-01-06 19:25:33,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:33,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 19:25:33,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:34,011 INFO L225 Difference]: With dead ends: 4709 [2021-01-06 19:25:34,011 INFO L226 Difference]: Without dead ends: 2813 [2021-01-06 19:25:34,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:25:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2813 states. [2021-01-06 19:25:34,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2813 to 1953. [2021-01-06 19:25:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2021-01-06 19:25:34,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2509 transitions. [2021-01-06 19:25:34,236 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2509 transitions. Word has length 87 [2021-01-06 19:25:34,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:34,236 INFO L481 AbstractCegarLoop]: Abstraction has 1953 states and 2509 transitions. [2021-01-06 19:25:34,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:34,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2509 transitions. [2021-01-06 19:25:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:34,238 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:34,238 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:34,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:25:34,238 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:34,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash -199926830, now seen corresponding path program 1 times [2021-01-06 19:25:34,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:34,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366681074] [2021-01-06 19:25:34,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:34,275 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:25:34,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366681074] [2021-01-06 19:25:34,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:34,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:34,276 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607372688] [2021-01-06 19:25:34,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:34,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:34,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:34,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:34,277 INFO L87 Difference]: Start difference. First operand 1953 states and 2509 transitions. Second operand 3 states. [2021-01-06 19:25:34,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:34,525 INFO L93 Difference]: Finished difference Result 3893 states and 5000 transitions. [2021-01-06 19:25:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:34,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 19:25:34,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:34,535 INFO L225 Difference]: With dead ends: 3893 [2021-01-06 19:25:34,535 INFO L226 Difference]: Without dead ends: 1953 [2021-01-06 19:25:34,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:34,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2021-01-06 19:25:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1953. [2021-01-06 19:25:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2021-01-06 19:25:34,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2489 transitions. [2021-01-06 19:25:34,798 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2489 transitions. Word has length 87 [2021-01-06 19:25:34,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:34,798 INFO L481 AbstractCegarLoop]: Abstraction has 1953 states and 2489 transitions. [2021-01-06 19:25:34,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:34,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2489 transitions. [2021-01-06 19:25:34,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:34,800 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:34,800 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:34,801 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:25:34,801 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:34,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:34,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1043932332, now seen corresponding path program 1 times [2021-01-06 19:25:34,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:34,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487528228] [2021-01-06 19:25:34,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:34,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:25:34,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487528228] [2021-01-06 19:25:34,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:34,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:34,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403835525] [2021-01-06 19:25:34,847 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:34,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:34,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:34,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:34,848 INFO L87 Difference]: Start difference. First operand 1953 states and 2489 transitions. Second operand 4 states. [2021-01-06 19:25:35,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:35,220 INFO L93 Difference]: Finished difference Result 4635 states and 5895 transitions. [2021-01-06 19:25:35,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:35,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2021-01-06 19:25:35,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:35,232 INFO L225 Difference]: With dead ends: 4635 [2021-01-06 19:25:35,233 INFO L226 Difference]: Without dead ends: 2713 [2021-01-06 19:25:35,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2021-01-06 19:25:35,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 1863. [2021-01-06 19:25:35,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1863 states. [2021-01-06 19:25:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1863 states to 1863 states and 2326 transitions. [2021-01-06 19:25:35,427 INFO L78 Accepts]: Start accepts. Automaton has 1863 states and 2326 transitions. Word has length 87 [2021-01-06 19:25:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:35,427 INFO L481 AbstractCegarLoop]: Abstraction has 1863 states and 2326 transitions. [2021-01-06 19:25:35,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1863 states and 2326 transitions. [2021-01-06 19:25:35,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:25:35,428 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:35,429 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:35,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:25:35,429 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:35,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:35,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1116318890, now seen corresponding path program 1 times [2021-01-06 19:25:35,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:35,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470078591] [2021-01-06 19:25:35,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:35,469 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470078591] [2021-01-06 19:25:35,469 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:35,469 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:35,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959180303] [2021-01-06 19:25:35,469 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:35,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:35,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:35,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:35,470 INFO L87 Difference]: Start difference. First operand 1863 states and 2326 transitions. Second operand 3 states. [2021-01-06 19:25:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:35,838 INFO L93 Difference]: Finished difference Result 5258 states and 6516 transitions. [2021-01-06 19:25:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:35,839 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 19:25:35,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:35,866 INFO L225 Difference]: With dead ends: 5258 [2021-01-06 19:25:35,866 INFO L226 Difference]: Without dead ends: 3456 [2021-01-06 19:25:35,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2021-01-06 19:25:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 3456. [2021-01-06 19:25:36,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3456 states. [2021-01-06 19:25:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 4236 transitions. [2021-01-06 19:25:36,231 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 4236 transitions. Word has length 87 [2021-01-06 19:25:36,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:36,232 INFO L481 AbstractCegarLoop]: Abstraction has 3456 states and 4236 transitions. [2021-01-06 19:25:36,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:36,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 4236 transitions. [2021-01-06 19:25:36,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 19:25:36,234 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:36,234 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:36,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:25:36,234 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:36,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash 170439851, now seen corresponding path program 1 times [2021-01-06 19:25:36,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:36,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583444753] [2021-01-06 19:25:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:36,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583444753] [2021-01-06 19:25:36,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:36,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:36,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162196053] [2021-01-06 19:25:36,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:36,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:36,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:36,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:36,283 INFO L87 Difference]: Start difference. First operand 3456 states and 4236 transitions. Second operand 3 states. [2021-01-06 19:25:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:36,936 INFO L93 Difference]: Finished difference Result 9550 states and 11686 transitions. [2021-01-06 19:25:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:36,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 19:25:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:36,950 INFO L225 Difference]: With dead ends: 9550 [2021-01-06 19:25:36,950 INFO L226 Difference]: Without dead ends: 6212 [2021-01-06 19:25:36,957 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6212 states. [2021-01-06 19:25:37,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6212 to 6210. [2021-01-06 19:25:37,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2021-01-06 19:25:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 7554 transitions. [2021-01-06 19:25:37,663 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 7554 transitions. Word has length 88 [2021-01-06 19:25:37,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:37,663 INFO L481 AbstractCegarLoop]: Abstraction has 6210 states and 7554 transitions. [2021-01-06 19:25:37,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 7554 transitions. [2021-01-06 19:25:37,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 19:25:37,665 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:37,666 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:37,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:25:37,666 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:37,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:37,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1893331105, now seen corresponding path program 1 times [2021-01-06 19:25:37,667 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:37,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564849656] [2021-01-06 19:25:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:37,708 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564849656] [2021-01-06 19:25:37,708 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:37,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:37,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505931042] [2021-01-06 19:25:37,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:37,709 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:37,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:37,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:37,710 INFO L87 Difference]: Start difference. First operand 6210 states and 7554 transitions. Second operand 3 states. [2021-01-06 19:25:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:38,909 INFO L93 Difference]: Finished difference Result 17412 states and 21156 transitions. [2021-01-06 19:25:38,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:38,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 19:25:38,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:38,931 INFO L225 Difference]: With dead ends: 17412 [2021-01-06 19:25:38,932 INFO L226 Difference]: Without dead ends: 11320 [2021-01-06 19:25:38,945 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11320 states. [2021-01-06 19:25:40,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11320 to 11318. [2021-01-06 19:25:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11318 states. [2021-01-06 19:25:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11318 states to 11318 states and 13694 transitions. [2021-01-06 19:25:40,085 INFO L78 Accepts]: Start accepts. Automaton has 11318 states and 13694 transitions. Word has length 89 [2021-01-06 19:25:40,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:40,085 INFO L481 AbstractCegarLoop]: Abstraction has 11318 states and 13694 transitions. [2021-01-06 19:25:40,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:40,086 INFO L276 IsEmpty]: Start isEmpty. Operand 11318 states and 13694 transitions. [2021-01-06 19:25:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 19:25:40,089 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:40,089 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:40,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:25:40,090 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:40,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash 522505245, now seen corresponding path program 1 times [2021-01-06 19:25:40,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:40,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872282451] [2021-01-06 19:25:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:40,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:40,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872282451] [2021-01-06 19:25:40,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:40,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:40,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803281720] [2021-01-06 19:25:40,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:40,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:40,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:40,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:40,131 INFO L87 Difference]: Start difference. First operand 11318 states and 13694 transitions. Second operand 3 states. [2021-01-06 19:25:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:41,152 INFO L93 Difference]: Finished difference Result 22408 states and 27129 transitions. [2021-01-06 19:25:41,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:41,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 19:25:41,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:41,177 INFO L225 Difference]: With dead ends: 22408 [2021-01-06 19:25:41,177 INFO L226 Difference]: Without dead ends: 11208 [2021-01-06 19:25:41,193 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:41,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11208 states. [2021-01-06 19:25:42,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11208 to 11208. [2021-01-06 19:25:42,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11208 states. [2021-01-06 19:25:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11208 states to 11208 states and 13568 transitions. [2021-01-06 19:25:42,062 INFO L78 Accepts]: Start accepts. Automaton has 11208 states and 13568 transitions. Word has length 89 [2021-01-06 19:25:42,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:42,062 INFO L481 AbstractCegarLoop]: Abstraction has 11208 states and 13568 transitions. [2021-01-06 19:25:42,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:42,062 INFO L276 IsEmpty]: Start isEmpty. Operand 11208 states and 13568 transitions. [2021-01-06 19:25:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:25:42,064 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:42,065 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:42,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:25:42,065 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash 286492441, now seen corresponding path program 1 times [2021-01-06 19:25:42,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:42,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101417007] [2021-01-06 19:25:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:42,111 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:42,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101417007] [2021-01-06 19:25:42,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:42,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:42,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412387214] [2021-01-06 19:25:42,112 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:42,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:42,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:42,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:42,113 INFO L87 Difference]: Start difference. First operand 11208 states and 13568 transitions. Second operand 3 states. [2021-01-06 19:25:43,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:43,814 INFO L93 Difference]: Finished difference Result 31510 states and 38186 transitions. [2021-01-06 19:25:43,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:43,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:25:43,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:43,856 INFO L225 Difference]: With dead ends: 31510 [2021-01-06 19:25:43,857 INFO L226 Difference]: Without dead ends: 20420 [2021-01-06 19:25:43,874 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:43,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20420 states. [2021-01-06 19:25:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20420 to 20418. [2021-01-06 19:25:45,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20418 states. [2021-01-06 19:25:45,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20418 states to 20418 states and 24684 transitions. [2021-01-06 19:25:45,540 INFO L78 Accepts]: Start accepts. Automaton has 20418 states and 24684 transitions. Word has length 90 [2021-01-06 19:25:45,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:45,540 INFO L481 AbstractCegarLoop]: Abstraction has 20418 states and 24684 transitions. [2021-01-06 19:25:45,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:45,541 INFO L276 IsEmpty]: Start isEmpty. Operand 20418 states and 24684 transitions. [2021-01-06 19:25:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:25:45,544 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:45,545 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:45,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:25:45,545 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:45,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1592638505, now seen corresponding path program 1 times [2021-01-06 19:25:45,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:45,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950169469] [2021-01-06 19:25:45,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:45,569 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:45,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950169469] [2021-01-06 19:25:45,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:45,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:45,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552431534] [2021-01-06 19:25:45,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:45,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:45,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:45,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:45,571 INFO L87 Difference]: Start difference. First operand 20418 states and 24684 transitions. Second operand 3 states. [2021-01-06 19:25:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:46,946 INFO L93 Difference]: Finished difference Result 40610 states and 49115 transitions. [2021-01-06 19:25:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:46,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:25:46,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:46,979 INFO L225 Difference]: With dead ends: 40610 [2021-01-06 19:25:46,979 INFO L226 Difference]: Without dead ends: 20310 [2021-01-06 19:25:47,003 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20310 states. [2021-01-06 19:25:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20310 to 20310. [2021-01-06 19:25:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20310 states. [2021-01-06 19:25:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20310 states to 20310 states and 24562 transitions. [2021-01-06 19:25:48,633 INFO L78 Accepts]: Start accepts. Automaton has 20310 states and 24562 transitions. Word has length 90 [2021-01-06 19:25:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:48,633 INFO L481 AbstractCegarLoop]: Abstraction has 20310 states and 24562 transitions. [2021-01-06 19:25:48,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 20310 states and 24562 transitions. [2021-01-06 19:25:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-01-06 19:25:48,636 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:48,636 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:48,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:25:48,637 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:48,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:48,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1495313167, now seen corresponding path program 1 times [2021-01-06 19:25:48,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:48,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736555856] [2021-01-06 19:25:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:48,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736555856] [2021-01-06 19:25:48,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:48,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:48,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997659995] [2021-01-06 19:25:48,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:48,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:48,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:48,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:48,679 INFO L87 Difference]: Start difference. First operand 20310 states and 24562 transitions. Second operand 3 states. [2021-01-06 19:25:51,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:51,439 INFO L93 Difference]: Finished difference Result 49104 states and 59659 transitions. [2021-01-06 19:25:51,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:51,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2021-01-06 19:25:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:51,494 INFO L225 Difference]: With dead ends: 49104 [2021-01-06 19:25:51,494 INFO L226 Difference]: Without dead ends: 34458 [2021-01-06 19:25:51,509 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34458 states. [2021-01-06 19:25:53,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34458 to 27680. [2021-01-06 19:25:53,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27680 states. [2021-01-06 19:25:53,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27680 states to 27680 states and 33500 transitions. [2021-01-06 19:25:53,731 INFO L78 Accepts]: Start accepts. Automaton has 27680 states and 33500 transitions. Word has length 91 [2021-01-06 19:25:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:53,731 INFO L481 AbstractCegarLoop]: Abstraction has 27680 states and 33500 transitions. [2021-01-06 19:25:53,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 27680 states and 33500 transitions. [2021-01-06 19:25:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 19:25:53,741 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:53,741 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:53,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:25:53,742 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:53,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:53,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1737858130, now seen corresponding path program 1 times [2021-01-06 19:25:53,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:53,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996933928] [2021-01-06 19:25:53,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:53,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996933928] [2021-01-06 19:25:53,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:53,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:53,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602249303] [2021-01-06 19:25:53,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:53,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:53,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:53,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:53,804 INFO L87 Difference]: Start difference. First operand 27680 states and 33500 transitions. Second operand 4 states. [2021-01-06 19:25:58,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:58,177 INFO L93 Difference]: Finished difference Result 88088 states and 106618 transitions. [2021-01-06 19:25:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:58,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2021-01-06 19:25:58,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:58,253 INFO L225 Difference]: With dead ends: 88088 [2021-01-06 19:25:58,253 INFO L226 Difference]: Without dead ends: 60456 [2021-01-06 19:25:58,285 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:58,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60456 states. [2021-01-06 19:26:02,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60456 to 52070. [2021-01-06 19:26:02,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52070 states. [2021-01-06 19:26:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52070 states to 52070 states and 62704 transitions. [2021-01-06 19:26:02,592 INFO L78 Accepts]: Start accepts. Automaton has 52070 states and 62704 transitions. Word has length 120 [2021-01-06 19:26:02,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:02,593 INFO L481 AbstractCegarLoop]: Abstraction has 52070 states and 62704 transitions. [2021-01-06 19:26:02,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:02,593 INFO L276 IsEmpty]: Start isEmpty. Operand 52070 states and 62704 transitions. [2021-01-06 19:26:02,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 19:26:02,610 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:02,611 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:02,611 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:26:02,611 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:02,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1791021269, now seen corresponding path program 1 times [2021-01-06 19:26:02,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:02,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450986714] [2021-01-06 19:26:02,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:02,663 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450986714] [2021-01-06 19:26:02,663 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:02,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:02,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425949181] [2021-01-06 19:26:02,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:02,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:02,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:02,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:02,664 INFO L87 Difference]: Start difference. First operand 52070 states and 62704 transitions. Second operand 3 states. [2021-01-06 19:26:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:09,735 INFO L93 Difference]: Finished difference Result 150386 states and 180738 transitions. [2021-01-06 19:26:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:09,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2021-01-06 19:26:09,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:10,004 INFO L225 Difference]: With dead ends: 150386 [2021-01-06 19:26:10,004 INFO L226 Difference]: Without dead ends: 98432 [2021-01-06 19:26:10,046 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:10,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98432 states. [2021-01-06 19:26:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98432 to 98046. [2021-01-06 19:26:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98046 states. [2021-01-06 19:26:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98046 states to 98046 states and 117472 transitions. [2021-01-06 19:26:17,880 INFO L78 Accepts]: Start accepts. Automaton has 98046 states and 117472 transitions. Word has length 120 [2021-01-06 19:26:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:17,881 INFO L481 AbstractCegarLoop]: Abstraction has 98046 states and 117472 transitions. [2021-01-06 19:26:17,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 98046 states and 117472 transitions. [2021-01-06 19:26:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2021-01-06 19:26:17,906 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:17,906 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:17,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:26:17,906 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:17,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:17,907 INFO L82 PathProgramCache]: Analyzing trace with hash -776801065, now seen corresponding path program 1 times [2021-01-06 19:26:17,907 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:17,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182157458] [2021-01-06 19:26:17,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:17,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:26:17,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182157458] [2021-01-06 19:26:17,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:17,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:17,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827016955] [2021-01-06 19:26:17,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:17,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:17,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:17,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:17,935 INFO L87 Difference]: Start difference. First operand 98046 states and 117472 transitions. Second operand 3 states. [2021-01-06 19:26:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:25,353 INFO L93 Difference]: Finished difference Result 195872 states and 234705 transitions. [2021-01-06 19:26:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:25,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2021-01-06 19:26:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:25,611 INFO L225 Difference]: With dead ends: 195872 [2021-01-06 19:26:25,611 INFO L226 Difference]: Without dead ends: 97942 [2021-01-06 19:26:25,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:25,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97942 states. [2021-01-06 19:26:33,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97942 to 97942. [2021-01-06 19:26:33,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97942 states. [2021-01-06 19:26:33,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97942 states to 97942 states and 117358 transitions. [2021-01-06 19:26:33,354 INFO L78 Accepts]: Start accepts. Automaton has 97942 states and 117358 transitions. Word has length 120 [2021-01-06 19:26:33,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:33,354 INFO L481 AbstractCegarLoop]: Abstraction has 97942 states and 117358 transitions. [2021-01-06 19:26:33,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:33,354 INFO L276 IsEmpty]: Start isEmpty. Operand 97942 states and 117358 transitions. [2021-01-06 19:26:33,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:26:33,367 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:33,367 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:33,367 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:26:33,367 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1383226793, now seen corresponding path program 1 times [2021-01-06 19:26:33,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:33,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209342388] [2021-01-06 19:26:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:33,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209342388] [2021-01-06 19:26:33,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:33,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:26:33,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629110987] [2021-01-06 19:26:33,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:33,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:33,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:33,417 INFO L87 Difference]: Start difference. First operand 97942 states and 117358 transitions. Second operand 4 states. [2021-01-06 19:26:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:40,872 INFO L93 Difference]: Finished difference Result 172730 states and 206840 transitions. [2021-01-06 19:26:40,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:26:40,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:26:40,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:40,976 INFO L225 Difference]: With dead ends: 172730 [2021-01-06 19:26:40,976 INFO L226 Difference]: Without dead ends: 74848 [2021-01-06 19:26:41,041 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74848 states. [2021-01-06 19:26:46,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74848 to 74846. [2021-01-06 19:26:46,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74846 states. [2021-01-06 19:26:46,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74846 states to 74846 states and 89033 transitions. [2021-01-06 19:26:46,832 INFO L78 Accepts]: Start accepts. Automaton has 74846 states and 89033 transitions. Word has length 121 [2021-01-06 19:26:46,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:46,832 INFO L481 AbstractCegarLoop]: Abstraction has 74846 states and 89033 transitions. [2021-01-06 19:26:46,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:46,832 INFO L276 IsEmpty]: Start isEmpty. Operand 74846 states and 89033 transitions. [2021-01-06 19:26:46,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-01-06 19:26:46,867 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:46,867 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:46,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:26:46,867 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:46,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:46,868 INFO L82 PathProgramCache]: Analyzing trace with hash -533607938, now seen corresponding path program 1 times [2021-01-06 19:26:46,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:46,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298714932] [2021-01-06 19:26:46,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:46,934 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:46,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298714932] [2021-01-06 19:26:46,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:46,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:26:46,935 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402548831] [2021-01-06 19:26:46,936 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:46,936 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:46,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:46,936 INFO L87 Difference]: Start difference. First operand 74846 states and 89033 transitions. Second operand 4 states. [2021-01-06 19:26:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:52,903 INFO L93 Difference]: Finished difference Result 149926 states and 178293 transitions. [2021-01-06 19:26:52,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:26:52,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2021-01-06 19:26:52,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:52,982 INFO L225 Difference]: With dead ends: 149926 [2021-01-06 19:26:52,982 INFO L226 Difference]: Without dead ends: 63448 [2021-01-06 19:26:53,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63448 states. [2021-01-06 19:26:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63448 to 63061. [2021-01-06 19:26:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63061 states. [2021-01-06 19:26:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63061 states to 63061 states and 74924 transitions. [2021-01-06 19:26:57,821 INFO L78 Accepts]: Start accepts. Automaton has 63061 states and 74924 transitions. Word has length 175 [2021-01-06 19:26:57,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:57,821 INFO L481 AbstractCegarLoop]: Abstraction has 63061 states and 74924 transitions. [2021-01-06 19:26:57,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:57,821 INFO L276 IsEmpty]: Start isEmpty. Operand 63061 states and 74924 transitions. [2021-01-06 19:26:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2021-01-06 19:26:57,839 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:57,839 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:57,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:26:57,839 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:57,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:57,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1741282652, now seen corresponding path program 1 times [2021-01-06 19:26:57,840 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:57,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112117922] [2021-01-06 19:26:57,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:57,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:57,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:26:57,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112117922] [2021-01-06 19:26:57,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:57,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:57,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850446937] [2021-01-06 19:26:57,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:57,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:57,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:57,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:57,920 INFO L87 Difference]: Start difference. First operand 63061 states and 74924 transitions. Second operand 4 states. [2021-01-06 19:27:03,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:03,493 INFO L93 Difference]: Finished difference Result 133458 states and 158080 transitions. [2021-01-06 19:27:03,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:03,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2021-01-06 19:27:03,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:03,574 INFO L225 Difference]: With dead ends: 133458 [2021-01-06 19:27:03,574 INFO L226 Difference]: Without dead ends: 70457 [2021-01-06 19:27:03,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:03,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70457 states. [2021-01-06 19:27:08,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70457 to 61285. [2021-01-06 19:27:08,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61285 states. [2021-01-06 19:27:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61285 states to 61285 states and 71323 transitions. [2021-01-06 19:27:08,377 INFO L78 Accepts]: Start accepts. Automaton has 61285 states and 71323 transitions. Word has length 175 [2021-01-06 19:27:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:08,378 INFO L481 AbstractCegarLoop]: Abstraction has 61285 states and 71323 transitions. [2021-01-06 19:27:08,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 61285 states and 71323 transitions. [2021-01-06 19:27:08,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2021-01-06 19:27:08,398 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:08,398 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:08,399 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:27:08,399 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:08,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:08,399 INFO L82 PathProgramCache]: Analyzing trace with hash -757245354, now seen corresponding path program 1 times [2021-01-06 19:27:08,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:08,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720488535] [2021-01-06 19:27:08,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:08,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-01-06 19:27:08,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720488535] [2021-01-06 19:27:08,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:08,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:08,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779348103] [2021-01-06 19:27:08,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:08,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:08,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:08,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:08,491 INFO L87 Difference]: Start difference. First operand 61285 states and 71323 transitions. Second operand 3 states. [2021-01-06 19:27:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:13,902 INFO L93 Difference]: Finished difference Result 133258 states and 154868 transitions. [2021-01-06 19:27:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:13,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2021-01-06 19:27:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:13,981 INFO L225 Difference]: With dead ends: 133258 [2021-01-06 19:27:13,981 INFO L226 Difference]: Without dead ends: 72012 [2021-01-06 19:27:14,012 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:27:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72012 states. [2021-01-06 19:27:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72012 to 71692. [2021-01-06 19:27:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71692 states. [2021-01-06 19:27:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71692 states to 71692 states and 83025 transitions. [2021-01-06 19:27:20,102 INFO L78 Accepts]: Start accepts. Automaton has 71692 states and 83025 transitions. Word has length 210 [2021-01-06 19:27:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:20,103 INFO L481 AbstractCegarLoop]: Abstraction has 71692 states and 83025 transitions. [2021-01-06 19:27:20,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:20,103 INFO L276 IsEmpty]: Start isEmpty. Operand 71692 states and 83025 transitions. [2021-01-06 19:27:20,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2021-01-06 19:27:20,139 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:20,140 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:20,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:27:20,140 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash -830501553, now seen corresponding path program 1 times [2021-01-06 19:27:20,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:20,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99737607] [2021-01-06 19:27:20,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:20,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99737607] [2021-01-06 19:27:20,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:20,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:27:20,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391320316] [2021-01-06 19:27:20,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:20,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:20,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:20,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:20,219 INFO L87 Difference]: Start difference. First operand 71692 states and 83025 transitions. Second operand 4 states.