/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/systemc/token_ring.08.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:27:04,327 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:27:04,331 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:27:04,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:27:04,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:27:04,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:27:04,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:27:04,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:27:04,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:27:04,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:27:04,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:27:04,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:27:04,395 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:27:04,396 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:27:04,397 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:27:04,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:27:04,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:27:04,401 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:27:04,403 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:27:04,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:27:04,408 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:27:04,409 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:27:04,411 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:27:04,412 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:27:04,415 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:27:04,416 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:27:04,416 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:27:04,417 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:27:04,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:27:04,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:27:04,420 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:27:04,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:27:04,422 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:27:04,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:27:04,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:27:04,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:27:04,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:27:04,426 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:27:04,426 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:27:04,427 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:27:04,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:27:04,430 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:27:04,462 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:27:04,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:27:04,464 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:27:04,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:27:04,464 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:27:04,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:27:04,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:27:04,465 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:27:04,465 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:27:04,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:27:04,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:27:04,466 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:27:04,466 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:27:04,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:27:04,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:27:04,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:27:04,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:27:04,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:27:04,468 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:27:04,468 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:27:04,468 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:27:04,469 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:27:04,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:27:04,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:27:04,469 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:27:04,469 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:27:04,817 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:27:04,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:27:04,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:27:04,857 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:27:04,857 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:27:04,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.08.cil-1.c [2021-01-06 19:27:04,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fb3a08a84/6933ae66d13641d397f9475eab2cd20d/FLAG9fa94ac69 [2021-01-06 19:27:05,580 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:27:05,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-1.c [2021-01-06 19:27:05,608 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fb3a08a84/6933ae66d13641d397f9475eab2cd20d/FLAG9fa94ac69 [2021-01-06 19:27:05,858 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/fb3a08a84/6933ae66d13641d397f9475eab2cd20d [2021-01-06 19:27:05,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:27:05,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:27:05,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:27:05,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:27:05,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:27:05,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:27:05" (1/1) ... [2021-01-06 19:27:05,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca19445 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:05, skipping insertion in model container [2021-01-06 19:27:05,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:27:05" (1/1) ... [2021-01-06 19:27:05,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:27:05,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:27:06,092 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~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_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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:27:06,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:27:06,320 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:27:06,341 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.08.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~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_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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:27:06,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:27:06,503 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:27:06,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06 WrapperNode [2021-01-06 19:27:06,504 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:27:06,507 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:27:06,507 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:27:06,507 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:27:06,517 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:27:06" (1/1) ... [2021-01-06 19:27:06,556 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:27:06" (1/1) ... [2021-01-06 19:27:06,714 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:27:06,715 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:27:06,715 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:27:06,715 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:27:06,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06" (1/1) ... [2021-01-06 19:27:06,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06" (1/1) ... [2021-01-06 19:27:06,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06" (1/1) ... [2021-01-06 19:27:06,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06" (1/1) ... [2021-01-06 19:27:06,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06" (1/1) ... [2021-01-06 19:27:06,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06" (1/1) ... [2021-01-06 19:27:06,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06" (1/1) ... [2021-01-06 19:27:06,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:27:06,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:27:06,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:27:06,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:27:06,904 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06" (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:27:06,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:27:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:27:06,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:27:06,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:27:09,001 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:27:09,002 INFO L299 CfgBuilder]: Removed 325 assume(true) statements. [2021-01-06 19:27:09,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:27:09 BoogieIcfgContainer [2021-01-06 19:27:09,006 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:27:09,007 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:27:09,008 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:27:09,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:27:09,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:27:05" (1/3) ... [2021-01-06 19:27:09,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1722a9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:27:09, skipping insertion in model container [2021-01-06 19:27:09,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:27:06" (2/3) ... [2021-01-06 19:27:09,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1722a9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:27:09, skipping insertion in model container [2021-01-06 19:27:09,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:27:09" (3/3) ... [2021-01-06 19:27:09,015 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.08.cil-1.c [2021-01-06 19:27:09,022 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:27:09,028 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-01-06 19:27:09,049 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-01-06 19:27:09,087 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:27:09,088 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:27:09,088 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:27:09,088 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:27:09,088 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:27:09,088 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:27:09,088 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:27:09,089 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:27:09,122 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2021-01-06 19:27:09,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:09,136 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:09,137 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] [2021-01-06 19:27:09,138 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:09,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:09,144 INFO L82 PathProgramCache]: Analyzing trace with hash -245504410, now seen corresponding path program 1 times [2021-01-06 19:27:09,155 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:09,155 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964461838] [2021-01-06 19:27:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:09,437 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:27:09,438 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964461838] [2021-01-06 19:27:09,439 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:09,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:09,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392896911] [2021-01-06 19:27:09,446 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:09,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:09,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:09,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:09,464 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2021-01-06 19:27:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:09,624 INFO L93 Difference]: Finished difference Result 1943 states and 2965 transitions. [2021-01-06 19:27:09,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:09,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 19:27:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:09,656 INFO L225 Difference]: With dead ends: 1943 [2021-01-06 19:27:09,656 INFO L226 Difference]: Without dead ends: 970 [2021-01-06 19:27:09,666 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:27:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2021-01-06 19:27:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2021-01-06 19:27:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2021-01-06 19:27:09,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1458 transitions. [2021-01-06 19:27:09,789 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1458 transitions. Word has length 116 [2021-01-06 19:27:09,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:09,790 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1458 transitions. [2021-01-06 19:27:09,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1458 transitions. [2021-01-06 19:27:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:09,795 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:09,795 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] [2021-01-06 19:27:09,796 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:27:09,796 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:09,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:09,797 INFO L82 PathProgramCache]: Analyzing trace with hash -716860760, now seen corresponding path program 1 times [2021-01-06 19:27:09,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:09,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392512323] [2021-01-06 19:27:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:09,971 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:27:09,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392512323] [2021-01-06 19:27:09,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:09,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:09,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307004292] [2021-01-06 19:27:09,974 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:09,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:09,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:09,976 INFO L87 Difference]: Start difference. First operand 970 states and 1458 transitions. Second operand 4 states. [2021-01-06 19:27:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:10,144 INFO L93 Difference]: Finished difference Result 2722 states and 4078 transitions. [2021-01-06 19:27:10,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:10,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:27:10,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:10,156 INFO L225 Difference]: With dead ends: 2722 [2021-01-06 19:27:10,156 INFO L226 Difference]: Without dead ends: 1765 [2021-01-06 19:27:10,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2021-01-06 19:27:10,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1763. [2021-01-06 19:27:10,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2021-01-06 19:27:10,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2636 transitions. [2021-01-06 19:27:10,244 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2636 transitions. Word has length 116 [2021-01-06 19:27:10,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:10,245 INFO L481 AbstractCegarLoop]: Abstraction has 1763 states and 2636 transitions. [2021-01-06 19:27:10,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:10,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2636 transitions. [2021-01-06 19:27:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:10,250 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:10,250 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] [2021-01-06 19:27:10,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:27:10,251 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1544712490, now seen corresponding path program 1 times [2021-01-06 19:27:10,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:10,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835975585] [2021-01-06 19:27:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:10,343 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:27:10,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835975585] [2021-01-06 19:27:10,344 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:10,344 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:10,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794169981] [2021-01-06 19:27:10,345 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:10,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:10,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:10,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:10,346 INFO L87 Difference]: Start difference. First operand 1763 states and 2636 transitions. Second operand 4 states. [2021-01-06 19:27:10,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:10,591 INFO L93 Difference]: Finished difference Result 5096 states and 7606 transitions. [2021-01-06 19:27:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:10,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:27:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:10,611 INFO L225 Difference]: With dead ends: 5096 [2021-01-06 19:27:10,611 INFO L226 Difference]: Without dead ends: 3348 [2021-01-06 19:27:10,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:10,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2021-01-06 19:27:10,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 3346. [2021-01-06 19:27:10,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3346 states. [2021-01-06 19:27:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 4987 transitions. [2021-01-06 19:27:10,772 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 4987 transitions. Word has length 116 [2021-01-06 19:27:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:10,773 INFO L481 AbstractCegarLoop]: Abstraction has 3346 states and 4987 transitions. [2021-01-06 19:27:10,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4987 transitions. [2021-01-06 19:27:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:10,776 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:10,776 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] [2021-01-06 19:27:10,776 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:27:10,777 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -321996184, now seen corresponding path program 1 times [2021-01-06 19:27:10,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:10,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666608279] [2021-01-06 19:27:10,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:10,910 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:27:10,911 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666608279] [2021-01-06 19:27:10,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:10,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:10,912 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064094893] [2021-01-06 19:27:10,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:10,913 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:10,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:10,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:10,918 INFO L87 Difference]: Start difference. First operand 3346 states and 4987 transitions. Second operand 4 states. [2021-01-06 19:27:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:11,353 INFO L93 Difference]: Finished difference Result 9839 states and 14649 transitions. [2021-01-06 19:27:11,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:11,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:27:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:11,390 INFO L225 Difference]: With dead ends: 9839 [2021-01-06 19:27:11,391 INFO L226 Difference]: Without dead ends: 6509 [2021-01-06 19:27:11,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:11,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6509 states. [2021-01-06 19:27:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6509 to 6507. [2021-01-06 19:27:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6507 states. [2021-01-06 19:27:11,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6507 states to 6507 states and 9676 transitions. [2021-01-06 19:27:11,826 INFO L78 Accepts]: Start accepts. Automaton has 6507 states and 9676 transitions. Word has length 116 [2021-01-06 19:27:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:11,827 INFO L481 AbstractCegarLoop]: Abstraction has 6507 states and 9676 transitions. [2021-01-06 19:27:11,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 6507 states and 9676 transitions. [2021-01-06 19:27:11,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:11,830 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:11,831 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] [2021-01-06 19:27:11,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:27:11,831 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:11,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:11,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1629138582, now seen corresponding path program 1 times [2021-01-06 19:27:11,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:11,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034262303] [2021-01-06 19:27:11,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:11,971 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:27:11,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034262303] [2021-01-06 19:27:11,972 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:11,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:11,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821915416] [2021-01-06 19:27:11,973 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:11,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:11,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:11,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:11,974 INFO L87 Difference]: Start difference. First operand 6507 states and 9676 transitions. Second operand 3 states. [2021-01-06 19:27:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:12,345 INFO L93 Difference]: Finished difference Result 12997 states and 19326 transitions. [2021-01-06 19:27:12,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:12,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 19:27:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:12,380 INFO L225 Difference]: With dead ends: 12997 [2021-01-06 19:27:12,380 INFO L226 Difference]: Without dead ends: 6507 [2021-01-06 19:27:12,390 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:27:12,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6507 states. [2021-01-06 19:27:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6507 to 6507. [2021-01-06 19:27:12,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6507 states. [2021-01-06 19:27:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6507 states to 6507 states and 9650 transitions. [2021-01-06 19:27:12,695 INFO L78 Accepts]: Start accepts. Automaton has 6507 states and 9650 transitions. Word has length 116 [2021-01-06 19:27:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:12,696 INFO L481 AbstractCegarLoop]: Abstraction has 6507 states and 9650 transitions. [2021-01-06 19:27:12,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 6507 states and 9650 transitions. [2021-01-06 19:27:12,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:12,698 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:12,698 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] [2021-01-06 19:27:12,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:27:12,699 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:12,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:12,699 INFO L82 PathProgramCache]: Analyzing trace with hash -241114906, now seen corresponding path program 1 times [2021-01-06 19:27:12,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:12,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094735544] [2021-01-06 19:27:12,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:12,824 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:27:12,825 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094735544] [2021-01-06 19:27:12,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:12,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:12,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733309892] [2021-01-06 19:27:12,826 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:12,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:12,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:12,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:12,828 INFO L87 Difference]: Start difference. First operand 6507 states and 9650 transitions. Second operand 3 states. [2021-01-06 19:27:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:13,177 INFO L93 Difference]: Finished difference Result 12996 states and 19273 transitions. [2021-01-06 19:27:13,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:13,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 19:27:13,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:13,236 INFO L225 Difference]: With dead ends: 12996 [2021-01-06 19:27:13,236 INFO L226 Difference]: Without dead ends: 6507 [2021-01-06 19:27:13,247 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:27:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6507 states. [2021-01-06 19:27:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6507 to 6507. [2021-01-06 19:27:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6507 states. [2021-01-06 19:27:13,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6507 states to 6507 states and 9624 transitions. [2021-01-06 19:27:13,673 INFO L78 Accepts]: Start accepts. Automaton has 6507 states and 9624 transitions. Word has length 116 [2021-01-06 19:27:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:13,674 INFO L481 AbstractCegarLoop]: Abstraction has 6507 states and 9624 transitions. [2021-01-06 19:27:13,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 6507 states and 9624 transitions. [2021-01-06 19:27:13,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:13,677 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:13,677 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] [2021-01-06 19:27:13,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:27:13,678 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:13,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1581813270, now seen corresponding path program 1 times [2021-01-06 19:27:13,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:13,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962966127] [2021-01-06 19:27:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:13,785 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:27:13,786 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962966127] [2021-01-06 19:27:13,786 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:13,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:13,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143534243] [2021-01-06 19:27:13,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:13,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:13,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:13,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:13,792 INFO L87 Difference]: Start difference. First operand 6507 states and 9624 transitions. Second operand 4 states. [2021-01-06 19:27:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:14,498 INFO L93 Difference]: Finished difference Result 19296 states and 28530 transitions. [2021-01-06 19:27:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:14,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:27:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:14,532 INFO L225 Difference]: With dead ends: 19296 [2021-01-06 19:27:14,532 INFO L226 Difference]: Without dead ends: 12808 [2021-01-06 19:27:14,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:14,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12808 states. [2021-01-06 19:27:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12808 to 12806. [2021-01-06 19:27:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12806 states. [2021-01-06 19:27:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12806 states to 12806 states and 18915 transitions. [2021-01-06 19:27:15,369 INFO L78 Accepts]: Start accepts. Automaton has 12806 states and 18915 transitions. Word has length 116 [2021-01-06 19:27:15,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:15,370 INFO L481 AbstractCegarLoop]: Abstraction has 12806 states and 18915 transitions. [2021-01-06 19:27:15,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:15,370 INFO L276 IsEmpty]: Start isEmpty. Operand 12806 states and 18915 transitions. [2021-01-06 19:27:15,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:15,373 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:15,374 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] [2021-01-06 19:27:15,374 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:27:15,374 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:15,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash 806750760, now seen corresponding path program 1 times [2021-01-06 19:27:15,375 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:15,375 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119533115] [2021-01-06 19:27:15,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:27:15,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119533115] [2021-01-06 19:27:15,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:15,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:15,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637275797] [2021-01-06 19:27:15,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:15,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:15,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:15,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:15,459 INFO L87 Difference]: Start difference. First operand 12806 states and 18915 transitions. Second operand 4 states. [2021-01-06 19:27:16,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:16,529 INFO L93 Difference]: Finished difference Result 38171 states and 56365 transitions. [2021-01-06 19:27:16,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:16,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:27:16,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:16,597 INFO L225 Difference]: With dead ends: 38171 [2021-01-06 19:27:16,597 INFO L226 Difference]: Without dead ends: 25385 [2021-01-06 19:27:16,619 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25385 states. [2021-01-06 19:27:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25385 to 25383. [2021-01-06 19:27:18,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25383 states. [2021-01-06 19:27:18,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25383 states to 25383 states and 37444 transitions. [2021-01-06 19:27:18,233 INFO L78 Accepts]: Start accepts. Automaton has 25383 states and 37444 transitions. Word has length 116 [2021-01-06 19:27:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:18,233 INFO L481 AbstractCegarLoop]: Abstraction has 25383 states and 37444 transitions. [2021-01-06 19:27:18,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:18,233 INFO L276 IsEmpty]: Start isEmpty. Operand 25383 states and 37444 transitions. [2021-01-06 19:27:18,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:18,240 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:18,240 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] [2021-01-06 19:27:18,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:27:18,241 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:18,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:18,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1887145430, now seen corresponding path program 1 times [2021-01-06 19:27:18,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:18,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807280606] [2021-01-06 19:27:18,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:18,313 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:27:18,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807280606] [2021-01-06 19:27:18,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:18,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:18,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749977306] [2021-01-06 19:27:18,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:18,322 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:18,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:18,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:18,324 INFO L87 Difference]: Start difference. First operand 25383 states and 37444 transitions. Second operand 4 states. [2021-01-06 19:27:20,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:20,259 INFO L93 Difference]: Finished difference Result 73820 states and 108942 transitions. [2021-01-06 19:27:20,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:20,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:27:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:20,400 INFO L225 Difference]: With dead ends: 73820 [2021-01-06 19:27:20,400 INFO L226 Difference]: Without dead ends: 48459 [2021-01-06 19:27:20,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:20,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48459 states. [2021-01-06 19:27:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48459 to 48425. [2021-01-06 19:27:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48425 states. [2021-01-06 19:27:23,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48425 states to 48425 states and 71431 transitions. [2021-01-06 19:27:23,121 INFO L78 Accepts]: Start accepts. Automaton has 48425 states and 71431 transitions. Word has length 116 [2021-01-06 19:27:23,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:23,122 INFO L481 AbstractCegarLoop]: Abstraction has 48425 states and 71431 transitions. [2021-01-06 19:27:23,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:23,122 INFO L276 IsEmpty]: Start isEmpty. Operand 48425 states and 71431 transitions. [2021-01-06 19:27:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:23,133 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:23,133 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] [2021-01-06 19:27:23,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:27:23,134 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:23,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:23,135 INFO L82 PathProgramCache]: Analyzing trace with hash -535760212, now seen corresponding path program 1 times [2021-01-06 19:27:23,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:23,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552664258] [2021-01-06 19:27:23,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:23,191 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:27:23,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552664258] [2021-01-06 19:27:23,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:23,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:23,193 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424388212] [2021-01-06 19:27:23,193 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:23,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:23,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:23,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:23,196 INFO L87 Difference]: Start difference. First operand 48425 states and 71431 transitions. Second operand 4 states. [2021-01-06 19:27:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:26,637 INFO L93 Difference]: Finished difference Result 140862 states and 207889 transitions. [2021-01-06 19:27:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:26,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:27:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:26,907 INFO L225 Difference]: With dead ends: 140862 [2021-01-06 19:27:26,908 INFO L226 Difference]: Without dead ends: 92460 [2021-01-06 19:27:26,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:27,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92460 states. [2021-01-06 19:27:30,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92460 to 92138. [2021-01-06 19:27:30,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92138 states. [2021-01-06 19:27:30,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92138 states to 92138 states and 135848 transitions. [2021-01-06 19:27:30,958 INFO L78 Accepts]: Start accepts. Automaton has 92138 states and 135848 transitions. Word has length 116 [2021-01-06 19:27:30,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:30,959 INFO L481 AbstractCegarLoop]: Abstraction has 92138 states and 135848 transitions. [2021-01-06 19:27:30,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 92138 states and 135848 transitions. [2021-01-06 19:27:30,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:30,996 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:30,997 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] [2021-01-06 19:27:30,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:27:30,997 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:30,998 INFO L82 PathProgramCache]: Analyzing trace with hash 2140232170, now seen corresponding path program 1 times [2021-01-06 19:27:30,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:30,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17058495] [2021-01-06 19:27:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:31,058 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:27:31,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17058495] [2021-01-06 19:27:31,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:31,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:27:31,059 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660041854] [2021-01-06 19:27:31,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:27:31,060 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:31,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:27:31,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:27:31,062 INFO L87 Difference]: Start difference. First operand 92138 states and 135848 transitions. Second operand 3 states. [2021-01-06 19:27:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:34,829 INFO L93 Difference]: Finished difference Result 184252 states and 271662 transitions. [2021-01-06 19:27:34,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:27:34,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2021-01-06 19:27:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:35,055 INFO L225 Difference]: With dead ends: 184252 [2021-01-06 19:27:35,055 INFO L226 Difference]: Without dead ends: 92138 [2021-01-06 19:27:35,239 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:27:35,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92138 states. [2021-01-06 19:27:38,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92138 to 92138. [2021-01-06 19:27:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92138 states. [2021-01-06 19:27:38,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92138 states to 92138 states and 134436 transitions. [2021-01-06 19:27:38,777 INFO L78 Accepts]: Start accepts. Automaton has 92138 states and 134436 transitions. Word has length 116 [2021-01-06 19:27:38,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:38,777 INFO L481 AbstractCegarLoop]: Abstraction has 92138 states and 134436 transitions. [2021-01-06 19:27:38,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:27:38,778 INFO L276 IsEmpty]: Start isEmpty. Operand 92138 states and 134436 transitions. [2021-01-06 19:27:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:38,797 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:38,797 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] [2021-01-06 19:27:38,798 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:27:38,798 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:38,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:38,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1256723180, now seen corresponding path program 1 times [2021-01-06 19:27:38,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:38,799 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583059142] [2021-01-06 19:27:38,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:38,994 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:27:38,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583059142] [2021-01-06 19:27:38,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:38,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:38,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297804664] [2021-01-06 19:27:38,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:38,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:38,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:38,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:38,999 INFO L87 Difference]: Start difference. First operand 92138 states and 134436 transitions. Second operand 4 states. [2021-01-06 19:27:44,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:27:44,403 INFO L93 Difference]: Finished difference Result 267711 states and 390890 transitions. [2021-01-06 19:27:44,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:27:44,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:27:44,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:27:44,718 INFO L225 Difference]: With dead ends: 267711 [2021-01-06 19:27:44,719 INFO L226 Difference]: Without dead ends: 175598 [2021-01-06 19:27:44,839 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:27:45,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175598 states. [2021-01-06 19:27:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175598 to 175468. [2021-01-06 19:27:50,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175468 states. [2021-01-06 19:27:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175468 states to 175468 states and 256102 transitions. [2021-01-06 19:27:51,513 INFO L78 Accepts]: Start accepts. Automaton has 175468 states and 256102 transitions. Word has length 116 [2021-01-06 19:27:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:27:51,514 INFO L481 AbstractCegarLoop]: Abstraction has 175468 states and 256102 transitions. [2021-01-06 19:27:51,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:27:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 175468 states and 256102 transitions. [2021-01-06 19:27:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:27:51,571 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:27:51,572 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] [2021-01-06 19:27:51,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:27:51,572 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:27:51,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:27:51,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1228222890, now seen corresponding path program 1 times [2021-01-06 19:27:51,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:27:51,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916898495] [2021-01-06 19:27:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:27:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:27:51,616 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:27:51,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916898495] [2021-01-06 19:27:51,617 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:27:51,617 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:27:51,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546067595] [2021-01-06 19:27:51,617 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:27:51,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:27:51,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:27:51,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:27:51,618 INFO L87 Difference]: Start difference. First operand 175468 states and 256102 transitions. Second operand 4 states. [2021-01-06 19:28:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:01,638 INFO L93 Difference]: Finished difference Result 509377 states and 743980 transitions. [2021-01-06 19:28:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:01,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:28:01,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:02,125 INFO L225 Difference]: With dead ends: 509377 [2021-01-06 19:28:02,126 INFO L226 Difference]: Without dead ends: 333935 [2021-01-06 19:28:02,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333935 states. [2021-01-06 19:28:14,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333935 to 333677. [2021-01-06 19:28:14,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333677 states. [2021-01-06 19:28:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333677 states to 333677 states and 487143 transitions. [2021-01-06 19:28:15,265 INFO L78 Accepts]: Start accepts. Automaton has 333677 states and 487143 transitions. Word has length 116 [2021-01-06 19:28:15,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:15,265 INFO L481 AbstractCegarLoop]: Abstraction has 333677 states and 487143 transitions. [2021-01-06 19:28:15,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:15,265 INFO L276 IsEmpty]: Start isEmpty. Operand 333677 states and 487143 transitions. [2021-01-06 19:28:15,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:28:15,308 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:15,308 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] [2021-01-06 19:28:15,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:28:15,309 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:15,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:15,309 INFO L82 PathProgramCache]: Analyzing trace with hash -712359124, now seen corresponding path program 1 times [2021-01-06 19:28:15,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:15,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081822229] [2021-01-06 19:28:15,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:15,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081822229] [2021-01-06 19:28:15,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:15,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:15,369 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347694313] [2021-01-06 19:28:15,369 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:15,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:15,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:15,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:15,370 INFO L87 Difference]: Start difference. First operand 333677 states and 487143 transitions. Second operand 4 states. [2021-01-06 19:28:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:35,745 INFO L93 Difference]: Finished difference Result 967362 states and 1413293 transitions. [2021-01-06 19:28:35,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:35,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2021-01-06 19:28:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:36,934 INFO L225 Difference]: With dead ends: 967362 [2021-01-06 19:28:36,934 INFO L226 Difference]: Without dead ends: 633712 [2021-01-06 19:28:37,441 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633712 states. [2021-01-06 19:29:04,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633712 to 633198. [2021-01-06 19:29:04,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633198 states. [2021-01-06 19:29:07,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633198 states to 633198 states and 924648 transitions. [2021-01-06 19:29:07,889 INFO L78 Accepts]: Start accepts. Automaton has 633198 states and 924648 transitions. Word has length 116 [2021-01-06 19:29:07,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:07,890 INFO L481 AbstractCegarLoop]: Abstraction has 633198 states and 924648 transitions. [2021-01-06 19:29:07,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:07,890 INFO L276 IsEmpty]: Start isEmpty. Operand 633198 states and 924648 transitions. [2021-01-06 19:29:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-01-06 19:29:08,002 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:08,002 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] [2021-01-06 19:29:08,003 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:29:08,003 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:08,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:08,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1164704106, now seen corresponding path program 1 times [2021-01-06 19:29:08,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:08,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766820370] [2021-01-06 19:29:08,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:08,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766820370] [2021-01-06 19:29:08,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:08,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:08,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13704148] [2021-01-06 19:29:08,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:08,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:08,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:08,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:08,054 INFO L87 Difference]: Start difference. First operand 633198 states and 924648 transitions. Second operand 4 states.