/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/transmitter.16.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:32:08,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:32:08,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:32:08,983 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:32:08,984 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:32:08,988 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:32:08,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:32:08,997 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:32:09,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:32:09,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:32:09,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:32:09,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:32:09,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:32:09,012 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:32:09,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:32:09,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:32:09,016 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:32:09,017 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:32:09,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:32:09,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:32:09,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:32:09,048 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:32:09,053 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:32:09,055 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:32:09,060 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:32:09,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:32:09,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:32:09,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:32:09,064 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:32:09,065 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:32:09,065 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:32:09,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:32:09,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:32:09,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:32:09,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:32:09,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:32:09,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:32:09,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:32:09,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:32:09,076 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:32:09,077 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:32:09,082 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:32:09,134 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:32:09,134 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:32:09,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:32:09,138 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:32:09,138 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:32:09,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:32:09,138 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:32:09,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:32:09,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:32:09,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:32:09,141 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:32:09,141 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:32:09,141 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:32:09,142 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:32:09,142 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:32:09,142 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:32:09,142 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:32:09,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:32:09,143 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:32:09,143 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:32:09,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:32:09,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:32:09,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:32:09,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:32:09,144 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:32:09,144 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:32:09,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:32:09,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:32:09,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:32:09,540 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:32:09,542 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:32:09,543 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.16.cil.c [2021-01-06 19:32:09,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9cfcd63e2/d89f259408324ab9b15be459b2220b73/FLAG6f1e8409a [2021-01-06 19:32:10,472 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:32:10,473 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.16.cil.c [2021-01-06 19:32:10,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9cfcd63e2/d89f259408324ab9b15be459b2220b73/FLAG6f1e8409a [2021-01-06 19:32:10,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/9cfcd63e2/d89f259408324ab9b15be459b2220b73 [2021-01-06 19:32:10,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:32:10,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:32:10,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:10,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:32:10,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:32:10,736 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:10" (1/1) ... [2021-01-06 19:32:10,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e11eeaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:10, skipping insertion in model container [2021-01-06 19:32:10,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:32:10" (1/1) ... [2021-01-06 19:32:10,745 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:32:10,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:32:10,974 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/transmitter.16.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_15~0,] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T14_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_14~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T14_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_14~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T14_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_14~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_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~16,] [2021-01-06 19:32:11,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:11,221 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:32:11,235 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/transmitter.16.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~15,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_15~0,] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T14_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_14~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T14_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_14~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___13~0,] left hand side expression in assignment: lhs: VariableLHS[~t14_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T14_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_14~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t14_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~16,] [2021-01-06 19:32:11,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:32:11,442 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:32:11,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11 WrapperNode [2021-01-06 19:32:11,443 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:32:11,444 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:11,444 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:32:11,445 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:32:11,453 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:32:11" (1/1) ... [2021-01-06 19:32:11,471 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:32:11" (1/1) ... [2021-01-06 19:32:11,643 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:32:11,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:32:11,644 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:32:11,644 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:32:11,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11" (1/1) ... [2021-01-06 19:32:11,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11" (1/1) ... [2021-01-06 19:32:11,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11" (1/1) ... [2021-01-06 19:32:11,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11" (1/1) ... [2021-01-06 19:32:11,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11" (1/1) ... [2021-01-06 19:32:11,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11" (1/1) ... [2021-01-06 19:32:11,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11" (1/1) ... [2021-01-06 19:32:11,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:32:11,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:32:11,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:32:11,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:32:11,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11" (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:32:11,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:32:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:32:11,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:32:11,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:32:15,005 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:32:15,005 INFO L299 CfgBuilder]: Removed 624 assume(true) statements. [2021-01-06 19:32:15,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:32:15 BoogieIcfgContainer [2021-01-06 19:32:15,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:32:15,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:32:15,014 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:32:15,017 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:32:15,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:32:10" (1/3) ... [2021-01-06 19:32:15,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2039684d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:32:15, skipping insertion in model container [2021-01-06 19:32:15,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:32:11" (2/3) ... [2021-01-06 19:32:15,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2039684d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:32:15, skipping insertion in model container [2021-01-06 19:32:15,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:32:15" (3/3) ... [2021-01-06 19:32:15,021 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.16.cil.c [2021-01-06 19:32:15,027 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:32:15,034 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:32:15,054 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:32:15,092 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:32:15,092 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:32:15,092 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:32:15,093 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:32:15,093 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:32:15,093 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:32:15,093 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:32:15,093 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:32:15,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states. [2021-01-06 19:32:15,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:15,175 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:15,176 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:15,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1186634079, now seen corresponding path program 1 times [2021-01-06 19:32:15,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:15,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748799578] [2021-01-06 19:32:15,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:15,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:15,547 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:32:15,548 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748799578] [2021-01-06 19:32:15,549 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:15,549 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:15,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557149827] [2021-01-06 19:32:15,556 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:15,556 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:15,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:15,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:15,574 INFO L87 Difference]: Start difference. First operand 2018 states. Second operand 3 states. [2021-01-06 19:32:15,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:15,767 INFO L93 Difference]: Finished difference Result 4031 states and 6077 transitions. [2021-01-06 19:32:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:15,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:15,819 INFO L225 Difference]: With dead ends: 4031 [2021-01-06 19:32:15,820 INFO L226 Difference]: Without dead ends: 2014 [2021-01-06 19:32:15,837 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:32:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2021-01-06 19:32:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2021-01-06 19:32:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2021-01-06 19:32:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 3000 transitions. [2021-01-06 19:32:16,042 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 3000 transitions. Word has length 178 [2021-01-06 19:32:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:16,043 INFO L481 AbstractCegarLoop]: Abstraction has 2014 states and 3000 transitions. [2021-01-06 19:32:16,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:16,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 3000 transitions. [2021-01-06 19:32:16,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:16,058 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:16,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:16,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:32:16,059 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash -355980445, now seen corresponding path program 1 times [2021-01-06 19:32:16,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:16,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675148651] [2021-01-06 19:32:16,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:16,218 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:32:16,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675148651] [2021-01-06 19:32:16,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:16,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:16,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432238729] [2021-01-06 19:32:16,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:16,222 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:16,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:16,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:16,223 INFO L87 Difference]: Start difference. First operand 2014 states and 3000 transitions. Second operand 3 states. [2021-01-06 19:32:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:16,355 INFO L93 Difference]: Finished difference Result 4015 states and 5978 transitions. [2021-01-06 19:32:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:16,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:16,372 INFO L225 Difference]: With dead ends: 4015 [2021-01-06 19:32:16,372 INFO L226 Difference]: Without dead ends: 2014 [2021-01-06 19:32:16,379 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:32:16,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2021-01-06 19:32:16,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2021-01-06 19:32:16,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2021-01-06 19:32:16,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 2999 transitions. [2021-01-06 19:32:16,482 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 2999 transitions. Word has length 178 [2021-01-06 19:32:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:16,486 INFO L481 AbstractCegarLoop]: Abstraction has 2014 states and 2999 transitions. [2021-01-06 19:32:16,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 2999 transitions. [2021-01-06 19:32:16,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:16,492 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:16,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:16,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:32:16,493 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:16,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash -864759259, now seen corresponding path program 1 times [2021-01-06 19:32:16,501 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:16,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498124552] [2021-01-06 19:32:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:16,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:16,778 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:32:16,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498124552] [2021-01-06 19:32:16,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:16,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:16,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425350781] [2021-01-06 19:32:16,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:16,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:16,782 INFO L87 Difference]: Start difference. First operand 2014 states and 2999 transitions. Second operand 3 states. [2021-01-06 19:32:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:17,021 INFO L93 Difference]: Finished difference Result 5736 states and 8515 transitions. [2021-01-06 19:32:17,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:17,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:17,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:17,043 INFO L225 Difference]: With dead ends: 5736 [2021-01-06 19:32:17,044 INFO L226 Difference]: Without dead ends: 3741 [2021-01-06 19:32:17,049 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:32:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2021-01-06 19:32:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3739. [2021-01-06 19:32:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5529 transitions. [2021-01-06 19:32:17,223 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5529 transitions. Word has length 178 [2021-01-06 19:32:17,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:17,230 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5529 transitions. [2021-01-06 19:32:17,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:17,231 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5529 transitions. [2021-01-06 19:32:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:17,233 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:17,233 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:17,233 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:32:17,234 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:17,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:17,234 INFO L82 PathProgramCache]: Analyzing trace with hash 439277764, now seen corresponding path program 1 times [2021-01-06 19:32:17,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:17,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113573063] [2021-01-06 19:32:17,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:17,446 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:32:17,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113573063] [2021-01-06 19:32:17,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:17,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:17,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018164635] [2021-01-06 19:32:17,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:17,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:17,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:17,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:17,451 INFO L87 Difference]: Start difference. First operand 3739 states and 5529 transitions. Second operand 4 states. [2021-01-06 19:32:17,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:17,824 INFO L93 Difference]: Finished difference Result 9184 states and 13556 transitions. [2021-01-06 19:32:17,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:17,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:17,854 INFO L225 Difference]: With dead ends: 9184 [2021-01-06 19:32:17,855 INFO L226 Difference]: Without dead ends: 5465 [2021-01-06 19:32:17,863 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:32:17,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5465 states. [2021-01-06 19:32:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5465 to 3739. [2021-01-06 19:32:18,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5526 transitions. [2021-01-06 19:32:18,048 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5526 transitions. Word has length 178 [2021-01-06 19:32:18,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:18,048 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5526 transitions. [2021-01-06 19:32:18,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:18,049 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5526 transitions. [2021-01-06 19:32:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:18,051 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:18,051 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:18,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:32:18,052 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1106659654, now seen corresponding path program 1 times [2021-01-06 19:32:18,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:18,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808546320] [2021-01-06 19:32:18,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:18,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:18,206 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:32:18,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808546320] [2021-01-06 19:32:18,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:18,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:18,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665169328] [2021-01-06 19:32:18,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:18,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:18,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:18,209 INFO L87 Difference]: Start difference. First operand 3739 states and 5526 transitions. Second operand 4 states. [2021-01-06 19:32:18,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:18,583 INFO L93 Difference]: Finished difference Result 9180 states and 13542 transitions. [2021-01-06 19:32:18,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:18,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:18,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:18,616 INFO L225 Difference]: With dead ends: 9180 [2021-01-06 19:32:18,617 INFO L226 Difference]: Without dead ends: 5463 [2021-01-06 19:32:18,628 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:32:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5463 states. [2021-01-06 19:32:18,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5463 to 3739. [2021-01-06 19:32:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:18,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5523 transitions. [2021-01-06 19:32:18,907 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5523 transitions. Word has length 178 [2021-01-06 19:32:18,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:18,908 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5523 transitions. [2021-01-06 19:32:18,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5523 transitions. [2021-01-06 19:32:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:18,910 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:18,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:18,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:32:18,911 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:18,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:18,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1451487816, now seen corresponding path program 1 times [2021-01-06 19:32:18,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:18,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857681795] [2021-01-06 19:32:18,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:19,017 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:32:19,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857681795] [2021-01-06 19:32:19,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:19,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:19,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482791177] [2021-01-06 19:32:19,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:19,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:19,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:19,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:19,021 INFO L87 Difference]: Start difference. First operand 3739 states and 5523 transitions. Second operand 3 states. [2021-01-06 19:32:19,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:19,246 INFO L93 Difference]: Finished difference Result 7455 states and 11008 transitions. [2021-01-06 19:32:19,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:19,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:19,266 INFO L225 Difference]: With dead ends: 7455 [2021-01-06 19:32:19,266 INFO L226 Difference]: Without dead ends: 3739 [2021-01-06 19:32:19,274 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:32:19,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-01-06 19:32:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2021-01-06 19:32:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:19,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5515 transitions. [2021-01-06 19:32:19,476 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5515 transitions. Word has length 178 [2021-01-06 19:32:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:19,476 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5515 transitions. [2021-01-06 19:32:19,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5515 transitions. [2021-01-06 19:32:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:19,479 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:19,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:19,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:32:19,480 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:19,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1202993144, now seen corresponding path program 1 times [2021-01-06 19:32:19,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:19,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989200814] [2021-01-06 19:32:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:19,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:19,576 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:32:19,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989200814] [2021-01-06 19:32:19,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:19,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:19,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440163623] [2021-01-06 19:32:19,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:19,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:19,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:19,580 INFO L87 Difference]: Start difference. First operand 3739 states and 5515 transitions. Second operand 3 states. [2021-01-06 19:32:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:19,785 INFO L93 Difference]: Finished difference Result 7454 states and 10991 transitions. [2021-01-06 19:32:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:19,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:19,824 INFO L225 Difference]: With dead ends: 7454 [2021-01-06 19:32:19,824 INFO L226 Difference]: Without dead ends: 3739 [2021-01-06 19:32:19,832 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:32:19,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-01-06 19:32:20,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2021-01-06 19:32:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5507 transitions. [2021-01-06 19:32:20,017 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5507 transitions. Word has length 178 [2021-01-06 19:32:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:20,017 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5507 transitions. [2021-01-06 19:32:20,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5507 transitions. [2021-01-06 19:32:20,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:20,019 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:20,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:20,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:32:20,020 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 928135752, now seen corresponding path program 1 times [2021-01-06 19:32:20,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:20,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801578027] [2021-01-06 19:32:20,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:20,105 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:32:20,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801578027] [2021-01-06 19:32:20,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:20,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:20,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068133294] [2021-01-06 19:32:20,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:20,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:20,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:20,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:20,108 INFO L87 Difference]: Start difference. First operand 3739 states and 5507 transitions. Second operand 4 states. [2021-01-06 19:32:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:20,521 INFO L93 Difference]: Finished difference Result 9174 states and 13490 transitions. [2021-01-06 19:32:20,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:20,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:20,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:20,538 INFO L225 Difference]: With dead ends: 9174 [2021-01-06 19:32:20,538 INFO L226 Difference]: Without dead ends: 5460 [2021-01-06 19:32:20,547 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:32:20,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5460 states. [2021-01-06 19:32:20,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5460 to 3739. [2021-01-06 19:32:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5504 transitions. [2021-01-06 19:32:20,782 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5504 transitions. Word has length 178 [2021-01-06 19:32:20,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:20,783 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5504 transitions. [2021-01-06 19:32:20,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5504 transitions. [2021-01-06 19:32:20,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:20,785 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:20,786 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:20,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:32:20,786 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:20,787 INFO L82 PathProgramCache]: Analyzing trace with hash 316866694, now seen corresponding path program 1 times [2021-01-06 19:32:20,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:20,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611648829] [2021-01-06 19:32:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:20,858 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:32:20,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611648829] [2021-01-06 19:32:20,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:20,860 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:20,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686109436] [2021-01-06 19:32:20,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:20,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:20,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:20,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:20,862 INFO L87 Difference]: Start difference. First operand 3739 states and 5504 transitions. Second operand 3 states. [2021-01-06 19:32:21,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:21,052 INFO L93 Difference]: Finished difference Result 7452 states and 10967 transitions. [2021-01-06 19:32:21,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:21,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:21,063 INFO L225 Difference]: With dead ends: 7452 [2021-01-06 19:32:21,063 INFO L226 Difference]: Without dead ends: 3739 [2021-01-06 19:32:21,070 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:32:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-01-06 19:32:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2021-01-06 19:32:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:21,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5496 transitions. [2021-01-06 19:32:21,263 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5496 transitions. Word has length 178 [2021-01-06 19:32:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:21,263 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5496 transitions. [2021-01-06 19:32:21,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5496 transitions. [2021-01-06 19:32:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:21,266 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:21,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:21,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:32:21,266 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:21,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:21,267 INFO L82 PathProgramCache]: Analyzing trace with hash 962659014, now seen corresponding path program 1 times [2021-01-06 19:32:21,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:21,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960018463] [2021-01-06 19:32:21,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:21,366 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:32:21,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960018463] [2021-01-06 19:32:21,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:21,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:21,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833278365] [2021-01-06 19:32:21,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:21,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:21,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:21,369 INFO L87 Difference]: Start difference. First operand 3739 states and 5496 transitions. Second operand 3 states. [2021-01-06 19:32:21,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:21,569 INFO L93 Difference]: Finished difference Result 7451 states and 10950 transitions. [2021-01-06 19:32:21,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:21,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:21,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:21,581 INFO L225 Difference]: With dead ends: 7451 [2021-01-06 19:32:21,581 INFO L226 Difference]: Without dead ends: 3739 [2021-01-06 19:32:21,591 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:32:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-01-06 19:32:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2021-01-06 19:32:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5488 transitions. [2021-01-06 19:32:21,790 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5488 transitions. Word has length 178 [2021-01-06 19:32:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:21,791 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5488 transitions. [2021-01-06 19:32:21,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5488 transitions. [2021-01-06 19:32:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:21,793 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:21,793 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:21,793 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:32:21,793 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1510360954, now seen corresponding path program 1 times [2021-01-06 19:32:21,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:21,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110151015] [2021-01-06 19:32:21,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:21,858 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:32:21,859 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110151015] [2021-01-06 19:32:21,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:21,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:21,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741128873] [2021-01-06 19:32:21,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:21,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:21,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:21,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:21,861 INFO L87 Difference]: Start difference. First operand 3739 states and 5488 transitions. Second operand 3 states. [2021-01-06 19:32:22,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:22,097 INFO L93 Difference]: Finished difference Result 7450 states and 10933 transitions. [2021-01-06 19:32:22,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:22,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:22,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:22,106 INFO L225 Difference]: With dead ends: 7450 [2021-01-06 19:32:22,107 INFO L226 Difference]: Without dead ends: 3739 [2021-01-06 19:32:22,114 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:32:22,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-01-06 19:32:22,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2021-01-06 19:32:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:22,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5480 transitions. [2021-01-06 19:32:22,342 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5480 transitions. Word has length 178 [2021-01-06 19:32:22,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:22,343 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5480 transitions. [2021-01-06 19:32:22,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:22,343 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5480 transitions. [2021-01-06 19:32:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:22,345 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:22,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:22,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:32:22,346 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:22,347 INFO L82 PathProgramCache]: Analyzing trace with hash 210979526, now seen corresponding path program 1 times [2021-01-06 19:32:22,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:22,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071707901] [2021-01-06 19:32:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:22,438 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:32:22,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071707901] [2021-01-06 19:32:22,438 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:22,439 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:22,439 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732734059] [2021-01-06 19:32:22,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:22,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:22,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:22,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:22,441 INFO L87 Difference]: Start difference. First operand 3739 states and 5480 transitions. Second operand 4 states. [2021-01-06 19:32:22,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:22,931 INFO L93 Difference]: Finished difference Result 9164 states and 13413 transitions. [2021-01-06 19:32:22,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:22,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:22,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:22,944 INFO L225 Difference]: With dead ends: 9164 [2021-01-06 19:32:22,945 INFO L226 Difference]: Without dead ends: 5455 [2021-01-06 19:32:22,953 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:32:22,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5455 states. [2021-01-06 19:32:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5455 to 3739. [2021-01-06 19:32:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5477 transitions. [2021-01-06 19:32:23,168 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5477 transitions. Word has length 178 [2021-01-06 19:32:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:23,169 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5477 transitions. [2021-01-06 19:32:23,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5477 transitions. [2021-01-06 19:32:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:23,171 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:23,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:23,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:32:23,172 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:23,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:23,172 INFO L82 PathProgramCache]: Analyzing trace with hash 596841928, now seen corresponding path program 1 times [2021-01-06 19:32:23,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:23,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171934966] [2021-01-06 19:32:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:23,278 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:32:23,279 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171934966] [2021-01-06 19:32:23,279 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:23,279 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:23,279 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126026478] [2021-01-06 19:32:23,280 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:23,280 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:23,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:23,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:23,281 INFO L87 Difference]: Start difference. First operand 3739 states and 5477 transitions. Second operand 3 states. [2021-01-06 19:32:23,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:23,500 INFO L93 Difference]: Finished difference Result 7447 states and 10907 transitions. [2021-01-06 19:32:23,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:23,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:23,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:23,509 INFO L225 Difference]: With dead ends: 7447 [2021-01-06 19:32:23,509 INFO L226 Difference]: Without dead ends: 3739 [2021-01-06 19:32:23,515 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:32:23,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-01-06 19:32:23,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2021-01-06 19:32:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5469 transitions. [2021-01-06 19:32:23,727 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5469 transitions. Word has length 178 [2021-01-06 19:32:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:23,727 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5469 transitions. [2021-01-06 19:32:23,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5469 transitions. [2021-01-06 19:32:23,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:23,729 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:23,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:23,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:32:23,730 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:23,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1718397832, now seen corresponding path program 1 times [2021-01-06 19:32:23,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:23,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525041408] [2021-01-06 19:32:23,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:23,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:23,796 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:32:23,796 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525041408] [2021-01-06 19:32:23,796 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:23,796 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:23,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329947336] [2021-01-06 19:32:23,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:23,797 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:23,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:23,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:23,798 INFO L87 Difference]: Start difference. First operand 3739 states and 5469 transitions. Second operand 3 states. [2021-01-06 19:32:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:24,014 INFO L93 Difference]: Finished difference Result 7446 states and 10890 transitions. [2021-01-06 19:32:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:24,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:24,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:24,022 INFO L225 Difference]: With dead ends: 7446 [2021-01-06 19:32:24,023 INFO L226 Difference]: Without dead ends: 3739 [2021-01-06 19:32:24,031 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:32:24,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-01-06 19:32:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2021-01-06 19:32:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5461 transitions. [2021-01-06 19:32:24,231 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5461 transitions. Word has length 178 [2021-01-06 19:32:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:24,231 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5461 transitions. [2021-01-06 19:32:24,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5461 transitions. [2021-01-06 19:32:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:24,234 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:24,234 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:24,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:32:24,234 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1154916920, now seen corresponding path program 1 times [2021-01-06 19:32:24,235 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:24,235 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994993693] [2021-01-06 19:32:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:24,365 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:32:24,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994993693] [2021-01-06 19:32:24,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:24,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:24,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171307801] [2021-01-06 19:32:24,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:24,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:24,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:24,368 INFO L87 Difference]: Start difference. First operand 3739 states and 5461 transitions. Second operand 4 states. [2021-01-06 19:32:24,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:24,804 INFO L93 Difference]: Finished difference Result 9158 states and 13361 transitions. [2021-01-06 19:32:24,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:24,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:24,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:24,829 INFO L225 Difference]: With dead ends: 9158 [2021-01-06 19:32:24,829 INFO L226 Difference]: Without dead ends: 5452 [2021-01-06 19:32:24,837 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:32:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2021-01-06 19:32:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 3739. [2021-01-06 19:32:25,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5458 transitions. [2021-01-06 19:32:25,061 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5458 transitions. Word has length 178 [2021-01-06 19:32:25,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:25,061 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5458 transitions. [2021-01-06 19:32:25,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5458 transitions. [2021-01-06 19:32:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:25,063 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:25,064 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:25,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:32:25,065 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:25,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:25,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1816871430, now seen corresponding path program 1 times [2021-01-06 19:32:25,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:25,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072970742] [2021-01-06 19:32:25,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:25,138 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:32:25,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072970742] [2021-01-06 19:32:25,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:25,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:25,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400271877] [2021-01-06 19:32:25,142 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:25,142 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:25,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:25,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:25,143 INFO L87 Difference]: Start difference. First operand 3739 states and 5458 transitions. Second operand 4 states. [2021-01-06 19:32:25,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:25,652 INFO L93 Difference]: Finished difference Result 9051 states and 13202 transitions. [2021-01-06 19:32:25,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:25,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:25,665 INFO L225 Difference]: With dead ends: 9051 [2021-01-06 19:32:25,665 INFO L226 Difference]: Without dead ends: 5346 [2021-01-06 19:32:25,673 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:32:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2021-01-06 19:32:25,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 3739. [2021-01-06 19:32:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5455 transitions. [2021-01-06 19:32:25,896 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5455 transitions. Word has length 178 [2021-01-06 19:32:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:25,896 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5455 transitions. [2021-01-06 19:32:25,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:25,896 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5455 transitions. [2021-01-06 19:32:25,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:25,898 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:25,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:25,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:32:25,899 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:25,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:25,900 INFO L82 PathProgramCache]: Analyzing trace with hash -581116408, now seen corresponding path program 1 times [2021-01-06 19:32:25,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:25,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432693985] [2021-01-06 19:32:25,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:25,964 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:32:25,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432693985] [2021-01-06 19:32:25,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:25,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:25,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760540997] [2021-01-06 19:32:25,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:25,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:25,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:25,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:25,967 INFO L87 Difference]: Start difference. First operand 3739 states and 5455 transitions. Second operand 3 states. [2021-01-06 19:32:26,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:26,213 INFO L93 Difference]: Finished difference Result 7443 states and 10859 transitions. [2021-01-06 19:32:26,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:26,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:26,221 INFO L225 Difference]: With dead ends: 7443 [2021-01-06 19:32:26,222 INFO L226 Difference]: Without dead ends: 3739 [2021-01-06 19:32:26,227 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:32:26,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-01-06 19:32:26,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2021-01-06 19:32:26,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5419 transitions. [2021-01-06 19:32:26,537 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5419 transitions. Word has length 178 [2021-01-06 19:32:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:26,537 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5419 transitions. [2021-01-06 19:32:26,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5419 transitions. [2021-01-06 19:32:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:26,539 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:26,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:26,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:32:26,540 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:26,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -979535065, now seen corresponding path program 1 times [2021-01-06 19:32:26,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:26,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455848476] [2021-01-06 19:32:26,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:26,639 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:32:26,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455848476] [2021-01-06 19:32:26,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:26,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:26,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209313078] [2021-01-06 19:32:26,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:26,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:26,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:26,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:26,648 INFO L87 Difference]: Start difference. First operand 3739 states and 5419 transitions. Second operand 4 states. [2021-01-06 19:32:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:27,178 INFO L93 Difference]: Finished difference Result 9047 states and 13103 transitions. [2021-01-06 19:32:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:27,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:27,188 INFO L225 Difference]: With dead ends: 9047 [2021-01-06 19:32:27,188 INFO L226 Difference]: Without dead ends: 5344 [2021-01-06 19:32:27,195 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:32:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2021-01-06 19:32:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 3739. [2021-01-06 19:32:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5416 transitions. [2021-01-06 19:32:27,443 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5416 transitions. Word has length 178 [2021-01-06 19:32:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:27,443 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5416 transitions. [2021-01-06 19:32:27,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:27,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5416 transitions. [2021-01-06 19:32:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:27,445 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:27,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:27,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:32:27,445 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:27,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash -552980567, now seen corresponding path program 1 times [2021-01-06 19:32:27,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:27,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074291672] [2021-01-06 19:32:27,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:27,520 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:32:27,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074291672] [2021-01-06 19:32:27,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:27,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:27,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136162020] [2021-01-06 19:32:27,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:27,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:27,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:27,523 INFO L87 Difference]: Start difference. First operand 3739 states and 5416 transitions. Second operand 4 states. [2021-01-06 19:32:28,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:28,019 INFO L93 Difference]: Finished difference Result 9043 states and 13089 transitions. [2021-01-06 19:32:28,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:28,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:28,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:28,027 INFO L225 Difference]: With dead ends: 9043 [2021-01-06 19:32:28,028 INFO L226 Difference]: Without dead ends: 5342 [2021-01-06 19:32:28,033 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:32:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5342 states. [2021-01-06 19:32:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5342 to 3739. [2021-01-06 19:32:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:28,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5413 transitions. [2021-01-06 19:32:28,294 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5413 transitions. Word has length 178 [2021-01-06 19:32:28,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:28,294 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5413 transitions. [2021-01-06 19:32:28,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5413 transitions. [2021-01-06 19:32:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:28,295 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:28,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:28,296 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:32:28,296 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:28,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:28,296 INFO L82 PathProgramCache]: Analyzing trace with hash -708961109, now seen corresponding path program 1 times [2021-01-06 19:32:28,297 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:28,297 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260548435] [2021-01-06 19:32:28,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:28,362 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:32:28,362 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260548435] [2021-01-06 19:32:28,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:28,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:28,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248527607] [2021-01-06 19:32:28,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:28,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:28,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:28,364 INFO L87 Difference]: Start difference. First operand 3739 states and 5413 transitions. Second operand 4 states. [2021-01-06 19:32:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:28,870 INFO L93 Difference]: Finished difference Result 9041 states and 13079 transitions. [2021-01-06 19:32:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:28,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:28,876 INFO L225 Difference]: With dead ends: 9041 [2021-01-06 19:32:28,876 INFO L226 Difference]: Without dead ends: 5341 [2021-01-06 19:32:28,879 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:32:28,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5341 states. [2021-01-06 19:32:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5341 to 3739. [2021-01-06 19:32:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:29,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5410 transitions. [2021-01-06 19:32:29,160 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5410 transitions. Word has length 178 [2021-01-06 19:32:29,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:29,163 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5410 transitions. [2021-01-06 19:32:29,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:29,163 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5410 transitions. [2021-01-06 19:32:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:29,164 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:29,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:29,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:32:29,165 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:29,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:29,166 INFO L82 PathProgramCache]: Analyzing trace with hash -298350743, now seen corresponding path program 1 times [2021-01-06 19:32:29,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:29,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340536172] [2021-01-06 19:32:29,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:29,236 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:32:29,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340536172] [2021-01-06 19:32:29,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:29,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:29,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390218707] [2021-01-06 19:32:29,239 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:29,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:29,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:29,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:29,241 INFO L87 Difference]: Start difference. First operand 3739 states and 5410 transitions. Second operand 4 states. [2021-01-06 19:32:29,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:29,659 INFO L93 Difference]: Finished difference Result 9039 states and 13069 transitions. [2021-01-06 19:32:29,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:29,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:29,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:29,664 INFO L225 Difference]: With dead ends: 9039 [2021-01-06 19:32:29,665 INFO L226 Difference]: Without dead ends: 5340 [2021-01-06 19:32:29,668 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:32:29,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2021-01-06 19:32:29,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 3739. [2021-01-06 19:32:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:29,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5407 transitions. [2021-01-06 19:32:29,956 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5407 transitions. Word has length 178 [2021-01-06 19:32:29,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:29,957 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5407 transitions. [2021-01-06 19:32:29,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5407 transitions. [2021-01-06 19:32:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:29,957 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:29,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:29,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:32:29,958 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:29,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:29,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2086220565, now seen corresponding path program 1 times [2021-01-06 19:32:29,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:29,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652484373] [2021-01-06 19:32:29,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:30,029 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:32:30,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652484373] [2021-01-06 19:32:30,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:30,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:30,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693453682] [2021-01-06 19:32:30,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:30,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:30,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:30,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:30,032 INFO L87 Difference]: Start difference. First operand 3739 states and 5407 transitions. Second operand 4 states. [2021-01-06 19:32:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:30,558 INFO L93 Difference]: Finished difference Result 9037 states and 13059 transitions. [2021-01-06 19:32:30,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:30,559 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:30,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:30,565 INFO L225 Difference]: With dead ends: 9037 [2021-01-06 19:32:30,566 INFO L226 Difference]: Without dead ends: 5339 [2021-01-06 19:32:30,571 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:32:30,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5339 states. [2021-01-06 19:32:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5339 to 3739. [2021-01-06 19:32:30,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5404 transitions. [2021-01-06 19:32:30,785 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5404 transitions. Word has length 178 [2021-01-06 19:32:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:30,785 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5404 transitions. [2021-01-06 19:32:30,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5404 transitions. [2021-01-06 19:32:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:30,786 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:30,786 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:30,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:32:30,787 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash 72863529, now seen corresponding path program 1 times [2021-01-06 19:32:30,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:30,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937116604] [2021-01-06 19:32:30,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:30,895 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:32:30,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937116604] [2021-01-06 19:32:30,895 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:30,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:30,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662181461] [2021-01-06 19:32:30,896 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:30,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:30,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:30,897 INFO L87 Difference]: Start difference. First operand 3739 states and 5404 transitions. Second operand 4 states. [2021-01-06 19:32:31,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:31,478 INFO L93 Difference]: Finished difference Result 9035 states and 13049 transitions. [2021-01-06 19:32:31,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:31,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:31,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:31,484 INFO L225 Difference]: With dead ends: 9035 [2021-01-06 19:32:31,484 INFO L226 Difference]: Without dead ends: 5338 [2021-01-06 19:32:31,488 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:32:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5338 states. [2021-01-06 19:32:31,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5338 to 3739. [2021-01-06 19:32:31,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:31,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5401 transitions. [2021-01-06 19:32:31,717 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5401 transitions. Word has length 178 [2021-01-06 19:32:31,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:31,717 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5401 transitions. [2021-01-06 19:32:31,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5401 transitions. [2021-01-06 19:32:31,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:31,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:31,718 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:31,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:32:31,718 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:31,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:31,719 INFO L82 PathProgramCache]: Analyzing trace with hash 142511403, now seen corresponding path program 1 times [2021-01-06 19:32:31,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:31,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372713619] [2021-01-06 19:32:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:31,792 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:32:31,792 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372713619] [2021-01-06 19:32:31,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:31,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:31,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623155347] [2021-01-06 19:32:31,793 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:31,793 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:31,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:31,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:31,794 INFO L87 Difference]: Start difference. First operand 3739 states and 5401 transitions. Second operand 4 states. [2021-01-06 19:32:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:32,329 INFO L93 Difference]: Finished difference Result 9033 states and 13039 transitions. [2021-01-06 19:32:32,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:32,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:32,334 INFO L225 Difference]: With dead ends: 9033 [2021-01-06 19:32:32,334 INFO L226 Difference]: Without dead ends: 5337 [2021-01-06 19:32:32,337 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:32:32,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5337 states. [2021-01-06 19:32:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5337 to 3739. [2021-01-06 19:32:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5398 transitions. [2021-01-06 19:32:32,542 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5398 transitions. Word has length 178 [2021-01-06 19:32:32,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:32,542 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5398 transitions. [2021-01-06 19:32:32,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:32,543 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5398 transitions. [2021-01-06 19:32:32,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:32,544 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:32,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:32,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:32:32,544 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:32,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:32,545 INFO L82 PathProgramCache]: Analyzing trace with hash 560400105, now seen corresponding path program 1 times [2021-01-06 19:32:32,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:32,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451498915] [2021-01-06 19:32:32,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:32,609 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:32:32,609 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451498915] [2021-01-06 19:32:32,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:32,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:32,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724162538] [2021-01-06 19:32:32,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:32,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:32,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:32,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:32,611 INFO L87 Difference]: Start difference. First operand 3739 states and 5398 transitions. Second operand 4 states. [2021-01-06 19:32:33,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:33,106 INFO L93 Difference]: Finished difference Result 9031 states and 13029 transitions. [2021-01-06 19:32:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:33,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:33,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:33,113 INFO L225 Difference]: With dead ends: 9031 [2021-01-06 19:32:33,114 INFO L226 Difference]: Without dead ends: 5336 [2021-01-06 19:32:33,119 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:32:33,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5336 states. [2021-01-06 19:32:33,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5336 to 3739. [2021-01-06 19:32:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5395 transitions. [2021-01-06 19:32:33,390 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5395 transitions. Word has length 178 [2021-01-06 19:32:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:33,390 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5395 transitions. [2021-01-06 19:32:33,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5395 transitions. [2021-01-06 19:32:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:33,391 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:33,391 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:33,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:32:33,392 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:33,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1959353707, now seen corresponding path program 1 times [2021-01-06 19:32:33,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:33,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803763302] [2021-01-06 19:32:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:33,454 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:32:33,455 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803763302] [2021-01-06 19:32:33,455 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:33,455 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:32:33,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341065190] [2021-01-06 19:32:33,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:32:33,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:33,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:32:33,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:32:33,457 INFO L87 Difference]: Start difference. First operand 3739 states and 5395 transitions. Second operand 3 states. [2021-01-06 19:32:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:33,782 INFO L93 Difference]: Finished difference Result 7432 states and 10726 transitions. [2021-01-06 19:32:33,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:32:33,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2021-01-06 19:32:33,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:33,787 INFO L225 Difference]: With dead ends: 7432 [2021-01-06 19:32:33,787 INFO L226 Difference]: Without dead ends: 3739 [2021-01-06 19:32:33,794 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:32:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3739 states. [2021-01-06 19:32:34,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3739 to 3739. [2021-01-06 19:32:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5359 transitions. [2021-01-06 19:32:34,009 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5359 transitions. Word has length 178 [2021-01-06 19:32:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:34,009 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5359 transitions. [2021-01-06 19:32:34,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:34,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5359 transitions. [2021-01-06 19:32:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:34,010 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:34,011 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:34,011 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:32:34,011 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:34,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:34,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1972147091, now seen corresponding path program 1 times [2021-01-06 19:32:34,012 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:34,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606336107] [2021-01-06 19:32:34,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:34,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:34,079 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:32:34,079 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606336107] [2021-01-06 19:32:34,079 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:34,080 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:34,080 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798523370] [2021-01-06 19:32:34,080 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:34,080 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:34,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:34,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:34,081 INFO L87 Difference]: Start difference. First operand 3739 states and 5359 transitions. Second operand 4 states. [2021-01-06 19:32:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:34,664 INFO L93 Difference]: Finished difference Result 9130 states and 13073 transitions. [2021-01-06 19:32:34,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:34,665 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:34,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:34,669 INFO L225 Difference]: With dead ends: 9130 [2021-01-06 19:32:34,669 INFO L226 Difference]: Without dead ends: 5438 [2021-01-06 19:32:34,673 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:32:34,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5438 states. [2021-01-06 19:32:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5438 to 3739. [2021-01-06 19:32:34,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3739 states. [2021-01-06 19:32:34,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3739 states to 3739 states and 5356 transitions. [2021-01-06 19:32:34,897 INFO L78 Accepts]: Start accepts. Automaton has 3739 states and 5356 transitions. Word has length 178 [2021-01-06 19:32:34,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:34,898 INFO L481 AbstractCegarLoop]: Abstraction has 3739 states and 5356 transitions. [2021-01-06 19:32:34,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:34,898 INFO L276 IsEmpty]: Start isEmpty. Operand 3739 states and 5356 transitions. [2021-01-06 19:32:34,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:34,899 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:34,899 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:34,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:32:34,899 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:34,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1683327701, now seen corresponding path program 1 times [2021-01-06 19:32:34,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:34,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122091680] [2021-01-06 19:32:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:34,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:34,967 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:32:34,967 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122091680] [2021-01-06 19:32:34,967 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:34,968 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:34,968 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502007548] [2021-01-06 19:32:34,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:34,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:34,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:34,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:34,969 INFO L87 Difference]: Start difference. First operand 3739 states and 5356 transitions. Second operand 5 states. [2021-01-06 19:32:36,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:36,057 INFO L93 Difference]: Finished difference Result 11465 states and 16503 transitions. [2021-01-06 19:32:36,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:36,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 19:32:36,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:36,068 INFO L225 Difference]: With dead ends: 11465 [2021-01-06 19:32:36,069 INFO L226 Difference]: Without dead ends: 7780 [2021-01-06 19:32:36,075 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:32:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7780 states. [2021-01-06 19:32:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7780 to 3784. [2021-01-06 19:32:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2021-01-06 19:32:36,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 5386 transitions. [2021-01-06 19:32:36,623 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 5386 transitions. Word has length 178 [2021-01-06 19:32:36,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:36,624 INFO L481 AbstractCegarLoop]: Abstraction has 3784 states and 5386 transitions. [2021-01-06 19:32:36,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 5386 transitions. [2021-01-06 19:32:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:36,625 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:36,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:36,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:32:36,626 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:36,626 INFO L82 PathProgramCache]: Analyzing trace with hash -2112986007, now seen corresponding path program 1 times [2021-01-06 19:32:36,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:36,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504802080] [2021-01-06 19:32:36,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:36,698 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:32:36,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504802080] [2021-01-06 19:32:36,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:36,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:36,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139933038] [2021-01-06 19:32:36,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:36,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:36,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:36,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:36,701 INFO L87 Difference]: Start difference. First operand 3784 states and 5386 transitions. Second operand 5 states. [2021-01-06 19:32:37,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:37,767 INFO L93 Difference]: Finished difference Result 14447 states and 20589 transitions. [2021-01-06 19:32:37,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:37,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 19:32:37,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:37,776 INFO L225 Difference]: With dead ends: 14447 [2021-01-06 19:32:37,777 INFO L226 Difference]: Without dead ends: 10724 [2021-01-06 19:32:37,782 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:32:37,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10724 states. [2021-01-06 19:32:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10724 to 3874. [2021-01-06 19:32:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3874 states. [2021-01-06 19:32:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3874 states and 5476 transitions. [2021-01-06 19:32:38,222 INFO L78 Accepts]: Start accepts. Automaton has 3874 states and 5476 transitions. Word has length 178 [2021-01-06 19:32:38,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:38,222 INFO L481 AbstractCegarLoop]: Abstraction has 3874 states and 5476 transitions. [2021-01-06 19:32:38,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:38,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3874 states and 5476 transitions. [2021-01-06 19:32:38,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:38,223 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:38,223 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:38,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:32:38,223 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:38,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:38,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1089346087, now seen corresponding path program 1 times [2021-01-06 19:32:38,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:38,224 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962425041] [2021-01-06 19:32:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:38,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:32:38,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962425041] [2021-01-06 19:32:38,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:38,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:38,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985164253] [2021-01-06 19:32:38,305 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:38,307 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:38,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:38,308 INFO L87 Difference]: Start difference. First operand 3874 states and 5476 transitions. Second operand 5 states. [2021-01-06 19:32:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:38,972 INFO L93 Difference]: Finished difference Result 9169 states and 12952 transitions. [2021-01-06 19:32:38,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:38,975 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 19:32:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:38,983 INFO L225 Difference]: With dead ends: 9169 [2021-01-06 19:32:38,983 INFO L226 Difference]: Without dead ends: 5366 [2021-01-06 19:32:38,990 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:32:38,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5366 states. [2021-01-06 19:32:39,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5366 to 3880. [2021-01-06 19:32:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3880 states. [2021-01-06 19:32:39,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 5454 transitions. [2021-01-06 19:32:39,377 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 5454 transitions. Word has length 178 [2021-01-06 19:32:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:39,377 INFO L481 AbstractCegarLoop]: Abstraction has 3880 states and 5454 transitions. [2021-01-06 19:32:39,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 5454 transitions. [2021-01-06 19:32:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:39,378 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:39,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:39,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:32:39,379 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:39,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:39,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1203734939, now seen corresponding path program 1 times [2021-01-06 19:32:39,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:39,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377438063] [2021-01-06 19:32:39,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:39,453 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:32:39,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377438063] [2021-01-06 19:32:39,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:39,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:39,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426163999] [2021-01-06 19:32:39,454 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:39,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:39,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:39,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:39,455 INFO L87 Difference]: Start difference. First operand 3880 states and 5454 transitions. Second operand 4 states. [2021-01-06 19:32:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:40,676 INFO L93 Difference]: Finished difference Result 14700 states and 20645 transitions. [2021-01-06 19:32:40,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:40,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:40,686 INFO L225 Difference]: With dead ends: 14700 [2021-01-06 19:32:40,687 INFO L226 Difference]: Without dead ends: 10869 [2021-01-06 19:32:40,692 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:32:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10869 states. [2021-01-06 19:32:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10869 to 10475. [2021-01-06 19:32:41,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10475 states. [2021-01-06 19:32:41,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10475 states to 10475 states and 14635 transitions. [2021-01-06 19:32:41,681 INFO L78 Accepts]: Start accepts. Automaton has 10475 states and 14635 transitions. Word has length 178 [2021-01-06 19:32:41,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:41,682 INFO L481 AbstractCegarLoop]: Abstraction has 10475 states and 14635 transitions. [2021-01-06 19:32:41,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:41,682 INFO L276 IsEmpty]: Start isEmpty. Operand 10475 states and 14635 transitions. [2021-01-06 19:32:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:41,683 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:41,683 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:41,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:32:41,683 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:41,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:41,684 INFO L82 PathProgramCache]: Analyzing trace with hash -201109244, now seen corresponding path program 1 times [2021-01-06 19:32:41,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:41,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94903051] [2021-01-06 19:32:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:41,773 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:32:41,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94903051] [2021-01-06 19:32:41,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:41,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:41,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766050509] [2021-01-06 19:32:41,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:41,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:41,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:41,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:41,776 INFO L87 Difference]: Start difference. First operand 10475 states and 14635 transitions. Second operand 5 states. [2021-01-06 19:32:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:43,623 INFO L93 Difference]: Finished difference Result 27258 states and 38228 transitions. [2021-01-06 19:32:43,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:43,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 19:32:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:43,639 INFO L225 Difference]: With dead ends: 27258 [2021-01-06 19:32:43,639 INFO L226 Difference]: Without dead ends: 16859 [2021-01-06 19:32:43,647 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:32:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16859 states. [2021-01-06 19:32:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16859 to 10562. [2021-01-06 19:32:44,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10562 states. [2021-01-06 19:32:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 14669 transitions. [2021-01-06 19:32:44,713 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 14669 transitions. Word has length 178 [2021-01-06 19:32:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:44,713 INFO L481 AbstractCegarLoop]: Abstraction has 10562 states and 14669 transitions. [2021-01-06 19:32:44,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 14669 transitions. [2021-01-06 19:32:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:44,714 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:44,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:44,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:32:44,715 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:44,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2120692674, now seen corresponding path program 1 times [2021-01-06 19:32:44,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:44,716 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558404049] [2021-01-06 19:32:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:44,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:44,831 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:32:44,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558404049] [2021-01-06 19:32:44,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:44,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:32:44,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808540253] [2021-01-06 19:32:44,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:32:44,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:44,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:32:44,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:32:44,834 INFO L87 Difference]: Start difference. First operand 10562 states and 14669 transitions. Second operand 4 states. [2021-01-06 19:32:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:47,947 INFO L93 Difference]: Finished difference Result 40603 states and 56359 transitions. [2021-01-06 19:32:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:32:47,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:32:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:47,981 INFO L225 Difference]: With dead ends: 40603 [2021-01-06 19:32:47,981 INFO L226 Difference]: Without dead ends: 30126 [2021-01-06 19:32:47,992 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:32:48,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30126 states. [2021-01-06 19:32:50,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30126 to 29226. [2021-01-06 19:32:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29226 states. [2021-01-06 19:32:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29226 states to 29226 states and 40369 transitions. [2021-01-06 19:32:50,867 INFO L78 Accepts]: Start accepts. Automaton has 29226 states and 40369 transitions. Word has length 178 [2021-01-06 19:32:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:50,868 INFO L481 AbstractCegarLoop]: Abstraction has 29226 states and 40369 transitions. [2021-01-06 19:32:50,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:32:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 29226 states and 40369 transitions. [2021-01-06 19:32:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:50,869 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:50,870 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:50,870 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:32:50,870 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:50,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1117635809, now seen corresponding path program 1 times [2021-01-06 19:32:50,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:50,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404942743] [2021-01-06 19:32:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:50,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:50,939 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:32:50,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404942743] [2021-01-06 19:32:50,940 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:50,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:50,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553985653] [2021-01-06 19:32:50,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:50,941 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:50,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:50,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:50,942 INFO L87 Difference]: Start difference. First operand 29226 states and 40369 transitions. Second operand 5 states. [2021-01-06 19:32:55,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:32:55,994 INFO L93 Difference]: Finished difference Result 75199 states and 104345 transitions. [2021-01-06 19:32:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:32:55,995 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 19:32:55,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:32:56,068 INFO L225 Difference]: With dead ends: 75199 [2021-01-06 19:32:56,068 INFO L226 Difference]: Without dead ends: 46062 [2021-01-06 19:32:56,105 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:32:56,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46062 states. [2021-01-06 19:32:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46062 to 29469. [2021-01-06 19:32:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29469 states. [2021-01-06 19:32:59,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29469 states to 29469 states and 40465 transitions. [2021-01-06 19:32:59,231 INFO L78 Accepts]: Start accepts. Automaton has 29469 states and 40465 transitions. Word has length 178 [2021-01-06 19:32:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:59,231 INFO L481 AbstractCegarLoop]: Abstraction has 29469 states and 40465 transitions. [2021-01-06 19:32:59,231 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:32:59,231 INFO L276 IsEmpty]: Start isEmpty. Operand 29469 states and 40465 transitions. [2021-01-06 19:32:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:32:59,232 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:59,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:59,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:32:59,232 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash 60904607, now seen corresponding path program 1 times [2021-01-06 19:32:59,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:59,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664286413] [2021-01-06 19:32:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:59,295 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:32:59,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664286413] [2021-01-06 19:32:59,296 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:59,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:59,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559177202] [2021-01-06 19:32:59,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:59,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:59,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:59,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:59,297 INFO L87 Difference]: Start difference. First operand 29469 states and 40465 transitions. Second operand 5 states. [2021-01-06 19:33:07,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:07,409 INFO L93 Difference]: Finished difference Result 105030 states and 145468 transitions. [2021-01-06 19:33:07,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:33:07,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 19:33:07,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:07,493 INFO L225 Difference]: With dead ends: 105030 [2021-01-06 19:33:07,493 INFO L226 Difference]: Without dead ends: 75657 [2021-01-06 19:33:07,528 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:33:07,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75657 states. [2021-01-06 19:33:11,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75657 to 30153. [2021-01-06 19:33:11,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30153 states. [2021-01-06 19:33:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30153 states to 30153 states and 41149 transitions. [2021-01-06 19:33:11,440 INFO L78 Accepts]: Start accepts. Automaton has 30153 states and 41149 transitions. Word has length 178 [2021-01-06 19:33:11,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:11,440 INFO L481 AbstractCegarLoop]: Abstraction has 30153 states and 41149 transitions. [2021-01-06 19:33:11,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:11,440 INFO L276 IsEmpty]: Start isEmpty. Operand 30153 states and 41149 transitions. [2021-01-06 19:33:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:33:11,441 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:11,441 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:11,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:33:11,442 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:11,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1937967837, now seen corresponding path program 1 times [2021-01-06 19:33:11,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:11,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310749246] [2021-01-06 19:33:11,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:11,532 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:33:11,533 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310749246] [2021-01-06 19:33:11,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:11,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:33:11,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669929038] [2021-01-06 19:33:11,534 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:33:11,534 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:11,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:33:11,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:33:11,535 INFO L87 Difference]: Start difference. First operand 30153 states and 41149 transitions. Second operand 4 states. [2021-01-06 19:33:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:21,698 INFO L93 Difference]: Finished difference Result 116380 states and 158761 transitions. [2021-01-06 19:33:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:33:21,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:33:21,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:21,791 INFO L225 Difference]: With dead ends: 116380 [2021-01-06 19:33:21,791 INFO L226 Difference]: Without dead ends: 86328 [2021-01-06 19:33:21,822 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:33:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86328 states. [2021-01-06 19:33:31,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86328 to 84288. [2021-01-06 19:33:31,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84288 states. [2021-01-06 19:33:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84288 states to 84288 states and 114460 transitions. [2021-01-06 19:33:31,891 INFO L78 Accepts]: Start accepts. Automaton has 84288 states and 114460 transitions. Word has length 178 [2021-01-06 19:33:31,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:31,891 INFO L481 AbstractCegarLoop]: Abstraction has 84288 states and 114460 transitions. [2021-01-06 19:33:31,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:33:31,891 INFO L276 IsEmpty]: Start isEmpty. Operand 84288 states and 114460 transitions. [2021-01-06 19:33:31,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:33:31,892 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:31,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:31,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:33:31,892 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:31,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:31,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1154805124, now seen corresponding path program 1 times [2021-01-06 19:33:31,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:31,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994978724] [2021-01-06 19:33:31,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:32,173 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:33:32,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994978724] [2021-01-06 19:33:32,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:32,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:33:32,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204959850] [2021-01-06 19:33:32,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:32,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:32,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:32,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:32,176 INFO L87 Difference]: Start difference. First operand 84288 states and 114460 transitions. Second operand 5 states. [2021-01-06 19:33:47,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:33:47,270 INFO L93 Difference]: Finished difference Result 213578 states and 291601 transitions. [2021-01-06 19:33:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:33:47,270 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 19:33:47,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:33:47,436 INFO L225 Difference]: With dead ends: 213578 [2021-01-06 19:33:47,436 INFO L226 Difference]: Without dead ends: 129395 [2021-01-06 19:33:47,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:33:47,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129395 states. [2021-01-06 19:33:58,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129395 to 84969. [2021-01-06 19:33:58,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84969 states. [2021-01-06 19:33:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84969 states to 84969 states and 114730 transitions. [2021-01-06 19:33:58,413 INFO L78 Accepts]: Start accepts. Automaton has 84969 states and 114730 transitions. Word has length 178 [2021-01-06 19:33:58,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:33:58,414 INFO L481 AbstractCegarLoop]: Abstraction has 84969 states and 114730 transitions. [2021-01-06 19:33:58,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:33:58,414 INFO L276 IsEmpty]: Start isEmpty. Operand 84969 states and 114730 transitions. [2021-01-06 19:33:58,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:33:58,415 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:33:58,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:33:58,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 19:33:58,415 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:33:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:33:58,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1261031226, now seen corresponding path program 1 times [2021-01-06 19:33:58,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:33:58,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705288224] [2021-01-06 19:33:58,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:33:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:33:58,500 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:33:58,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705288224] [2021-01-06 19:33:58,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:33:58,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:33:58,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694287003] [2021-01-06 19:33:58,501 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:33:58,501 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:33:58,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:33:58,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:33:58,502 INFO L87 Difference]: Start difference. First operand 84969 states and 114730 transitions. Second operand 5 states. [2021-01-06 19:34:22,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:34:22,966 INFO L93 Difference]: Finished difference Result 293432 states and 400257 transitions. [2021-01-06 19:34:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:34:22,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2021-01-06 19:34:22,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:34:23,419 INFO L225 Difference]: With dead ends: 293432 [2021-01-06 19:34:23,419 INFO L226 Difference]: Without dead ends: 208575 [2021-01-06 19:34:23,522 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:34:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208575 states. [2021-01-06 19:34:35,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208575 to 86883. [2021-01-06 19:34:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86883 states. [2021-01-06 19:34:35,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86883 states to 86883 states and 116644 transitions. [2021-01-06 19:34:35,629 INFO L78 Accepts]: Start accepts. Automaton has 86883 states and 116644 transitions. Word has length 178 [2021-01-06 19:34:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:34:35,629 INFO L481 AbstractCegarLoop]: Abstraction has 86883 states and 116644 transitions. [2021-01-06 19:34:35,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:34:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 86883 states and 116644 transitions. [2021-01-06 19:34:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2021-01-06 19:34:35,630 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:34:35,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:34:35,631 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:34:35,631 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:34:35,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:34:35,632 INFO L82 PathProgramCache]: Analyzing trace with hash 2100064888, now seen corresponding path program 1 times [2021-01-06 19:34:35,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:34:35,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900011905] [2021-01-06 19:34:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:34:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:34:35,714 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:34:35,714 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900011905] [2021-01-06 19:34:35,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:34:35,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:34:35,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874771511] [2021-01-06 19:34:35,715 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:34:35,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:34:35,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:34:35,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:34:35,716 INFO L87 Difference]: Start difference. First operand 86883 states and 116644 transitions. Second operand 4 states. [2021-01-06 19:35:07,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:35:07,349 INFO L93 Difference]: Finished difference Result 335044 states and 449740 transitions. [2021-01-06 19:35:07,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:35:07,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2021-01-06 19:35:07,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:35:07,970 INFO L225 Difference]: With dead ends: 335044 [2021-01-06 19:35:07,970 INFO L226 Difference]: Without dead ends: 248278 [2021-01-06 19:35:08,094 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:35:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248278 states.