/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.05.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:30:08,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:30:08,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:30:08,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:30:08,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:30:08,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:30:08,521 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:30:08,526 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:30:08,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:30:08,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:30:08,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:30:08,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:30:08,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:30:08,546 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:30:08,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:30:08,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:30:08,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:30:08,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:30:08,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:30:08,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:30:08,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:30:08,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:30:08,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:30:08,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:30:08,607 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:30:08,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:30:08,610 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:30:08,612 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:30:08,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:30:08,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:30:08,614 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:30:08,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:30:08,619 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:30:08,620 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:30:08,621 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:30:08,621 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:30:08,622 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:30:08,622 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:30:08,622 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:30:08,623 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:30:08,624 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:30:08,625 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:30:08,651 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:30:08,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:30:08,653 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:30:08,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:30:08,653 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:30:08,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:30:08,654 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:30:08,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:30:08,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:30:08,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:30:08,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:30:08,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:30:08,655 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:30:08,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:30:08,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:30:08,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:30:08,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:30:08,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:30:08,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:30:08,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:30:08,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:30:08,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:30:08,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:30:08,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:30:08,657 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:30:08,657 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:30:09,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:30:09,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:30:09,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:30:09,057 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:30:09,057 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:30:09,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.05.cil.c [2021-01-06 19:30:09,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d4219b203/a2a89181dc684db79362376156213700/FLAG6729f58c6 [2021-01-06 19:30:09,720 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:30:09,721 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.05.cil.c [2021-01-06 19:30:09,733 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d4219b203/a2a89181dc684db79362376156213700/FLAG6729f58c6 [2021-01-06 19:30:10,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/d4219b203/a2a89181dc684db79362376156213700 [2021-01-06 19:30:10,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:30:10,049 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:30:10,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:30:10,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:30:10,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:30:10,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:30:10" (1/1) ... [2021-01-06 19:30:10,060 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53dffde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10, skipping insertion in model container [2021-01-06 19:30:10,060 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:30:10" (1/1) ... [2021-01-06 19:30:10,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:30:10,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:30:10,280 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.05.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[~__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[~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[~__retres1~6,] 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~6,] 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~6,] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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~7,] [2021-01-06 19:30:10,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:30:10,385 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:30:10,399 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.05.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[~__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[~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[~__retres1~6,] 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~6,] 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~6,] 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[~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[~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[~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[~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[~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[~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[~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[~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[~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~7,] [2021-01-06 19:30:10,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:30:10,505 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:30:10,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10 WrapperNode [2021-01-06 19:30:10,506 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:30:10,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:30:10,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:30:10,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:30:10,547 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:30:10" (1/1) ... [2021-01-06 19:30:10,570 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:30:10" (1/1) ... [2021-01-06 19:30:10,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:30:10,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:30:10,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:30:10,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:30:10,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10" (1/1) ... [2021-01-06 19:30:10,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10" (1/1) ... [2021-01-06 19:30:10,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10" (1/1) ... [2021-01-06 19:30:10,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10" (1/1) ... [2021-01-06 19:30:10,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10" (1/1) ... [2021-01-06 19:30:10,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10" (1/1) ... [2021-01-06 19:30:10,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10" (1/1) ... [2021-01-06 19:30:10,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:30:10,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:30:10,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:30:10,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:30:10,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10" (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:30:10,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:30:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:30:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:30:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:30:12,608 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:30:12,609 INFO L299 CfgBuilder]: Removed 181 assume(true) statements. [2021-01-06 19:30:12,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:30:12 BoogieIcfgContainer [2021-01-06 19:30:12,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:30:12,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:30:12,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:30:12,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:30:12,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:30:10" (1/3) ... [2021-01-06 19:30:12,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28260c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:30:12, skipping insertion in model container [2021-01-06 19:30:12,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:10" (2/3) ... [2021-01-06 19:30:12,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28260c0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:30:12, skipping insertion in model container [2021-01-06 19:30:12,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:30:12" (3/3) ... [2021-01-06 19:30:12,620 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.05.cil.c [2021-01-06 19:30:12,631 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:30:12,636 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:30:12,655 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:30:12,703 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:30:12,703 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:30:12,703 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:30:12,703 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:30:12,703 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:30:12,704 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:30:12,704 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:30:12,704 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:30:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states. [2021-01-06 19:30:12,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:12,740 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:12,741 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] [2021-01-06 19:30:12,742 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:12,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:12,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1912114834, now seen corresponding path program 1 times [2021-01-06 19:30:12,758 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:12,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379705122] [2021-01-06 19:30:12,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:12,980 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:30:12,981 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379705122] [2021-01-06 19:30:12,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:12,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:12,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967139392] [2021-01-06 19:30:12,987 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:12,988 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:13,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:13,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:13,005 INFO L87 Difference]: Start difference. First operand 486 states. Second operand 3 states. [2021-01-06 19:30:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:13,141 INFO L93 Difference]: Finished difference Result 967 states and 1501 transitions. [2021-01-06 19:30:13,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:13,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:13,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:13,185 INFO L225 Difference]: With dead ends: 967 [2021-01-06 19:30:13,185 INFO L226 Difference]: Without dead ends: 482 [2021-01-06 19:30:13,195 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:30:13,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2021-01-06 19:30:13,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2021-01-06 19:30:13,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2021-01-06 19:30:13,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 730 transitions. [2021-01-06 19:30:13,278 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 730 transitions. Word has length 85 [2021-01-06 19:30:13,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:13,279 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 730 transitions. [2021-01-06 19:30:13,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 730 transitions. [2021-01-06 19:30:13,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:13,282 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:13,283 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] [2021-01-06 19:30:13,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:30:13,283 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:13,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:13,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1325014384, now seen corresponding path program 1 times [2021-01-06 19:30:13,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:13,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68472813] [2021-01-06 19:30:13,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:13,373 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:30:13,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68472813] [2021-01-06 19:30:13,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:13,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:13,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950355444] [2021-01-06 19:30:13,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:13,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:13,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:13,379 INFO L87 Difference]: Start difference. First operand 482 states and 730 transitions. Second operand 3 states. [2021-01-06 19:30:13,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:13,534 INFO L93 Difference]: Finished difference Result 1320 states and 1994 transitions. [2021-01-06 19:30:13,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:13,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:13,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:13,541 INFO L225 Difference]: With dead ends: 1320 [2021-01-06 19:30:13,542 INFO L226 Difference]: Without dead ends: 848 [2021-01-06 19:30:13,545 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:30:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2021-01-06 19:30:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2021-01-06 19:30:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1268 transitions. [2021-01-06 19:30:13,627 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1268 transitions. Word has length 85 [2021-01-06 19:30:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:13,627 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1268 transitions. [2021-01-06 19:30:13,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1268 transitions. [2021-01-06 19:30:13,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:13,636 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:13,636 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] [2021-01-06 19:30:13,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:30:13,637 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:13,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:13,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1311229201, now seen corresponding path program 1 times [2021-01-06 19:30:13,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:13,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241861139] [2021-01-06 19:30:13,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:13,753 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:30:13,753 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241861139] [2021-01-06 19:30:13,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:13,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:13,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889806411] [2021-01-06 19:30:13,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:13,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:13,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:13,762 INFO L87 Difference]: Start difference. First operand 846 states and 1268 transitions. Second operand 3 states. [2021-01-06 19:30:13,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:13,862 INFO L93 Difference]: Finished difference Result 1681 states and 2519 transitions. [2021-01-06 19:30:13,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:13,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:13,868 INFO L225 Difference]: With dead ends: 1681 [2021-01-06 19:30:13,868 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 19:30:13,870 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:30:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 19:30:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-01-06 19:30:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1260 transitions. [2021-01-06 19:30:13,912 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1260 transitions. Word has length 85 [2021-01-06 19:30:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:13,913 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1260 transitions. [2021-01-06 19:30:13,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1260 transitions. [2021-01-06 19:30:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:13,915 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:13,915 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] [2021-01-06 19:30:13,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:30:13,916 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash -86597841, now seen corresponding path program 1 times [2021-01-06 19:30:13,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:13,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108920757] [2021-01-06 19:30:13,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:14,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108920757] [2021-01-06 19:30:14,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:14,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:14,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59016985] [2021-01-06 19:30:14,016 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:14,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:14,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:14,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:14,018 INFO L87 Difference]: Start difference. First operand 846 states and 1260 transitions. Second operand 3 states. [2021-01-06 19:30:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:14,075 INFO L93 Difference]: Finished difference Result 1680 states and 2502 transitions. [2021-01-06 19:30:14,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:14,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:14,081 INFO L225 Difference]: With dead ends: 1680 [2021-01-06 19:30:14,081 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 19:30:14,083 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:30:14,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 19:30:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-01-06 19:30:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:14,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1252 transitions. [2021-01-06 19:30:14,119 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1252 transitions. Word has length 85 [2021-01-06 19:30:14,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:14,119 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1252 transitions. [2021-01-06 19:30:14,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:14,119 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1252 transitions. [2021-01-06 19:30:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:14,121 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:14,121 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] [2021-01-06 19:30:14,121 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:30:14,121 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:14,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:14,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1571114257, now seen corresponding path program 1 times [2021-01-06 19:30:14,122 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:14,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425457317] [2021-01-06 19:30:14,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:14,176 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:30:14,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425457317] [2021-01-06 19:30:14,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:14,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:14,178 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704256619] [2021-01-06 19:30:14,178 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:14,178 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:14,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:14,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:14,179 INFO L87 Difference]: Start difference. First operand 846 states and 1252 transitions. Second operand 3 states. [2021-01-06 19:30:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:14,262 INFO L93 Difference]: Finished difference Result 1678 states and 2483 transitions. [2021-01-06 19:30:14,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:14,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:14,274 INFO L225 Difference]: With dead ends: 1678 [2021-01-06 19:30:14,274 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 19:30:14,275 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:30:14,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 19:30:14,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-01-06 19:30:14,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1244 transitions. [2021-01-06 19:30:14,323 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1244 transitions. Word has length 85 [2021-01-06 19:30:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:14,323 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1244 transitions. [2021-01-06 19:30:14,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1244 transitions. [2021-01-06 19:30:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:14,324 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:14,325 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] [2021-01-06 19:30:14,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:30:14,325 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:14,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:14,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1353664849, now seen corresponding path program 1 times [2021-01-06 19:30:14,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:14,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251405828] [2021-01-06 19:30:14,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:14,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:14,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:30:14,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251405828] [2021-01-06 19:30:14,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:14,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:14,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453705875] [2021-01-06 19:30:14,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:14,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:14,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:14,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:14,450 INFO L87 Difference]: Start difference. First operand 846 states and 1244 transitions. Second operand 3 states. [2021-01-06 19:30:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:14,513 INFO L93 Difference]: Finished difference Result 1677 states and 2466 transitions. [2021-01-06 19:30:14,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:14,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:14,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:14,519 INFO L225 Difference]: With dead ends: 1677 [2021-01-06 19:30:14,519 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 19:30:14,521 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 19:30:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-01-06 19:30:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1236 transitions. [2021-01-06 19:30:14,576 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1236 transitions. Word has length 85 [2021-01-06 19:30:14,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:14,577 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1236 transitions. [2021-01-06 19:30:14,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:14,577 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1236 transitions. [2021-01-06 19:30:14,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:14,578 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:14,578 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] [2021-01-06 19:30:14,579 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:30:14,579 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:14,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1839938287, now seen corresponding path program 1 times [2021-01-06 19:30:14,584 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:14,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907801468] [2021-01-06 19:30:14,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:14,679 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:30:14,680 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907801468] [2021-01-06 19:30:14,680 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:14,680 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:14,681 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520053629] [2021-01-06 19:30:14,681 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:14,681 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:14,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:14,682 INFO L87 Difference]: Start difference. First operand 846 states and 1236 transitions. Second operand 3 states. [2021-01-06 19:30:14,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:14,789 INFO L93 Difference]: Finished difference Result 1676 states and 2449 transitions. [2021-01-06 19:30:14,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:14,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:14,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:14,794 INFO L225 Difference]: With dead ends: 1676 [2021-01-06 19:30:14,794 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 19:30:14,797 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:30:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 19:30:14,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-01-06 19:30:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1216 transitions. [2021-01-06 19:30:14,846 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1216 transitions. Word has length 85 [2021-01-06 19:30:14,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:14,862 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1216 transitions. [2021-01-06 19:30:14,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1216 transitions. [2021-01-06 19:30:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:14,863 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:14,864 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:14,864 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:30:14,864 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:14,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:14,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1688218612, now seen corresponding path program 1 times [2021-01-06 19:30:14,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:14,866 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164772323] [2021-01-06 19:30:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:14,978 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:30:14,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164772323] [2021-01-06 19:30:14,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:14,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:14,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765680615] [2021-01-06 19:30:14,982 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:14,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:14,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:14,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:14,983 INFO L87 Difference]: Start difference. First operand 846 states and 1216 transitions. Second operand 3 states. [2021-01-06 19:30:15,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:15,103 INFO L93 Difference]: Finished difference Result 1675 states and 2408 transitions. [2021-01-06 19:30:15,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:15,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:15,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:15,109 INFO L225 Difference]: With dead ends: 1675 [2021-01-06 19:30:15,109 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 19:30:15,111 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:30:15,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 19:30:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-01-06 19:30:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:15,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1196 transitions. [2021-01-06 19:30:15,162 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1196 transitions. Word has length 85 [2021-01-06 19:30:15,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:15,163 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1196 transitions. [2021-01-06 19:30:15,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:15,163 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1196 transitions. [2021-01-06 19:30:15,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:15,164 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:15,164 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] [2021-01-06 19:30:15,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:30:15,164 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:15,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:15,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1961990068, now seen corresponding path program 1 times [2021-01-06 19:30:15,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:15,167 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047113579] [2021-01-06 19:30:15,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:15,243 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:30:15,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047113579] [2021-01-06 19:30:15,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:15,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:15,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961661638] [2021-01-06 19:30:15,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:15,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:15,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:15,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:15,256 INFO L87 Difference]: Start difference. First operand 846 states and 1196 transitions. Second operand 3 states. [2021-01-06 19:30:15,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:15,359 INFO L93 Difference]: Finished difference Result 1674 states and 2367 transitions. [2021-01-06 19:30:15,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:15,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:15,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:15,364 INFO L225 Difference]: With dead ends: 1674 [2021-01-06 19:30:15,365 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 19:30:15,366 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:30:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 19:30:15,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-01-06 19:30:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1176 transitions. [2021-01-06 19:30:15,411 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1176 transitions. Word has length 85 [2021-01-06 19:30:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:15,411 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1176 transitions. [2021-01-06 19:30:15,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1176 transitions. [2021-01-06 19:30:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:15,412 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:15,413 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] [2021-01-06 19:30:15,413 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:30:15,413 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:15,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1893352853, now seen corresponding path program 1 times [2021-01-06 19:30:15,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:15,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089166517] [2021-01-06 19:30:15,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:15,459 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:30:15,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089166517] [2021-01-06 19:30:15,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:15,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:15,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547944952] [2021-01-06 19:30:15,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:15,461 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:15,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:15,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:15,462 INFO L87 Difference]: Start difference. First operand 846 states and 1176 transitions. Second operand 3 states. [2021-01-06 19:30:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:15,583 INFO L93 Difference]: Finished difference Result 1673 states and 2326 transitions. [2021-01-06 19:30:15,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:15,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:15,594 INFO L225 Difference]: With dead ends: 1673 [2021-01-06 19:30:15,594 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 19:30:15,596 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:30:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 19:30:15,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-01-06 19:30:15,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:15,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1156 transitions. [2021-01-06 19:30:15,642 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1156 transitions. Word has length 85 [2021-01-06 19:30:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:15,643 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1156 transitions. [2021-01-06 19:30:15,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1156 transitions. [2021-01-06 19:30:15,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:15,645 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:15,645 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] [2021-01-06 19:30:15,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:30:15,645 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:15,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:15,646 INFO L82 PathProgramCache]: Analyzing trace with hash 367812267, now seen corresponding path program 1 times [2021-01-06 19:30:15,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:15,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087521574] [2021-01-06 19:30:15,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:15,699 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:30:15,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087521574] [2021-01-06 19:30:15,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:15,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:15,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708843275] [2021-01-06 19:30:15,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:15,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:15,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:15,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:15,703 INFO L87 Difference]: Start difference. First operand 846 states and 1156 transitions. Second operand 3 states. [2021-01-06 19:30:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:15,789 INFO L93 Difference]: Finished difference Result 1672 states and 2285 transitions. [2021-01-06 19:30:15,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:15,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:15,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:15,796 INFO L225 Difference]: With dead ends: 1672 [2021-01-06 19:30:15,797 INFO L226 Difference]: Without dead ends: 846 [2021-01-06 19:30:15,799 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:30:15,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2021-01-06 19:30:15,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 846. [2021-01-06 19:30:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2021-01-06 19:30:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1136 transitions. [2021-01-06 19:30:15,846 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1136 transitions. Word has length 85 [2021-01-06 19:30:15,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:15,849 INFO L481 AbstractCegarLoop]: Abstraction has 846 states and 1136 transitions. [2021-01-06 19:30:15,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:15,849 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1136 transitions. [2021-01-06 19:30:15,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:15,850 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:15,850 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] [2021-01-06 19:30:15,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:30:15,850 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:15,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:15,851 INFO L82 PathProgramCache]: Analyzing trace with hash 613218122, now seen corresponding path program 1 times [2021-01-06 19:30:15,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:15,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186120566] [2021-01-06 19:30:15,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:15,907 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:30:15,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186120566] [2021-01-06 19:30:15,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:15,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:15,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463401285] [2021-01-06 19:30:15,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:15,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:15,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:15,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:15,910 INFO L87 Difference]: Start difference. First operand 846 states and 1136 transitions. Second operand 5 states. [2021-01-06 19:30:16,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:16,229 INFO L93 Difference]: Finished difference Result 2644 states and 3569 transitions. [2021-01-06 19:30:16,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:16,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2021-01-06 19:30:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:16,239 INFO L225 Difference]: With dead ends: 2644 [2021-01-06 19:30:16,239 INFO L226 Difference]: Without dead ends: 1825 [2021-01-06 19:30:16,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:30:16,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2021-01-06 19:30:16,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 867. [2021-01-06 19:30:16,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 867 states. [2021-01-06 19:30:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 867 states to 867 states and 1150 transitions. [2021-01-06 19:30:16,311 INFO L78 Accepts]: Start accepts. Automaton has 867 states and 1150 transitions. Word has length 85 [2021-01-06 19:30:16,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:16,311 INFO L481 AbstractCegarLoop]: Abstraction has 867 states and 1150 transitions. [2021-01-06 19:30:16,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 867 states and 1150 transitions. [2021-01-06 19:30:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:16,312 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:16,312 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] [2021-01-06 19:30:16,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:30:16,313 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:16,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 815042056, now seen corresponding path program 1 times [2021-01-06 19:30:16,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:16,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014384255] [2021-01-06 19:30:16,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:16,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:16,377 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:30:16,377 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014384255] [2021-01-06 19:30:16,377 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:16,378 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:16,378 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442456914] [2021-01-06 19:30:16,378 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:16,378 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:16,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:16,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:16,380 INFO L87 Difference]: Start difference. First operand 867 states and 1150 transitions. Second operand 5 states. [2021-01-06 19:30:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:16,590 INFO L93 Difference]: Finished difference Result 2196 states and 2939 transitions. [2021-01-06 19:30:16,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:16,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2021-01-06 19:30:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:16,598 INFO L225 Difference]: With dead ends: 2196 [2021-01-06 19:30:16,599 INFO L226 Difference]: Without dead ends: 1363 [2021-01-06 19:30:16,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:30:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2021-01-06 19:30:16,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 873. [2021-01-06 19:30:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2021-01-06 19:30:16,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1144 transitions. [2021-01-06 19:30:16,692 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1144 transitions. Word has length 85 [2021-01-06 19:30:16,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:16,693 INFO L481 AbstractCegarLoop]: Abstraction has 873 states and 1144 transitions. [2021-01-06 19:30:16,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:16,693 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1144 transitions. [2021-01-06 19:30:16,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:16,694 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:16,694 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] [2021-01-06 19:30:16,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:30:16,695 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:16,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1691061062, now seen corresponding path program 1 times [2021-01-06 19:30:16,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:16,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768497945] [2021-01-06 19:30:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:16,740 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:30:16,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768497945] [2021-01-06 19:30:16,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:16,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:16,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345315911] [2021-01-06 19:30:16,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:16,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:16,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:16,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:16,743 INFO L87 Difference]: Start difference. First operand 873 states and 1144 transitions. Second operand 5 states. [2021-01-06 19:30:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:16,965 INFO L93 Difference]: Finished difference Result 2312 states and 3054 transitions. [2021-01-06 19:30:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:16,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2021-01-06 19:30:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:16,974 INFO L225 Difference]: With dead ends: 2312 [2021-01-06 19:30:16,974 INFO L226 Difference]: Without dead ends: 1487 [2021-01-06 19:30:16,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:30:16,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2021-01-06 19:30:17,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 879. [2021-01-06 19:30:17,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 879 states. [2021-01-06 19:30:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1138 transitions. [2021-01-06 19:30:17,074 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1138 transitions. Word has length 85 [2021-01-06 19:30:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:17,076 INFO L481 AbstractCegarLoop]: Abstraction has 879 states and 1138 transitions. [2021-01-06 19:30:17,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1138 transitions. [2021-01-06 19:30:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:17,077 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:17,077 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] [2021-01-06 19:30:17,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:30:17,078 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:17,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1939207556, now seen corresponding path program 1 times [2021-01-06 19:30:17,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:17,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845947730] [2021-01-06 19:30:17,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:17,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:17,133 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845947730] [2021-01-06 19:30:17,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:17,133 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:17,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830215001] [2021-01-06 19:30:17,134 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:17,134 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:17,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:17,135 INFO L87 Difference]: Start difference. First operand 879 states and 1138 transitions. Second operand 5 states. [2021-01-06 19:30:17,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:17,394 INFO L93 Difference]: Finished difference Result 2379 states and 3104 transitions. [2021-01-06 19:30:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:17,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2021-01-06 19:30:17,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:17,402 INFO L225 Difference]: With dead ends: 2379 [2021-01-06 19:30:17,402 INFO L226 Difference]: Without dead ends: 1555 [2021-01-06 19:30:17,406 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:30:17,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2021-01-06 19:30:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 885. [2021-01-06 19:30:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2021-01-06 19:30:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1132 transitions. [2021-01-06 19:30:17,488 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1132 transitions. Word has length 85 [2021-01-06 19:30:17,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:17,488 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 1132 transitions. [2021-01-06 19:30:17,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1132 transitions. [2021-01-06 19:30:17,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:17,489 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:17,490 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] [2021-01-06 19:30:17,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:30:17,490 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:17,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1544840770, now seen corresponding path program 1 times [2021-01-06 19:30:17,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:17,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136998628] [2021-01-06 19:30:17,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:17,544 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:30:17,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136998628] [2021-01-06 19:30:17,547 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:17,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:30:17,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664679639] [2021-01-06 19:30:17,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:30:17,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:30:17,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:17,549 INFO L87 Difference]: Start difference. First operand 885 states and 1132 transitions. Second operand 5 states. [2021-01-06 19:30:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:17,806 INFO L93 Difference]: Finished difference Result 2446 states and 3154 transitions. [2021-01-06 19:30:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:30:17,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2021-01-06 19:30:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:17,815 INFO L225 Difference]: With dead ends: 2446 [2021-01-06 19:30:17,816 INFO L226 Difference]: Without dead ends: 1623 [2021-01-06 19:30:17,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:30:17,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2021-01-06 19:30:17,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 891. [2021-01-06 19:30:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2021-01-06 19:30:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1126 transitions. [2021-01-06 19:30:17,901 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1126 transitions. Word has length 85 [2021-01-06 19:30:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:17,901 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1126 transitions. [2021-01-06 19:30:17,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:30:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1126 transitions. [2021-01-06 19:30:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:17,902 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:17,902 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] [2021-01-06 19:30:17,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:30:17,903 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1567473024, now seen corresponding path program 1 times [2021-01-06 19:30:17,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:17,904 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855210113] [2021-01-06 19:30:17,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:17,976 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:30:17,976 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855210113] [2021-01-06 19:30:17,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:17,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:17,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440366112] [2021-01-06 19:30:17,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:17,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:17,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:17,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:17,979 INFO L87 Difference]: Start difference. First operand 891 states and 1126 transitions. Second operand 3 states. [2021-01-06 19:30:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:18,064 INFO L93 Difference]: Finished difference Result 1769 states and 2233 transitions. [2021-01-06 19:30:18,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:18,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:18,069 INFO L225 Difference]: With dead ends: 1769 [2021-01-06 19:30:18,070 INFO L226 Difference]: Without dead ends: 891 [2021-01-06 19:30:18,074 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:30:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 891 states. [2021-01-06 19:30:18,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 891 to 891. [2021-01-06 19:30:18,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 891 states. [2021-01-06 19:30:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1118 transitions. [2021-01-06 19:30:18,177 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1118 transitions. Word has length 85 [2021-01-06 19:30:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:18,177 INFO L481 AbstractCegarLoop]: Abstraction has 891 states and 1118 transitions. [2021-01-06 19:30:18,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1118 transitions. [2021-01-06 19:30:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-01-06 19:30:18,179 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:18,179 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] [2021-01-06 19:30:18,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:30:18,179 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1629512638, now seen corresponding path program 1 times [2021-01-06 19:30:18,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:18,180 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330511262] [2021-01-06 19:30:18,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:18,225 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:30:18,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330511262] [2021-01-06 19:30:18,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:18,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:18,226 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331172005] [2021-01-06 19:30:18,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:18,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:18,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:18,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:18,229 INFO L87 Difference]: Start difference. First operand 891 states and 1118 transitions. Second operand 3 states. [2021-01-06 19:30:18,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:18,412 INFO L93 Difference]: Finished difference Result 2500 states and 3120 transitions. [2021-01-06 19:30:18,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:18,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2021-01-06 19:30:18,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:18,421 INFO L225 Difference]: With dead ends: 2500 [2021-01-06 19:30:18,421 INFO L226 Difference]: Without dead ends: 1682 [2021-01-06 19:30:18,423 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:30:18,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1682 states. [2021-01-06 19:30:18,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1682 to 1639. [2021-01-06 19:30:18,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1639 states. [2021-01-06 19:30:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2029 transitions. [2021-01-06 19:30:18,602 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2029 transitions. Word has length 85 [2021-01-06 19:30:18,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:18,603 INFO L481 AbstractCegarLoop]: Abstraction has 1639 states and 2029 transitions. [2021-01-06 19:30:18,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:18,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2029 transitions. [2021-01-06 19:30:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-01-06 19:30:18,604 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:18,604 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] [2021-01-06 19:30:18,604 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:30:18,605 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1820000063, now seen corresponding path program 1 times [2021-01-06 19:30:18,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:18,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693992990] [2021-01-06 19:30:18,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:18,653 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:30:18,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693992990] [2021-01-06 19:30:18,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:18,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:18,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194837115] [2021-01-06 19:30:18,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:18,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:18,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:18,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:18,656 INFO L87 Difference]: Start difference. First operand 1639 states and 2029 transitions. Second operand 3 states. [2021-01-06 19:30:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:18,982 INFO L93 Difference]: Finished difference Result 4411 states and 5463 transitions. [2021-01-06 19:30:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:18,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2021-01-06 19:30:18,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:18,997 INFO L225 Difference]: With dead ends: 4411 [2021-01-06 19:30:18,998 INFO L226 Difference]: Without dead ends: 2914 [2021-01-06 19:30:19,001 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:30:19,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2021-01-06 19:30:19,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2912. [2021-01-06 19:30:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2912 states. [2021-01-06 19:30:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 3588 transitions. [2021-01-06 19:30:19,316 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 3588 transitions. Word has length 86 [2021-01-06 19:30:19,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:19,316 INFO L481 AbstractCegarLoop]: Abstraction has 2912 states and 3588 transitions. [2021-01-06 19:30:19,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:19,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 3588 transitions. [2021-01-06 19:30:19,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:30:19,318 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:19,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:19,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:30:19,319 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash 362538096, now seen corresponding path program 1 times [2021-01-06 19:30:19,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:19,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120963873] [2021-01-06 19:30:19,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:19,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:30:19,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120963873] [2021-01-06 19:30:19,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:19,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:19,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927721251] [2021-01-06 19:30:19,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:19,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:19,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:19,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:19,367 INFO L87 Difference]: Start difference. First operand 2912 states and 3588 transitions. Second operand 3 states. [2021-01-06 19:30:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:19,865 INFO L93 Difference]: Finished difference Result 8364 states and 10284 transitions. [2021-01-06 19:30:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:19,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 19:30:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:19,895 INFO L225 Difference]: With dead ends: 8364 [2021-01-06 19:30:19,895 INFO L226 Difference]: Without dead ends: 5594 [2021-01-06 19:30:19,902 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:30:19,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5594 states. [2021-01-06 19:30:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5594 to 5376. [2021-01-06 19:30:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5376 states. [2021-01-06 19:30:20,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5376 states to 5376 states and 6590 transitions. [2021-01-06 19:30:20,452 INFO L78 Accepts]: Start accepts. Automaton has 5376 states and 6590 transitions. Word has length 87 [2021-01-06 19:30:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:20,453 INFO L481 AbstractCegarLoop]: Abstraction has 5376 states and 6590 transitions. [2021-01-06 19:30:20,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 5376 states and 6590 transitions. [2021-01-06 19:30:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-01-06 19:30:20,455 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:20,455 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] [2021-01-06 19:30:20,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:30:20,455 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:20,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:20,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1929296046, now seen corresponding path program 1 times [2021-01-06 19:30:20,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:20,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087642572] [2021-01-06 19:30:20,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:20,486 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:30:20,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087642572] [2021-01-06 19:30:20,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:20,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:20,489 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518548363] [2021-01-06 19:30:20,489 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:20,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:20,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:20,490 INFO L87 Difference]: Start difference. First operand 5376 states and 6590 transitions. Second operand 3 states. [2021-01-06 19:30:21,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:21,111 INFO L93 Difference]: Finished difference Result 10540 states and 12931 transitions. [2021-01-06 19:30:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:21,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2021-01-06 19:30:21,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:21,149 INFO L225 Difference]: With dead ends: 10540 [2021-01-06 19:30:21,150 INFO L226 Difference]: Without dead ends: 5242 [2021-01-06 19:30:21,162 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:30:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2021-01-06 19:30:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 5242. [2021-01-06 19:30:21,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5242 states. [2021-01-06 19:30:21,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 6434 transitions. [2021-01-06 19:30:21,766 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 6434 transitions. Word has length 87 [2021-01-06 19:30:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:21,767 INFO L481 AbstractCegarLoop]: Abstraction has 5242 states and 6434 transitions. [2021-01-06 19:30:21,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:21,767 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 6434 transitions. [2021-01-06 19:30:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 19:30:21,768 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:21,769 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] [2021-01-06 19:30:21,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:30:21,769 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:21,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1694989306, now seen corresponding path program 1 times [2021-01-06 19:30:21,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:21,770 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148083141] [2021-01-06 19:30:21,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:21,817 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:30:21,818 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148083141] [2021-01-06 19:30:21,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:21,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:21,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195411644] [2021-01-06 19:30:21,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:21,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:21,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:21,824 INFO L87 Difference]: Start difference. First operand 5242 states and 6434 transitions. Second operand 3 states. [2021-01-06 19:30:22,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:22,671 INFO L93 Difference]: Finished difference Result 14722 states and 18054 transitions. [2021-01-06 19:30:22,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:22,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 19:30:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:22,740 INFO L225 Difference]: With dead ends: 14722 [2021-01-06 19:30:22,740 INFO L226 Difference]: Without dead ends: 9622 [2021-01-06 19:30:22,751 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:30:22,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9622 states. [2021-01-06 19:30:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9622 to 9620. [2021-01-06 19:30:23,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9620 states. [2021-01-06 19:30:23,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9620 states to 9620 states and 11760 transitions. [2021-01-06 19:30:23,440 INFO L78 Accepts]: Start accepts. Automaton has 9620 states and 11760 transitions. Word has length 88 [2021-01-06 19:30:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:23,441 INFO L481 AbstractCegarLoop]: Abstraction has 9620 states and 11760 transitions. [2021-01-06 19:30:23,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 9620 states and 11760 transitions. [2021-01-06 19:30:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-01-06 19:30:23,444 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:23,444 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] [2021-01-06 19:30:23,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:30:23,444 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:23,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:23,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1033220040, now seen corresponding path program 1 times [2021-01-06 19:30:23,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:23,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059364315] [2021-01-06 19:30:23,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:23,476 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:30:23,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059364315] [2021-01-06 19:30:23,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:23,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:23,477 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551655707] [2021-01-06 19:30:23,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:23,478 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:23,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:23,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:23,478 INFO L87 Difference]: Start difference. First operand 9620 states and 11760 transitions. Second operand 3 states. [2021-01-06 19:30:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:24,432 INFO L93 Difference]: Finished difference Result 18966 states and 23207 transitions. [2021-01-06 19:30:24,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:24,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2021-01-06 19:30:24,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:24,453 INFO L225 Difference]: With dead ends: 18966 [2021-01-06 19:30:24,453 INFO L226 Difference]: Without dead ends: 9488 [2021-01-06 19:30:24,467 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:30:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9488 states. [2021-01-06 19:30:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9488 to 9488. [2021-01-06 19:30:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9488 states. [2021-01-06 19:30:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9488 states to 9488 states and 11608 transitions. [2021-01-06 19:30:25,402 INFO L78 Accepts]: Start accepts. Automaton has 9488 states and 11608 transitions. Word has length 88 [2021-01-06 19:30:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:25,402 INFO L481 AbstractCegarLoop]: Abstraction has 9488 states and 11608 transitions. [2021-01-06 19:30:25,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 9488 states and 11608 transitions. [2021-01-06 19:30:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 19:30:25,404 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:25,405 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] [2021-01-06 19:30:25,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:30:25,405 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:25,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1773387851, now seen corresponding path program 1 times [2021-01-06 19:30:25,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:25,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472012942] [2021-01-06 19:30:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:25,448 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:30:25,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472012942] [2021-01-06 19:30:25,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:25,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:25,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514031984] [2021-01-06 19:30:25,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:25,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:25,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:25,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:25,450 INFO L87 Difference]: Start difference. First operand 9488 states and 11608 transitions. Second operand 3 states. [2021-01-06 19:30:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:26,571 INFO L93 Difference]: Finished difference Result 26624 states and 32540 transitions. [2021-01-06 19:30:26,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:26,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 19:30:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:26,609 INFO L225 Difference]: With dead ends: 26624 [2021-01-06 19:30:26,609 INFO L226 Difference]: Without dead ends: 17278 [2021-01-06 19:30:26,625 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:30:26,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17278 states. [2021-01-06 19:30:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17278 to 17276. [2021-01-06 19:30:27,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17276 states. [2021-01-06 19:30:27,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17276 states to 17276 states and 21054 transitions. [2021-01-06 19:30:27,736 INFO L78 Accepts]: Start accepts. Automaton has 17276 states and 21054 transitions. Word has length 89 [2021-01-06 19:30:27,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:27,737 INFO L481 AbstractCegarLoop]: Abstraction has 17276 states and 21054 transitions. [2021-01-06 19:30:27,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:27,737 INFO L276 IsEmpty]: Start isEmpty. Operand 17276 states and 21054 transitions. [2021-01-06 19:30:27,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-01-06 19:30:27,739 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:27,740 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] [2021-01-06 19:30:27,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:30:27,740 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:27,740 INFO L82 PathProgramCache]: Analyzing trace with hash -206629901, now seen corresponding path program 1 times [2021-01-06 19:30:27,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:27,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572045409] [2021-01-06 19:30:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:27,764 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:30:27,765 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572045409] [2021-01-06 19:30:27,765 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:27,765 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:27,765 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593514949] [2021-01-06 19:30:27,766 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:27,766 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:27,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:27,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:27,767 INFO L87 Difference]: Start difference. First operand 17276 states and 21054 transitions. Second operand 3 states. [2021-01-06 19:30:29,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:29,033 INFO L93 Difference]: Finished difference Result 34280 states and 41801 transitions. [2021-01-06 19:30:29,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:29,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2021-01-06 19:30:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:29,076 INFO L225 Difference]: With dead ends: 34280 [2021-01-06 19:30:29,076 INFO L226 Difference]: Without dead ends: 17146 [2021-01-06 19:30:29,103 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:30:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17146 states. [2021-01-06 19:30:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17146 to 17146. [2021-01-06 19:30:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17146 states. [2021-01-06 19:30:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17146 states to 17146 states and 20906 transitions. [2021-01-06 19:30:30,509 INFO L78 Accepts]: Start accepts. Automaton has 17146 states and 20906 transitions. Word has length 89 [2021-01-06 19:30:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:30,510 INFO L481 AbstractCegarLoop]: Abstraction has 17146 states and 20906 transitions. [2021-01-06 19:30:30,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 17146 states and 20906 transitions. [2021-01-06 19:30:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2021-01-06 19:30:30,512 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:30,512 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] [2021-01-06 19:30:30,512 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:30:30,512 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash -38095691, now seen corresponding path program 1 times [2021-01-06 19:30:30,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:30,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470341391] [2021-01-06 19:30:30,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:30,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470341391] [2021-01-06 19:30:30,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:30,563 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:30,563 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969850962] [2021-01-06 19:30:30,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:30,564 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:30,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:30,565 INFO L87 Difference]: Start difference. First operand 17146 states and 20906 transitions. Second operand 3 states. [2021-01-06 19:30:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:32,625 INFO L93 Difference]: Finished difference Result 50766 states and 61885 transitions. [2021-01-06 19:30:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:32,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2021-01-06 19:30:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:32,676 INFO L225 Difference]: With dead ends: 50766 [2021-01-06 19:30:32,676 INFO L226 Difference]: Without dead ends: 33730 [2021-01-06 19:30:32,698 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:30:32,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33730 states. [2021-01-06 19:30:35,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33730 to 33602. [2021-01-06 19:30:35,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33602 states. [2021-01-06 19:30:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33602 states to 33602 states and 40656 transitions. [2021-01-06 19:30:35,316 INFO L78 Accepts]: Start accepts. Automaton has 33602 states and 40656 transitions. Word has length 90 [2021-01-06 19:30:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:35,317 INFO L481 AbstractCegarLoop]: Abstraction has 33602 states and 40656 transitions. [2021-01-06 19:30:35,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:35,317 INFO L276 IsEmpty]: Start isEmpty. Operand 33602 states and 40656 transitions. [2021-01-06 19:30:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-01-06 19:30:35,327 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:35,328 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:35,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:30:35,328 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:35,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1515193549, now seen corresponding path program 1 times [2021-01-06 19:30:35,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:35,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407680539] [2021-01-06 19:30:35,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:35,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407680539] [2021-01-06 19:30:35,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:35,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:30:35,405 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756024857] [2021-01-06 19:30:35,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:35,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:35,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:35,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:35,407 INFO L87 Difference]: Start difference. First operand 33602 states and 40656 transitions. Second operand 4 states. [2021-01-06 19:30:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:39,962 INFO L93 Difference]: Finished difference Result 100202 states and 121091 transitions. [2021-01-06 19:30:39,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:30:39,963 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2021-01-06 19:30:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:40,028 INFO L225 Difference]: With dead ends: 100202 [2021-01-06 19:30:40,029 INFO L226 Difference]: Without dead ends: 50284 [2021-01-06 19:30:40,071 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:40,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50284 states. [2021-01-06 19:30:43,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50284 to 50284. [2021-01-06 19:30:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50284 states. [2021-01-06 19:30:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50284 states to 50284 states and 60748 transitions. [2021-01-06 19:30:43,711 INFO L78 Accepts]: Start accepts. Automaton has 50284 states and 60748 transitions. Word has length 111 [2021-01-06 19:30:43,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:43,711 INFO L481 AbstractCegarLoop]: Abstraction has 50284 states and 60748 transitions. [2021-01-06 19:30:43,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:43,711 INFO L276 IsEmpty]: Start isEmpty. Operand 50284 states and 60748 transitions. [2021-01-06 19:30:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-01-06 19:30:43,740 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:43,740 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:43,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:30:43,740 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1449414187, now seen corresponding path program 1 times [2021-01-06 19:30:43,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:43,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592612034] [2021-01-06 19:30:43,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-01-06 19:30:43,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592612034] [2021-01-06 19:30:43,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:43,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:43,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004149824] [2021-01-06 19:30:43,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:43,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:43,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:43,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:43,827 INFO L87 Difference]: Start difference. First operand 50284 states and 60748 transitions. Second operand 3 states. [2021-01-06 19:30:48,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:48,204 INFO L93 Difference]: Finished difference Result 115482 states and 139409 transitions. [2021-01-06 19:30:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:48,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2021-01-06 19:30:48,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:48,293 INFO L225 Difference]: With dead ends: 115482 [2021-01-06 19:30:48,293 INFO L226 Difference]: Without dead ends: 65294 [2021-01-06 19:30:48,332 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:30:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65294 states. [2021-01-06 19:30:52,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65294 to 65102. [2021-01-06 19:30:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65102 states. [2021-01-06 19:30:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65102 states to 65102 states and 78288 transitions. [2021-01-06 19:30:52,751 INFO L78 Accepts]: Start accepts. Automaton has 65102 states and 78288 transitions. Word has length 152 [2021-01-06 19:30:52,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:52,752 INFO L481 AbstractCegarLoop]: Abstraction has 65102 states and 78288 transitions. [2021-01-06 19:30:52,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:52,752 INFO L276 IsEmpty]: Start isEmpty. Operand 65102 states and 78288 transitions. [2021-01-06 19:30:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2021-01-06 19:30:52,775 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:52,776 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:52,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:30:52,776 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:52,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:52,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1391161611, now seen corresponding path program 1 times [2021-01-06 19:30:52,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:52,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665666633] [2021-01-06 19:30:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:52,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665666633] [2021-01-06 19:30:52,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:52,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:30:52,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409742929] [2021-01-06 19:30:52,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:52,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:52,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:52,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:52,840 INFO L87 Difference]: Start difference. First operand 65102 states and 78288 transitions. Second operand 4 states. [2021-01-06 19:30:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:57,117 INFO L93 Difference]: Finished difference Result 115248 states and 138884 transitions. [2021-01-06 19:30:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:30:57,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2021-01-06 19:30:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:57,197 INFO L225 Difference]: With dead ends: 115248 [2021-01-06 19:30:57,197 INFO L226 Difference]: Without dead ends: 65104 [2021-01-06 19:30:57,228 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:57,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65104 states. [2021-01-06 19:31:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65104 to 65102. [2021-01-06 19:31:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65102 states. [2021-01-06 19:31:01,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65102 states to 65102 states and 78174 transitions. [2021-01-06 19:31:01,555 INFO L78 Accepts]: Start accepts. Automaton has 65102 states and 78174 transitions. Word has length 155 [2021-01-06 19:31:01,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:01,556 INFO L481 AbstractCegarLoop]: Abstraction has 65102 states and 78174 transitions. [2021-01-06 19:31:01,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:01,556 INFO L276 IsEmpty]: Start isEmpty. Operand 65102 states and 78174 transitions. [2021-01-06 19:31:01,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2021-01-06 19:31:01,589 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:01,590 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:01,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:31:01,590 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:01,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:01,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1351019048, now seen corresponding path program 1 times [2021-01-06 19:31:01,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:01,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830753553] [2021-01-06 19:31:01,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-01-06 19:31:01,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830753553] [2021-01-06 19:31:01,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:01,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:01,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415836291] [2021-01-06 19:31:01,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:01,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:01,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:01,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:01,836 INFO L87 Difference]: Start difference. First operand 65102 states and 78174 transitions. Second operand 3 states. [2021-01-06 19:31:06,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:06,849 INFO L93 Difference]: Finished difference Result 143584 states and 172221 transitions. [2021-01-06 19:31:06,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:06,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2021-01-06 19:31:06,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:06,945 INFO L225 Difference]: With dead ends: 143584 [2021-01-06 19:31:06,945 INFO L226 Difference]: Without dead ends: 78564 [2021-01-06 19:31:06,992 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:31:07,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78564 states. [2021-01-06 19:31:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78564 to 78308. [2021-01-06 19:31:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78308 states. [2021-01-06 19:31:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78308 states to 78308 states and 93626 transitions. [2021-01-06 19:31:12,251 INFO L78 Accepts]: Start accepts. Automaton has 78308 states and 93626 transitions. Word has length 196 [2021-01-06 19:31:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:12,251 INFO L481 AbstractCegarLoop]: Abstraction has 78308 states and 93626 transitions. [2021-01-06 19:31:12,251 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 78308 states and 93626 transitions. [2021-01-06 19:31:12,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:31:12,286 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:12,286 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:12,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:31:12,286 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:12,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:12,287 INFO L82 PathProgramCache]: Analyzing trace with hash -434171315, now seen corresponding path program 1 times [2021-01-06 19:31:12,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:12,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839814169] [2021-01-06 19:31:12,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:12,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:31:12,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839814169] [2021-01-06 19:31:12,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:12,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:31:12,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503189114] [2021-01-06 19:31:12,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:12,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:12,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:12,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:12,365 INFO L87 Difference]: Start difference. First operand 78308 states and 93626 transitions. Second operand 4 states. [2021-01-06 19:31:17,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:17,724 INFO L93 Difference]: Finished difference Result 143274 states and 171652 transitions. [2021-01-06 19:31:17,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:31:17,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2021-01-06 19:31:17,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:17,822 INFO L225 Difference]: With dead ends: 143274 [2021-01-06 19:31:17,822 INFO L226 Difference]: Without dead ends: 78310 [2021-01-06 19:31:17,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78310 states. [2021-01-06 19:31:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78310 to 78308. [2021-01-06 19:31:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78308 states. [2021-01-06 19:31:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78308 states to 78308 states and 93450 transitions. [2021-01-06 19:31:23,187 INFO L78 Accepts]: Start accepts. Automaton has 78308 states and 93450 transitions. Word has length 199 [2021-01-06 19:31:23,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:23,187 INFO L481 AbstractCegarLoop]: Abstraction has 78308 states and 93450 transitions. [2021-01-06 19:31:23,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 78308 states and 93450 transitions. [2021-01-06 19:31:23,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2021-01-06 19:31:23,228 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:23,228 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:23,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:31:23,229 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:23,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:23,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1439026059, now seen corresponding path program 1 times [2021-01-06 19:31:23,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:23,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888628098] [2021-01-06 19:31:23,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-01-06 19:31:23,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888628098] [2021-01-06 19:31:23,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:23,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:23,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109246933] [2021-01-06 19:31:23,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:23,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:23,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:23,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:23,326 INFO L87 Difference]: Start difference. First operand 78308 states and 93450 transitions. Second operand 3 states. [2021-01-06 19:31:29,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:29,421 INFO L93 Difference]: Finished difference Result 168578 states and 200903 transitions. [2021-01-06 19:31:29,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:29,421 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2021-01-06 19:31:29,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:29,524 INFO L225 Difference]: With dead ends: 168578 [2021-01-06 19:31:29,525 INFO L226 Difference]: Without dead ends: 90338 [2021-01-06 19:31:29,582 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:31:29,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90338 states. [2021-01-06 19:31:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90338 to 90018. [2021-01-06 19:31:35,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90018 states. [2021-01-06 19:31:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90018 states to 90018 states and 106982 transitions. [2021-01-06 19:31:35,652 INFO L78 Accepts]: Start accepts. Automaton has 90018 states and 106982 transitions. Word has length 240 [2021-01-06 19:31:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:35,653 INFO L481 AbstractCegarLoop]: Abstraction has 90018 states and 106982 transitions. [2021-01-06 19:31:35,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:35,653 INFO L276 IsEmpty]: Start isEmpty. Operand 90018 states and 106982 transitions. [2021-01-06 19:31:35,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2021-01-06 19:31:35,718 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:35,719 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:35,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:31:35,720 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:35,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:35,720 INFO L82 PathProgramCache]: Analyzing trace with hash 549951307, now seen corresponding path program 1 times [2021-01-06 19:31:35,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:35,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719868385] [2021-01-06 19:31:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:35,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:31:35,822 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719868385] [2021-01-06 19:31:35,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:35,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:31:35,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364195015] [2021-01-06 19:31:35,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:35,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:35,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:35,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:35,824 INFO L87 Difference]: Start difference. First operand 90018 states and 106982 transitions. Second operand 4 states. [2021-01-06 19:31:36,095 WARN L197 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-01-06 19:31:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:42,248 INFO L93 Difference]: Finished difference Result 172272 states and 204960 transitions. [2021-01-06 19:31:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:31:42,249 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 243 [2021-01-06 19:31:42,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:42,365 INFO L225 Difference]: With dead ends: 172272 [2021-01-06 19:31:42,365 INFO L226 Difference]: Without dead ends: 94100 [2021-01-06 19:31:42,421 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:42,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94100 states. [2021-01-06 19:31:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94100 to 90018. [2021-01-06 19:31:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90018 states. [2021-01-06 19:31:48,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90018 states to 90018 states and 106702 transitions. [2021-01-06 19:31:48,598 INFO L78 Accepts]: Start accepts. Automaton has 90018 states and 106702 transitions. Word has length 243 [2021-01-06 19:31:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:48,599 INFO L481 AbstractCegarLoop]: Abstraction has 90018 states and 106702 transitions. [2021-01-06 19:31:48,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 90018 states and 106702 transitions. [2021-01-06 19:31:48,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2021-01-06 19:31:48,649 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:48,649 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:48,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:31:48,649 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:48,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:48,650 INFO L82 PathProgramCache]: Analyzing trace with hash -326008208, now seen corresponding path program 1 times [2021-01-06 19:31:48,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:48,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285114328] [2021-01-06 19:31:48,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-01-06 19:31:48,990 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285114328] [2021-01-06 19:31:48,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:48,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:48,991 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564562161] [2021-01-06 19:31:48,991 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:48,991 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:48,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:48,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:48,992 INFO L87 Difference]: Start difference. First operand 90018 states and 106702 transitions. Second operand 3 states. [2021-01-06 19:31:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:57,227 INFO L93 Difference]: Finished difference Result 219950 states and 260576 transitions. [2021-01-06 19:31:57,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:57,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 284 [2021-01-06 19:31:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:57,418 INFO L225 Difference]: With dead ends: 219950 [2021-01-06 19:31:57,419 INFO L226 Difference]: Without dead ends: 129986 [2021-01-06 19:31:57,494 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:31:57,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129986 states.