/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.12.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:28:24,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:28:24,493 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:28:24,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:28:24,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:28:24,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:28:24,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:28:24,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:28:24,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:28:24,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:28:24,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:28:24,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:28:24,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:28:24,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:28:24,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:28:24,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:28:24,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:28:24,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:28:24,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:28:24,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:28:24,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:28:24,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:28:24,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:28:24,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:28:24,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:28:24,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:28:24,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:28:24,577 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:28:24,577 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:28:24,579 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:28:24,579 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:28:24,580 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:28:24,581 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:28:24,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:28:24,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:28:24,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:28:24,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:28:24,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:28:24,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:28:24,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:28:24,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:28:24,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-01-06 19:28:24,617 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:28:24,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:28:24,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:28:24,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:28:24,620 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:28:24,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:28:24,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:28:24,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:28:24,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:28:24,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:28:24,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:28:24,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:28:24,622 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:28:24,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:28:24,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:28:24,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:28:24,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:28:24,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:28:24,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:28:24,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:28:24,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:28:24,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:28:24,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:28:24,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:28:24,624 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:28:24,625 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-01-06 19:28:25,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:28:25,074 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:28:25,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:28:25,080 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:28:25,081 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:28:25,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.12.cil-2.c [2021-01-06 19:28:25,166 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/214909cb9/11728df63bee4ef39e95424f38cb1db3/FLAGe3c2d08d8 [2021-01-06 19:28:25,875 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:28:25,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.12.cil-2.c [2021-01-06 19:28:25,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/214909cb9/11728df63bee4ef39e95424f38cb1db3/FLAGe3c2d08d8 [2021-01-06 19:28:26,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/214909cb9/11728df63bee4ef39e95424f38cb1db3 [2021-01-06 19:28:26,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:28:26,194 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:28:26,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:28:26,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:28:26,202 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:28:26,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:26,206 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bab51f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26, skipping insertion in model container [2021-01-06 19:28:26,206 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:26,215 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:28:26,293 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:28:26,436 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.12.cil-2.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] [2021-01-06 19:28:26,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:28:26,679 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:28:26,695 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.12.cil-2.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] [2021-01-06 19:28:26,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:28:26,838 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:28:26,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26 WrapperNode [2021-01-06 19:28:26,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:28:26,840 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:28:26,840 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:28:26,840 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:28:26,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:26,887 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:27,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:28:27,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:28:27,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:28:27,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:28:27,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:27,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:27,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:27,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:27,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:27,209 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:27,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... [2021-01-06 19:28:27,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:28:27,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:28:27,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:28:27,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:28:27,250 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:28:27,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:28:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:28:27,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:28:27,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:28:30,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:28:30,564 INFO L299 CfgBuilder]: Removed 553 assume(true) statements. [2021-01-06 19:28:30,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:28:30 BoogieIcfgContainer [2021-01-06 19:28:30,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:28:30,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:28:30,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:28:30,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:28:30,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:28:26" (1/3) ... [2021-01-06 19:28:30,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d41f34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:28:30, skipping insertion in model container [2021-01-06 19:28:30,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:26" (2/3) ... [2021-01-06 19:28:30,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d41f34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:28:30, skipping insertion in model container [2021-01-06 19:28:30,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:28:30" (3/3) ... [2021-01-06 19:28:30,577 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.12.cil-2.c [2021-01-06 19:28:30,584 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:28:30,590 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:28:30,610 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:28:30,648 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:28:30,648 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:28:30,648 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:28:30,648 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:28:30,649 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:28:30,649 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:28:30,649 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:28:30,649 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:28:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states. [2021-01-06 19:28:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:30,711 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:30,712 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:30,713 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:30,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:30,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1063150512, now seen corresponding path program 1 times [2021-01-06 19:28:30,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:30,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716993848] [2021-01-06 19:28:30,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:31,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:31,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716993848] [2021-01-06 19:28:31,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:31,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:31,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197075503] [2021-01-06 19:28:31,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:31,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:31,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:31,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:31,159 INFO L87 Difference]: Start difference. First operand 1758 states. Second operand 3 states. [2021-01-06 19:28:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:31,326 INFO L93 Difference]: Finished difference Result 3511 states and 5293 transitions. [2021-01-06 19:28:31,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:31,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 19:28:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:31,361 INFO L225 Difference]: With dead ends: 3511 [2021-01-06 19:28:31,362 INFO L226 Difference]: Without dead ends: 1754 [2021-01-06 19:28:31,375 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:31,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2021-01-06 19:28:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2021-01-06 19:28:31,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2021-01-06 19:28:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2614 transitions. [2021-01-06 19:28:31,527 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2614 transitions. Word has length 160 [2021-01-06 19:28:31,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:31,528 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 2614 transitions. [2021-01-06 19:28:31,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2614 transitions. [2021-01-06 19:28:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:31,539 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:31,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:31,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:28:31,541 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:31,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:31,542 INFO L82 PathProgramCache]: Analyzing trace with hash 82195698, now seen corresponding path program 1 times [2021-01-06 19:28:31,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:31,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748977653] [2021-01-06 19:28:31,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:31,750 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748977653] [2021-01-06 19:28:31,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:31,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:31,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339641518] [2021-01-06 19:28:31,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:31,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:31,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:31,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:31,759 INFO L87 Difference]: Start difference. First operand 1754 states and 2614 transitions. Second operand 3 states. [2021-01-06 19:28:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:31,863 INFO L93 Difference]: Finished difference Result 3495 states and 5206 transitions. [2021-01-06 19:28:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:31,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 19:28:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:31,874 INFO L225 Difference]: With dead ends: 3495 [2021-01-06 19:28:31,875 INFO L226 Difference]: Without dead ends: 1754 [2021-01-06 19:28:31,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1754 states. [2021-01-06 19:28:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1754 to 1754. [2021-01-06 19:28:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2021-01-06 19:28:31,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2613 transitions. [2021-01-06 19:28:31,943 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2613 transitions. Word has length 160 [2021-01-06 19:28:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:31,946 INFO L481 AbstractCegarLoop]: Abstraction has 1754 states and 2613 transitions. [2021-01-06 19:28:31,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:31,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2613 transitions. [2021-01-06 19:28:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:31,949 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:31,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:31,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:28:31,950 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:31,954 INFO L82 PathProgramCache]: Analyzing trace with hash 346843188, now seen corresponding path program 1 times [2021-01-06 19:28:31,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:31,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722367815] [2021-01-06 19:28:31,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:32,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722367815] [2021-01-06 19:28:32,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:32,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:32,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27003378] [2021-01-06 19:28:32,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:32,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:32,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:32,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:32,117 INFO L87 Difference]: Start difference. First operand 1754 states and 2613 transitions. Second operand 3 states. [2021-01-06 19:28:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:32,310 INFO L93 Difference]: Finished difference Result 4994 states and 7417 transitions. [2021-01-06 19:28:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:32,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 19:28:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:32,327 INFO L225 Difference]: With dead ends: 4994 [2021-01-06 19:28:32,328 INFO L226 Difference]: Without dead ends: 3257 [2021-01-06 19:28:32,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:32,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3257 states. [2021-01-06 19:28:32,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3257 to 3255. [2021-01-06 19:28:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4828 transitions. [2021-01-06 19:28:32,461 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4828 transitions. Word has length 160 [2021-01-06 19:28:32,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:32,468 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4828 transitions. [2021-01-06 19:28:32,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:32,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4828 transitions. [2021-01-06 19:28:32,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:32,471 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:32,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:32,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:28:32,471 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:32,472 INFO L82 PathProgramCache]: Analyzing trace with hash -686676560, now seen corresponding path program 1 times [2021-01-06 19:28:32,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:32,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457650647] [2021-01-06 19:28:32,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:32,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457650647] [2021-01-06 19:28:32,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:32,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:32,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610258081] [2021-01-06 19:28:32,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:32,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:32,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:32,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:32,581 INFO L87 Difference]: Start difference. First operand 3255 states and 4828 transitions. Second operand 4 states. [2021-01-06 19:28:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:33,005 INFO L93 Difference]: Finished difference Result 7994 states and 11842 transitions. [2021-01-06 19:28:33,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:33,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:33,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:33,035 INFO L225 Difference]: With dead ends: 7994 [2021-01-06 19:28:33,036 INFO L226 Difference]: Without dead ends: 4757 [2021-01-06 19:28:33,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4757 states. [2021-01-06 19:28:33,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4757 to 3255. [2021-01-06 19:28:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4825 transitions. [2021-01-06 19:28:33,227 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4825 transitions. Word has length 160 [2021-01-06 19:28:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:33,228 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4825 transitions. [2021-01-06 19:28:33,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4825 transitions. [2021-01-06 19:28:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:33,230 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:33,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:33,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:28:33,231 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:33,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash -260122062, now seen corresponding path program 1 times [2021-01-06 19:28:33,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:33,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715381780] [2021-01-06 19:28:33,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:33,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715381780] [2021-01-06 19:28:33,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:33,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:33,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83700520] [2021-01-06 19:28:33,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:33,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:33,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:33,372 INFO L87 Difference]: Start difference. First operand 3255 states and 4825 transitions. Second operand 4 states. [2021-01-06 19:28:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:33,772 INFO L93 Difference]: Finished difference Result 7992 states and 11832 transitions. [2021-01-06 19:28:33,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:33,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:33,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:33,798 INFO L225 Difference]: With dead ends: 7992 [2021-01-06 19:28:33,798 INFO L226 Difference]: Without dead ends: 4756 [2021-01-06 19:28:33,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:33,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4756 states. [2021-01-06 19:28:33,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4756 to 3255. [2021-01-06 19:28:33,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4822 transitions. [2021-01-06 19:28:33,980 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4822 transitions. Word has length 160 [2021-01-06 19:28:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:33,980 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4822 transitions. [2021-01-06 19:28:33,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4822 transitions. [2021-01-06 19:28:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:33,982 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:33,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:33,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:28:33,983 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:33,984 INFO L82 PathProgramCache]: Analyzing trace with hash -800551568, now seen corresponding path program 1 times [2021-01-06 19:28:33,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:33,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99926043] [2021-01-06 19:28:33,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:34,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99926043] [2021-01-06 19:28:34,117 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:34,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:34,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844909676] [2021-01-06 19:28:34,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:34,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:34,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:34,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:34,119 INFO L87 Difference]: Start difference. First operand 3255 states and 4822 transitions. Second operand 4 states. [2021-01-06 19:28:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:34,475 INFO L93 Difference]: Finished difference Result 7990 states and 11822 transitions. [2021-01-06 19:28:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:34,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:34,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:34,500 INFO L225 Difference]: With dead ends: 7990 [2021-01-06 19:28:34,500 INFO L226 Difference]: Without dead ends: 4755 [2021-01-06 19:28:34,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4755 states. [2021-01-06 19:28:34,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4755 to 3255. [2021-01-06 19:28:34,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4819 transitions. [2021-01-06 19:28:34,692 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4819 transitions. Word has length 160 [2021-01-06 19:28:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:34,693 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4819 transitions. [2021-01-06 19:28:34,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4819 transitions. [2021-01-06 19:28:34,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:34,695 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:34,695 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:34,696 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:28:34,696 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:34,701 INFO L82 PathProgramCache]: Analyzing trace with hash -956532110, now seen corresponding path program 1 times [2021-01-06 19:28:34,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:34,702 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20014233] [2021-01-06 19:28:34,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:34,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20014233] [2021-01-06 19:28:34,806 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:34,806 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:34,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138419134] [2021-01-06 19:28:34,807 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:34,807 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:34,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:34,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:34,808 INFO L87 Difference]: Start difference. First operand 3255 states and 4819 transitions. Second operand 3 states. [2021-01-06 19:28:34,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:34,991 INFO L93 Difference]: Finished difference Result 6488 states and 9603 transitions. [2021-01-06 19:28:34,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:34,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 19:28:34,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:35,009 INFO L225 Difference]: With dead ends: 6488 [2021-01-06 19:28:35,010 INFO L226 Difference]: Without dead ends: 3255 [2021-01-06 19:28:35,018 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:35,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2021-01-06 19:28:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3255. [2021-01-06 19:28:35,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4811 transitions. [2021-01-06 19:28:35,203 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4811 transitions. Word has length 160 [2021-01-06 19:28:35,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:35,204 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4811 transitions. [2021-01-06 19:28:35,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4811 transitions. [2021-01-06 19:28:35,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:35,206 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:35,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:35,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:28:35,206 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:35,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:35,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1550565364, now seen corresponding path program 1 times [2021-01-06 19:28:35,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:35,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851920811] [2021-01-06 19:28:35,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:35,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:35,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851920811] [2021-01-06 19:28:35,302 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:35,303 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:35,303 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618786341] [2021-01-06 19:28:35,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:35,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:35,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:35,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:35,304 INFO L87 Difference]: Start difference. First operand 3255 states and 4811 transitions. Second operand 4 states. [2021-01-06 19:28:35,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:35,643 INFO L93 Difference]: Finished difference Result 7984 states and 11787 transitions. [2021-01-06 19:28:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:35,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:35,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:35,680 INFO L225 Difference]: With dead ends: 7984 [2021-01-06 19:28:35,680 INFO L226 Difference]: Without dead ends: 4752 [2021-01-06 19:28:35,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:35,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4752 states. [2021-01-06 19:28:35,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4752 to 3255. [2021-01-06 19:28:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:35,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4808 transitions. [2021-01-06 19:28:35,931 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4808 transitions. Word has length 160 [2021-01-06 19:28:35,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:35,932 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4808 transitions. [2021-01-06 19:28:35,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:35,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4808 transitions. [2021-01-06 19:28:35,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:35,935 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:35,935 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:35,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:28:35,935 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:35,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:35,936 INFO L82 PathProgramCache]: Analyzing trace with hash -585317838, now seen corresponding path program 1 times [2021-01-06 19:28:35,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:35,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606926608] [2021-01-06 19:28:35,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:36,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:36,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606926608] [2021-01-06 19:28:36,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:36,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:36,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018492848] [2021-01-06 19:28:36,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:36,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:36,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:36,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:36,016 INFO L87 Difference]: Start difference. First operand 3255 states and 4808 transitions. Second operand 4 states. [2021-01-06 19:28:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:36,345 INFO L93 Difference]: Finished difference Result 7982 states and 11777 transitions. [2021-01-06 19:28:36,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:36,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:36,359 INFO L225 Difference]: With dead ends: 7982 [2021-01-06 19:28:36,359 INFO L226 Difference]: Without dead ends: 4751 [2021-01-06 19:28:36,366 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:36,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4751 states. [2021-01-06 19:28:36,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4751 to 3255. [2021-01-06 19:28:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4805 transitions. [2021-01-06 19:28:36,629 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4805 transitions. Word has length 160 [2021-01-06 19:28:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:36,630 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4805 transitions. [2021-01-06 19:28:36,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4805 transitions. [2021-01-06 19:28:36,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:36,632 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:36,633 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:36,633 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:28:36,633 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:36,634 INFO L82 PathProgramCache]: Analyzing trace with hash -515669964, now seen corresponding path program 1 times [2021-01-06 19:28:36,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:36,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134903502] [2021-01-06 19:28:36,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:36,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134903502] [2021-01-06 19:28:36,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:36,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:36,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431014939] [2021-01-06 19:28:36,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:36,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:36,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:36,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:36,719 INFO L87 Difference]: Start difference. First operand 3255 states and 4805 transitions. Second operand 4 states. [2021-01-06 19:28:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:37,072 INFO L93 Difference]: Finished difference Result 7980 states and 11767 transitions. [2021-01-06 19:28:37,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:37,073 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:37,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:37,084 INFO L225 Difference]: With dead ends: 7980 [2021-01-06 19:28:37,084 INFO L226 Difference]: Without dead ends: 4750 [2021-01-06 19:28:37,093 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:37,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4750 states. [2021-01-06 19:28:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4750 to 3255. [2021-01-06 19:28:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4802 transitions. [2021-01-06 19:28:37,319 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4802 transitions. Word has length 160 [2021-01-06 19:28:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:37,319 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4802 transitions. [2021-01-06 19:28:37,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4802 transitions. [2021-01-06 19:28:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:37,322 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:37,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:37,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:28:37,322 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:37,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:37,323 INFO L82 PathProgramCache]: Analyzing trace with hash -97781262, now seen corresponding path program 1 times [2021-01-06 19:28:37,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:37,324 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384537501] [2021-01-06 19:28:37,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:37,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:37,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384537501] [2021-01-06 19:28:37,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:37,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:37,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242694786] [2021-01-06 19:28:37,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:37,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:37,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:37,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:37,401 INFO L87 Difference]: Start difference. First operand 3255 states and 4802 transitions. Second operand 4 states. [2021-01-06 19:28:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:37,750 INFO L93 Difference]: Finished difference Result 7978 states and 11757 transitions. [2021-01-06 19:28:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:37,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:37,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:37,763 INFO L225 Difference]: With dead ends: 7978 [2021-01-06 19:28:37,763 INFO L226 Difference]: Without dead ends: 4749 [2021-01-06 19:28:37,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4749 states. [2021-01-06 19:28:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4749 to 3255. [2021-01-06 19:28:38,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4799 transitions. [2021-01-06 19:28:38,009 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4799 transitions. Word has length 160 [2021-01-06 19:28:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:38,010 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4799 transitions. [2021-01-06 19:28:38,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4799 transitions. [2021-01-06 19:28:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:38,012 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:38,012 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:38,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:28:38,012 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:38,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1301172340, now seen corresponding path program 1 times [2021-01-06 19:28:38,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:38,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461010818] [2021-01-06 19:28:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:38,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461010818] [2021-01-06 19:28:38,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:38,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:38,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562189781] [2021-01-06 19:28:38,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:38,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:38,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:38,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:38,086 INFO L87 Difference]: Start difference. First operand 3255 states and 4799 transitions. Second operand 3 states. [2021-01-06 19:28:38,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:38,277 INFO L93 Difference]: Finished difference Result 6483 states and 9558 transitions. [2021-01-06 19:28:38,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:38,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 19:28:38,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:38,285 INFO L225 Difference]: With dead ends: 6483 [2021-01-06 19:28:38,286 INFO L226 Difference]: Without dead ends: 3255 [2021-01-06 19:28:38,291 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2021-01-06 19:28:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3255. [2021-01-06 19:28:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4791 transitions. [2021-01-06 19:28:38,474 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4791 transitions. Word has length 160 [2021-01-06 19:28:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:38,475 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4791 transitions. [2021-01-06 19:28:38,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:38,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4791 transitions. [2021-01-06 19:28:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:38,477 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:38,477 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:38,477 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:28:38,477 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:38,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:38,478 INFO L82 PathProgramCache]: Analyzing trace with hash -293635856, now seen corresponding path program 1 times [2021-01-06 19:28:38,478 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:38,478 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397404887] [2021-01-06 19:28:38,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:38,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397404887] [2021-01-06 19:28:38,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:38,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:38,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425576864] [2021-01-06 19:28:38,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:38,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:38,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:38,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:38,588 INFO L87 Difference]: Start difference. First operand 3255 states and 4791 transitions. Second operand 4 states. [2021-01-06 19:28:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:38,983 INFO L93 Difference]: Finished difference Result 7974 states and 11726 transitions. [2021-01-06 19:28:38,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:38,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:38,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:38,998 INFO L225 Difference]: With dead ends: 7974 [2021-01-06 19:28:38,999 INFO L226 Difference]: Without dead ends: 4747 [2021-01-06 19:28:39,011 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:39,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4747 states. [2021-01-06 19:28:39,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4747 to 3255. [2021-01-06 19:28:39,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4788 transitions. [2021-01-06 19:28:39,232 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4788 transitions. Word has length 160 [2021-01-06 19:28:39,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:39,234 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4788 transitions. [2021-01-06 19:28:39,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4788 transitions. [2021-01-06 19:28:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:39,236 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:39,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:39,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:28:39,236 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:39,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:39,237 INFO L82 PathProgramCache]: Analyzing trace with hash 69830642, now seen corresponding path program 1 times [2021-01-06 19:28:39,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:39,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688794463] [2021-01-06 19:28:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:39,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688794463] [2021-01-06 19:28:39,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:39,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:39,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065572921] [2021-01-06 19:28:39,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:39,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:39,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:39,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:39,352 INFO L87 Difference]: Start difference. First operand 3255 states and 4788 transitions. Second operand 4 states. [2021-01-06 19:28:39,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:39,951 INFO L93 Difference]: Finished difference Result 7879 states and 11582 transitions. [2021-01-06 19:28:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:39,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:39,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:39,964 INFO L225 Difference]: With dead ends: 7879 [2021-01-06 19:28:39,964 INFO L226 Difference]: Without dead ends: 4654 [2021-01-06 19:28:39,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:39,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4654 states. [2021-01-06 19:28:40,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4654 to 3255. [2021-01-06 19:28:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:40,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4785 transitions. [2021-01-06 19:28:40,221 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4785 transitions. Word has length 160 [2021-01-06 19:28:40,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:40,221 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4785 transitions. [2021-01-06 19:28:40,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4785 transitions. [2021-01-06 19:28:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:40,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:40,224 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:40,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:28:40,224 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:40,225 INFO L82 PathProgramCache]: Analyzing trace with hash -475041932, now seen corresponding path program 1 times [2021-01-06 19:28:40,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:40,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362599432] [2021-01-06 19:28:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:40,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362599432] [2021-01-06 19:28:40,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:40,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:40,290 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526483356] [2021-01-06 19:28:40,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:40,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:40,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:40,292 INFO L87 Difference]: Start difference. First operand 3255 states and 4785 transitions. Second operand 4 states. [2021-01-06 19:28:40,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:40,784 INFO L93 Difference]: Finished difference Result 7877 states and 11572 transitions. [2021-01-06 19:28:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:40,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:40,796 INFO L225 Difference]: With dead ends: 7877 [2021-01-06 19:28:40,796 INFO L226 Difference]: Without dead ends: 4653 [2021-01-06 19:28:40,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2021-01-06 19:28:41,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 3255. [2021-01-06 19:28:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:41,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4782 transitions. [2021-01-06 19:28:41,028 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4782 transitions. Word has length 160 [2021-01-06 19:28:41,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:41,029 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4782 transitions. [2021-01-06 19:28:41,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:41,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4782 transitions. [2021-01-06 19:28:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:41,031 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:41,031 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:41,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:28:41,032 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:41,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:41,032 INFO L82 PathProgramCache]: Analyzing trace with hash 200118194, now seen corresponding path program 1 times [2021-01-06 19:28:41,032 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:41,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460407165] [2021-01-06 19:28:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:41,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460407165] [2021-01-06 19:28:41,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:41,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:41,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498965115] [2021-01-06 19:28:41,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:41,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:41,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:41,099 INFO L87 Difference]: Start difference. First operand 3255 states and 4782 transitions. Second operand 3 states. [2021-01-06 19:28:41,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:41,372 INFO L93 Difference]: Finished difference Result 6478 states and 9518 transitions. [2021-01-06 19:28:41,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:41,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 19:28:41,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:41,381 INFO L225 Difference]: With dead ends: 6478 [2021-01-06 19:28:41,382 INFO L226 Difference]: Without dead ends: 3255 [2021-01-06 19:28:41,387 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2021-01-06 19:28:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3255. [2021-01-06 19:28:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4746 transitions. [2021-01-06 19:28:41,653 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4746 transitions. Word has length 160 [2021-01-06 19:28:41,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:41,653 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4746 transitions. [2021-01-06 19:28:41,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4746 transitions. [2021-01-06 19:28:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:41,654 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:41,655 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:41,655 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:28:41,655 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash -319925257, now seen corresponding path program 1 times [2021-01-06 19:28:41,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:41,656 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887554631] [2021-01-06 19:28:41,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:41,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887554631] [2021-01-06 19:28:41,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:41,727 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:41,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926483641] [2021-01-06 19:28:41,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:41,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:41,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:41,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:41,731 INFO L87 Difference]: Start difference. First operand 3255 states and 4746 transitions. Second operand 4 states. [2021-01-06 19:28:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:42,244 INFO L93 Difference]: Finished difference Result 7873 states and 11473 transitions. [2021-01-06 19:28:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:42,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:42,258 INFO L225 Difference]: With dead ends: 7873 [2021-01-06 19:28:42,258 INFO L226 Difference]: Without dead ends: 4651 [2021-01-06 19:28:42,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4651 states. [2021-01-06 19:28:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4651 to 3255. [2021-01-06 19:28:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:42,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4743 transitions. [2021-01-06 19:28:42,498 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4743 transitions. Word has length 160 [2021-01-06 19:28:42,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:42,499 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4743 transitions. [2021-01-06 19:28:42,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:42,499 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4743 transitions. [2021-01-06 19:28:42,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:42,500 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:42,500 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:42,500 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:28:42,500 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:42,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:42,501 INFO L82 PathProgramCache]: Analyzing trace with hash -904696907, now seen corresponding path program 1 times [2021-01-06 19:28:42,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:42,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708339989] [2021-01-06 19:28:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:42,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708339989] [2021-01-06 19:28:42,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:42,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:42,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754599442] [2021-01-06 19:28:42,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:42,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:42,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:42,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:42,566 INFO L87 Difference]: Start difference. First operand 3255 states and 4743 transitions. Second operand 4 states. [2021-01-06 19:28:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:43,096 INFO L93 Difference]: Finished difference Result 7871 states and 11463 transitions. [2021-01-06 19:28:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:43,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:43,110 INFO L225 Difference]: With dead ends: 7871 [2021-01-06 19:28:43,110 INFO L226 Difference]: Without dead ends: 4650 [2021-01-06 19:28:43,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2021-01-06 19:28:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 3255. [2021-01-06 19:28:43,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:43,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4740 transitions. [2021-01-06 19:28:43,369 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4740 transitions. Word has length 160 [2021-01-06 19:28:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:43,369 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4740 transitions. [2021-01-06 19:28:43,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4740 transitions. [2021-01-06 19:28:43,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:43,370 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:43,371 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:43,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:28:43,371 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:43,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:43,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1339202505, now seen corresponding path program 1 times [2021-01-06 19:28:43,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:43,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304587971] [2021-01-06 19:28:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:43,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:43,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304587971] [2021-01-06 19:28:43,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:43,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:43,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231727114] [2021-01-06 19:28:43,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:43,442 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:43,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:43,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:43,443 INFO L87 Difference]: Start difference. First operand 3255 states and 4740 transitions. Second operand 4 states. [2021-01-06 19:28:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:44,054 INFO L93 Difference]: Finished difference Result 7869 states and 11453 transitions. [2021-01-06 19:28:44,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:44,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:44,068 INFO L225 Difference]: With dead ends: 7869 [2021-01-06 19:28:44,069 INFO L226 Difference]: Without dead ends: 4649 [2021-01-06 19:28:44,076 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:44,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4649 states. [2021-01-06 19:28:44,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4649 to 3255. [2021-01-06 19:28:44,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4737 transitions. [2021-01-06 19:28:44,418 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4737 transitions. Word has length 160 [2021-01-06 19:28:44,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:44,418 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4737 transitions. [2021-01-06 19:28:44,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4737 transitions. [2021-01-06 19:28:44,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:44,420 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:44,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:44,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:28:44,420 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:44,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:44,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1768860811, now seen corresponding path program 1 times [2021-01-06 19:28:44,421 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:44,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197812989] [2021-01-06 19:28:44,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:44,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197812989] [2021-01-06 19:28:44,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:44,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:44,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225574179] [2021-01-06 19:28:44,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:44,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:44,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:44,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:44,492 INFO L87 Difference]: Start difference. First operand 3255 states and 4737 transitions. Second operand 4 states. [2021-01-06 19:28:45,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:45,012 INFO L93 Difference]: Finished difference Result 7867 states and 11443 transitions. [2021-01-06 19:28:45,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:45,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:45,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:45,024 INFO L225 Difference]: With dead ends: 7867 [2021-01-06 19:28:45,024 INFO L226 Difference]: Without dead ends: 4648 [2021-01-06 19:28:45,031 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4648 states. [2021-01-06 19:28:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4648 to 3255. [2021-01-06 19:28:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4734 transitions. [2021-01-06 19:28:45,315 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4734 transitions. Word has length 160 [2021-01-06 19:28:45,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:45,315 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4734 transitions. [2021-01-06 19:28:45,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:45,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4734 transitions. [2021-01-06 19:28:45,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:45,316 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:45,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:45,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:28:45,317 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:45,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:45,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1819509879, now seen corresponding path program 1 times [2021-01-06 19:28:45,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:45,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375350979] [2021-01-06 19:28:45,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:45,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375350979] [2021-01-06 19:28:45,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:45,377 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:45,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989250516] [2021-01-06 19:28:45,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:45,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:45,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:45,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:45,378 INFO L87 Difference]: Start difference. First operand 3255 states and 4734 transitions. Second operand 4 states. [2021-01-06 19:28:45,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:45,916 INFO L93 Difference]: Finished difference Result 7863 states and 11429 transitions. [2021-01-06 19:28:45,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:45,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:45,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:45,927 INFO L225 Difference]: With dead ends: 7863 [2021-01-06 19:28:45,928 INFO L226 Difference]: Without dead ends: 4646 [2021-01-06 19:28:45,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:45,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4646 states. [2021-01-06 19:28:46,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4646 to 3255. [2021-01-06 19:28:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4731 transitions. [2021-01-06 19:28:46,228 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4731 transitions. Word has length 160 [2021-01-06 19:28:46,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:46,229 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4731 transitions. [2021-01-06 19:28:46,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:46,229 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4731 transitions. [2021-01-06 19:28:46,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:46,230 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:46,230 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:46,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:28:46,231 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:46,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:46,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1613623815, now seen corresponding path program 1 times [2021-01-06 19:28:46,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:46,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985376037] [2021-01-06 19:28:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:46,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985376037] [2021-01-06 19:28:46,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:46,291 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:46,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775974306] [2021-01-06 19:28:46,291 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:46,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:46,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:46,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:46,292 INFO L87 Difference]: Start difference. First operand 3255 states and 4731 transitions. Second operand 4 states. [2021-01-06 19:28:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:46,789 INFO L93 Difference]: Finished difference Result 7861 states and 11419 transitions. [2021-01-06 19:28:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:46,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:46,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:46,800 INFO L225 Difference]: With dead ends: 7861 [2021-01-06 19:28:46,800 INFO L226 Difference]: Without dead ends: 4645 [2021-01-06 19:28:46,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:46,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2021-01-06 19:28:47,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 3255. [2021-01-06 19:28:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:47,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4728 transitions. [2021-01-06 19:28:47,079 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4728 transitions. Word has length 160 [2021-01-06 19:28:47,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:47,079 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4728 transitions. [2021-01-06 19:28:47,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:47,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4728 transitions. [2021-01-06 19:28:47,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:47,081 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:47,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:47,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:28:47,081 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:47,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:47,082 INFO L82 PathProgramCache]: Analyzing trace with hash 630934583, now seen corresponding path program 1 times [2021-01-06 19:28:47,082 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:47,082 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594732289] [2021-01-06 19:28:47,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:47,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594732289] [2021-01-06 19:28:47,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:47,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:47,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661701238] [2021-01-06 19:28:47,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:47,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:47,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:47,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:47,140 INFO L87 Difference]: Start difference. First operand 3255 states and 4728 transitions. Second operand 4 states. [2021-01-06 19:28:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:47,634 INFO L93 Difference]: Finished difference Result 7859 states and 11409 transitions. [2021-01-06 19:28:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:47,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:47,641 INFO L225 Difference]: With dead ends: 7859 [2021-01-06 19:28:47,641 INFO L226 Difference]: Without dead ends: 4644 [2021-01-06 19:28:47,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4644 states. [2021-01-06 19:28:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4644 to 3255. [2021-01-06 19:28:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:48,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4725 transitions. [2021-01-06 19:28:48,004 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4725 transitions. Word has length 160 [2021-01-06 19:28:48,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:48,004 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4725 transitions. [2021-01-06 19:28:48,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:48,004 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4725 transitions. [2021-01-06 19:28:48,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:48,006 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:48,006 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:48,006 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:28:48,006 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:48,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:48,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1118981689, now seen corresponding path program 1 times [2021-01-06 19:28:48,007 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:48,007 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090449747] [2021-01-06 19:28:48,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:48,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:48,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090449747] [2021-01-06 19:28:48,076 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:48,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:48,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075074186] [2021-01-06 19:28:48,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:48,077 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:48,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:48,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:48,078 INFO L87 Difference]: Start difference. First operand 3255 states and 4725 transitions. Second operand 4 states. [2021-01-06 19:28:48,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:48,708 INFO L93 Difference]: Finished difference Result 7857 states and 11399 transitions. [2021-01-06 19:28:48,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:48,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2021-01-06 19:28:48,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:48,716 INFO L225 Difference]: With dead ends: 7857 [2021-01-06 19:28:48,716 INFO L226 Difference]: Without dead ends: 4643 [2021-01-06 19:28:48,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4643 states. [2021-01-06 19:28:49,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4643 to 3255. [2021-01-06 19:28:49,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4722 transitions. [2021-01-06 19:28:49,115 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4722 transitions. Word has length 160 [2021-01-06 19:28:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:49,115 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4722 transitions. [2021-01-06 19:28:49,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:49,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4722 transitions. [2021-01-06 19:28:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:49,117 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:49,117 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:49,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:28:49,118 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash 26346487, now seen corresponding path program 1 times [2021-01-06 19:28:49,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:49,119 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094131151] [2021-01-06 19:28:49,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:49,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094131151] [2021-01-06 19:28:49,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:49,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:49,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549718328] [2021-01-06 19:28:49,201 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:49,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:49,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:49,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:49,203 INFO L87 Difference]: Start difference. First operand 3255 states and 4722 transitions. Second operand 3 states. [2021-01-06 19:28:49,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:49,521 INFO L93 Difference]: Finished difference Result 6468 states and 9387 transitions. [2021-01-06 19:28:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:49,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 19:28:49,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:49,525 INFO L225 Difference]: With dead ends: 6468 [2021-01-06 19:28:49,525 INFO L226 Difference]: Without dead ends: 3255 [2021-01-06 19:28:49,530 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:49,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2021-01-06 19:28:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3255. [2021-01-06 19:28:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3255 states. [2021-01-06 19:28:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4686 transitions. [2021-01-06 19:28:49,945 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4686 transitions. Word has length 160 [2021-01-06 19:28:49,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:49,946 INFO L481 AbstractCegarLoop]: Abstraction has 3255 states and 4686 transitions. [2021-01-06 19:28:49,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:49,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4686 transitions. [2021-01-06 19:28:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2021-01-06 19:28:49,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:49,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:49,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:28:49,949 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:49,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:49,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1759277819, now seen corresponding path program 1 times [2021-01-06 19:28:49,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:49,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228820202] [2021-01-06 19:28:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:50,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:50,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228820202] [2021-01-06 19:28:50,054 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:50,054 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:50,054 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304088835] [2021-01-06 19:28:50,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:50,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:50,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:50,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:50,057 INFO L87 Difference]: Start difference. First operand 3255 states and 4686 transitions. Second operand 3 states. [2021-01-06 19:28:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:50,723 INFO L93 Difference]: Finished difference Result 9526 states and 13699 transitions. [2021-01-06 19:28:50,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:50,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2021-01-06 19:28:50,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:50,729 INFO L225 Difference]: With dead ends: 9526 [2021-01-06 19:28:50,729 INFO L226 Difference]: Without dead ends: 6315 [2021-01-06 19:28:50,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6315 states. [2021-01-06 19:28:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6315 to 6137. [2021-01-06 19:28:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6137 states. [2021-01-06 19:28:51,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6137 states to 6137 states and 8792 transitions. [2021-01-06 19:28:51,348 INFO L78 Accepts]: Start accepts. Automaton has 6137 states and 8792 transitions. Word has length 160 [2021-01-06 19:28:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:51,348 INFO L481 AbstractCegarLoop]: Abstraction has 6137 states and 8792 transitions. [2021-01-06 19:28:51,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:51,349 INFO L276 IsEmpty]: Start isEmpty. Operand 6137 states and 8792 transitions. [2021-01-06 19:28:51,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:28:51,354 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:51,354 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:51,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:28:51,355 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:51,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:51,355 INFO L82 PathProgramCache]: Analyzing trace with hash -837601248, now seen corresponding path program 1 times [2021-01-06 19:28:51,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:51,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979736424] [2021-01-06 19:28:51,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:51,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979736424] [2021-01-06 19:28:51,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:51,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:51,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453562252] [2021-01-06 19:28:51,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:51,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:51,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:51,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:51,478 INFO L87 Difference]: Start difference. First operand 6137 states and 8792 transitions. Second operand 5 states. [2021-01-06 19:28:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:52,840 INFO L93 Difference]: Finished difference Result 18165 states and 26033 transitions. [2021-01-06 19:28:52,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:52,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:28:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:52,855 INFO L225 Difference]: With dead ends: 18165 [2021-01-06 19:28:52,855 INFO L226 Difference]: Without dead ends: 12076 [2021-01-06 19:28:52,864 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:28:52,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12076 states. [2021-01-06 19:28:53,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12076 to 6224. [2021-01-06 19:28:53,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2021-01-06 19:28:53,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 8851 transitions. [2021-01-06 19:28:53,462 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 8851 transitions. Word has length 261 [2021-01-06 19:28:53,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:53,462 INFO L481 AbstractCegarLoop]: Abstraction has 6224 states and 8851 transitions. [2021-01-06 19:28:53,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:53,462 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 8851 transitions. [2021-01-06 19:28:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:28:53,468 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:53,468 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:53,468 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:28:53,468 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:53,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:53,469 INFO L82 PathProgramCache]: Analyzing trace with hash 581072284, now seen corresponding path program 1 times [2021-01-06 19:28:53,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:53,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959208142] [2021-01-06 19:28:53,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:53,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959208142] [2021-01-06 19:28:53,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:53,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:53,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152441208] [2021-01-06 19:28:53,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:53,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:53,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:53,565 INFO L87 Difference]: Start difference. First operand 6224 states and 8851 transitions. Second operand 5 states. [2021-01-06 19:28:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:55,326 INFO L93 Difference]: Finished difference Result 23776 states and 33867 transitions. [2021-01-06 19:28:55,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:55,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:28:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:55,346 INFO L225 Difference]: With dead ends: 23776 [2021-01-06 19:28:55,346 INFO L226 Difference]: Without dead ends: 17607 [2021-01-06 19:28:55,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:28:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17607 states. [2021-01-06 19:28:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17607 to 6395. [2021-01-06 19:28:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6395 states. [2021-01-06 19:28:55,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 9022 transitions. [2021-01-06 19:28:55,988 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 9022 transitions. Word has length 261 [2021-01-06 19:28:55,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:55,988 INFO L481 AbstractCegarLoop]: Abstraction has 6395 states and 9022 transitions. [2021-01-06 19:28:55,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:55,988 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 9022 transitions. [2021-01-06 19:28:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:28:55,992 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:55,992 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:55,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:28:55,993 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:55,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:55,993 INFO L82 PathProgramCache]: Analyzing trace with hash -292593318, now seen corresponding path program 1 times [2021-01-06 19:28:55,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:55,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401908234] [2021-01-06 19:28:55,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:56,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:56,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401908234] [2021-01-06 19:28:56,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:56,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:56,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954316116] [2021-01-06 19:28:56,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:56,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:56,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:56,096 INFO L87 Difference]: Start difference. First operand 6395 states and 9022 transitions. Second operand 5 states. [2021-01-06 19:28:57,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:57,003 INFO L93 Difference]: Finished difference Result 15383 states and 21650 transitions. [2021-01-06 19:28:57,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:57,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:28:57,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:57,012 INFO L225 Difference]: With dead ends: 15383 [2021-01-06 19:28:57,013 INFO L226 Difference]: Without dead ends: 9053 [2021-01-06 19:28:57,020 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:28:57,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2021-01-06 19:28:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 6407. [2021-01-06 19:28:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6407 states. [2021-01-06 19:28:57,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6407 states to 6407 states and 8981 transitions. [2021-01-06 19:28:57,631 INFO L78 Accepts]: Start accepts. Automaton has 6407 states and 8981 transitions. Word has length 261 [2021-01-06 19:28:57,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:57,632 INFO L481 AbstractCegarLoop]: Abstraction has 6407 states and 8981 transitions. [2021-01-06 19:28:57,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:28:57,632 INFO L276 IsEmpty]: Start isEmpty. Operand 6407 states and 8981 transitions. [2021-01-06 19:28:57,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:28:57,637 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:57,638 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:57,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:28:57,638 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:57,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:57,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1171388630, now seen corresponding path program 1 times [2021-01-06 19:28:57,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:57,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698724664] [2021-01-06 19:28:57,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:28:57,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698724664] [2021-01-06 19:28:57,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:57,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:28:57,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923229152] [2021-01-06 19:28:57,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:28:57,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:57,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:28:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:57,731 INFO L87 Difference]: Start difference. First operand 6407 states and 8981 transitions. Second operand 5 states. [2021-01-06 19:28:59,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:59,408 INFO L93 Difference]: Finished difference Result 23493 states and 33128 transitions. [2021-01-06 19:28:59,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:28:59,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:28:59,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:59,424 INFO L225 Difference]: With dead ends: 23493 [2021-01-06 19:28:59,424 INFO L226 Difference]: Without dead ends: 17158 [2021-01-06 19:28:59,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:28:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17158 states. [2021-01-06 19:29:00,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17158 to 6578. [2021-01-06 19:29:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6578 states. [2021-01-06 19:29:00,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6578 states to 6578 states and 9152 transitions. [2021-01-06 19:29:00,260 INFO L78 Accepts]: Start accepts. Automaton has 6578 states and 9152 transitions. Word has length 261 [2021-01-06 19:29:00,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:00,261 INFO L481 AbstractCegarLoop]: Abstraction has 6578 states and 9152 transitions. [2021-01-06 19:29:00,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:00,261 INFO L276 IsEmpty]: Start isEmpty. Operand 6578 states and 9152 transitions. [2021-01-06 19:29:00,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:29:00,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:00,267 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:00,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:29:00,267 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:00,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:00,268 INFO L82 PathProgramCache]: Analyzing trace with hash -823914092, now seen corresponding path program 1 times [2021-01-06 19:29:00,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:00,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771833177] [2021-01-06 19:29:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:00,364 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:00,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771833177] [2021-01-06 19:29:00,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:00,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:00,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638647936] [2021-01-06 19:29:00,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:00,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:00,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:00,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:00,367 INFO L87 Difference]: Start difference. First operand 6578 states and 9152 transitions. Second operand 4 states. [2021-01-06 19:29:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:02,020 INFO L93 Difference]: Finished difference Result 22308 states and 30992 transitions. [2021-01-06 19:29:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:02,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2021-01-06 19:29:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:02,038 INFO L225 Difference]: With dead ends: 22308 [2021-01-06 19:29:02,038 INFO L226 Difference]: Without dead ends: 15807 [2021-01-06 19:29:02,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:02,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15807 states. [2021-01-06 19:29:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15807 to 12533. [2021-01-06 19:29:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12533 states. [2021-01-06 19:29:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12533 states to 12533 states and 17366 transitions. [2021-01-06 19:29:03,294 INFO L78 Accepts]: Start accepts. Automaton has 12533 states and 17366 transitions. Word has length 261 [2021-01-06 19:29:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:03,295 INFO L481 AbstractCegarLoop]: Abstraction has 12533 states and 17366 transitions. [2021-01-06 19:29:03,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:03,295 INFO L276 IsEmpty]: Start isEmpty. Operand 12533 states and 17366 transitions. [2021-01-06 19:29:03,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:29:03,302 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:03,303 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:03,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:29:03,303 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:03,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:03,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2137054418, now seen corresponding path program 1 times [2021-01-06 19:29:03,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:03,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846710924] [2021-01-06 19:29:03,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:03,393 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:03,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846710924] [2021-01-06 19:29:03,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:03,394 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:03,394 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833006565] [2021-01-06 19:29:03,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:03,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:03,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:03,396 INFO L87 Difference]: Start difference. First operand 12533 states and 17366 transitions. Second operand 5 states. [2021-01-06 19:29:05,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,954 INFO L93 Difference]: Finished difference Result 35331 states and 49220 transitions. [2021-01-06 19:29:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:05,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:29:05,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,976 INFO L225 Difference]: With dead ends: 35331 [2021-01-06 19:29:05,977 INFO L226 Difference]: Without dead ends: 22879 [2021-01-06 19:29:05,987 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:29:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22879 states. [2021-01-06 19:29:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22879 to 12701. [2021-01-06 19:29:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12701 states. [2021-01-06 19:29:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12701 states to 12701 states and 17481 transitions. [2021-01-06 19:29:07,348 INFO L78 Accepts]: Start accepts. Automaton has 12701 states and 17481 transitions. Word has length 261 [2021-01-06 19:29:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:07,348 INFO L481 AbstractCegarLoop]: Abstraction has 12701 states and 17481 transitions. [2021-01-06 19:29:07,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 12701 states and 17481 transitions. [2021-01-06 19:29:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:29:07,355 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:07,356 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:07,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:29:07,356 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:07,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:07,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1743925682, now seen corresponding path program 1 times [2021-01-06 19:29:07,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:07,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524280499] [2021-01-06 19:29:07,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:07,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524280499] [2021-01-06 19:29:07,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:07,593 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:07,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676717752] [2021-01-06 19:29:07,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:07,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:07,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:07,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:07,594 INFO L87 Difference]: Start difference. First operand 12701 states and 17481 transitions. Second operand 4 states. [2021-01-06 19:29:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:10,862 INFO L93 Difference]: Finished difference Result 43288 states and 59497 transitions. [2021-01-06 19:29:10,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:10,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2021-01-06 19:29:10,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:10,894 INFO L225 Difference]: With dead ends: 43288 [2021-01-06 19:29:10,895 INFO L226 Difference]: Without dead ends: 30670 [2021-01-06 19:29:10,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30670 states. [2021-01-06 19:29:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30670 to 24320. [2021-01-06 19:29:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24320 states. [2021-01-06 19:29:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24320 states to 24320 states and 33342 transitions. [2021-01-06 19:29:13,676 INFO L78 Accepts]: Start accepts. Automaton has 24320 states and 33342 transitions. Word has length 261 [2021-01-06 19:29:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:13,677 INFO L481 AbstractCegarLoop]: Abstraction has 24320 states and 33342 transitions. [2021-01-06 19:29:13,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 24320 states and 33342 transitions. [2021-01-06 19:29:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:29:13,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:13,693 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:13,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:29:13,694 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:13,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:13,694 INFO L82 PathProgramCache]: Analyzing trace with hash -2000012691, now seen corresponding path program 1 times [2021-01-06 19:29:13,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:13,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697757432] [2021-01-06 19:29:13,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:13,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:13,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697757432] [2021-01-06 19:29:13,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:13,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:13,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112139655] [2021-01-06 19:29:13,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:13,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:13,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:13,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:13,804 INFO L87 Difference]: Start difference. First operand 24320 states and 33342 transitions. Second operand 5 states. [2021-01-06 19:29:18,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:18,416 INFO L93 Difference]: Finished difference Result 67969 states and 93773 transitions. [2021-01-06 19:29:18,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:18,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:29:18,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:18,645 INFO L225 Difference]: With dead ends: 67969 [2021-01-06 19:29:18,645 INFO L226 Difference]: Without dead ends: 43736 [2021-01-06 19:29:18,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:29:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43736 states. [2021-01-06 19:29:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43736 to 24644. [2021-01-06 19:29:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24644 states. [2021-01-06 19:29:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24644 states to 24644 states and 33565 transitions. [2021-01-06 19:29:21,843 INFO L78 Accepts]: Start accepts. Automaton has 24644 states and 33565 transitions. Word has length 261 [2021-01-06 19:29:21,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:21,843 INFO L481 AbstractCegarLoop]: Abstraction has 24644 states and 33565 transitions. [2021-01-06 19:29:21,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:21,843 INFO L276 IsEmpty]: Start isEmpty. Operand 24644 states and 33565 transitions. [2021-01-06 19:29:21,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:29:21,852 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:21,853 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:21,853 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:29:21,853 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:21,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:21,853 INFO L82 PathProgramCache]: Analyzing trace with hash 477690089, now seen corresponding path program 1 times [2021-01-06 19:29:21,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:21,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318750046] [2021-01-06 19:29:21,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:21,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:21,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318750046] [2021-01-06 19:29:21,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:21,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:21,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065455501] [2021-01-06 19:29:21,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:21,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:21,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:21,957 INFO L87 Difference]: Start difference. First operand 24644 states and 33565 transitions. Second operand 4 states. [2021-01-06 19:29:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:29,048 INFO L93 Difference]: Finished difference Result 84017 states and 114272 transitions. [2021-01-06 19:29:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:29,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2021-01-06 19:29:29,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:29,115 INFO L225 Difference]: With dead ends: 84017 [2021-01-06 19:29:29,115 INFO L226 Difference]: Without dead ends: 59469 [2021-01-06 19:29:29,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59469 states. [2021-01-06 19:29:34,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59469 to 47283. [2021-01-06 19:29:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47283 states. [2021-01-06 19:29:34,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47283 states to 47283 states and 64158 transitions. [2021-01-06 19:29:34,873 INFO L78 Accepts]: Start accepts. Automaton has 47283 states and 64158 transitions. Word has length 261 [2021-01-06 19:29:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:34,873 INFO L481 AbstractCegarLoop]: Abstraction has 47283 states and 64158 transitions. [2021-01-06 19:29:34,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 47283 states and 64158 transitions. [2021-01-06 19:29:34,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:29:34,895 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:34,895 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:34,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:29:34,896 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:34,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:34,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1638442104, now seen corresponding path program 1 times [2021-01-06 19:29:34,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:34,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781590833] [2021-01-06 19:29:34,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:34,984 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:34,984 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781590833] [2021-01-06 19:29:34,984 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:34,984 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:34,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744070718] [2021-01-06 19:29:34,985 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:34,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:34,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:34,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:34,986 INFO L87 Difference]: Start difference. First operand 47283 states and 64158 transitions. Second operand 5 states. [2021-01-06 19:29:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:44,584 INFO L93 Difference]: Finished difference Result 129390 states and 176709 transitions. [2021-01-06 19:29:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:44,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:29:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:44,664 INFO L225 Difference]: With dead ends: 129390 [2021-01-06 19:29:44,664 INFO L226 Difference]: Without dead ends: 82207 [2021-01-06 19:29:44,701 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:29:44,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82207 states. [2021-01-06 19:29:50,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82207 to 47907. [2021-01-06 19:29:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47907 states. [2021-01-06 19:29:50,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47907 states to 47907 states and 64589 transitions. [2021-01-06 19:29:50,787 INFO L78 Accepts]: Start accepts. Automaton has 47907 states and 64589 transitions. Word has length 261 [2021-01-06 19:29:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:50,787 INFO L481 AbstractCegarLoop]: Abstraction has 47907 states and 64589 transitions. [2021-01-06 19:29:50,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 47907 states and 64589 transitions. [2021-01-06 19:29:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:29:50,802 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:50,802 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:50,803 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:29:50,803 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:50,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:50,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1328739332, now seen corresponding path program 1 times [2021-01-06 19:29:50,803 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:50,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647321435] [2021-01-06 19:29:50,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:50,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:29:50,890 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647321435] [2021-01-06 19:29:50,890 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:50,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:50,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331337092] [2021-01-06 19:29:50,891 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:50,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:50,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:50,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:50,892 INFO L87 Difference]: Start difference. First operand 47907 states and 64589 transitions. Second operand 5 states. [2021-01-06 19:30:04,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:04,646 INFO L93 Difference]: Finished difference Result 161070 states and 219158 transitions. [2021-01-06 19:30:04,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:04,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:30:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:04,778 INFO L225 Difference]: With dead ends: 161070 [2021-01-06 19:30:04,778 INFO L226 Difference]: Without dead ends: 113270 [2021-01-06 19:30:04,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:30:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113270 states. [2021-01-06 19:30:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113270 to 49110. [2021-01-06 19:30:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49110 states. [2021-01-06 19:30:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49110 states to 49110 states and 65792 transitions. [2021-01-06 19:30:11,861 INFO L78 Accepts]: Start accepts. Automaton has 49110 states and 65792 transitions. Word has length 261 [2021-01-06 19:30:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:11,861 INFO L481 AbstractCegarLoop]: Abstraction has 49110 states and 65792 transitions. [2021-01-06 19:30:11,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 49110 states and 65792 transitions. [2021-01-06 19:30:11,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:30:11,877 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:11,877 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:11,877 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 19:30:11,877 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:11,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1837518146, now seen corresponding path program 1 times [2021-01-06 19:30:11,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:11,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116817973] [2021-01-06 19:30:11,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:30:11,987 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116817973] [2021-01-06 19:30:11,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:11,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:11,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6366759] [2021-01-06 19:30:11,989 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:11,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:11,989 INFO L87 Difference]: Start difference. First operand 49110 states and 65792 transitions. Second operand 4 states. [2021-01-06 19:30:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:27,633 INFO L93 Difference]: Finished difference Result 167165 states and 223639 transitions. [2021-01-06 19:30:27,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:27,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 261 [2021-01-06 19:30:27,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:27,770 INFO L225 Difference]: With dead ends: 167165 [2021-01-06 19:30:27,770 INFO L226 Difference]: Without dead ends: 118167 [2021-01-06 19:30:27,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118167 states. [2021-01-06 19:30:40,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118167 to 94261. [2021-01-06 19:30:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94261 states. [2021-01-06 19:30:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94261 states to 94261 states and 125837 transitions. [2021-01-06 19:30:40,675 INFO L78 Accepts]: Start accepts. Automaton has 94261 states and 125837 transitions. Word has length 261 [2021-01-06 19:30:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:40,676 INFO L481 AbstractCegarLoop]: Abstraction has 94261 states and 125837 transitions. [2021-01-06 19:30:40,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 94261 states and 125837 transitions. [2021-01-06 19:30:40,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:30:40,699 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:40,699 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:40,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:30:40,700 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:40,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:40,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1270105856, now seen corresponding path program 1 times [2021-01-06 19:30:40,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:40,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40030337] [2021-01-06 19:30:40,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:30:40,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40030337] [2021-01-06 19:30:40,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:40,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:40,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489168223] [2021-01-06 19:30:40,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:40,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:40,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:40,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:40,796 INFO L87 Difference]: Start difference. First operand 94261 states and 125837 transitions. Second operand 5 states. [2021-01-06 19:31:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:02,043 INFO L93 Difference]: Finished difference Result 252058 states and 338668 transitions. [2021-01-06 19:31:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:02,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:31:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:02,464 INFO L225 Difference]: With dead ends: 252058 [2021-01-06 19:31:02,464 INFO L226 Difference]: Without dead ends: 157913 [2021-01-06 19:31:02,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:31:02,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157913 states. [2021-01-06 19:31:16,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157913 to 95461. [2021-01-06 19:31:16,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95461 states. [2021-01-06 19:31:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95461 states to 95461 states and 126668 transitions. [2021-01-06 19:31:16,796 INFO L78 Accepts]: Start accepts. Automaton has 95461 states and 126668 transitions. Word has length 261 [2021-01-06 19:31:16,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:16,797 INFO L481 AbstractCegarLoop]: Abstraction has 95461 states and 126668 transitions. [2021-01-06 19:31:16,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 95461 states and 126668 transitions. [2021-01-06 19:31:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:31:16,826 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:16,827 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:16,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 19:31:16,827 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:16,828 INFO L82 PathProgramCache]: Analyzing trace with hash 189475708, now seen corresponding path program 1 times [2021-01-06 19:31:16,828 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:16,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868740156] [2021-01-06 19:31:16,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:31:17,137 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868740156] [2021-01-06 19:31:17,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:17,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:17,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605654680] [2021-01-06 19:31:17,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:17,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:17,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:17,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:17,142 INFO L87 Difference]: Start difference. First operand 95461 states and 126668 transitions. Second operand 5 states. [2021-01-06 19:31:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:46,916 INFO L93 Difference]: Finished difference Result 309510 states and 414297 transitions. [2021-01-06 19:31:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:46,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2021-01-06 19:31:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:47,402 INFO L225 Difference]: With dead ends: 309510 [2021-01-06 19:31:47,403 INFO L226 Difference]: Without dead ends: 214172 [2021-01-06 19:31:47,508 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:31:47,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214172 states. [2021-01-06 19:32:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214172 to 97768. [2021-01-06 19:32:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97768 states. [2021-01-06 19:32:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97768 states to 97768 states and 128975 transitions. [2021-01-06 19:32:03,149 INFO L78 Accepts]: Start accepts. Automaton has 97768 states and 128975 transitions. Word has length 261 [2021-01-06 19:32:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:03,149 INFO L481 AbstractCegarLoop]: Abstraction has 97768 states and 128975 transitions. [2021-01-06 19:32:03,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 97768 states and 128975 transitions. [2021-01-06 19:32:03,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2021-01-06 19:32:03,186 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:03,186 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:03,186 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 19:32:03,186 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:03,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:03,187 INFO L82 PathProgramCache]: Analyzing trace with hash -421793350, now seen corresponding path program 1 times [2021-01-06 19:32:03,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:03,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778805369] [2021-01-06 19:32:03,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:03,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:03,293 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:32:03,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778805369] [2021-01-06 19:32:03,294 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:03,294 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:03,294 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781903363] [2021-01-06 19:32:03,295 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:03,295 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:03,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:03,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:03,295 INFO L87 Difference]: Start difference. First operand 97768 states and 128975 transitions. Second operand 4 states.