/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.07.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:26:10,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:26:10,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:26:10,144 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:26:10,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:26:10,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:26:10,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:26:10,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:26:10,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:26:10,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:26:10,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:26:10,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:26:10,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:26:10,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:26:10,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:26:10,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:26:10,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:26:10,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:26:10,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:26:10,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:26:10,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:26:10,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:26:10,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:26:10,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:26:10,220 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:26:10,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:26:10,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:26:10,224 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:26:10,225 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:26:10,226 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:26:10,226 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:26:10,227 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:26:10,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:26:10,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:26:10,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:26:10,232 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:26:10,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:26:10,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:26:10,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:26:10,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:26:10,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:26:10,243 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:26:10,295 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:26:10,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:26:10,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:26:10,301 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:26:10,301 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:26:10,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:26:10,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:26:10,302 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:26:10,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:26:10,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:26:10,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:26:10,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:26:10,304 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:26:10,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:26:10,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:26:10,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:26:10,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:26:10,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:26:10,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:26:10,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:26:10,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:26:10,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:26:10,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:26:10,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:26:10,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:26:10,307 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:26:10,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:26:10,808 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:26:10,811 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:26:10,813 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:26:10,814 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:26:10,815 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.07.cil-1.c [2021-01-06 19:26:10,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cffa271de/24a8a86a96b643af945130a3d01b233f/FLAGe8eeb1e67 [2021-01-06 19:26:11,630 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:26:11,634 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.07.cil-1.c [2021-01-06 19:26:11,655 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cffa271de/24a8a86a96b643af945130a3d01b233f/FLAGe8eeb1e67 [2021-01-06 19:26:11,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cffa271de/24a8a86a96b643af945130a3d01b233f [2021-01-06 19:26:11,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:26:11,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:26:11,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:26:11,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:26:11,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:26:11,913 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:26:11" (1/1) ... [2021-01-06 19:26:11,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6d0eb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:11, skipping insertion in model container [2021-01-06 19:26:11,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:26:11" (1/1) ... [2021-01-06 19:26:11,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:26:12,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:26:12,189 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.07.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_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[~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[~__retres1~8,] 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~8,] 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~8,] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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~9,] [2021-01-06 19:26:12,310 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:26:12,322 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:26:12,336 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.07.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_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[~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[~__retres1~8,] 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~8,] 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~8,] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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[~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~9,] [2021-01-06 19:26:12,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:26:12,499 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:26:12,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12 WrapperNode [2021-01-06 19:26:12,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:26:12,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:26:12,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:26:12,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:26:12,511 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:26:12" (1/1) ... [2021-01-06 19:26:12,526 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:26:12" (1/1) ... [2021-01-06 19:26:12,650 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:26:12,651 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:26:12,651 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:26:12,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:26:12,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12" (1/1) ... [2021-01-06 19:26:12,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12" (1/1) ... [2021-01-06 19:26:12,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12" (1/1) ... [2021-01-06 19:26:12,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12" (1/1) ... [2021-01-06 19:26:12,706 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12" (1/1) ... [2021-01-06 19:26:12,736 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12" (1/1) ... [2021-01-06 19:26:12,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12" (1/1) ... [2021-01-06 19:26:12,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:26:12,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:26:12,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:26:12,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:26:12,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12" (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:26:12,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:26:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:26:12,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:26:12,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:26:15,010 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:26:15,011 INFO L299 CfgBuilder]: Removed 278 assume(true) statements. [2021-01-06 19:26:15,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:26:15 BoogieIcfgContainer [2021-01-06 19:26:15,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:26:15,016 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:26:15,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:26:15,020 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:26:15,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:26:11" (1/3) ... [2021-01-06 19:26:15,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2132aab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:26:15, skipping insertion in model container [2021-01-06 19:26:15,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:26:12" (2/3) ... [2021-01-06 19:26:15,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2132aab9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:26:15, skipping insertion in model container [2021-01-06 19:26:15,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:26:15" (3/3) ... [2021-01-06 19:26:15,024 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.07.cil-1.c [2021-01-06 19:26:15,031 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:26:15,037 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:26:15,057 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:26:15,091 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:26:15,092 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:26:15,092 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:26:15,092 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:26:15,092 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:26:15,092 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:26:15,092 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:26:15,093 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:26:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states. [2021-01-06 19:26:15,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:15,141 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:15,142 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] [2021-01-06 19:26:15,143 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:15,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1880548039, now seen corresponding path program 1 times [2021-01-06 19:26:15,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:15,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708707068] [2021-01-06 19:26:15,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:15,433 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:26:15,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708707068] [2021-01-06 19:26:15,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:15,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:15,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665068808] [2021-01-06 19:26:15,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:15,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:15,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:15,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:15,465 INFO L87 Difference]: Start difference. First operand 813 states. Second operand 3 states. [2021-01-06 19:26:15,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:15,630 INFO L93 Difference]: Finished difference Result 1621 states and 2483 transitions. [2021-01-06 19:26:15,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:15,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:26:15,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:15,660 INFO L225 Difference]: With dead ends: 1621 [2021-01-06 19:26:15,660 INFO L226 Difference]: Without dead ends: 809 [2021-01-06 19:26:15,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:15,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-01-06 19:26:15,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2021-01-06 19:26:15,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2021-01-06 19:26:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1219 transitions. [2021-01-06 19:26:15,778 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1219 transitions. Word has length 105 [2021-01-06 19:26:15,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:15,779 INFO L481 AbstractCegarLoop]: Abstraction has 809 states and 1219 transitions. [2021-01-06 19:26:15,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:15,779 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1219 transitions. [2021-01-06 19:26:15,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:15,783 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:15,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:15,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:26:15,784 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1107276859, now seen corresponding path program 1 times [2021-01-06 19:26:15,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:15,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031184122] [2021-01-06 19:26:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:15,947 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:26:15,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031184122] [2021-01-06 19:26:15,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:15,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:26:15,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405565815] [2021-01-06 19:26:15,951 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:15,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:15,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:15,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:15,953 INFO L87 Difference]: Start difference. First operand 809 states and 1219 transitions. Second operand 3 states. [2021-01-06 19:26:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:16,069 INFO L93 Difference]: Finished difference Result 2259 states and 3393 transitions. [2021-01-06 19:26:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:16,070 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:26:16,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:16,079 INFO L225 Difference]: With dead ends: 2259 [2021-01-06 19:26:16,079 INFO L226 Difference]: Without dead ends: 1462 [2021-01-06 19:26:16,086 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:26:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2021-01-06 19:26:16,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1460. [2021-01-06 19:26:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2189 transitions. [2021-01-06 19:26:16,166 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2189 transitions. Word has length 105 [2021-01-06 19:26:16,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:16,167 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2189 transitions. [2021-01-06 19:26:16,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2189 transitions. [2021-01-06 19:26:16,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:16,176 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:16,176 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] [2021-01-06 19:26:16,177 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:26:16,177 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:16,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1591347777, now seen corresponding path program 1 times [2021-01-06 19:26:16,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:16,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466315305] [2021-01-06 19:26:16,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:16,304 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:26:16,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466315305] [2021-01-06 19:26:16,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:16,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:16,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558524412] [2021-01-06 19:26:16,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:16,306 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:16,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:16,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:16,307 INFO L87 Difference]: Start difference. First operand 1460 states and 2189 transitions. Second operand 4 states. [2021-01-06 19:26:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:16,465 INFO L93 Difference]: Finished difference Result 3557 states and 5324 transitions. [2021-01-06 19:26:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:16,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:16,478 INFO L225 Difference]: With dead ends: 3557 [2021-01-06 19:26:16,478 INFO L226 Difference]: Without dead ends: 2111 [2021-01-06 19:26:16,481 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:26:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2021-01-06 19:26:16,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1460. [2021-01-06 19:26:16,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:16,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2186 transitions. [2021-01-06 19:26:16,572 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2186 transitions. Word has length 105 [2021-01-06 19:26:16,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:16,572 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2186 transitions. [2021-01-06 19:26:16,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:16,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2186 transitions. [2021-01-06 19:26:16,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:16,574 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:16,574 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] [2021-01-06 19:26:16,574 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:26:16,574 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:16,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:16,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1562847487, now seen corresponding path program 1 times [2021-01-06 19:26:16,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:16,576 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031860898] [2021-01-06 19:26:16,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:16,715 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:26:16,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031860898] [2021-01-06 19:26:16,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:16,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:16,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484210727] [2021-01-06 19:26:16,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:16,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:16,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:16,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:16,722 INFO L87 Difference]: Start difference. First operand 1460 states and 2186 transitions. Second operand 4 states. [2021-01-06 19:26:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:16,898 INFO L93 Difference]: Finished difference Result 3555 states and 5314 transitions. [2021-01-06 19:26:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:16,898 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:16,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:16,910 INFO L225 Difference]: With dead ends: 3555 [2021-01-06 19:26:16,910 INFO L226 Difference]: Without dead ends: 2110 [2021-01-06 19:26:16,914 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:26:16,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2021-01-06 19:26:16,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1460. [2021-01-06 19:26:16,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2183 transitions. [2021-01-06 19:26:16,991 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2183 transitions. Word has length 105 [2021-01-06 19:26:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:16,992 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2183 transitions. [2021-01-06 19:26:16,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2183 transitions. [2021-01-06 19:26:16,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:16,993 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:16,993 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] [2021-01-06 19:26:16,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:26:16,994 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:16,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:16,994 INFO L82 PathProgramCache]: Analyzing trace with hash -377734527, now seen corresponding path program 1 times [2021-01-06 19:26:16,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:16,995 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751906488] [2021-01-06 19:26:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:17,076 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:26:17,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751906488] [2021-01-06 19:26:17,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:17,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:26:17,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835670536] [2021-01-06 19:26:17,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:17,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:17,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:17,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:17,079 INFO L87 Difference]: Start difference. First operand 1460 states and 2183 transitions. Second operand 3 states. [2021-01-06 19:26:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:17,174 INFO L93 Difference]: Finished difference Result 2904 states and 4341 transitions. [2021-01-06 19:26:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:17,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:26:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:17,183 INFO L225 Difference]: With dead ends: 2904 [2021-01-06 19:26:17,183 INFO L226 Difference]: Without dead ends: 1460 [2021-01-06 19:26:17,186 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:26:17,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2021-01-06 19:26:17,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1460. [2021-01-06 19:26:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:17,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2175 transitions. [2021-01-06 19:26:17,263 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2175 transitions. Word has length 105 [2021-01-06 19:26:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:17,263 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2175 transitions. [2021-01-06 19:26:17,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2175 transitions. [2021-01-06 19:26:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:17,264 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:17,264 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] [2021-01-06 19:26:17,265 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:26:17,265 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:17,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:17,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1561368317, now seen corresponding path program 1 times [2021-01-06 19:26:17,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:17,266 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522438840] [2021-01-06 19:26:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:17,341 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:26:17,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522438840] [2021-01-06 19:26:17,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:17,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:26:17,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444729807] [2021-01-06 19:26:17,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:17,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:17,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:17,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:17,344 INFO L87 Difference]: Start difference. First operand 1460 states and 2175 transitions. Second operand 3 states. [2021-01-06 19:26:17,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:17,503 INFO L93 Difference]: Finished difference Result 2903 states and 4324 transitions. [2021-01-06 19:26:17,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:17,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:26:17,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:17,515 INFO L225 Difference]: With dead ends: 2903 [2021-01-06 19:26:17,515 INFO L226 Difference]: Without dead ends: 1460 [2021-01-06 19:26:17,521 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:26:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2021-01-06 19:26:17,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1460. [2021-01-06 19:26:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2167 transitions. [2021-01-06 19:26:17,631 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2167 transitions. Word has length 105 [2021-01-06 19:26:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:17,632 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2167 transitions. [2021-01-06 19:26:17,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2167 transitions. [2021-01-06 19:26:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:17,636 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:17,637 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] [2021-01-06 19:26:17,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:26:17,637 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:17,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash 931183361, now seen corresponding path program 1 times [2021-01-06 19:26:17,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:17,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472965742] [2021-01-06 19:26:17,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:17,770 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:26:17,771 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472965742] [2021-01-06 19:26:17,771 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:17,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:17,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419722027] [2021-01-06 19:26:17,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:17,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:17,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:17,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:17,785 INFO L87 Difference]: Start difference. First operand 1460 states and 2167 transitions. Second operand 4 states. [2021-01-06 19:26:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:17,991 INFO L93 Difference]: Finished difference Result 3549 states and 5262 transitions. [2021-01-06 19:26:17,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:17,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:18,002 INFO L225 Difference]: With dead ends: 3549 [2021-01-06 19:26:18,003 INFO L226 Difference]: Without dead ends: 2107 [2021-01-06 19:26:18,007 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:26:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2107 states. [2021-01-06 19:26:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2107 to 1460. [2021-01-06 19:26:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:18,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2164 transitions. [2021-01-06 19:26:18,141 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2164 transitions. Word has length 105 [2021-01-06 19:26:18,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:18,142 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2164 transitions. [2021-01-06 19:26:18,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:18,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2164 transitions. [2021-01-06 19:26:18,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:18,143 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:18,144 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] [2021-01-06 19:26:18,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:26:18,144 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:18,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:18,145 INFO L82 PathProgramCache]: Analyzing trace with hash -63510337, now seen corresponding path program 1 times [2021-01-06 19:26:18,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:18,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380913188] [2021-01-06 19:26:18,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:18,232 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:26:18,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380913188] [2021-01-06 19:26:18,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:18,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:18,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860087229] [2021-01-06 19:26:18,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:18,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:18,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:18,239 INFO L87 Difference]: Start difference. First operand 1460 states and 2164 transitions. Second operand 4 states. [2021-01-06 19:26:18,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:18,452 INFO L93 Difference]: Finished difference Result 3547 states and 5252 transitions. [2021-01-06 19:26:18,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:18,453 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:18,465 INFO L225 Difference]: With dead ends: 3547 [2021-01-06 19:26:18,465 INFO L226 Difference]: Without dead ends: 2106 [2021-01-06 19:26:18,469 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:26:18,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2021-01-06 19:26:18,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1460. [2021-01-06 19:26:18,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2161 transitions. [2021-01-06 19:26:18,562 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2161 transitions. Word has length 105 [2021-01-06 19:26:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:18,563 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2161 transitions. [2021-01-06 19:26:18,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2161 transitions. [2021-01-06 19:26:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:18,564 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:18,565 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] [2021-01-06 19:26:18,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:26:18,565 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:18,566 INFO L82 PathProgramCache]: Analyzing trace with hash -649786559, now seen corresponding path program 1 times [2021-01-06 19:26:18,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:18,566 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674383241] [2021-01-06 19:26:18,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:18,625 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:26:18,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674383241] [2021-01-06 19:26:18,630 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:18,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:18,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007104176] [2021-01-06 19:26:18,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:18,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:18,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:18,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:18,633 INFO L87 Difference]: Start difference. First operand 1460 states and 2161 transitions. Second operand 4 states. [2021-01-06 19:26:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:18,900 INFO L93 Difference]: Finished difference Result 3489 states and 5162 transitions. [2021-01-06 19:26:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:18,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:18,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:18,912 INFO L225 Difference]: With dead ends: 3489 [2021-01-06 19:26:18,912 INFO L226 Difference]: Without dead ends: 2049 [2021-01-06 19:26:18,915 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:26:18,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2021-01-06 19:26:19,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1460. [2021-01-06 19:26:19,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2158 transitions. [2021-01-06 19:26:19,022 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2158 transitions. Word has length 105 [2021-01-06 19:26:19,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:19,023 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2158 transitions. [2021-01-06 19:26:19,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:19,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2158 transitions. [2021-01-06 19:26:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:19,024 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:19,024 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] [2021-01-06 19:26:19,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:26:19,025 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:19,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:19,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1686605951, now seen corresponding path program 1 times [2021-01-06 19:26:19,026 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:19,026 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536073442] [2021-01-06 19:26:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:19,084 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:26:19,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536073442] [2021-01-06 19:26:19,084 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:19,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:26:19,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841036899] [2021-01-06 19:26:19,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:19,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:19,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:19,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:19,091 INFO L87 Difference]: Start difference. First operand 1460 states and 2158 transitions. Second operand 3 states. [2021-01-06 19:26:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:19,251 INFO L93 Difference]: Finished difference Result 2898 states and 4284 transitions. [2021-01-06 19:26:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:19,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2021-01-06 19:26:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:19,261 INFO L225 Difference]: With dead ends: 2898 [2021-01-06 19:26:19,262 INFO L226 Difference]: Without dead ends: 1460 [2021-01-06 19:26:19,265 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:26:19,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2021-01-06 19:26:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1460. [2021-01-06 19:26:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2132 transitions. [2021-01-06 19:26:19,377 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2132 transitions. Word has length 105 [2021-01-06 19:26:19,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:19,377 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2132 transitions. [2021-01-06 19:26:19,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:19,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2132 transitions. [2021-01-06 19:26:19,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:19,379 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:19,379 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] [2021-01-06 19:26:19,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:26:19,379 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:19,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:19,380 INFO L82 PathProgramCache]: Analyzing trace with hash -192524995, now seen corresponding path program 1 times [2021-01-06 19:26:19,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:19,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187812149] [2021-01-06 19:26:19,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:19,436 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:26:19,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187812149] [2021-01-06 19:26:19,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:19,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:19,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653192875] [2021-01-06 19:26:19,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:19,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:19,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:19,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:19,440 INFO L87 Difference]: Start difference. First operand 1460 states and 2132 transitions. Second operand 4 states. [2021-01-06 19:26:19,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:19,724 INFO L93 Difference]: Finished difference Result 3483 states and 5084 transitions. [2021-01-06 19:26:19,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:19,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:19,738 INFO L225 Difference]: With dead ends: 3483 [2021-01-06 19:26:19,738 INFO L226 Difference]: Without dead ends: 2046 [2021-01-06 19:26:19,741 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:26:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2021-01-06 19:26:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1460. [2021-01-06 19:26:19,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2129 transitions. [2021-01-06 19:26:19,845 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2129 transitions. Word has length 105 [2021-01-06 19:26:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:19,846 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2129 transitions. [2021-01-06 19:26:19,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2129 transitions. [2021-01-06 19:26:19,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:19,847 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:19,847 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] [2021-01-06 19:26:19,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:26:19,848 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1132331199, now seen corresponding path program 1 times [2021-01-06 19:26:19,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:19,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712896631] [2021-01-06 19:26:19,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:19,899 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:26:19,899 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712896631] [2021-01-06 19:26:19,899 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:19,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:19,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588836009] [2021-01-06 19:26:19,900 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:19,900 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:19,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:19,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:19,901 INFO L87 Difference]: Start difference. First operand 1460 states and 2129 transitions. Second operand 4 states. [2021-01-06 19:26:20,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:20,208 INFO L93 Difference]: Finished difference Result 3481 states and 5074 transitions. [2021-01-06 19:26:20,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:20,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:20,218 INFO L225 Difference]: With dead ends: 3481 [2021-01-06 19:26:20,219 INFO L226 Difference]: Without dead ends: 2045 [2021-01-06 19:26:20,221 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:26:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2021-01-06 19:26:20,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 1460. [2021-01-06 19:26:20,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2126 transitions. [2021-01-06 19:26:20,325 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2126 transitions. Word has length 105 [2021-01-06 19:26:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:20,325 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2126 transitions. [2021-01-06 19:26:20,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2126 transitions. [2021-01-06 19:26:20,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:20,327 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:20,327 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] [2021-01-06 19:26:20,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:26:20,327 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:20,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:20,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1595878147, now seen corresponding path program 1 times [2021-01-06 19:26:20,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:20,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940561339] [2021-01-06 19:26:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:20,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:20,378 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:26:20,379 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940561339] [2021-01-06 19:26:20,379 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:20,379 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:20,379 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663266404] [2021-01-06 19:26:20,380 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:20,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:20,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:20,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:20,381 INFO L87 Difference]: Start difference. First operand 1460 states and 2126 transitions. Second operand 4 states. [2021-01-06 19:26:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:20,703 INFO L93 Difference]: Finished difference Result 3479 states and 5064 transitions. [2021-01-06 19:26:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:20,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:20,716 INFO L225 Difference]: With dead ends: 3479 [2021-01-06 19:26:20,716 INFO L226 Difference]: Without dead ends: 2044 [2021-01-06 19:26:20,720 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:26:20,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2021-01-06 19:26:20,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 1460. [2021-01-06 19:26:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2123 transitions. [2021-01-06 19:26:20,862 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2123 transitions. Word has length 105 [2021-01-06 19:26:20,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:20,862 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2123 transitions. [2021-01-06 19:26:20,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:20,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2123 transitions. [2021-01-06 19:26:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:20,864 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:20,864 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] [2021-01-06 19:26:20,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:26:20,865 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:20,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1641251071, now seen corresponding path program 1 times [2021-01-06 19:26:20,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:20,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614944073] [2021-01-06 19:26:20,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:20,908 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:26:20,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614944073] [2021-01-06 19:26:20,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:20,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:20,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425012729] [2021-01-06 19:26:20,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:20,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:20,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:20,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:20,911 INFO L87 Difference]: Start difference. First operand 1460 states and 2123 transitions. Second operand 4 states. [2021-01-06 19:26:21,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:21,202 INFO L93 Difference]: Finished difference Result 3477 states and 5054 transitions. [2021-01-06 19:26:21,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:21,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:21,229 INFO L225 Difference]: With dead ends: 3477 [2021-01-06 19:26:21,229 INFO L226 Difference]: Without dead ends: 2043 [2021-01-06 19:26:21,240 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:26:21,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2021-01-06 19:26:21,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1460. [2021-01-06 19:26:21,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:21,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2120 transitions. [2021-01-06 19:26:21,371 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2120 transitions. Word has length 105 [2021-01-06 19:26:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:21,371 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2120 transitions. [2021-01-06 19:26:21,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2120 transitions. [2021-01-06 19:26:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:21,372 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:21,373 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] [2021-01-06 19:26:21,373 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:26:21,373 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 498748605, now seen corresponding path program 1 times [2021-01-06 19:26:21,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:21,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249385880] [2021-01-06 19:26:21,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:21,415 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:26:21,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249385880] [2021-01-06 19:26:21,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:21,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:21,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490729888] [2021-01-06 19:26:21,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:21,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:21,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:21,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:21,418 INFO L87 Difference]: Start difference. First operand 1460 states and 2120 transitions. Second operand 4 states. [2021-01-06 19:26:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:21,679 INFO L93 Difference]: Finished difference Result 3475 states and 5044 transitions. [2021-01-06 19:26:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:21,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:21,685 INFO L225 Difference]: With dead ends: 3475 [2021-01-06 19:26:21,685 INFO L226 Difference]: Without dead ends: 2042 [2021-01-06 19:26:21,690 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:26:21,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2042 states. [2021-01-06 19:26:21,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2042 to 1460. [2021-01-06 19:26:21,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2021-01-06 19:26:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2117 transitions. [2021-01-06 19:26:21,822 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2117 transitions. Word has length 105 [2021-01-06 19:26:21,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:21,823 INFO L481 AbstractCegarLoop]: Abstraction has 1460 states and 2117 transitions. [2021-01-06 19:26:21,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2117 transitions. [2021-01-06 19:26:21,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:21,824 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:21,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:21,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:26:21,825 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:21,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:21,825 INFO L82 PathProgramCache]: Analyzing trace with hash 738988351, now seen corresponding path program 1 times [2021-01-06 19:26:21,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:21,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246839488] [2021-01-06 19:26:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:26:21,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246839488] [2021-01-06 19:26:21,891 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:21,891 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:26:21,891 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117705350] [2021-01-06 19:26:21,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:26:21,892 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:21,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:26:21,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:21,893 INFO L87 Difference]: Start difference. First operand 1460 states and 2117 transitions. Second operand 5 states. [2021-01-06 19:26:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:22,402 INFO L93 Difference]: Finished difference Result 5570 states and 8068 transitions. [2021-01-06 19:26:22,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:26:22,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 105 [2021-01-06 19:26:22,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:22,412 INFO L225 Difference]: With dead ends: 5570 [2021-01-06 19:26:22,412 INFO L226 Difference]: Without dead ends: 4144 [2021-01-06 19:26:22,415 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:26:22,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2021-01-06 19:26:22,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 1520. [2021-01-06 19:26:22,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1520 states. [2021-01-06 19:26:22,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2177 transitions. [2021-01-06 19:26:22,588 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2177 transitions. Word has length 105 [2021-01-06 19:26:22,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:22,589 INFO L481 AbstractCegarLoop]: Abstraction has 1520 states and 2177 transitions. [2021-01-06 19:26:22,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:26:22,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2177 transitions. [2021-01-06 19:26:22,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2021-01-06 19:26:22,590 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:22,590 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] [2021-01-06 19:26:22,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:26:22,593 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:22,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:22,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1172054207, now seen corresponding path program 1 times [2021-01-06 19:26:22,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:22,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018660676] [2021-01-06 19:26:22,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:22,647 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:26:22,647 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018660676] [2021-01-06 19:26:22,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:22,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:22,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131147137] [2021-01-06 19:26:22,648 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:22,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:22,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:22,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:22,650 INFO L87 Difference]: Start difference. First operand 1520 states and 2177 transitions. Second operand 4 states. [2021-01-06 19:26:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:23,247 INFO L93 Difference]: Finished difference Result 5590 states and 7990 transitions. [2021-01-06 19:26:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:23,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2021-01-06 19:26:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:23,258 INFO L225 Difference]: With dead ends: 5590 [2021-01-06 19:26:23,258 INFO L226 Difference]: Without dead ends: 4099 [2021-01-06 19:26:23,263 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:26:23,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2021-01-06 19:26:23,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 3885. [2021-01-06 19:26:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2021-01-06 19:26:23,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 5504 transitions. [2021-01-06 19:26:23,644 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 5504 transitions. Word has length 105 [2021-01-06 19:26:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:23,644 INFO L481 AbstractCegarLoop]: Abstraction has 3885 states and 5504 transitions. [2021-01-06 19:26:23,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 5504 transitions. [2021-01-06 19:26:23,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 19:26:23,646 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:23,647 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:23,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:26:23,647 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:23,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:23,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1427849594, now seen corresponding path program 1 times [2021-01-06 19:26:23,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:23,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870633070] [2021-01-06 19:26:23,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:23,729 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:26:23,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870633070] [2021-01-06 19:26:23,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:23,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:26:23,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201494759] [2021-01-06 19:26:23,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:26:23,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:26:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:23,735 INFO L87 Difference]: Start difference. First operand 3885 states and 5504 transitions. Second operand 5 states. [2021-01-06 19:26:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:24,503 INFO L93 Difference]: Finished difference Result 10206 states and 14508 transitions. [2021-01-06 19:26:24,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:26:24,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2021-01-06 19:26:24,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:24,520 INFO L225 Difference]: With dead ends: 10206 [2021-01-06 19:26:24,521 INFO L226 Difference]: Without dead ends: 6360 [2021-01-06 19:26:24,531 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:26:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6360 states. [2021-01-06 19:26:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6360 to 3942. [2021-01-06 19:26:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3942 states. [2021-01-06 19:26:25,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 5528 transitions. [2021-01-06 19:26:25,023 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 5528 transitions. Word has length 123 [2021-01-06 19:26:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:25,024 INFO L481 AbstractCegarLoop]: Abstraction has 3942 states and 5528 transitions. [2021-01-06 19:26:25,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:26:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 5528 transitions. [2021-01-06 19:26:25,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 19:26:25,026 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:25,026 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:25,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:26:25,026 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:25,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash -990634884, now seen corresponding path program 1 times [2021-01-06 19:26:25,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:25,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134456940] [2021-01-06 19:26:25,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:25,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:26:25,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134456940] [2021-01-06 19:26:25,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:25,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:26:25,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281504759] [2021-01-06 19:26:25,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:26:25,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:26:25,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:25,097 INFO L87 Difference]: Start difference. First operand 3942 states and 5528 transitions. Second operand 5 states. [2021-01-06 19:26:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:25,829 INFO L93 Difference]: Finished difference Result 8784 states and 12291 transitions. [2021-01-06 19:26:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:26:25,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 123 [2021-01-06 19:26:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:25,840 INFO L225 Difference]: With dead ends: 8784 [2021-01-06 19:26:25,841 INFO L226 Difference]: Without dead ends: 4888 [2021-01-06 19:26:25,848 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:26:25,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4888 states. [2021-01-06 19:26:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4888 to 3948. [2021-01-06 19:26:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2021-01-06 19:26:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 5484 transitions. [2021-01-06 19:26:26,267 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 5484 transitions. Word has length 123 [2021-01-06 19:26:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:26,268 INFO L481 AbstractCegarLoop]: Abstraction has 3948 states and 5484 transitions. [2021-01-06 19:26:26,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:26:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 5484 transitions. [2021-01-06 19:26:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2021-01-06 19:26:26,270 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:26,270 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:26,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:26:26,271 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:26,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash -750395138, now seen corresponding path program 1 times [2021-01-06 19:26:26,272 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:26,272 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890456253] [2021-01-06 19:26:26,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:26:26,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890456253] [2021-01-06 19:26:26,338 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:26,338 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:26,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850695700] [2021-01-06 19:26:26,338 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:26,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:26,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:26,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:26,340 INFO L87 Difference]: Start difference. First operand 3948 states and 5484 transitions. Second operand 4 states. [2021-01-06 19:26:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:27,474 INFO L93 Difference]: Finished difference Result 14815 states and 20566 transitions. [2021-01-06 19:26:27,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:27,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2021-01-06 19:26:27,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:27,499 INFO L225 Difference]: With dead ends: 14815 [2021-01-06 19:26:27,499 INFO L226 Difference]: Without dead ends: 10915 [2021-01-06 19:26:27,508 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:26:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10915 states. [2021-01-06 19:26:28,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10915 to 10443. [2021-01-06 19:26:28,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10443 states. [2021-01-06 19:26:28,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10443 states to 10443 states and 14381 transitions. [2021-01-06 19:26:28,458 INFO L78 Accepts]: Start accepts. Automaton has 10443 states and 14381 transitions. Word has length 123 [2021-01-06 19:26:28,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:28,458 INFO L481 AbstractCegarLoop]: Abstraction has 10443 states and 14381 transitions. [2021-01-06 19:26:28,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:28,459 INFO L276 IsEmpty]: Start isEmpty. Operand 10443 states and 14381 transitions. [2021-01-06 19:26:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:26:28,462 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:28,462 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:28,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:26:28,463 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1357225913, now seen corresponding path program 1 times [2021-01-06 19:26:28,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:28,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055272826] [2021-01-06 19:26:28,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:28,534 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:26:28,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055272826] [2021-01-06 19:26:28,535 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:28,535 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:26:28,535 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909107174] [2021-01-06 19:26:28,536 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:26:28,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:26:28,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:28,537 INFO L87 Difference]: Start difference. First operand 10443 states and 14381 transitions. Second operand 5 states. [2021-01-06 19:26:29,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:29,997 INFO L93 Difference]: Finished difference Result 26880 states and 37268 transitions. [2021-01-06 19:26:29,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:26:29,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2021-01-06 19:26:29,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:30,032 INFO L225 Difference]: With dead ends: 26880 [2021-01-06 19:26:30,033 INFO L226 Difference]: Without dead ends: 16489 [2021-01-06 19:26:30,045 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:26:30,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16489 states. [2021-01-06 19:26:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16489 to 10596. [2021-01-06 19:26:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10596 states. [2021-01-06 19:26:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10596 states to 10596 states and 14447 transitions. [2021-01-06 19:26:30,919 INFO L78 Accepts]: Start accepts. Automaton has 10596 states and 14447 transitions. Word has length 127 [2021-01-06 19:26:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:30,920 INFO L481 AbstractCegarLoop]: Abstraction has 10596 states and 14447 transitions. [2021-01-06 19:26:30,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:26:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10596 states and 14447 transitions. [2021-01-06 19:26:30,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-01-06 19:26:30,923 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:30,923 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:30,923 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:26:30,923 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1330160311, now seen corresponding path program 1 times [2021-01-06 19:26:30,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:30,924 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065608873] [2021-01-06 19:26:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:26:30,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065608873] [2021-01-06 19:26:30,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:30,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:26:30,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233997693] [2021-01-06 19:26:30,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:26:30,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:26:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:26:30,977 INFO L87 Difference]: Start difference. First operand 10596 states and 14447 transitions. Second operand 4 states. [2021-01-06 19:26:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:33,388 INFO L93 Difference]: Finished difference Result 40013 states and 54564 transitions. [2021-01-06 19:26:33,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:26:33,391 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2021-01-06 19:26:33,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:33,446 INFO L225 Difference]: With dead ends: 40013 [2021-01-06 19:26:33,446 INFO L226 Difference]: Without dead ends: 29471 [2021-01-06 19:26:33,466 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:33,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29471 states. [2021-01-06 19:26:35,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29471 to 28393. [2021-01-06 19:26:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28393 states. [2021-01-06 19:26:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28393 states to 28393 states and 38440 transitions. [2021-01-06 19:26:35,692 INFO L78 Accepts]: Start accepts. Automaton has 28393 states and 38440 transitions. Word has length 127 [2021-01-06 19:26:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:35,692 INFO L481 AbstractCegarLoop]: Abstraction has 28393 states and 38440 transitions. [2021-01-06 19:26:35,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:26:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 28393 states and 38440 transitions. [2021-01-06 19:26:35,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:26:35,697 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:35,697 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:35,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:26:35,697 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:35,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:35,698 INFO L82 PathProgramCache]: Analyzing trace with hash -156894974, now seen corresponding path program 1 times [2021-01-06 19:26:35,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:35,698 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848079909] [2021-01-06 19:26:35,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:26:35,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848079909] [2021-01-06 19:26:35,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:35,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:26:35,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017060635] [2021-01-06 19:26:35,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:26:35,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:35,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:26:35,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:35,749 INFO L87 Difference]: Start difference. First operand 28393 states and 38440 transitions. Second operand 5 states. [2021-01-06 19:26:39,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:39,401 INFO L93 Difference]: Finished difference Result 72366 states and 98739 transitions. [2021-01-06 19:26:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:26:39,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2021-01-06 19:26:39,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:39,467 INFO L225 Difference]: With dead ends: 72366 [2021-01-06 19:26:39,468 INFO L226 Difference]: Without dead ends: 44031 [2021-01-06 19:26:39,499 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:26:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44031 states. [2021-01-06 19:26:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44031 to 28804. [2021-01-06 19:26:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28804 states. [2021-01-06 19:26:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28804 states to 28804 states and 38620 transitions. [2021-01-06 19:26:42,140 INFO L78 Accepts]: Start accepts. Automaton has 28804 states and 38620 transitions. Word has length 131 [2021-01-06 19:26:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:42,140 INFO L481 AbstractCegarLoop]: Abstraction has 28804 states and 38620 transitions. [2021-01-06 19:26:42,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:26:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 28804 states and 38620 transitions. [2021-01-06 19:26:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:26:42,144 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:42,145 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:42,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:26:42,145 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1577209476, now seen corresponding path program 1 times [2021-01-06 19:26:42,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:42,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153138590] [2021-01-06 19:26:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:26:42,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153138590] [2021-01-06 19:26:42,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:42,213 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:26:42,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660060778] [2021-01-06 19:26:42,213 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:26:42,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:42,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:26:42,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:26:42,214 INFO L87 Difference]: Start difference. First operand 28804 states and 38620 transitions. Second operand 3 states. [2021-01-06 19:26:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:46,222 INFO L93 Difference]: Finished difference Result 82794 states and 111133 transitions. [2021-01-06 19:26:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:46,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2021-01-06 19:26:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:46,276 INFO L225 Difference]: With dead ends: 82794 [2021-01-06 19:26:46,276 INFO L226 Difference]: Without dead ends: 54057 [2021-01-06 19:26:46,305 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:26:46,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54057 states. [2021-01-06 19:26:50,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54057 to 53947. [2021-01-06 19:26:50,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53947 states. [2021-01-06 19:26:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53947 states to 53947 states and 72117 transitions. [2021-01-06 19:26:50,787 INFO L78 Accepts]: Start accepts. Automaton has 53947 states and 72117 transitions. Word has length 131 [2021-01-06 19:26:50,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:50,787 INFO L481 AbstractCegarLoop]: Abstraction has 53947 states and 72117 transitions. [2021-01-06 19:26:50,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:50,787 INFO L276 IsEmpty]: Start isEmpty. Operand 53947 states and 72117 transitions. [2021-01-06 19:26:50,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:26:50,791 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:50,791 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:50,792 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:26:50,792 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:50,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:50,792 INFO L82 PathProgramCache]: Analyzing trace with hash -580263547, now seen corresponding path program 1 times [2021-01-06 19:26:50,792 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:50,793 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215581780] [2021-01-06 19:26:50,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:26:50,844 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:26:50,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215581780] [2021-01-06 19:26:50,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:26:50,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:26:50,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815515191] [2021-01-06 19:26:50,845 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:26:50,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:26:50,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:26:50,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:26:50,846 INFO L87 Difference]: Start difference. First operand 53947 states and 72117 transitions. Second operand 5 states. [2021-01-06 19:26:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:58,079 INFO L93 Difference]: Finished difference Result 145768 states and 196708 transitions. [2021-01-06 19:26:58,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:26:58,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2021-01-06 19:26:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:58,191 INFO L225 Difference]: With dead ends: 145768 [2021-01-06 19:26:58,191 INFO L226 Difference]: Without dead ends: 91892 [2021-01-06 19:26:58,229 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:26:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91892 states. [2021-01-06 19:27:03,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91892 to 55048. [2021-01-06 19:27:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55048 states. [2021-01-06 19:27:03,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55048 states to 55048 states and 72904 transitions. [2021-01-06 19:27:03,375 INFO L78 Accepts]: Start accepts. Automaton has 55048 states and 72904 transitions. Word has length 131 [2021-01-06 19:27:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:03,375 INFO L481 AbstractCegarLoop]: Abstraction has 55048 states and 72904 transitions. [2021-01-06 19:27:03,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:27:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 55048 states and 72904 transitions. [2021-01-06 19:27:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:27:03,381 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:03,381 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:03,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:27:03,382 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:03,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash -997660153, now seen corresponding path program 1 times [2021-01-06 19:27:03,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:03,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629860894] [2021-01-06 19:27:03,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:03,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:03,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629860894] [2021-01-06 19:27:03,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:03,437 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:27:03,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745851593] [2021-01-06 19:27:03,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:27:03,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:03,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:27:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:03,438 INFO L87 Difference]: Start difference. First operand 55048 states and 72904 transitions. Second operand 5 states. [2021-01-06 19:27:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:13,671 INFO L93 Difference]: Finished difference Result 178285 states and 239345 transitions. [2021-01-06 19:27:13,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:27:13,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 131 [2021-01-06 19:27:13,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:13,815 INFO L225 Difference]: With dead ends: 178285 [2021-01-06 19:27:13,815 INFO L226 Difference]: Without dead ends: 123315 [2021-01-06 19:27:13,858 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:27:13,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123315 states. [2021-01-06 19:27:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123315 to 57091. [2021-01-06 19:27:19,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57091 states. [2021-01-06 19:27:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57091 states to 57091 states and 74947 transitions. [2021-01-06 19:27:19,770 INFO L78 Accepts]: Start accepts. Automaton has 57091 states and 74947 transitions. Word has length 131 [2021-01-06 19:27:19,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:19,770 INFO L481 AbstractCegarLoop]: Abstraction has 57091 states and 74947 transitions. [2021-01-06 19:27:19,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:27:19,771 INFO L276 IsEmpty]: Start isEmpty. Operand 57091 states and 74947 transitions. [2021-01-06 19:27:19,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:27:19,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:19,776 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:19,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:27:19,776 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:19,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:19,777 INFO L82 PathProgramCache]: Analyzing trace with hash 263257097, now seen corresponding path program 1 times [2021-01-06 19:27:19,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:19,777 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985111929] [2021-01-06 19:27:19,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:20,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985111929] [2021-01-06 19:27:20,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:20,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:20,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110613321] [2021-01-06 19:27:20,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:20,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:20,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:20,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:20,017 INFO L87 Difference]: Start difference. First operand 57091 states and 74947 transitions. Second operand 4 states. [2021-01-06 19:27:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:28,430 INFO L93 Difference]: Finished difference Result 148528 states and 193701 transitions. [2021-01-06 19:27:28,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:28,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2021-01-06 19:27:28,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:28,515 INFO L225 Difference]: With dead ends: 148528 [2021-01-06 19:27:28,515 INFO L226 Difference]: Without dead ends: 91520 [2021-01-06 19:27:28,551 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:28,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91520 states. [2021-01-06 19:27:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91520 to 65497. [2021-01-06 19:27:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65497 states. [2021-01-06 19:27:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65497 states to 65497 states and 84753 transitions. [2021-01-06 19:27:34,820 INFO L78 Accepts]: Start accepts. Automaton has 65497 states and 84753 transitions. Word has length 131 [2021-01-06 19:27:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:34,820 INFO L481 AbstractCegarLoop]: Abstraction has 65497 states and 84753 transitions. [2021-01-06 19:27:34,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 65497 states and 84753 transitions. [2021-01-06 19:27:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:27:34,825 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:34,825 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:34,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:27:34,825 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:34,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:34,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1650042507, now seen corresponding path program 1 times [2021-01-06 19:27:34,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:34,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809745377] [2021-01-06 19:27:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:34,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:34,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809745377] [2021-01-06 19:27:34,885 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:34,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:34,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319318567] [2021-01-06 19:27:34,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:34,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:34,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:34,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:34,887 INFO L87 Difference]: Start difference. First operand 65497 states and 84753 transitions. Second operand 4 states. [2021-01-06 19:27:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:44,285 INFO L93 Difference]: Finished difference Result 161016 states and 208074 transitions. [2021-01-06 19:27:44,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:44,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2021-01-06 19:27:44,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:44,394 INFO L225 Difference]: With dead ends: 161016 [2021-01-06 19:27:44,394 INFO L226 Difference]: Without dead ends: 95674 [2021-01-06 19:27:44,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:27:44,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95674 states. [2021-01-06 19:27:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95674 to 65497. [2021-01-06 19:27:50,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65497 states. [2021-01-06 19:27:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65497 states to 65497 states and 84536 transitions. [2021-01-06 19:27:51,003 INFO L78 Accepts]: Start accepts. Automaton has 65497 states and 84536 transitions. Word has length 131 [2021-01-06 19:27:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:51,003 INFO L481 AbstractCegarLoop]: Abstraction has 65497 states and 84536 transitions. [2021-01-06 19:27:51,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 65497 states and 84536 transitions. [2021-01-06 19:27:51,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:27:51,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:51,008 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:27:51,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:27:51,009 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:51,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:51,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2093943181, now seen corresponding path program 1 times [2021-01-06 19:27:51,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:51,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762454833] [2021-01-06 19:27:51,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:27:51,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762454833] [2021-01-06 19:27:51,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:51,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:51,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889167367] [2021-01-06 19:27:51,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:51,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:51,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:51,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:51,068 INFO L87 Difference]: Start difference. First operand 65497 states and 84536 transitions. Second operand 4 states. [2021-01-06 19:28:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:00,908 INFO L93 Difference]: Finished difference Result 161013 states and 207583 transitions. [2021-01-06 19:28:00,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:00,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2021-01-06 19:28:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:01,021 INFO L225 Difference]: With dead ends: 161013 [2021-01-06 19:28:01,021 INFO L226 Difference]: Without dead ends: 95674 [2021-01-06 19:28:01,066 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:01,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95674 states. [2021-01-06 19:28:07,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95674 to 65497. [2021-01-06 19:28:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65497 states. [2021-01-06 19:28:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65497 states to 65497 states and 84319 transitions. [2021-01-06 19:28:07,854 INFO L78 Accepts]: Start accepts. Automaton has 65497 states and 84319 transitions. Word has length 131 [2021-01-06 19:28:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:07,854 INFO L481 AbstractCegarLoop]: Abstraction has 65497 states and 84319 transitions. [2021-01-06 19:28:07,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 65497 states and 84319 transitions. [2021-01-06 19:28:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:28:07,864 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:07,864 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:28:07,865 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:07,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:07,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1612862923, now seen corresponding path program 1 times [2021-01-06 19:28:07,865 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:07,865 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291978073] [2021-01-06 19:28:07,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:28:07,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291978073] [2021-01-06 19:28:07,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:07,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:07,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481035418] [2021-01-06 19:28:07,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:07,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:07,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:07,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:07,925 INFO L87 Difference]: Start difference. First operand 65497 states and 84319 transitions. Second operand 4 states. [2021-01-06 19:28:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:18,010 INFO L93 Difference]: Finished difference Result 161012 states and 207094 transitions. [2021-01-06 19:28:18,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:18,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2021-01-06 19:28:18,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:18,115 INFO L225 Difference]: With dead ends: 161012 [2021-01-06 19:28:18,115 INFO L226 Difference]: Without dead ends: 95674 [2021-01-06 19:28:18,160 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:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95674 states. [2021-01-06 19:28:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95674 to 65497. [2021-01-06 19:28:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65497 states. [2021-01-06 19:28:25,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65497 states to 65497 states and 84102 transitions. [2021-01-06 19:28:25,057 INFO L78 Accepts]: Start accepts. Automaton has 65497 states and 84102 transitions. Word has length 131 [2021-01-06 19:28:25,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:25,057 INFO L481 AbstractCegarLoop]: Abstraction has 65497 states and 84102 transitions. [2021-01-06 19:28:25,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:25,057 INFO L276 IsEmpty]: Start isEmpty. Operand 65497 states and 84102 transitions. [2021-01-06 19:28:25,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:28:25,061 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:25,062 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:28:25,062 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:25,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:25,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1597344205, now seen corresponding path program 1 times [2021-01-06 19:28:25,062 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:25,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291299575] [2021-01-06 19:28:25,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:25,117 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:28:25,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291299575] [2021-01-06 19:28:25,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:25,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:25,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020674606] [2021-01-06 19:28:25,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:25,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:25,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:25,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:25,119 INFO L87 Difference]: Start difference. First operand 65497 states and 84102 transitions. Second operand 4 states.