/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.08.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:30:31,210 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:30:31,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:30:31,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:30:31,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:30:31,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:30:31,275 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:30:31,281 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:30:31,286 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:30:31,294 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:30:31,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:30:31,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:30:31,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:30:31,301 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:30:31,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:30:31,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:30:31,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:30:31,311 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:30:31,319 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:30:31,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:30:31,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:30:31,331 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:30:31,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:30:31,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:30:31,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:30:31,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:30:31,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:30:31,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:30:31,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:30:31,360 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:30:31,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:30:31,361 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:30:31,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:30:31,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:30:31,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:30:31,366 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:30:31,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:30:31,367 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:30:31,367 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:30:31,368 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:30:31,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:30:31,370 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:31,417 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:30:31,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:30:31,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:30:31,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:30:31,423 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:30:31,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:30:31,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:30:31,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:30:31,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:30:31,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:30:31,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:30:31,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:30:31,426 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:30:31,426 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:30:31,426 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:30:31,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:30:31,427 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:30:31,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:30:31,427 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:30:31,427 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:30:31,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:30:31,428 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:30:31,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:30:31,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:30:31,428 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:30:31,428 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:31,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:30:31,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:30:31,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:30:31,895 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:30:31,896 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:30:31,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/transmitter.08.cil.c [2021-01-06 19:30:31,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cebf92343/91bdb055773a4b4db70512efdae30ff9/FLAG41b89e607 [2021-01-06 19:30:32,646 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:30:32,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/transmitter.08.cil.c [2021-01-06 19:30:32,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cebf92343/91bdb055773a4b4db70512efdae30ff9/FLAG41b89e607 [2021-01-06 19:30:32,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/cebf92343/91bdb055773a4b4db70512efdae30ff9 [2021-01-06 19:30:32,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:30:32,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:30:32,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:30:32,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:30:32,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:30:32,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:30:32" (1/1) ... [2021-01-06 19:30:32,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cca4430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:32, skipping insertion in model container [2021-01-06 19:30:32,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:30:32" (1/1) ... [2021-01-06 19:30:32,967 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:30:33,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:30:33,188 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.08.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~10,] [2021-01-06 19:30:33,364 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:30:33,383 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:30:33,400 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.08.cil.c[401,414] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~10,] [2021-01-06 19:30:33,479 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:30:33,515 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:30:33,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:33 WrapperNode [2021-01-06 19:30:33,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:30:33,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:30:33,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:30:33,519 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:30:33,527 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:33" (1/1) ... [2021-01-06 19:30:33,558 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:33" (1/1) ... [2021-01-06 19:30:33,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:30:33,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:30:33,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:30:33,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:30:33,696 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:33" (1/1) ... [2021-01-06 19:30:33,697 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:33" (1/1) ... [2021-01-06 19:30:33,708 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:33" (1/1) ... [2021-01-06 19:30:33,709 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:33" (1/1) ... [2021-01-06 19:30:33,750 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:33" (1/1) ... [2021-01-06 19:30:33,810 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:33" (1/1) ... [2021-01-06 19:30:33,824 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:33" (1/1) ... [2021-01-06 19:30:33,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:30:33,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:30:33,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:30:33,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:30:33,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:33" (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:33,943 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:30:33,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:30:33,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:30:33,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:30:35,892 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:30:35,893 INFO L299 CfgBuilder]: Removed 304 assume(true) statements. [2021-01-06 19:30:35,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:30:35 BoogieIcfgContainer [2021-01-06 19:30:35,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:30:35,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:30:35,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:30:35,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:30:35,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:30:32" (1/3) ... [2021-01-06 19:30:35,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2b7541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:30:35, skipping insertion in model container [2021-01-06 19:30:35,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:30:33" (2/3) ... [2021-01-06 19:30:35,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2b7541 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:30:35, skipping insertion in model container [2021-01-06 19:30:35,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:30:35" (3/3) ... [2021-01-06 19:30:35,905 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.08.cil.c [2021-01-06 19:30:35,912 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:30:35,919 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:30:35,939 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:30:35,973 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:30:35,974 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:30:35,974 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:30:35,974 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:30:35,974 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:30:35,974 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:30:35,974 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:30:35,974 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:30:36,007 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states. [2021-01-06 19:30:36,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:36,023 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:36,024 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:36,025 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:36,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2079068621, now seen corresponding path program 1 times [2021-01-06 19:30:36,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:36,043 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970453628] [2021-01-06 19:30:36,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:36,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:36,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970453628] [2021-01-06 19:30:36,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:36,367 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:36,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342673524] [2021-01-06 19:30:36,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:36,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:36,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:36,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:36,391 INFO L87 Difference]: Start difference. First operand 906 states. Second operand 3 states. [2021-01-06 19:30:36,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:36,539 INFO L93 Difference]: Finished difference Result 1807 states and 2767 transitions. [2021-01-06 19:30:36,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:36,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 19:30:36,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:36,571 INFO L225 Difference]: With dead ends: 1807 [2021-01-06 19:30:36,571 INFO L226 Difference]: Without dead ends: 902 [2021-01-06 19:30:36,581 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:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2021-01-06 19:30:36,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2021-01-06 19:30:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2021-01-06 19:30:36,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1357 transitions. [2021-01-06 19:30:36,745 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1357 transitions. Word has length 121 [2021-01-06 19:30:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:36,745 INFO L481 AbstractCegarLoop]: Abstraction has 902 states and 1357 transitions. [2021-01-06 19:30:36,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1357 transitions. [2021-01-06 19:30:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:36,751 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:36,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:36,752 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:30:36,752 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:36,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:36,753 INFO L82 PathProgramCache]: Analyzing trace with hash -493895989, now seen corresponding path program 1 times [2021-01-06 19:30:36,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:36,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163442460] [2021-01-06 19:30:36,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:36,912 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:36,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163442460] [2021-01-06 19:30:36,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:36,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:36,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570349955] [2021-01-06 19:30:36,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:36,917 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:36,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:36,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:36,918 INFO L87 Difference]: Start difference. First operand 902 states and 1357 transitions. Second operand 4 states. [2021-01-06 19:30:37,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:37,172 INFO L93 Difference]: Finished difference Result 2520 states and 3779 transitions. [2021-01-06 19:30:37,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:37,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:30:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:37,182 INFO L225 Difference]: With dead ends: 2520 [2021-01-06 19:30:37,182 INFO L226 Difference]: Without dead ends: 1631 [2021-01-06 19:30:37,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:37,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2021-01-06 19:30:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1629. [2021-01-06 19:30:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1629 states. [2021-01-06 19:30:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1629 states to 1629 states and 2438 transitions. [2021-01-06 19:30:37,297 INFO L78 Accepts]: Start accepts. Automaton has 1629 states and 2438 transitions. Word has length 121 [2021-01-06 19:30:37,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:37,300 INFO L481 AbstractCegarLoop]: Abstraction has 1629 states and 2438 transitions. [2021-01-06 19:30:37,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:37,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1629 states and 2438 transitions. [2021-01-06 19:30:37,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:37,312 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:37,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:37,313 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:30:37,313 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:37,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:37,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1827905929, now seen corresponding path program 1 times [2021-01-06 19:30:37,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:37,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15612441] [2021-01-06 19:30:37,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:37,481 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:37,482 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15612441] [2021-01-06 19:30:37,482 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:37,483 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:37,483 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872793735] [2021-01-06 19:30:37,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:37,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:37,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:37,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:37,489 INFO L87 Difference]: Start difference. First operand 1629 states and 2438 transitions. Second operand 4 states. [2021-01-06 19:30:37,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:37,748 INFO L93 Difference]: Finished difference Result 4696 states and 7016 transitions. [2021-01-06 19:30:37,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:37,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:30:37,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:37,766 INFO L225 Difference]: With dead ends: 4696 [2021-01-06 19:30:37,766 INFO L226 Difference]: Without dead ends: 3082 [2021-01-06 19:30:37,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:37,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3082 states. [2021-01-06 19:30:37,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3082 to 3080. [2021-01-06 19:30:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3080 states. [2021-01-06 19:30:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 4595 transitions. [2021-01-06 19:30:37,956 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 4595 transitions. Word has length 121 [2021-01-06 19:30:37,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:37,963 INFO L481 AbstractCegarLoop]: Abstraction has 3080 states and 4595 transitions. [2021-01-06 19:30:37,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 4595 transitions. [2021-01-06 19:30:37,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:37,968 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:37,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:37,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:30:37,968 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:37,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash -313954549, now seen corresponding path program 1 times [2021-01-06 19:30:37,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:37,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831946705] [2021-01-06 19:30:37,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:38,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:38,107 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:38,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831946705] [2021-01-06 19:30:38,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:38,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:38,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043260248] [2021-01-06 19:30:38,110 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:38,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:38,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:38,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:38,112 INFO L87 Difference]: Start difference. First operand 3080 states and 4595 transitions. Second operand 4 states. [2021-01-06 19:30:38,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:38,495 INFO L93 Difference]: Finished difference Result 9043 states and 13477 transitions. [2021-01-06 19:30:38,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:38,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:30:38,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:38,526 INFO L225 Difference]: With dead ends: 9043 [2021-01-06 19:30:38,527 INFO L226 Difference]: Without dead ends: 5979 [2021-01-06 19:30:38,533 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5979 states. [2021-01-06 19:30:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5979 to 5977. [2021-01-06 19:30:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5977 states. [2021-01-06 19:30:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 8896 transitions. [2021-01-06 19:30:38,828 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 8896 transitions. Word has length 121 [2021-01-06 19:30:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:38,828 INFO L481 AbstractCegarLoop]: Abstraction has 5977 states and 8896 transitions. [2021-01-06 19:30:38,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 8896 transitions. [2021-01-06 19:30:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:38,834 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:38,835 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:38,835 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:30:38,835 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:38,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:38,836 INFO L82 PathProgramCache]: Analyzing trace with hash -937236151, now seen corresponding path program 1 times [2021-01-06 19:30:38,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:38,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555036145] [2021-01-06 19:30:38,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:38,945 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:38,945 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555036145] [2021-01-06 19:30:38,945 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:38,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:38,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839427240] [2021-01-06 19:30:38,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:38,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:38,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:38,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:38,949 INFO L87 Difference]: Start difference. First operand 5977 states and 8896 transitions. Second operand 3 states. [2021-01-06 19:30:39,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:39,260 INFO L93 Difference]: Finished difference Result 11937 states and 17766 transitions. [2021-01-06 19:30:39,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:39,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 19:30:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:39,290 INFO L225 Difference]: With dead ends: 11937 [2021-01-06 19:30:39,290 INFO L226 Difference]: Without dead ends: 5977 [2021-01-06 19:30:39,300 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:39,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2021-01-06 19:30:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 5977. [2021-01-06 19:30:39,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5977 states. [2021-01-06 19:30:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 8870 transitions. [2021-01-06 19:30:39,624 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 8870 transitions. Word has length 121 [2021-01-06 19:30:39,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:39,625 INFO L481 AbstractCegarLoop]: Abstraction has 5977 states and 8870 transitions. [2021-01-06 19:30:39,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:39,625 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 8870 transitions. [2021-01-06 19:30:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:39,629 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:39,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:39,630 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:30:39,630 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:39,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash -818794677, now seen corresponding path program 1 times [2021-01-06 19:30:39,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:39,631 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952609528] [2021-01-06 19:30:39,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:39,690 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:39,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952609528] [2021-01-06 19:30:39,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:39,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:39,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956596986] [2021-01-06 19:30:39,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:39,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:39,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:39,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:39,692 INFO L87 Difference]: Start difference. First operand 5977 states and 8870 transitions. Second operand 3 states. [2021-01-06 19:30:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:39,958 INFO L93 Difference]: Finished difference Result 11936 states and 17713 transitions. [2021-01-06 19:30:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:39,959 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 19:30:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:39,988 INFO L225 Difference]: With dead ends: 11936 [2021-01-06 19:30:39,988 INFO L226 Difference]: Without dead ends: 5977 [2021-01-06 19:30:39,998 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:40,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5977 states. [2021-01-06 19:30:40,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5977 to 5977. [2021-01-06 19:30:40,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5977 states. [2021-01-06 19:30:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5977 states to 5977 states and 8844 transitions. [2021-01-06 19:30:40,383 INFO L78 Accepts]: Start accepts. Automaton has 5977 states and 8844 transitions. Word has length 121 [2021-01-06 19:30:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:40,383 INFO L481 AbstractCegarLoop]: Abstraction has 5977 states and 8844 transitions. [2021-01-06 19:30:40,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5977 states and 8844 transitions. [2021-01-06 19:30:40,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:40,388 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:40,388 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:40,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:30:40,389 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:40,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:40,395 INFO L82 PathProgramCache]: Analyzing trace with hash 498112779, now seen corresponding path program 1 times [2021-01-06 19:30:40,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:40,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124798013] [2021-01-06 19:30:40,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:40,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:40,473 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:40,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124798013] [2021-01-06 19:30:40,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:40,474 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:40,475 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983007669] [2021-01-06 19:30:40,475 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:40,475 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:40,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:40,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:40,476 INFO L87 Difference]: Start difference. First operand 5977 states and 8844 transitions. Second operand 4 states. [2021-01-06 19:30:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:41,239 INFO L93 Difference]: Finished difference Result 17708 states and 26194 transitions. [2021-01-06 19:30:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:41,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:30:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:41,292 INFO L225 Difference]: With dead ends: 17708 [2021-01-06 19:30:41,292 INFO L226 Difference]: Without dead ends: 11750 [2021-01-06 19:30:41,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11750 states. [2021-01-06 19:30:41,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11750 to 11748. [2021-01-06 19:30:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11748 states. [2021-01-06 19:30:41,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11748 states to 11748 states and 17359 transitions. [2021-01-06 19:30:41,843 INFO L78 Accepts]: Start accepts. Automaton has 11748 states and 17359 transitions. Word has length 121 [2021-01-06 19:30:41,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:41,844 INFO L481 AbstractCegarLoop]: Abstraction has 11748 states and 17359 transitions. [2021-01-06 19:30:41,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:41,844 INFO L276 IsEmpty]: Start isEmpty. Operand 11748 states and 17359 transitions. [2021-01-06 19:30:41,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:41,851 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:41,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:41,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:30:41,852 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:41,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:41,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1535281267, now seen corresponding path program 1 times [2021-01-06 19:30:41,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:41,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031941469] [2021-01-06 19:30:41,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:41,905 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:41,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031941469] [2021-01-06 19:30:41,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:41,906 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:41,906 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379775149] [2021-01-06 19:30:41,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:41,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:41,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:41,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:41,907 INFO L87 Difference]: Start difference. First operand 11748 states and 17359 transitions. Second operand 3 states. [2021-01-06 19:30:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:42,452 INFO L93 Difference]: Finished difference Result 23476 states and 34689 transitions. [2021-01-06 19:30:42,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:42,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 19:30:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:42,481 INFO L225 Difference]: With dead ends: 23476 [2021-01-06 19:30:42,481 INFO L226 Difference]: Without dead ends: 11748 [2021-01-06 19:30:42,499 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:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11748 states. [2021-01-06 19:30:43,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11748 to 11748. [2021-01-06 19:30:43,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11748 states. [2021-01-06 19:30:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11748 states to 11748 states and 17309 transitions. [2021-01-06 19:30:43,102 INFO L78 Accepts]: Start accepts. Automaton has 11748 states and 17309 transitions. Word has length 121 [2021-01-06 19:30:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:43,102 INFO L481 AbstractCegarLoop]: Abstraction has 11748 states and 17309 transitions. [2021-01-06 19:30:43,102 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 11748 states and 17309 transitions. [2021-01-06 19:30:43,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:43,109 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:43,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:43,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:30:43,110 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:43,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:43,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1594577229, now seen corresponding path program 1 times [2021-01-06 19:30:43,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:43,111 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730198668] [2021-01-06 19:30:43,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:43,160 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:43,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730198668] [2021-01-06 19:30:43,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:43,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:43,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285860451] [2021-01-06 19:30:43,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:43,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:43,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:43,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:43,163 INFO L87 Difference]: Start difference. First operand 11748 states and 17309 transitions. Second operand 4 states. [2021-01-06 19:30:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:44,261 INFO L93 Difference]: Finished difference Result 33959 states and 50065 transitions. [2021-01-06 19:30:44,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:44,262 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:30:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:44,312 INFO L225 Difference]: With dead ends: 33959 [2021-01-06 19:30:44,312 INFO L226 Difference]: Without dead ends: 22233 [2021-01-06 19:30:44,334 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:44,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22233 states. [2021-01-06 19:30:45,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22233 to 22199. [2021-01-06 19:30:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22199 states. [2021-01-06 19:30:45,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22199 states to 22199 states and 32721 transitions. [2021-01-06 19:30:45,404 INFO L78 Accepts]: Start accepts. Automaton has 22199 states and 32721 transitions. Word has length 121 [2021-01-06 19:30:45,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:45,404 INFO L481 AbstractCegarLoop]: Abstraction has 22199 states and 32721 transitions. [2021-01-06 19:30:45,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 22199 states and 32721 transitions. [2021-01-06 19:30:45,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:45,416 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:45,416 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:45,417 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:30:45,417 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:45,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:45,418 INFO L82 PathProgramCache]: Analyzing trace with hash -802893301, now seen corresponding path program 1 times [2021-01-06 19:30:45,418 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:45,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472757163] [2021-01-06 19:30:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:45,461 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:45,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472757163] [2021-01-06 19:30:45,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:45,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:45,462 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234424266] [2021-01-06 19:30:45,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:45,463 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:45,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:45,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:45,464 INFO L87 Difference]: Start difference. First operand 22199 states and 32721 transitions. Second operand 3 states. [2021-01-06 19:30:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:46,505 INFO L93 Difference]: Finished difference Result 44375 states and 65409 transitions. [2021-01-06 19:30:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:46,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 19:30:46,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:46,552 INFO L225 Difference]: With dead ends: 44375 [2021-01-06 19:30:46,552 INFO L226 Difference]: Without dead ends: 22199 [2021-01-06 19:30:46,577 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:46,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22199 states. [2021-01-06 19:30:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22199 to 22199. [2021-01-06 19:30:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22199 states. [2021-01-06 19:30:47,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22199 states to 22199 states and 32381 transitions. [2021-01-06 19:30:47,570 INFO L78 Accepts]: Start accepts. Automaton has 22199 states and 32381 transitions. Word has length 121 [2021-01-06 19:30:47,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:47,574 INFO L481 AbstractCegarLoop]: Abstraction has 22199 states and 32381 transitions. [2021-01-06 19:30:47,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 22199 states and 32381 transitions. [2021-01-06 19:30:47,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:47,598 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:47,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:47,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:30:47,599 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:47,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:47,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1218352692, now seen corresponding path program 1 times [2021-01-06 19:30:47,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:47,600 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343201204] [2021-01-06 19:30:47,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:47,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343201204] [2021-01-06 19:30:47,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:47,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:47,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768239706] [2021-01-06 19:30:47,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:47,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:47,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:47,650 INFO L87 Difference]: Start difference. First operand 22199 states and 32381 transitions. Second operand 4 states. [2021-01-06 19:30:49,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:49,173 INFO L93 Difference]: Finished difference Result 64234 states and 93773 transitions. [2021-01-06 19:30:49,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:49,174 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:30:49,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:49,244 INFO L225 Difference]: With dead ends: 64234 [2021-01-06 19:30:49,245 INFO L226 Difference]: Without dead ends: 42059 [2021-01-06 19:30:49,264 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42059 states. [2021-01-06 19:30:50,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42059 to 42025. [2021-01-06 19:30:50,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42025 states. [2021-01-06 19:30:50,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42025 states to 42025 states and 61327 transitions. [2021-01-06 19:30:50,961 INFO L78 Accepts]: Start accepts. Automaton has 42025 states and 61327 transitions. Word has length 121 [2021-01-06 19:30:50,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:50,961 INFO L481 AbstractCegarLoop]: Abstraction has 42025 states and 61327 transitions. [2021-01-06 19:30:50,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:50,961 INFO L276 IsEmpty]: Start isEmpty. Operand 42025 states and 61327 transitions. [2021-01-06 19:30:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:50,983 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:50,983 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:50,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:30:50,984 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:50,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:50,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1170211338, now seen corresponding path program 1 times [2021-01-06 19:30:50,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:50,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245326205] [2021-01-06 19:30:50,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:30:51,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245326205] [2021-01-06 19:30:51,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:51,030 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:51,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264330906] [2021-01-06 19:30:51,031 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:51,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:51,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:51,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:51,032 INFO L87 Difference]: Start difference. First operand 42025 states and 61327 transitions. Second operand 3 states. [2021-01-06 19:30:52,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:52,558 INFO L93 Difference]: Finished difference Result 84025 states and 122619 transitions. [2021-01-06 19:30:52,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:52,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 19:30:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:52,631 INFO L225 Difference]: With dead ends: 84025 [2021-01-06 19:30:52,631 INFO L226 Difference]: Without dead ends: 42025 [2021-01-06 19:30:52,668 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:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42025 states. [2021-01-06 19:30:54,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42025 to 42025. [2021-01-06 19:30:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42025 states. [2021-01-06 19:30:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42025 states to 42025 states and 60683 transitions. [2021-01-06 19:30:54,291 INFO L78 Accepts]: Start accepts. Automaton has 42025 states and 60683 transitions. Word has length 121 [2021-01-06 19:30:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:54,291 INFO L481 AbstractCegarLoop]: Abstraction has 42025 states and 60683 transitions. [2021-01-06 19:30:54,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 42025 states and 60683 transitions. [2021-01-06 19:30:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:30:54,314 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:54,314 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:54,314 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:30:54,314 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:54,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash 613809421, now seen corresponding path program 1 times [2021-01-06 19:30:54,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:54,316 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801519855] [2021-01-06 19:30:54,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:54,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:54,374 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801519855] [2021-01-06 19:30:54,374 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:54,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:54,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108289264] [2021-01-06 19:30:54,375 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:54,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:54,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:54,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:54,377 INFO L87 Difference]: Start difference. First operand 42025 states and 60683 transitions. Second operand 4 states. [2021-01-06 19:30:57,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:57,150 INFO L93 Difference]: Finished difference Result 121564 states and 175703 transitions. [2021-01-06 19:30:57,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:57,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:30:57,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:57,322 INFO L225 Difference]: With dead ends: 121564 [2021-01-06 19:30:57,322 INFO L226 Difference]: Without dead ends: 79565 [2021-01-06 19:30:57,407 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79565 states. [2021-01-06 19:31:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79565 to 79499. [2021-01-06 19:31:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79499 states. [2021-01-06 19:31:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79499 states to 79499 states and 114861 transitions. [2021-01-06 19:31:00,588 INFO L78 Accepts]: Start accepts. Automaton has 79499 states and 114861 transitions. Word has length 121 [2021-01-06 19:31:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:00,588 INFO L481 AbstractCegarLoop]: Abstraction has 79499 states and 114861 transitions. [2021-01-06 19:31:00,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:00,588 INFO L276 IsEmpty]: Start isEmpty. Operand 79499 states and 114861 transitions. [2021-01-06 19:31:00,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:31:00,618 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:00,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:00,619 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:31:00,619 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:00,620 INFO L82 PathProgramCache]: Analyzing trace with hash -442921781, now seen corresponding path program 1 times [2021-01-06 19:31:00,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:00,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91138363] [2021-01-06 19:31:00,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:00,664 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:31:00,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91138363] [2021-01-06 19:31:00,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:00,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:00,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037278308] [2021-01-06 19:31:00,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:00,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:00,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:00,667 INFO L87 Difference]: Start difference. First operand 79499 states and 114861 transitions. Second operand 4 states. [2021-01-06 19:31:05,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:05,504 INFO L93 Difference]: Finished difference Result 229822 states and 332345 transitions. [2021-01-06 19:31:05,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:05,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:31:05,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:05,722 INFO L225 Difference]: With dead ends: 229822 [2021-01-06 19:31:05,723 INFO L226 Difference]: Without dead ends: 150350 [2021-01-06 19:31:05,822 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150350 states. [2021-01-06 19:31:11,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150350 to 150220. [2021-01-06 19:31:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150220 states. [2021-01-06 19:31:11,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150220 states to 150220 states and 217134 transitions. [2021-01-06 19:31:11,682 INFO L78 Accepts]: Start accepts. Automaton has 150220 states and 217134 transitions. Word has length 121 [2021-01-06 19:31:11,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:11,683 INFO L481 AbstractCegarLoop]: Abstraction has 150220 states and 217134 transitions. [2021-01-06 19:31:11,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:11,683 INFO L276 IsEmpty]: Start isEmpty. Operand 150220 states and 217134 transitions. [2021-01-06 19:31:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:31:11,733 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:11,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:11,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:31:11,733 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:11,734 INFO L82 PathProgramCache]: Analyzing trace with hash 908463437, now seen corresponding path program 1 times [2021-01-06 19:31:11,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:11,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774059505] [2021-01-06 19:31:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:11,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:12,081 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:31:12,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774059505] [2021-01-06 19:31:12,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:12,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:12,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461119724] [2021-01-06 19:31:12,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:31:12,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:12,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:31:12,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:31:12,085 INFO L87 Difference]: Start difference. First operand 150220 states and 217134 transitions. Second operand 4 states. [2021-01-06 19:31:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:21,158 INFO L93 Difference]: Finished difference Result 433663 states and 627386 transitions. [2021-01-06 19:31:21,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:31:21,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2021-01-06 19:31:21,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:21,582 INFO L225 Difference]: With dead ends: 433663 [2021-01-06 19:31:21,583 INFO L226 Difference]: Without dead ends: 283471 [2021-01-06 19:31:21,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:31:22,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283471 states. [2021-01-06 19:31:32,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283471 to 283213. [2021-01-06 19:31:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283213 states. [2021-01-06 19:31:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283213 states to 283213 states and 409519 transitions. [2021-01-06 19:31:33,231 INFO L78 Accepts]: Start accepts. Automaton has 283213 states and 409519 transitions. Word has length 121 [2021-01-06 19:31:33,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:33,234 INFO L481 AbstractCegarLoop]: Abstraction has 283213 states and 409519 transitions. [2021-01-06 19:31:33,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:31:33,234 INFO L276 IsEmpty]: Start isEmpty. Operand 283213 states and 409519 transitions. [2021-01-06 19:31:33,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:31:33,365 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:33,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:33,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:31:33,366 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:33,368 INFO L82 PathProgramCache]: Analyzing trace with hash -710511477, now seen corresponding path program 1 times [2021-01-06 19:31:33,368 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:33,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863072888] [2021-01-06 19:31:33,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:33,421 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:31:33,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863072888] [2021-01-06 19:31:33,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:33,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:31:33,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783329891] [2021-01-06 19:31:33,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:33,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:33,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:33,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:33,426 INFO L87 Difference]: Start difference. First operand 283213 states and 409519 transitions. Second operand 3 states. [2021-01-06 19:31:48,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:48,210 INFO L93 Difference]: Finished difference Result 711371 states and 1025959 transitions. [2021-01-06 19:31:48,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:48,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2021-01-06 19:31:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:48,923 INFO L225 Difference]: With dead ends: 711371 [2021-01-06 19:31:48,923 INFO L226 Difference]: Without dead ends: 428189 [2021-01-06 19:31:49,268 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:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428189 states. [2021-01-06 19:32:05,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428189 to 411803. [2021-01-06 19:32:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411803 states. [2021-01-06 19:32:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411803 states to 411803 states and 590367 transitions. [2021-01-06 19:32:07,528 INFO L78 Accepts]: Start accepts. Automaton has 411803 states and 590367 transitions. Word has length 121 [2021-01-06 19:32:07,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:32:07,529 INFO L481 AbstractCegarLoop]: Abstraction has 411803 states and 590367 transitions. [2021-01-06 19:32:07,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:32:07,529 INFO L276 IsEmpty]: Start isEmpty. Operand 411803 states and 590367 transitions. [2021-01-06 19:32:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-01-06 19:32:07,643 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:32:07,656 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:32:07,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:32:07,657 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:32:07,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:32:07,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1871358836, now seen corresponding path program 1 times [2021-01-06 19:32:07,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:32:07,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056229953] [2021-01-06 19:32:07,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:32:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:32:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:32:08,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056229953] [2021-01-06 19:32:08,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:32:08,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:32:08,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305016456] [2021-01-06 19:32:08,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:32:08,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:32:08,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:32:08,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:32:08,481 INFO L87 Difference]: Start difference. First operand 411803 states and 590367 transitions. Second operand 5 states.