/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.13.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:28:38,976 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:28:38,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:28:39,017 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:28:39,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:28:39,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:28:39,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:28:39,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:28:39,026 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:28:39,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:28:39,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:28:39,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:28:39,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:28:39,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:28:39,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:28:39,035 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:28:39,036 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:28:39,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:28:39,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:28:39,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:28:39,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:28:39,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:28:39,048 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:28:39,049 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:28:39,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:28:39,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:28:39,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:28:39,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:28:39,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:28:39,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:28:39,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:28:39,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:28:39,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:28:39,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:28:39,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:28:39,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:28:39,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:28:39,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:28:39,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:28:39,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:28:39,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:28:39,078 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:39,138 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:28:39,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:28:39,141 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:28:39,141 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:28:39,142 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:28:39,142 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:28:39,142 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:28:39,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:28:39,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:28:39,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:28:39,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:28:39,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:28:39,146 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:28:39,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:28:39,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:28:39,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:28:39,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:28:39,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:28:39,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:28:39,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:28:39,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:28:39,149 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:28:39,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:28:39,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:28:39,149 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:28:39,150 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:39,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:28:39,642 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:28:39,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:28:39,647 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:28:39,650 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:28:39,651 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.13.cil-2.c [2021-01-06 19:28:39,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e754335b9/1aff36b8f83e4833ab2499274a4a5919/FLAGda6bfc25d [2021-01-06 19:28:40,366 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:28:40,367 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-2.c [2021-01-06 19:28:40,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e754335b9/1aff36b8f83e4833ab2499274a4a5919/FLAGda6bfc25d [2021-01-06 19:28:40,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/e754335b9/1aff36b8f83e4833ab2499274a4a5919 [2021-01-06 19:28:40,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:28:40,686 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:28:40,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:28:40,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:28:40,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:28:40,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:28:40" (1/1) ... [2021-01-06 19:28:40,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b7f175f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:40, skipping insertion in model container [2021-01-06 19:28:40,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:28:40" (1/1) ... [2021-01-06 19:28:40,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:28:40,786 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:28:40,999 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-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_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] [2021-01-06 19:28:41,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:28:41,358 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:28:41,372 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.13.cil-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_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres2~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp~3,] left hand side expression in assignment: lhs: VariableLHS[~kernel_st~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] [2021-01-06 19:28:41,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:28:41,589 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:28:41,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:41 WrapperNode [2021-01-06 19:28:41,590 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:28:41,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:28:41,593 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:28:41,593 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:28:41,601 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:41" (1/1) ... [2021-01-06 19:28:41,639 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:41" (1/1) ... [2021-01-06 19:28:41,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:28:41,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:28:41,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:28:41,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:28:41,770 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:41" (1/1) ... [2021-01-06 19:28:41,771 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:41" (1/1) ... [2021-01-06 19:28:41,782 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:41" (1/1) ... [2021-01-06 19:28:41,783 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:41" (1/1) ... [2021-01-06 19:28:41,844 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:41" (1/1) ... [2021-01-06 19:28:41,914 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:41" (1/1) ... [2021-01-06 19:28:41,925 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:41" (1/1) ... [2021-01-06 19:28:41,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:28:41,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:28:41,946 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:28:41,946 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:28:41,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:41" (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:42,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:28:42,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:28:42,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:28:42,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:28:45,169 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:28:45,170 INFO L299 CfgBuilder]: Removed 620 assume(true) statements. [2021-01-06 19:28:45,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:28:45 BoogieIcfgContainer [2021-01-06 19:28:45,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:28:45,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:28:45,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:28:45,181 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:28:45,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:28:40" (1/3) ... [2021-01-06 19:28:45,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669bc0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:28:45, skipping insertion in model container [2021-01-06 19:28:45,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:41" (2/3) ... [2021-01-06 19:28:45,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669bc0e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:28:45, skipping insertion in model container [2021-01-06 19:28:45,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:28:45" (3/3) ... [2021-01-06 19:28:45,185 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.13.cil-2.c [2021-01-06 19:28:45,192 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:28:45,198 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:28:45,217 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:28:45,256 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:28:45,257 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:28:45,257 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:28:45,257 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:28:45,257 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:28:45,257 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:28:45,257 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:28:45,258 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:28:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1989 states. [2021-01-06 19:28:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:45,318 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:45,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:45,320 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:45,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash 585149193, now seen corresponding path program 1 times [2021-01-06 19:28:45,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:45,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214612032] [2021-01-06 19:28:45,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:45,808 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,809 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214612032] [2021-01-06 19:28:45,810 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:45,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:45,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286040363] [2021-01-06 19:28:45,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:45,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:45,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:45,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:45,842 INFO L87 Difference]: Start difference. First operand 1989 states. Second operand 3 states. [2021-01-06 19:28:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:46,052 INFO L93 Difference]: Finished difference Result 3973 states and 5975 transitions. [2021-01-06 19:28:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:46,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:46,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:46,083 INFO L225 Difference]: With dead ends: 3973 [2021-01-06 19:28:46,084 INFO L226 Difference]: Without dead ends: 1985 [2021-01-06 19:28:46,097 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:46,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2021-01-06 19:28:46,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1985. [2021-01-06 19:28:46,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2021-01-06 19:28:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2953 transitions. [2021-01-06 19:28:46,290 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2953 transitions. Word has length 171 [2021-01-06 19:28:46,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:46,291 INFO L481 AbstractCegarLoop]: Abstraction has 1985 states and 2953 transitions. [2021-01-06 19:28:46,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2953 transitions. [2021-01-06 19:28:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:46,305 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:46,306 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:46,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:28:46,308 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:46,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:46,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1992875143, now seen corresponding path program 1 times [2021-01-06 19:28:46,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:46,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848339307] [2021-01-06 19:28:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:46,456 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,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848339307] [2021-01-06 19:28:46,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:46,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:46,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582468034] [2021-01-06 19:28:46,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:46,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:46,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:46,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:46,461 INFO L87 Difference]: Start difference. First operand 1985 states and 2953 transitions. Second operand 3 states. [2021-01-06 19:28:46,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:46,570 INFO L93 Difference]: Finished difference Result 3957 states and 5884 transitions. [2021-01-06 19:28:46,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:46,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:46,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:46,585 INFO L225 Difference]: With dead ends: 3957 [2021-01-06 19:28:46,586 INFO L226 Difference]: Without dead ends: 1985 [2021-01-06 19:28:46,591 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:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2021-01-06 19:28:46,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1985. [2021-01-06 19:28:46,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1985 states. [2021-01-06 19:28:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1985 states to 1985 states and 2952 transitions. [2021-01-06 19:28:46,717 INFO L78 Accepts]: Start accepts. Automaton has 1985 states and 2952 transitions. Word has length 171 [2021-01-06 19:28:46,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:46,720 INFO L481 AbstractCegarLoop]: Abstraction has 1985 states and 2952 transitions. [2021-01-06 19:28:46,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1985 states and 2952 transitions. [2021-01-06 19:28:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:46,724 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:46,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:46,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:28:46,725 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:46,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:46,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1325493253, now seen corresponding path program 1 times [2021-01-06 19:28:46,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:46,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652235944] [2021-01-06 19:28:46,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:46,886 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,886 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652235944] [2021-01-06 19:28:46,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:46,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:46,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818224112] [2021-01-06 19:28:46,888 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:46,888 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:46,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:46,889 INFO L87 Difference]: Start difference. First operand 1985 states and 2952 transitions. Second operand 3 states. [2021-01-06 19:28:47,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:47,076 INFO L93 Difference]: Finished difference Result 5667 states and 8402 transitions. [2021-01-06 19:28:47,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:47,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:47,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:47,100 INFO L225 Difference]: With dead ends: 5667 [2021-01-06 19:28:47,100 INFO L226 Difference]: Without dead ends: 3700 [2021-01-06 19:28:47,105 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:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2021-01-06 19:28:47,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 3698. [2021-01-06 19:28:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:47,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5476 transitions. [2021-01-06 19:28:47,278 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5476 transitions. Word has length 171 [2021-01-06 19:28:47,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:47,285 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5476 transitions. [2021-01-06 19:28:47,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5476 transitions. [2021-01-06 19:28:47,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:47,288 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:47,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:47,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:28:47,290 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:47,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:47,291 INFO L82 PathProgramCache]: Analyzing trace with hash 962370689, now seen corresponding path program 1 times [2021-01-06 19:28:47,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:47,293 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138664976] [2021-01-06 19:28:47,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:47,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:47,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138664976] [2021-01-06 19:28:47,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:47,491 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:47,491 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124766297] [2021-01-06 19:28:47,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:47,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:47,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:47,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:47,493 INFO L87 Difference]: Start difference. First operand 3698 states and 5476 transitions. Second operand 4 states. [2021-01-06 19:28:47,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:47,931 INFO L93 Difference]: Finished difference Result 9091 states and 13445 transitions. [2021-01-06 19:28:47,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:47,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:47,972 INFO L225 Difference]: With dead ends: 9091 [2021-01-06 19:28:47,973 INFO L226 Difference]: Without dead ends: 5412 [2021-01-06 19:28:47,984 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,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5412 states. [2021-01-06 19:28:48,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5412 to 3698. [2021-01-06 19:28:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:48,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5473 transitions. [2021-01-06 19:28:48,253 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5473 transitions. Word has length 171 [2021-01-06 19:28:48,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:48,254 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5473 transitions. [2021-01-06 19:28:48,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:48,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5473 transitions. [2021-01-06 19:28:48,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:48,257 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:48,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:48,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:28:48,258 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:48,258 INFO L82 PathProgramCache]: Analyzing trace with hash -442820989, now seen corresponding path program 1 times [2021-01-06 19:28:48,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:48,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656418983] [2021-01-06 19:28:48,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:48,423 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,424 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656418983] [2021-01-06 19:28:48,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:48,424 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:48,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180742610] [2021-01-06 19:28:48,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:48,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:48,428 INFO L87 Difference]: Start difference. First operand 3698 states and 5473 transitions. Second operand 4 states. [2021-01-06 19:28:48,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:48,798 INFO L93 Difference]: Finished difference Result 9089 states and 13435 transitions. [2021-01-06 19:28:48,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:48,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:48,828 INFO L225 Difference]: With dead ends: 9089 [2021-01-06 19:28:48,828 INFO L226 Difference]: Without dead ends: 5411 [2021-01-06 19:28:48,836 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,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5411 states. [2021-01-06 19:28:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5411 to 3698. [2021-01-06 19:28:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:49,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5470 transitions. [2021-01-06 19:28:49,103 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5470 transitions. Word has length 171 [2021-01-06 19:28:49,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:49,103 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5470 transitions. [2021-01-06 19:28:49,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:49,103 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5470 transitions. [2021-01-06 19:28:49,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:49,106 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:49,106 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:49,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:28:49,106 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:49,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:49,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1451512897, now seen corresponding path program 1 times [2021-01-06 19:28:49,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:49,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638874793] [2021-01-06 19:28:49,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:49,223 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,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638874793] [2021-01-06 19:28:49,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:49,224 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:49,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571767279] [2021-01-06 19:28:49,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:49,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:49,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:49,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:49,226 INFO L87 Difference]: Start difference. First operand 3698 states and 5470 transitions. Second operand 3 states. [2021-01-06 19:28:49,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:49,454 INFO L93 Difference]: Finished difference Result 7374 states and 10904 transitions. [2021-01-06 19:28:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:49,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:49,476 INFO L225 Difference]: With dead ends: 7374 [2021-01-06 19:28:49,476 INFO L226 Difference]: Without dead ends: 3698 [2021-01-06 19:28:49,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2021-01-06 19:28:49,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2021-01-06 19:28:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5462 transitions. [2021-01-06 19:28:49,728 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5462 transitions. Word has length 171 [2021-01-06 19:28:49,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:49,729 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5462 transitions. [2021-01-06 19:28:49,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:49,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5462 transitions. [2021-01-06 19:28:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:49,731 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:49,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:49,732 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:28:49,732 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:49,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash -501013827, now seen corresponding path program 1 times [2021-01-06 19:28:49,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:49,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722175068] [2021-01-06 19:28:49,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:49,820 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,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722175068] [2021-01-06 19:28:49,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:49,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:49,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292203149] [2021-01-06 19:28:49,821 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:49,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:49,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:49,822 INFO L87 Difference]: Start difference. First operand 3698 states and 5462 transitions. Second operand 3 states. [2021-01-06 19:28:50,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:50,056 INFO L93 Difference]: Finished difference Result 7373 states and 10887 transitions. [2021-01-06 19:28:50,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:50,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:50,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:50,088 INFO L225 Difference]: With dead ends: 7373 [2021-01-06 19:28:50,088 INFO L226 Difference]: Without dead ends: 3698 [2021-01-06 19:28:50,101 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,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2021-01-06 19:28:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2021-01-06 19:28:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5454 transitions. [2021-01-06 19:28:50,298 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5454 transitions. Word has length 171 [2021-01-06 19:28:50,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:50,298 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5454 transitions. [2021-01-06 19:28:50,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5454 transitions. [2021-01-06 19:28:50,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:50,301 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:50,301 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:50,301 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:28:50,301 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:50,302 INFO L82 PathProgramCache]: Analyzing trace with hash 544380097, now seen corresponding path program 1 times [2021-01-06 19:28:50,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:50,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69477172] [2021-01-06 19:28:50,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:50,391 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,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69477172] [2021-01-06 19:28:50,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:50,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:50,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649551990] [2021-01-06 19:28:50,393 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:50,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:50,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:50,394 INFO L87 Difference]: Start difference. First operand 3698 states and 5454 transitions. Second operand 4 states. [2021-01-06 19:28:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:50,783 INFO L93 Difference]: Finished difference Result 9081 states and 13379 transitions. [2021-01-06 19:28:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:50,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:50,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:50,797 INFO L225 Difference]: With dead ends: 9081 [2021-01-06 19:28:50,798 INFO L226 Difference]: Without dead ends: 5407 [2021-01-06 19:28:50,807 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:50,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5407 states. [2021-01-06 19:28:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5407 to 3698. [2021-01-06 19:28:51,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:51,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5451 transitions. [2021-01-06 19:28:51,052 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5451 transitions. Word has length 171 [2021-01-06 19:28:51,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:51,052 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5451 transitions. [2021-01-06 19:28:51,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5451 transitions. [2021-01-06 19:28:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:51,055 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:51,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:51,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:28:51,055 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash 279732607, now seen corresponding path program 1 times [2021-01-06 19:28:51,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:51,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171679027] [2021-01-06 19:28:51,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:51,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171679027] [2021-01-06 19:28:51,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:51,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:51,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351377329] [2021-01-06 19:28:51,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:51,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:51,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:51,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:51,141 INFO L87 Difference]: Start difference. First operand 3698 states and 5451 transitions. Second operand 4 states. [2021-01-06 19:28:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:51,516 INFO L93 Difference]: Finished difference Result 9079 states and 13369 transitions. [2021-01-06 19:28:51,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:51,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:51,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:51,531 INFO L225 Difference]: With dead ends: 9079 [2021-01-06 19:28:51,531 INFO L226 Difference]: Without dead ends: 5406 [2021-01-06 19:28:51,539 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2021-01-06 19:28:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 3698. [2021-01-06 19:28:51,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:51,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5448 transitions. [2021-01-06 19:28:51,838 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5448 transitions. Word has length 171 [2021-01-06 19:28:51,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:51,838 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5448 transitions. [2021-01-06 19:28:51,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:51,839 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5448 transitions. [2021-01-06 19:28:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:51,841 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:51,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:51,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:28:51,841 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:51,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash -2084109055, now seen corresponding path program 1 times [2021-01-06 19:28:51,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:51,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383733504] [2021-01-06 19:28:51,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:51,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383733504] [2021-01-06 19:28:51,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:51,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:51,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023270121] [2021-01-06 19:28:51,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:51,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:51,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:51,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:51,923 INFO L87 Difference]: Start difference. First operand 3698 states and 5448 transitions. Second operand 4 states. [2021-01-06 19:28:52,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:52,290 INFO L93 Difference]: Finished difference Result 9077 states and 13359 transitions. [2021-01-06 19:28:52,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:52,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:52,303 INFO L225 Difference]: With dead ends: 9077 [2021-01-06 19:28:52,303 INFO L226 Difference]: Without dead ends: 5405 [2021-01-06 19:28:52,311 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:52,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5405 states. [2021-01-06 19:28:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5405 to 3698. [2021-01-06 19:28:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:52,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5445 transitions. [2021-01-06 19:28:52,584 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5445 transitions. Word has length 171 [2021-01-06 19:28:52,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:52,584 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5445 transitions. [2021-01-06 19:28:52,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:52,584 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5445 transitions. [2021-01-06 19:28:52,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:52,587 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:52,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:52,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:28:52,587 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:52,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash 887679295, now seen corresponding path program 1 times [2021-01-06 19:28:52,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:52,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828822128] [2021-01-06 19:28:52,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:52,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:52,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828822128] [2021-01-06 19:28:52,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:52,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:52,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518289885] [2021-01-06 19:28:52,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:52,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:52,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:52,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:52,692 INFO L87 Difference]: Start difference. First operand 3698 states and 5445 transitions. Second operand 4 states. [2021-01-06 19:28:53,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:53,141 INFO L93 Difference]: Finished difference Result 9075 states and 13349 transitions. [2021-01-06 19:28:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:53,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:53,155 INFO L225 Difference]: With dead ends: 9075 [2021-01-06 19:28:53,155 INFO L226 Difference]: Without dead ends: 5404 [2021-01-06 19:28:53,163 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:53,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5404 states. [2021-01-06 19:28:53,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5404 to 3698. [2021-01-06 19:28:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5442 transitions. [2021-01-06 19:28:53,433 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5442 transitions. Word has length 171 [2021-01-06 19:28:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:53,434 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5442 transitions. [2021-01-06 19:28:53,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5442 transitions. [2021-01-06 19:28:53,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:53,436 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:53,436 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:53,436 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:28:53,437 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:53,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:53,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1510308543, now seen corresponding path program 1 times [2021-01-06 19:28:53,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:53,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364029292] [2021-01-06 19:28:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:53,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364029292] [2021-01-06 19:28:53,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:53,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:53,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437581885] [2021-01-06 19:28:53,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:53,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:53,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:53,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:53,537 INFO L87 Difference]: Start difference. First operand 3698 states and 5442 transitions. Second operand 3 states. [2021-01-06 19:28:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:53,738 INFO L93 Difference]: Finished difference Result 7368 states and 10842 transitions. [2021-01-06 19:28:53,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:53,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:53,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:53,746 INFO L225 Difference]: With dead ends: 7368 [2021-01-06 19:28:53,746 INFO L226 Difference]: Without dead ends: 3698 [2021-01-06 19:28:53,753 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:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2021-01-06 19:28:53,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2021-01-06 19:28:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5434 transitions. [2021-01-06 19:28:53,996 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5434 transitions. Word has length 171 [2021-01-06 19:28:53,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:53,996 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5434 transitions. [2021-01-06 19:28:53,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5434 transitions. [2021-01-06 19:28:53,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:53,998 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:53,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:53,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:28:53,999 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:53,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:54,000 INFO L82 PathProgramCache]: Analyzing trace with hash -897261379, now seen corresponding path program 1 times [2021-01-06 19:28:54,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:54,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824091287] [2021-01-06 19:28:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:54,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824091287] [2021-01-06 19:28:54,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:54,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:54,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337379684] [2021-01-06 19:28:54,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:54,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:54,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:54,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:54,070 INFO L87 Difference]: Start difference. First operand 3698 states and 5434 transitions. Second operand 4 states. [2021-01-06 19:28:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:54,458 INFO L93 Difference]: Finished difference Result 9069 states and 13314 transitions. [2021-01-06 19:28:54,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:54,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:54,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:54,469 INFO L225 Difference]: With dead ends: 9069 [2021-01-06 19:28:54,470 INFO L226 Difference]: Without dead ends: 5401 [2021-01-06 19:28:54,477 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:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5401 states. [2021-01-06 19:28:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5401 to 3698. [2021-01-06 19:28:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:54,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5431 transitions. [2021-01-06 19:28:54,710 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5431 transitions. Word has length 171 [2021-01-06 19:28:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:54,710 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5431 transitions. [2021-01-06 19:28:54,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5431 transitions. [2021-01-06 19:28:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:54,712 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:54,713 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:54,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:28:54,713 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:54,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:54,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1437690885, now seen corresponding path program 1 times [2021-01-06 19:28:54,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:54,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424047855] [2021-01-06 19:28:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:54,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424047855] [2021-01-06 19:28:54,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:54,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:54,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440440580] [2021-01-06 19:28:54,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:54,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:54,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:54,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:54,821 INFO L87 Difference]: Start difference. First operand 3698 states and 5431 transitions. Second operand 3 states. [2021-01-06 19:28:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:55,041 INFO L93 Difference]: Finished difference Result 7365 states and 10816 transitions. [2021-01-06 19:28:55,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:55,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:55,049 INFO L225 Difference]: With dead ends: 7365 [2021-01-06 19:28:55,049 INFO L226 Difference]: Without dead ends: 3698 [2021-01-06 19:28:55,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2021-01-06 19:28:55,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2021-01-06 19:28:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5423 transitions. [2021-01-06 19:28:55,263 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5423 transitions. Word has length 171 [2021-01-06 19:28:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:55,263 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5423 transitions. [2021-01-06 19:28:55,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5423 transitions. [2021-01-06 19:28:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:55,265 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:55,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:55,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:28:55,266 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash -207468033, now seen corresponding path program 1 times [2021-01-06 19:28:55,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:55,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617857141] [2021-01-06 19:28:55,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:55,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:55,329 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:55,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617857141] [2021-01-06 19:28:55,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:55,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:55,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293858256] [2021-01-06 19:28:55,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:55,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:55,332 INFO L87 Difference]: Start difference. First operand 3698 states and 5423 transitions. Second operand 4 states. [2021-01-06 19:28:55,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:55,793 INFO L93 Difference]: Finished difference Result 8967 states and 13143 transitions. [2021-01-06 19:28:55,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:55,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:55,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:55,805 INFO L225 Difference]: With dead ends: 8967 [2021-01-06 19:28:55,806 INFO L226 Difference]: Without dead ends: 5301 [2021-01-06 19:28:55,851 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:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5301 states. [2021-01-06 19:28:56,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5301 to 3698. [2021-01-06 19:28:56,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5420 transitions. [2021-01-06 19:28:56,080 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5420 transitions. Word has length 171 [2021-01-06 19:28:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:56,081 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5420 transitions. [2021-01-06 19:28:56,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5420 transitions. [2021-01-06 19:28:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:56,083 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:56,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:56,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:28:56,084 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:56,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:56,085 INFO L82 PathProgramCache]: Analyzing trace with hash 203142333, now seen corresponding path program 1 times [2021-01-06 19:28:56,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:56,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773997513] [2021-01-06 19:28:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:56,158 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:56,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773997513] [2021-01-06 19:28:56,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:56,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:56,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108500306] [2021-01-06 19:28:56,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:56,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:56,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:56,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:56,163 INFO L87 Difference]: Start difference. First operand 3698 states and 5420 transitions. Second operand 4 states. [2021-01-06 19:28:56,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:56,746 INFO L93 Difference]: Finished difference Result 8965 states and 13133 transitions. [2021-01-06 19:28:56,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:56,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:56,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:56,757 INFO L225 Difference]: With dead ends: 8965 [2021-01-06 19:28:56,757 INFO L226 Difference]: Without dead ends: 5300 [2021-01-06 19:28:56,763 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:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5300 states. [2021-01-06 19:28:57,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5300 to 3698. [2021-01-06 19:28:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:57,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5417 transitions. [2021-01-06 19:28:57,112 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5417 transitions. Word has length 171 [2021-01-06 19:28:57,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:57,112 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5417 transitions. [2021-01-06 19:28:57,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5417 transitions. [2021-01-06 19:28:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:57,114 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:57,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:57,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:28:57,115 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1584727489, now seen corresponding path program 1 times [2021-01-06 19:28:57,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:57,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234078261] [2021-01-06 19:28:57,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:57,222 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:57,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234078261] [2021-01-06 19:28:57,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:57,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:57,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451109962] [2021-01-06 19:28:57,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:57,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:57,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:57,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:57,225 INFO L87 Difference]: Start difference. First operand 3698 states and 5417 transitions. Second operand 3 states. [2021-01-06 19:28:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:57,566 INFO L93 Difference]: Finished difference Result 7362 states and 10785 transitions. [2021-01-06 19:28:57,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:57,566 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:57,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:57,572 INFO L225 Difference]: With dead ends: 7362 [2021-01-06 19:28:57,572 INFO L226 Difference]: Without dead ends: 3698 [2021-01-06 19:28:57,579 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:57,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2021-01-06 19:28:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2021-01-06 19:28:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5379 transitions. [2021-01-06 19:28:57,863 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5379 transitions. Word has length 171 [2021-01-06 19:28:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:57,863 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5379 transitions. [2021-01-06 19:28:57,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5379 transitions. [2021-01-06 19:28:57,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:57,866 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:57,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:57,866 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:28:57,866 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:57,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1653021692, now seen corresponding path program 1 times [2021-01-06 19:28:57,867 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:57,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726410651] [2021-01-06 19:28:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:57,938 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:57,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726410651] [2021-01-06 19:28:57,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:57,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:57,941 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918363372] [2021-01-06 19:28:57,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:57,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:57,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:57,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:57,943 INFO L87 Difference]: Start difference. First operand 3698 states and 5379 transitions. Second operand 4 states. [2021-01-06 19:28:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:58,439 INFO L93 Difference]: Finished difference Result 8961 states and 13029 transitions. [2021-01-06 19:28:58,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:58,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:58,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:58,447 INFO L225 Difference]: With dead ends: 8961 [2021-01-06 19:28:58,448 INFO L226 Difference]: Without dead ends: 5298 [2021-01-06 19:28:58,454 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:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5298 states. [2021-01-06 19:28:58,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5298 to 3698. [2021-01-06 19:28:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5376 transitions. [2021-01-06 19:28:58,751 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5376 transitions. Word has length 171 [2021-01-06 19:28:58,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:58,751 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5376 transitions. [2021-01-06 19:28:58,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5376 transitions. [2021-01-06 19:28:58,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:58,752 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:58,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:58,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:28:58,753 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:58,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:58,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1722669566, now seen corresponding path program 1 times [2021-01-06 19:28:58,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:58,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591519867] [2021-01-06 19:28:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:58,822 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:58,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591519867] [2021-01-06 19:28:58,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:58,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:58,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451992572] [2021-01-06 19:28:58,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:58,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:58,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:58,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:58,825 INFO L87 Difference]: Start difference. First operand 3698 states and 5376 transitions. Second operand 4 states. [2021-01-06 19:28:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:59,240 INFO L93 Difference]: Finished difference Result 8959 states and 13019 transitions. [2021-01-06 19:28:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:59,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:59,246 INFO L225 Difference]: With dead ends: 8959 [2021-01-06 19:28:59,246 INFO L226 Difference]: Without dead ends: 5297 [2021-01-06 19:28:59,251 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:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2021-01-06 19:28:59,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 3698. [2021-01-06 19:28:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:28:59,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5373 transitions. [2021-01-06 19:28:59,512 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5373 transitions. Word has length 171 [2021-01-06 19:28:59,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:59,513 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5373 transitions. [2021-01-06 19:28:59,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5373 transitions. [2021-01-06 19:28:59,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:59,514 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:59,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:59,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:28:59,515 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:59,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:59,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2140558268, now seen corresponding path program 1 times [2021-01-06 19:28:59,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:59,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328815616] [2021-01-06 19:28:59,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:59,610 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:59,611 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328815616] [2021-01-06 19:28:59,611 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:59,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:59,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62224623] [2021-01-06 19:28:59,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:59,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:59,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:59,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:59,612 INFO L87 Difference]: Start difference. First operand 3698 states and 5373 transitions. Second operand 4 states. [2021-01-06 19:29:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:00,104 INFO L93 Difference]: Finished difference Result 8955 states and 13005 transitions. [2021-01-06 19:29:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:00,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:00,110 INFO L225 Difference]: With dead ends: 8955 [2021-01-06 19:29:00,110 INFO L226 Difference]: Without dead ends: 5295 [2021-01-06 19:29:00,114 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:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2021-01-06 19:29:00,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 3698. [2021-01-06 19:29:00,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:29:00,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5370 transitions. [2021-01-06 19:29:00,351 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5370 transitions. Word has length 171 [2021-01-06 19:29:00,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:00,351 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5370 transitions. [2021-01-06 19:29:00,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:00,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5370 transitions. [2021-01-06 19:29:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:00,353 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:00,353 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:00,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:29:00,353 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:00,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:00,354 INFO L82 PathProgramCache]: Analyzing trace with hash 523117818, now seen corresponding path program 1 times [2021-01-06 19:29:00,354 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:00,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008164265] [2021-01-06 19:29:00,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:00,417 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:29:00,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008164265] [2021-01-06 19:29:00,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:00,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:00,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957408149] [2021-01-06 19:29:00,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:00,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:00,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:00,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:00,419 INFO L87 Difference]: Start difference. First operand 3698 states and 5370 transitions. Second operand 4 states. [2021-01-06 19:29:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:00,883 INFO L93 Difference]: Finished difference Result 8953 states and 12995 transitions. [2021-01-06 19:29:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:00,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:00,888 INFO L225 Difference]: With dead ends: 8953 [2021-01-06 19:29:00,888 INFO L226 Difference]: Without dead ends: 5294 [2021-01-06 19:29:00,891 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:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5294 states. [2021-01-06 19:29:01,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5294 to 3698. [2021-01-06 19:29:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:29:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5367 transitions. [2021-01-06 19:29:01,077 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5367 transitions. Word has length 171 [2021-01-06 19:29:01,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:01,077 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5367 transitions. [2021-01-06 19:29:01,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5367 transitions. [2021-01-06 19:29:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:01,078 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:01,078 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:01,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:29:01,079 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:01,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:01,079 INFO L82 PathProgramCache]: Analyzing trace with hash 886584316, now seen corresponding path program 1 times [2021-01-06 19:29:01,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:01,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466083601] [2021-01-06 19:29:01,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:01,145 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:29:01,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466083601] [2021-01-06 19:29:01,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:01,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:01,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058018329] [2021-01-06 19:29:01,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:01,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:01,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:01,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:01,147 INFO L87 Difference]: Start difference. First operand 3698 states and 5367 transitions. Second operand 4 states. [2021-01-06 19:29:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:01,650 INFO L93 Difference]: Finished difference Result 8951 states and 12985 transitions. [2021-01-06 19:29:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:01,651 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:01,657 INFO L225 Difference]: With dead ends: 8951 [2021-01-06 19:29:01,658 INFO L226 Difference]: Without dead ends: 5293 [2021-01-06 19:29:01,662 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:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2021-01-06 19:29:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 3698. [2021-01-06 19:29:01,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:29:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5364 transitions. [2021-01-06 19:29:01,929 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5364 transitions. Word has length 171 [2021-01-06 19:29:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:01,930 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5364 transitions. [2021-01-06 19:29:01,930 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5364 transitions. [2021-01-06 19:29:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:01,931 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:01,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:01,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:29:01,931 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:01,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1175403706, now seen corresponding path program 1 times [2021-01-06 19:29:01,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:01,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402618535] [2021-01-06 19:29:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:02,015 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:29:02,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402618535] [2021-01-06 19:29:02,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:02,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:02,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215947193] [2021-01-06 19:29:02,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:02,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:02,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:02,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:02,017 INFO L87 Difference]: Start difference. First operand 3698 states and 5364 transitions. Second operand 4 states. [2021-01-06 19:29:02,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:02,593 INFO L93 Difference]: Finished difference Result 8949 states and 12975 transitions. [2021-01-06 19:29:02,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:02,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:02,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:02,599 INFO L225 Difference]: With dead ends: 8949 [2021-01-06 19:29:02,599 INFO L226 Difference]: Without dead ends: 5292 [2021-01-06 19:29:02,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:02,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5292 states. [2021-01-06 19:29:02,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5292 to 3698. [2021-01-06 19:29:02,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:29:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5361 transitions. [2021-01-06 19:29:02,812 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5361 transitions. Word has length 171 [2021-01-06 19:29:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:02,812 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5361 transitions. [2021-01-06 19:29:02,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5361 transitions. [2021-01-06 19:29:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:02,813 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:02,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:02,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:29:02,814 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash 630531132, now seen corresponding path program 1 times [2021-01-06 19:29:02,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:02,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342864482] [2021-01-06 19:29:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:02,879 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:29:02,879 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342864482] [2021-01-06 19:29:02,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:02,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:02,880 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217518032] [2021-01-06 19:29:02,880 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:02,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:02,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:02,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:02,881 INFO L87 Difference]: Start difference. First operand 3698 states and 5361 transitions. Second operand 4 states. [2021-01-06 19:29:03,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:03,429 INFO L93 Difference]: Finished difference Result 8947 states and 12965 transitions. [2021-01-06 19:29:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:03,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:03,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:03,434 INFO L225 Difference]: With dead ends: 8947 [2021-01-06 19:29:03,434 INFO L226 Difference]: Without dead ends: 5291 [2021-01-06 19:29:03,438 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:03,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2021-01-06 19:29:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 3698. [2021-01-06 19:29:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:29:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5358 transitions. [2021-01-06 19:29:03,680 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5358 transitions. Word has length 171 [2021-01-06 19:29:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:03,680 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5358 transitions. [2021-01-06 19:29:03,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5358 transitions. [2021-01-06 19:29:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:03,681 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:03,681 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:03,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:29:03,681 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:03,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:03,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1305691258, now seen corresponding path program 1 times [2021-01-06 19:29:03,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:03,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087262398] [2021-01-06 19:29:03,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:03,741 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:29:03,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087262398] [2021-01-06 19:29:03,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:03,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:03,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116016099] [2021-01-06 19:29:03,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:03,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:03,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:03,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:03,744 INFO L87 Difference]: Start difference. First operand 3698 states and 5358 transitions. Second operand 4 states. [2021-01-06 19:29:04,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:04,226 INFO L93 Difference]: Finished difference Result 8945 states and 12955 transitions. [2021-01-06 19:29:04,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:04,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:04,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,232 INFO L225 Difference]: With dead ends: 8945 [2021-01-06 19:29:04,232 INFO L226 Difference]: Without dead ends: 5290 [2021-01-06 19:29:04,237 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:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2021-01-06 19:29:04,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 3698. [2021-01-06 19:29:04,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:29:04,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5355 transitions. [2021-01-06 19:29:04,465 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5355 transitions. Word has length 171 [2021-01-06 19:29:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:04,466 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5355 transitions. [2021-01-06 19:29:04,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5355 transitions. [2021-01-06 19:29:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:04,466 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:04,467 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:04,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:29:04,467 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:04,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:04,467 INFO L82 PathProgramCache]: Analyzing trace with hash 357639292, now seen corresponding path program 1 times [2021-01-06 19:29:04,467 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:04,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553847265] [2021-01-06 19:29:04,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:04,563 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:29:04,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553847265] [2021-01-06 19:29:04,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:04,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:04,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951104316] [2021-01-06 19:29:04,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:04,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:04,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:04,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:04,566 INFO L87 Difference]: Start difference. First operand 3698 states and 5355 transitions. Second operand 3 states. [2021-01-06 19:29:04,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:04,894 INFO L93 Difference]: Finished difference Result 7352 states and 10650 transitions. [2021-01-06 19:29:04,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:04,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:04,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,898 INFO L225 Difference]: With dead ends: 7352 [2021-01-06 19:29:04,898 INFO L226 Difference]: Without dead ends: 3698 [2021-01-06 19:29:04,903 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:04,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2021-01-06 19:29:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3698. [2021-01-06 19:29:05,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3698 states. [2021-01-06 19:29:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 5317 transitions. [2021-01-06 19:29:05,121 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 5317 transitions. Word has length 171 [2021-01-06 19:29:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:05,121 INFO L481 AbstractCegarLoop]: Abstraction has 3698 states and 5317 transitions. [2021-01-06 19:29:05,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:05,121 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 5317 transitions. [2021-01-06 19:29:05,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:05,122 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:05,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:05,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:29:05,123 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:05,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:05,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1248200712, now seen corresponding path program 1 times [2021-01-06 19:29:05,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:05,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835171937] [2021-01-06 19:29:05,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:05,177 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:29:05,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835171937] [2021-01-06 19:29:05,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:05,178 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:05,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52564797] [2021-01-06 19:29:05,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:05,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:05,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:05,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:05,179 INFO L87 Difference]: Start difference. First operand 3698 states and 5317 transitions. Second operand 3 states. [2021-01-06 19:29:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,744 INFO L93 Difference]: Finished difference Result 10838 states and 15566 transitions. [2021-01-06 19:29:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:05,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,752 INFO L225 Difference]: With dead ends: 10838 [2021-01-06 19:29:05,752 INFO L226 Difference]: Without dead ends: 7187 [2021-01-06 19:29:05,757 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:05,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2021-01-06 19:29:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 6995. [2021-01-06 19:29:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6995 states. [2021-01-06 19:29:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6995 states to 6995 states and 10011 transitions. [2021-01-06 19:29:06,216 INFO L78 Accepts]: Start accepts. Automaton has 6995 states and 10011 transitions. Word has length 171 [2021-01-06 19:29:06,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:06,216 INFO L481 AbstractCegarLoop]: Abstraction has 6995 states and 10011 transitions. [2021-01-06 19:29:06,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6995 states and 10011 transitions. [2021-01-06 19:29:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:06,222 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:06,222 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:06,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:29:06,222 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:06,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:06,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1031873080, now seen corresponding path program 1 times [2021-01-06 19:29:06,223 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:06,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799317813] [2021-01-06 19:29:06,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:06,329 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:06,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799317813] [2021-01-06 19:29:06,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:06,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:06,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580405842] [2021-01-06 19:29:06,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:06,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:06,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:06,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:06,332 INFO L87 Difference]: Start difference. First operand 6995 states and 10011 transitions. Second operand 5 states. [2021-01-06 19:29:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:07,808 INFO L93 Difference]: Finished difference Result 20722 states and 29666 transitions. [2021-01-06 19:29:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:07,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:07,822 INFO L225 Difference]: With dead ends: 20722 [2021-01-06 19:29:07,822 INFO L226 Difference]: Without dead ends: 13778 [2021-01-06 19:29:07,830 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:07,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13778 states. [2021-01-06 19:29:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13778 to 7088. [2021-01-06 19:29:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7088 states. [2021-01-06 19:29:08,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7088 states to 7088 states and 10074 transitions. [2021-01-06 19:29:08,328 INFO L78 Accepts]: Start accepts. Automaton has 7088 states and 10074 transitions. Word has length 279 [2021-01-06 19:29:08,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:08,328 INFO L481 AbstractCegarLoop]: Abstraction has 7088 states and 10074 transitions. [2021-01-06 19:29:08,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 7088 states and 10074 transitions. [2021-01-06 19:29:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:08,333 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:08,333 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:08,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:29:08,333 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2102224180, now seen corresponding path program 1 times [2021-01-06 19:29:08,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:08,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144616593] [2021-01-06 19:29:08,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:08,433 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:08,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144616593] [2021-01-06 19:29:08,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:08,434 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:08,434 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529900604] [2021-01-06 19:29:08,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:08,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:08,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:08,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:08,435 INFO L87 Difference]: Start difference. First operand 7088 states and 10074 transitions. Second operand 5 states. [2021-01-06 19:29:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:09,488 INFO L93 Difference]: Finished difference Result 16803 states and 23876 transitions. [2021-01-06 19:29:09,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:09,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:09,499 INFO L225 Difference]: With dead ends: 16803 [2021-01-06 19:29:09,499 INFO L226 Difference]: Without dead ends: 9780 [2021-01-06 19:29:09,510 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:29:09,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9780 states. [2021-01-06 19:29:10,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9780 to 7100. [2021-01-06 19:29:10,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7100 states. [2021-01-06 19:29:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7100 states to 7100 states and 10029 transitions. [2021-01-06 19:29:10,143 INFO L78 Accepts]: Start accepts. Automaton has 7100 states and 10029 transitions. Word has length 279 [2021-01-06 19:29:10,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:10,144 INFO L481 AbstractCegarLoop]: Abstraction has 7100 states and 10029 transitions. [2021-01-06 19:29:10,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand 7100 states and 10029 transitions. [2021-01-06 19:29:10,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:10,149 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:10,150 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:10,150 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:29:10,150 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:10,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:10,150 INFO L82 PathProgramCache]: Analyzing trace with hash -453591600, now seen corresponding path program 1 times [2021-01-06 19:29:10,151 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:10,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373680798] [2021-01-06 19:29:10,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:10,246 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:10,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373680798] [2021-01-06 19:29:10,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:10,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:10,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122977475] [2021-01-06 19:29:10,247 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:10,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:10,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:10,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:10,248 INFO L87 Difference]: Start difference. First operand 7100 states and 10029 transitions. Second operand 5 states. [2021-01-06 19:29:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:12,058 INFO L93 Difference]: Finished difference Result 26309 states and 37316 transitions. [2021-01-06 19:29:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:12,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:12,075 INFO L225 Difference]: With dead ends: 26309 [2021-01-06 19:29:12,075 INFO L226 Difference]: Without dead ends: 19281 [2021-01-06 19:29:12,085 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:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19281 states. [2021-01-06 19:29:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19281 to 7283. [2021-01-06 19:29:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7283 states. [2021-01-06 19:29:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 10212 transitions. [2021-01-06 19:29:12,905 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 10212 transitions. Word has length 279 [2021-01-06 19:29:12,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:12,905 INFO L481 AbstractCegarLoop]: Abstraction has 7283 states and 10212 transitions. [2021-01-06 19:29:12,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 10212 transitions. [2021-01-06 19:29:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:12,912 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:12,912 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:12,912 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:29:12,913 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:12,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:12,913 INFO L82 PathProgramCache]: Analyzing trace with hash -323727022, now seen corresponding path program 1 times [2021-01-06 19:29:12,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:12,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220298636] [2021-01-06 19:29:12,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:13,082 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,082 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220298636] [2021-01-06 19:29:13,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:13,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:13,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959333265] [2021-01-06 19:29:13,083 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:13,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:13,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:13,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:13,084 INFO L87 Difference]: Start difference. First operand 7283 states and 10212 transitions. Second operand 4 states. [2021-01-06 19:29:14,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:14,936 INFO L93 Difference]: Finished difference Result 24760 states and 34665 transitions. [2021-01-06 19:29:14,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:14,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2021-01-06 19:29:14,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:14,953 INFO L225 Difference]: With dead ends: 24760 [2021-01-06 19:29:14,953 INFO L226 Difference]: Without dead ends: 17554 [2021-01-06 19:29:14,961 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:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17554 states. [2021-01-06 19:29:16,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17554 to 13914. [2021-01-06 19:29:16,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13914 states. [2021-01-06 19:29:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13914 states to 13914 states and 19432 transitions. [2021-01-06 19:29:16,188 INFO L78 Accepts]: Start accepts. Automaton has 13914 states and 19432 transitions. Word has length 279 [2021-01-06 19:29:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:16,189 INFO L481 AbstractCegarLoop]: Abstraction has 13914 states and 19432 transitions. [2021-01-06 19:29:16,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 13914 states and 19432 transitions. [2021-01-06 19:29:16,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:16,198 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:16,199 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:16,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:29:16,199 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:16,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:16,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1100677485, now seen corresponding path program 1 times [2021-01-06 19:29:16,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:16,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560715232] [2021-01-06 19:29:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:16,305 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:16,306 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560715232] [2021-01-06 19:29:16,306 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:16,306 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:16,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428176877] [2021-01-06 19:29:16,307 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:16,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:16,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:16,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:16,308 INFO L87 Difference]: Start difference. First operand 13914 states and 19432 transitions. Second operand 5 states. [2021-01-06 19:29:18,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:18,658 INFO L93 Difference]: Finished difference Result 39489 states and 55392 transitions. [2021-01-06 19:29:18,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:18,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:18,692 INFO L225 Difference]: With dead ends: 39489 [2021-01-06 19:29:18,692 INFO L226 Difference]: Without dead ends: 25656 [2021-01-06 19:29:18,708 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,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25656 states. [2021-01-06 19:29:20,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25656 to 14094. [2021-01-06 19:29:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14094 states. [2021-01-06 19:29:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14094 states to 14094 states and 19555 transitions. [2021-01-06 19:29:20,077 INFO L78 Accepts]: Start accepts. Automaton has 14094 states and 19555 transitions. Word has length 279 [2021-01-06 19:29:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:20,077 INFO L481 AbstractCegarLoop]: Abstraction has 14094 states and 19555 transitions. [2021-01-06 19:29:20,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 14094 states and 19555 transitions. [2021-01-06 19:29:20,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:20,085 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:20,086 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:20,086 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:29:20,086 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2058345365, now seen corresponding path program 1 times [2021-01-06 19:29:20,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:20,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463450756] [2021-01-06 19:29:20,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:20,209 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:20,210 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463450756] [2021-01-06 19:29:20,210 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:20,210 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:20,210 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332107697] [2021-01-06 19:29:20,211 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:20,211 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:20,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:20,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:20,213 INFO L87 Difference]: Start difference. First operand 14094 states and 19555 transitions. Second operand 5 states. [2021-01-06 19:29:23,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:23,849 INFO L93 Difference]: Finished difference Result 50387 states and 70386 transitions. [2021-01-06 19:29:23,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:23,850 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:23,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:23,895 INFO L225 Difference]: With dead ends: 50387 [2021-01-06 19:29:23,896 INFO L226 Difference]: Without dead ends: 36381 [2021-01-06 19:29:23,912 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:23,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36381 states. [2021-01-06 19:29:25,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36381 to 14445. [2021-01-06 19:29:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14445 states. [2021-01-06 19:29:25,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14445 states to 14445 states and 19906 transitions. [2021-01-06 19:29:25,482 INFO L78 Accepts]: Start accepts. Automaton has 14445 states and 19906 transitions. Word has length 279 [2021-01-06 19:29:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:25,483 INFO L481 AbstractCegarLoop]: Abstraction has 14445 states and 19906 transitions. [2021-01-06 19:29:25,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 14445 states and 19906 transitions. [2021-01-06 19:29:25,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:25,489 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:25,490 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:25,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:29:25,490 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:25,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:25,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1952636393, now seen corresponding path program 1 times [2021-01-06 19:29:25,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:25,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592538574] [2021-01-06 19:29:25,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:25,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:25,599 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:25,599 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592538574] [2021-01-06 19:29:25,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:25,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:25,600 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488536666] [2021-01-06 19:29:25,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:25,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:25,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:25,601 INFO L87 Difference]: Start difference. First operand 14445 states and 19906 transitions. Second operand 3 states. [2021-01-06 19:29:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:28,562 INFO L93 Difference]: Finished difference Result 42102 states and 57991 transitions. [2021-01-06 19:29:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:28,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2021-01-06 19:29:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:28,588 INFO L225 Difference]: With dead ends: 42102 [2021-01-06 19:29:28,588 INFO L226 Difference]: Without dead ends: 27750 [2021-01-06 19:29:28,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27750 states. [2021-01-06 19:29:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27750 to 27732. [2021-01-06 19:29:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27732 states. [2021-01-06 19:29:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27732 states to 27732 states and 38071 transitions. [2021-01-06 19:29:31,736 INFO L78 Accepts]: Start accepts. Automaton has 27732 states and 38071 transitions. Word has length 279 [2021-01-06 19:29:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:31,736 INFO L481 AbstractCegarLoop]: Abstraction has 27732 states and 38071 transitions. [2021-01-06 19:29:31,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 27732 states and 38071 transitions. [2021-01-06 19:29:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:31,746 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:31,746 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:31,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:29:31,747 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:31,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1056893144, now seen corresponding path program 1 times [2021-01-06 19:29:31,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:31,747 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005560766] [2021-01-06 19:29:31,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:31,852 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:31,853 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005560766] [2021-01-06 19:29:31,853 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:31,853 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:31,853 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032278228] [2021-01-06 19:29:31,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:31,854 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:31,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:31,854 INFO L87 Difference]: Start difference. First operand 27732 states and 38071 transitions. Second operand 5 states. [2021-01-06 19:29:37,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:37,340 INFO L93 Difference]: Finished difference Result 77019 states and 106336 transitions. [2021-01-06 19:29:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:37,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:29:37,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:37,390 INFO L225 Difference]: With dead ends: 77019 [2021-01-06 19:29:37,390 INFO L226 Difference]: Without dead ends: 49384 [2021-01-06 19:29:37,412 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:37,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49384 states. [2021-01-06 19:29:40,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49384 to 28080. [2021-01-06 19:29:40,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28080 states. [2021-01-06 19:29:40,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28080 states to 28080 states and 38310 transitions. [2021-01-06 19:29:40,815 INFO L78 Accepts]: Start accepts. Automaton has 28080 states and 38310 transitions. Word has length 279 [2021-01-06 19:29:40,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:40,815 INFO L481 AbstractCegarLoop]: Abstraction has 28080 states and 38310 transitions. [2021-01-06 19:29:40,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:40,815 INFO L276 IsEmpty]: Start isEmpty. Operand 28080 states and 38310 transitions. [2021-01-06 19:29:40,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:40,826 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:40,826 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:40,827 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:29:40,827 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:40,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:40,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1516316708, now seen corresponding path program 1 times [2021-01-06 19:29:40,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:40,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554939202] [2021-01-06 19:29:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:40,950 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:40,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554939202] [2021-01-06 19:29:40,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:40,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:40,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580812710] [2021-01-06 19:29:40,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:40,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:40,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:40,953 INFO L87 Difference]: Start difference. First operand 28080 states and 38310 transitions. Second operand 4 states. [2021-01-06 19:29:48,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:48,460 INFO L93 Difference]: Finished difference Result 95954 states and 130733 transitions. [2021-01-06 19:29:48,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:48,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2021-01-06 19:29:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:48,526 INFO L225 Difference]: With dead ends: 95954 [2021-01-06 19:29:48,526 INFO L226 Difference]: Without dead ends: 67973 [2021-01-06 19:29:48,548 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:48,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67973 states. [2021-01-06 19:29:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67973 to 54015. [2021-01-06 19:29:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54015 states. [2021-01-06 19:29:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54015 states to 54015 states and 73423 transitions. [2021-01-06 19:29:54,753 INFO L78 Accepts]: Start accepts. Automaton has 54015 states and 73423 transitions. Word has length 279 [2021-01-06 19:29:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:54,754 INFO L481 AbstractCegarLoop]: Abstraction has 54015 states and 73423 transitions. [2021-01-06 19:29:54,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:54,754 INFO L276 IsEmpty]: Start isEmpty. Operand 54015 states and 73423 transitions. [2021-01-06 19:29:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:29:54,771 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:54,772 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:54,772 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:29:54,772 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash -604989858, now seen corresponding path program 1 times [2021-01-06 19:29:54,773 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:54,773 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784081836] [2021-01-06 19:29:54,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:54,870 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:54,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784081836] [2021-01-06 19:29:54,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:54,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:54,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662687507] [2021-01-06 19:29:54,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:54,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:54,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:54,872 INFO L87 Difference]: Start difference. First operand 54015 states and 73423 transitions. Second operand 5 states. [2021-01-06 19:30:05,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:05,642 INFO L93 Difference]: Finished difference Result 148627 states and 203306 transitions. [2021-01-06 19:30:05,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:05,642 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:30:05,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:05,749 INFO L225 Difference]: With dead ends: 148627 [2021-01-06 19:30:05,749 INFO L226 Difference]: Without dead ends: 94715 [2021-01-06 19:30:05,794 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:05,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94715 states. [2021-01-06 19:30:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94715 to 54687. [2021-01-06 19:30:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54687 states. [2021-01-06 19:30:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54687 states to 54687 states and 73886 transitions. [2021-01-06 19:30:12,652 INFO L78 Accepts]: Start accepts. Automaton has 54687 states and 73886 transitions. Word has length 279 [2021-01-06 19:30:12,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:12,653 INFO L481 AbstractCegarLoop]: Abstraction has 54687 states and 73886 transitions. [2021-01-06 19:30:12,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:12,653 INFO L276 IsEmpty]: Start isEmpty. Operand 54687 states and 73886 transitions. [2021-01-06 19:30:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:30:12,675 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:12,675 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:12,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 19:30:12,676 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:12,676 INFO L82 PathProgramCache]: Analyzing trace with hash -119465886, now seen corresponding path program 1 times [2021-01-06 19:30:12,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:12,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101139127] [2021-01-06 19:30:12,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:12,801 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:12,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101139127] [2021-01-06 19:30:12,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:12,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:12,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436411508] [2021-01-06 19:30:12,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:12,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:12,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:12,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:12,803 INFO L87 Difference]: Start difference. First operand 54687 states and 73886 transitions. Second operand 4 states. [2021-01-06 19:30:28,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:28,255 INFO L93 Difference]: Finished difference Result 186655 states and 251833 transitions. [2021-01-06 19:30:28,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:28,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 279 [2021-01-06 19:30:28,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:28,548 INFO L225 Difference]: With dead ends: 186655 [2021-01-06 19:30:28,548 INFO L226 Difference]: Without dead ends: 132080 [2021-01-06 19:30:28,593 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,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132080 states. [2021-01-06 19:30:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132080 to 105246. [2021-01-06 19:30:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105246 states. [2021-01-06 19:30:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105246 states to 105246 states and 141691 transitions. [2021-01-06 19:30:41,469 INFO L78 Accepts]: Start accepts. Automaton has 105246 states and 141691 transitions. Word has length 279 [2021-01-06 19:30:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:41,469 INFO L481 AbstractCegarLoop]: Abstraction has 105246 states and 141691 transitions. [2021-01-06 19:30:41,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 105246 states and 141691 transitions. [2021-01-06 19:30:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:30:41,502 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:41,503 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:41,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:30:41,503 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:41,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1391785500, now seen corresponding path program 1 times [2021-01-06 19:30:41,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:41,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640280118] [2021-01-06 19:30:41,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:41,616 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:41,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640280118] [2021-01-06 19:30:41,616 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:41,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:41,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832915654] [2021-01-06 19:30:41,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:41,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:41,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:41,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:41,618 INFO L87 Difference]: Start difference. First operand 105246 states and 141691 transitions. Second operand 5 states. [2021-01-06 19:31:02,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:02,801 INFO L93 Difference]: Finished difference Result 283740 states and 384342 transitions. [2021-01-06 19:31:02,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:02,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:31:02,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:03,001 INFO L225 Difference]: With dead ends: 283740 [2021-01-06 19:31:03,001 INFO L226 Difference]: Without dead ends: 178610 [2021-01-06 19:31:03,077 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:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178610 states. [2021-01-06 19:31:16,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178610 to 106542. [2021-01-06 19:31:16,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106542 states. [2021-01-06 19:31:17,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106542 states to 106542 states and 142586 transitions. [2021-01-06 19:31:17,163 INFO L78 Accepts]: Start accepts. Automaton has 106542 states and 142586 transitions. Word has length 279 [2021-01-06 19:31:17,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:17,163 INFO L481 AbstractCegarLoop]: Abstraction has 106542 states and 142586 transitions. [2021-01-06 19:31:17,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:31:17,163 INFO L276 IsEmpty]: Start isEmpty. Operand 106542 states and 142586 transitions. [2021-01-06 19:31:17,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2021-01-06 19:31:17,201 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:17,201 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:17,201 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 19:31:17,201 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:17,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:17,202 INFO L82 PathProgramCache]: Analyzing trace with hash 894136808, now seen corresponding path program 1 times [2021-01-06 19:31:17,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:17,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217741135] [2021-01-06 19:31:17,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:17,566 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,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217741135] [2021-01-06 19:31:17,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:17,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:31:17,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101367826] [2021-01-06 19:31:17,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:31:17,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:17,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:31:17,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:17,567 INFO L87 Difference]: Start difference. First operand 106542 states and 142586 transitions. Second operand 5 states. [2021-01-06 19:31:47,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:47,680 INFO L93 Difference]: Finished difference Result 350378 states and 472875 transitions. [2021-01-06 19:31:47,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:31:47,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 279 [2021-01-06 19:31:47,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:48,014 INFO L225 Difference]: With dead ends: 350378 [2021-01-06 19:31:48,014 INFO L226 Difference]: Without dead ends: 243959 [2021-01-06 19:31:48,114 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:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243959 states.