/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.01.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:24:52,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:24:52,571 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:24:52,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:24:52,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:24:52,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:24:52,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:24:52,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:24:52,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:24:52,652 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:24:52,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:24:52,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:24:52,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:24:52,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:24:52,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:24:52,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:24:52,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:24:52,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:24:52,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:24:52,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:24:52,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:24:52,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:24:52,692 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:24:52,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:24:52,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:24:52,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:24:52,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:24:52,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:24:52,706 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:24:52,707 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:24:52,707 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:24:52,708 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:24:52,709 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:24:52,710 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:24:52,711 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:24:52,711 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:24:52,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:24:52,712 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:24:52,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:24:52,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:24:52,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:24:52,715 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:24:52,742 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:24:52,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:24:52,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:24:52,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:24:52,744 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:24:52,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:24:52,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:24:52,745 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:24:52,745 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:24:52,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:24:52,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:24:52,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:24:52,746 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:24:52,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:24:52,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:24:52,747 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:24:52,747 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:24:52,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:24:52,748 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:24:52,748 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:24:52,748 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:24:52,748 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:24:52,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:24:52,749 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:24:52,749 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:24:52,749 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:24:53,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:24:53,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:24:53,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:24:53,181 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:24:53,182 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:24:53,183 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-01-06 19:24:53,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/98fc5553a/1092944de30844e7ab838bb254c743c0/FLAG584bebb27 [2021-01-06 19:24:53,898 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:24:53,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-01-06 19:24:53,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/98fc5553a/1092944de30844e7ab838bb254c743c0/FLAG584bebb27 [2021-01-06 19:24:54,268 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/98fc5553a/1092944de30844e7ab838bb254c743c0 [2021-01-06 19:24:54,272 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:24:54,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:24:54,280 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:24:54,281 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:24:54,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:24:54,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:24:54" (1/1) ... [2021-01-06 19:24:54,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1e4eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54, skipping insertion in model container [2021-01-06 19:24:54,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:24:54" (1/1) ... [2021-01-06 19:24:54,301 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:24:54,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:24:54,570 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.01.cil-2.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_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[~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[~__retres1~2,] 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[~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[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_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[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_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[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~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[~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~3,] [2021-01-06 19:24:54,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:24:54,649 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:24:54,665 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.01.cil-2.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_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[~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[~__retres1~2,] 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[~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[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_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[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_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[~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[~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[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~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[~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~3,] [2021-01-06 19:24:54,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:24:54,735 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:24:54,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54 WrapperNode [2021-01-06 19:24:54,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:24:54,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:24:54,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:24:54,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:24:54,746 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:24:54" (1/1) ... [2021-01-06 19:24:54,756 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:24:54" (1/1) ... [2021-01-06 19:24:54,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:24:54,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:24:54,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:24:54,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:24:54,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54" (1/1) ... [2021-01-06 19:24:54,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54" (1/1) ... [2021-01-06 19:24:54,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54" (1/1) ... [2021-01-06 19:24:54,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54" (1/1) ... [2021-01-06 19:24:54,820 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54" (1/1) ... [2021-01-06 19:24:54,841 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54" (1/1) ... [2021-01-06 19:24:54,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54" (1/1) ... [2021-01-06 19:24:54,863 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:24:54,864 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:24:54,864 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:24:54,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:24:54,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54" (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:24:55,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:24:55,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:24:55,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:24:55,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:24:55,811 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:24:55,811 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-01-06 19:24:55,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:24:55 BoogieIcfgContainer [2021-01-06 19:24:55,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:24:55,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:24:55,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:24:55,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:24:55,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:24:54" (1/3) ... [2021-01-06 19:24:55,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a2f760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:24:55, skipping insertion in model container [2021-01-06 19:24:55,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:24:54" (2/3) ... [2021-01-06 19:24:55,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58a2f760 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:24:55, skipping insertion in model container [2021-01-06 19:24:55,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:24:55" (3/3) ... [2021-01-06 19:24:55,827 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-01-06 19:24:55,834 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:24:55,840 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 19:24:55,861 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 19:24:55,891 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:24:55,891 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:24:55,892 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:24:55,892 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:24:55,892 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:24:55,892 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:24:55,892 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:24:55,893 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:24:55,913 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2021-01-06 19:24:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:55,921 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:55,922 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] [2021-01-06 19:24:55,923 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-01-06 19:24:55,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:55,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767426243] [2021-01-06 19:24:55,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:56,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:56,159 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:24:56,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767426243] [2021-01-06 19:24:56,161 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:56,161 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:56,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824725961] [2021-01-06 19:24:56,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:56,167 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:56,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:56,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:56,186 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2021-01-06 19:24:56,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:56,249 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2021-01-06 19:24:56,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:56,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 19:24:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:56,265 INFO L225 Difference]: With dead ends: 291 [2021-01-06 19:24:56,265 INFO L226 Difference]: Without dead ends: 144 [2021-01-06 19:24:56,270 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:24:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-01-06 19:24:56,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-01-06 19:24:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2021-01-06 19:24:56,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2021-01-06 19:24:56,335 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2021-01-06 19:24:56,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:56,336 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2021-01-06 19:24:56,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:56,336 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2021-01-06 19:24:56,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:56,338 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:56,338 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] [2021-01-06 19:24:56,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:24:56,339 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:56,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:56,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-01-06 19:24:56,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:56,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106730849] [2021-01-06 19:24:56,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:56,414 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:24:56,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106730849] [2021-01-06 19:24:56,418 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:56,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:24:56,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799365555] [2021-01-06 19:24:56,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:56,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:56,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:56,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:56,422 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2021-01-06 19:24:56,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:56,531 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2021-01-06 19:24:56,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:56,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 19:24:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:56,535 INFO L225 Difference]: With dead ends: 384 [2021-01-06 19:24:56,535 INFO L226 Difference]: Without dead ends: 246 [2021-01-06 19:24:56,537 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:24:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-01-06 19:24:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2021-01-06 19:24:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 19:24:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2021-01-06 19:24:56,576 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2021-01-06 19:24:56,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:56,582 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2021-01-06 19:24:56,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:56,582 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2021-01-06 19:24:56,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:56,584 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:56,584 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] [2021-01-06 19:24:56,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:24:56,585 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:56,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:56,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-01-06 19:24:56,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:56,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620960375] [2021-01-06 19:24:56,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:56,695 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:24:56,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620960375] [2021-01-06 19:24:56,696 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:56,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:56,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847763601] [2021-01-06 19:24:56,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:56,697 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:56,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:56,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:56,701 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 4 states. [2021-01-06 19:24:56,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:56,804 INFO L93 Difference]: Finished difference Result 578 states and 863 transitions. [2021-01-06 19:24:56,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:56,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-01-06 19:24:56,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:56,808 INFO L225 Difference]: With dead ends: 578 [2021-01-06 19:24:56,808 INFO L226 Difference]: Without dead ends: 343 [2021-01-06 19:24:56,810 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:24:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-01-06 19:24:56,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2021-01-06 19:24:56,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 19:24:56,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2021-01-06 19:24:56,835 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 39 [2021-01-06 19:24:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:56,836 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2021-01-06 19:24:56,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2021-01-06 19:24:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:56,837 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:56,837 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] [2021-01-06 19:24:56,838 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:24:56,838 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:56,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2021-01-06 19:24:56,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:56,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256358107] [2021-01-06 19:24:56,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:56,882 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:24:56,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256358107] [2021-01-06 19:24:56,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:56,883 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:24:56,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381773825] [2021-01-06 19:24:56,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:56,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:56,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:56,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:56,886 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand 3 states. [2021-01-06 19:24:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:56,962 INFO L93 Difference]: Finished difference Result 476 states and 708 transitions. [2021-01-06 19:24:56,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:56,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-01-06 19:24:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:56,965 INFO L225 Difference]: With dead ends: 476 [2021-01-06 19:24:56,965 INFO L226 Difference]: Without dead ends: 242 [2021-01-06 19:24:56,967 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:24:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-01-06 19:24:56,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-01-06 19:24:56,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 19:24:56,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 345 transitions. [2021-01-06 19:24:56,990 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 345 transitions. Word has length 39 [2021-01-06 19:24:56,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:56,990 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 345 transitions. [2021-01-06 19:24:56,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2021-01-06 19:24:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:56,992 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:56,992 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] [2021-01-06 19:24:56,993 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:24:56,993 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2021-01-06 19:24:56,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:56,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742973507] [2021-01-06 19:24:56,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:57,054 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:24:57,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742973507] [2021-01-06 19:24:57,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:57,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:57,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095648811] [2021-01-06 19:24:57,057 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:57,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:57,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:57,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:57,059 INFO L87 Difference]: Start difference. First operand 242 states and 345 transitions. Second operand 4 states. [2021-01-06 19:24:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:57,190 INFO L93 Difference]: Finished difference Result 560 states and 799 transitions. [2021-01-06 19:24:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:57,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-01-06 19:24:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:57,193 INFO L225 Difference]: With dead ends: 560 [2021-01-06 19:24:57,193 INFO L226 Difference]: Without dead ends: 327 [2021-01-06 19:24:57,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:57,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-01-06 19:24:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 242. [2021-01-06 19:24:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-01-06 19:24:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 342 transitions. [2021-01-06 19:24:57,218 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 342 transitions. Word has length 39 [2021-01-06 19:24:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:57,219 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 342 transitions. [2021-01-06 19:24:57,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 342 transitions. [2021-01-06 19:24:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-01-06 19:24:57,220 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:57,221 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] [2021-01-06 19:24:57,221 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:24:57,221 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:57,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:57,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2021-01-06 19:24:57,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:57,222 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660865582] [2021-01-06 19:24:57,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:57,267 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:24:57,267 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660865582] [2021-01-06 19:24:57,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:57,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:57,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032333175] [2021-01-06 19:24:57,268 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:57,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:57,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:57,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:57,270 INFO L87 Difference]: Start difference. First operand 242 states and 342 transitions. Second operand 4 states. [2021-01-06 19:24:57,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:57,441 INFO L93 Difference]: Finished difference Result 820 states and 1159 transitions. [2021-01-06 19:24:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:57,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-01-06 19:24:57,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:57,445 INFO L225 Difference]: With dead ends: 820 [2021-01-06 19:24:57,446 INFO L226 Difference]: Without dead ends: 589 [2021-01-06 19:24:57,448 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:24:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-01-06 19:24:57,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2021-01-06 19:24:57,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2021-01-06 19:24:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2021-01-06 19:24:57,501 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 39 [2021-01-06 19:24:57,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:57,501 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2021-01-06 19:24:57,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2021-01-06 19:24:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 19:24:57,504 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:57,504 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:57,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:24:57,504 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:57,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash -251336852, now seen corresponding path program 1 times [2021-01-06 19:24:57,505 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:57,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245922982] [2021-01-06 19:24:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:24:57,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245922982] [2021-01-06 19:24:57,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:57,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:24:57,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135001659] [2021-01-06 19:24:57,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:24:57,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:57,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:24:57,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:57,567 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand 5 states. [2021-01-06 19:24:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:57,867 INFO L93 Difference]: Finished difference Result 1379 states and 1933 transitions. [2021-01-06 19:24:57,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:24:57,868 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-01-06 19:24:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:57,873 INFO L225 Difference]: With dead ends: 1379 [2021-01-06 19:24:57,874 INFO L226 Difference]: Without dead ends: 859 [2021-01-06 19:24:57,875 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:24:57,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-01-06 19:24:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2021-01-06 19:24:57,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2021-01-06 19:24:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 765 transitions. [2021-01-06 19:24:57,944 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 765 transitions. Word has length 51 [2021-01-06 19:24:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:57,947 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 765 transitions. [2021-01-06 19:24:57,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:24:57,947 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 765 transitions. [2021-01-06 19:24:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 19:24:57,948 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:57,949 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:57,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:24:57,949 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:57,951 INFO L82 PathProgramCache]: Analyzing trace with hash 450263022, now seen corresponding path program 1 times [2021-01-06 19:24:57,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:57,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162510025] [2021-01-06 19:24:57,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:58,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:24:58,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162510025] [2021-01-06 19:24:58,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:58,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:58,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130496086] [2021-01-06 19:24:58,042 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:24:58,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:58,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:24:58,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:24:58,044 INFO L87 Difference]: Start difference. First operand 562 states and 765 transitions. Second operand 4 states. [2021-01-06 19:24:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:58,180 INFO L93 Difference]: Finished difference Result 1340 states and 1827 transitions. [2021-01-06 19:24:58,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:24:58,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-01-06 19:24:58,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:58,185 INFO L225 Difference]: With dead ends: 1340 [2021-01-06 19:24:58,186 INFO L226 Difference]: Without dead ends: 801 [2021-01-06 19:24:58,188 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-01-06 19:24:58,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 562. [2021-01-06 19:24:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2021-01-06 19:24:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2021-01-06 19:24:58,247 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2021-01-06 19:24:58,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:58,247 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2021-01-06 19:24:58,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:24:58,248 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2021-01-06 19:24:58,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-01-06 19:24:58,255 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:58,255 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:58,256 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:24:58,256 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:58,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:58,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1836466416, now seen corresponding path program 1 times [2021-01-06 19:24:58,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:58,258 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244780448] [2021-01-06 19:24:58,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:58,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:58,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244780448] [2021-01-06 19:24:58,364 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:58,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:58,365 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266529283] [2021-01-06 19:24:58,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:58,365 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:58,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:58,367 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand 3 states. [2021-01-06 19:24:58,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:58,525 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2021-01-06 19:24:58,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:58,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-01-06 19:24:58,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:58,531 INFO L225 Difference]: With dead ends: 1555 [2021-01-06 19:24:58,531 INFO L226 Difference]: Without dead ends: 1018 [2021-01-06 19:24:58,533 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:24:58,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-01-06 19:24:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2021-01-06 19:24:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2021-01-06 19:24:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2021-01-06 19:24:58,626 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2021-01-06 19:24:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:58,627 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2021-01-06 19:24:58,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2021-01-06 19:24:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-01-06 19:24:58,629 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:58,629 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:58,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:24:58,629 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1282971825, now seen corresponding path program 1 times [2021-01-06 19:24:58,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:58,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441457982] [2021-01-06 19:24:58,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:24:58,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441457982] [2021-01-06 19:24:58,722 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:58,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:24:58,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768216961] [2021-01-06 19:24:58,724 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:58,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:58,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:58,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:58,727 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand 3 states. [2021-01-06 19:24:58,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:58,917 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2021-01-06 19:24:58,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:58,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2021-01-06 19:24:58,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:58,932 INFO L225 Difference]: With dead ends: 2328 [2021-01-06 19:24:58,932 INFO L226 Difference]: Without dead ends: 1624 [2021-01-06 19:24:58,934 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:24:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2021-01-06 19:24:59,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2021-01-06 19:24:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2021-01-06 19:24:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2021-01-06 19:24:59,049 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2021-01-06 19:24:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:59,050 INFO L481 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2021-01-06 19:24:59,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:24:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2021-01-06 19:24:59,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:24:59,051 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:59,051 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:59,052 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:24:59,052 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:59,052 INFO L82 PathProgramCache]: Analyzing trace with hash -778511866, now seen corresponding path program 1 times [2021-01-06 19:24:59,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:59,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723689663] [2021-01-06 19:24:59,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:59,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723689663] [2021-01-06 19:24:59,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:59,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:24:59,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192653134] [2021-01-06 19:24:59,099 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:24:59,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:59,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:24:59,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:24:59,100 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand 5 states. [2021-01-06 19:24:59,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:59,341 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2021-01-06 19:24:59,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:24:59,342 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-01-06 19:24:59,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:59,352 INFO L225 Difference]: With dead ends: 2606 [2021-01-06 19:24:59,352 INFO L226 Difference]: Without dead ends: 1600 [2021-01-06 19:24:59,355 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-01-06 19:24:59,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-01-06 19:24:59,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2021-01-06 19:24:59,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2021-01-06 19:24:59,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2021-01-06 19:24:59,497 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2021-01-06 19:24:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:24:59,497 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2021-01-06 19:24:59,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:24:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2021-01-06 19:24:59,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-01-06 19:24:59,499 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:24:59,499 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:24:59,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:24:59,499 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:24:59,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:24:59,500 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2021-01-06 19:24:59,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:24:59,501 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807209092] [2021-01-06 19:24:59,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:24:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:24:59,565 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:24:59,565 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807209092] [2021-01-06 19:24:59,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:24:59,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:24:59,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390373805] [2021-01-06 19:24:59,566 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:24:59,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:24:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:24:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:24:59,567 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand 3 states. [2021-01-06 19:24:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:24:59,804 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2021-01-06 19:24:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:24:59,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-01-06 19:24:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:24:59,822 INFO L225 Difference]: With dead ends: 3754 [2021-01-06 19:24:59,822 INFO L226 Difference]: Without dead ends: 2454 [2021-01-06 19:24:59,825 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:24:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2021-01-06 19:25:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2021-01-06 19:25:00,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2021-01-06 19:25:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2021-01-06 19:25:00,023 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2021-01-06 19:25:00,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:00,024 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2021-01-06 19:25:00,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2021-01-06 19:25:00,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-01-06 19:25:00,026 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:00,026 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:00,026 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:25:00,026 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:00,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2021-01-06 19:25:00,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:00,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556681859] [2021-01-06 19:25:00,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:00,065 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556681859] [2021-01-06 19:25:00,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:00,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:25:00,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324629570] [2021-01-06 19:25:00,066 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:00,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:00,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:00,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:00,068 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand 4 states. [2021-01-06 19:25:00,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:00,334 INFO L93 Difference]: Finished difference Result 4276 states and 5307 transitions. [2021-01-06 19:25:00,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:25:00,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-01-06 19:25:00,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:00,344 INFO L225 Difference]: With dead ends: 4276 [2021-01-06 19:25:00,344 INFO L226 Difference]: Without dead ends: 1875 [2021-01-06 19:25:00,354 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2021-01-06 19:25:00,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1871. [2021-01-06 19:25:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2021-01-06 19:25:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2021-01-06 19:25:00,526 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2021-01-06 19:25:00,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:00,529 INFO L481 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2021-01-06 19:25:00,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2021-01-06 19:25:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:25:00,538 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:00,538 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:00,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:25:00,539 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:00,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1707646253, now seen corresponding path program 1 times [2021-01-06 19:25:00,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:00,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498891060] [2021-01-06 19:25:00,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:25:00,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498891060] [2021-01-06 19:25:00,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:00,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:25:00,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370574558] [2021-01-06 19:25:00,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:00,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:00,602 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand 4 states. [2021-01-06 19:25:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:00,835 INFO L93 Difference]: Finished difference Result 3747 states and 4574 transitions. [2021-01-06 19:25:00,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:25:00,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-01-06 19:25:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:00,844 INFO L225 Difference]: With dead ends: 3747 [2021-01-06 19:25:00,844 INFO L226 Difference]: Without dead ends: 1634 [2021-01-06 19:25:00,849 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:00,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2021-01-06 19:25:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1596. [2021-01-06 19:25:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2021-01-06 19:25:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2021-01-06 19:25:01,036 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2021-01-06 19:25:01,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:01,037 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2021-01-06 19:25:01,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2021-01-06 19:25:01,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:25:01,039 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:01,039 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:01,040 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:25:01,040 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:01,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:01,041 INFO L82 PathProgramCache]: Analyzing trace with hash -539668684, now seen corresponding path program 1 times [2021-01-06 19:25:01,041 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:01,041 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550254500] [2021-01-06 19:25:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:01,094 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:01,095 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550254500] [2021-01-06 19:25:01,095 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:01,095 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:25:01,095 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227408818] [2021-01-06 19:25:01,096 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:01,096 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:01,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:01,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:01,097 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand 4 states. [2021-01-06 19:25:01,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:01,240 INFO L93 Difference]: Finished difference Result 2614 states and 3137 transitions. [2021-01-06 19:25:01,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:25:01,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-01-06 19:25:01,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:01,244 INFO L225 Difference]: With dead ends: 2614 [2021-01-06 19:25:01,244 INFO L226 Difference]: Without dead ends: 728 [2021-01-06 19:25:01,248 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:01,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2021-01-06 19:25:01,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 716. [2021-01-06 19:25:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-01-06 19:25:01,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2021-01-06 19:25:01,304 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2021-01-06 19:25:01,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:01,304 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2021-01-06 19:25:01,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:01,305 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2021-01-06 19:25:01,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-01-06 19:25:01,306 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:01,306 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:01,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:25:01,306 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:01,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:01,307 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2021-01-06 19:25:01,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:01,307 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672596606] [2021-01-06 19:25:01,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:01,359 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:01,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672596606] [2021-01-06 19:25:01,362 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:01,362 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:01,362 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482053273] [2021-01-06 19:25:01,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:01,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:01,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:01,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:01,364 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2021-01-06 19:25:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:01,441 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2021-01-06 19:25:01,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:01,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-01-06 19:25:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:01,444 INFO L225 Difference]: With dead ends: 1048 [2021-01-06 19:25:01,444 INFO L226 Difference]: Without dead ends: 594 [2021-01-06 19:25:01,446 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:25:01,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-01-06 19:25:01,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2021-01-06 19:25:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2021-01-06 19:25:01,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2021-01-06 19:25:01,492 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2021-01-06 19:25:01,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:01,492 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2021-01-06 19:25:01,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2021-01-06 19:25:01,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-01-06 19:25:01,494 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:01,494 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:01,494 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:25:01,494 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:01,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:01,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2021-01-06 19:25:01,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:01,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486007752] [2021-01-06 19:25:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:01,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486007752] [2021-01-06 19:25:01,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:01,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:25:01,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630130826] [2021-01-06 19:25:01,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:01,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:01,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:01,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:01,637 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2021-01-06 19:25:01,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:01,727 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2021-01-06 19:25:01,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:01,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-01-06 19:25:01,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:01,731 INFO L225 Difference]: With dead ends: 598 [2021-01-06 19:25:01,731 INFO L226 Difference]: Without dead ends: 596 [2021-01-06 19:25:01,733 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-01-06 19:25:01,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2021-01-06 19:25:01,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2021-01-06 19:25:01,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2021-01-06 19:25:01,807 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2021-01-06 19:25:01,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:01,807 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2021-01-06 19:25:01,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:01,808 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2021-01-06 19:25:01,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 19:25:01,809 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:01,809 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:01,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:25:01,809 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:01,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2021-01-06 19:25:01,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:01,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246477647] [2021-01-06 19:25:01,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:01,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-01-06 19:25:01,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246477647] [2021-01-06 19:25:01,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:01,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:01,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663066124] [2021-01-06 19:25:01,869 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:01,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:01,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:01,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:01,870 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2021-01-06 19:25:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:01,975 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2021-01-06 19:25:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:01,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 19:25:01,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:01,980 INFO L225 Difference]: With dead ends: 1230 [2021-01-06 19:25:01,981 INFO L226 Difference]: Without dead ends: 900 [2021-01-06 19:25:01,982 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:25:01,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-01-06 19:25:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2021-01-06 19:25:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2021-01-06 19:25:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2021-01-06 19:25:02,044 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2021-01-06 19:25:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:02,045 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2021-01-06 19:25:02,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2021-01-06 19:25:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:25:02,046 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:02,047 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:02,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:25:02,047 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:02,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:02,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2021-01-06 19:25:02,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:02,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547056870] [2021-01-06 19:25:02,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:25:02,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:25:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:25:02,081 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:25:02,125 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 19:25:02,125 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 19:25:02,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:25:02,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:25:02 BoogieIcfgContainer [2021-01-06 19:25:02,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:25:02,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:25:02,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:25:02,260 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:25:02,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:24:55" (3/4) ... [2021-01-06 19:25:02,263 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 19:25:02,436 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/token_ring.01.cil-2.c-witness.graphml [2021-01-06 19:25:02,436 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:25:02,438 INFO L168 Benchmark]: Toolchain (without parser) took 8163.10 ms. Allocated memory was 151.0 MB in the beginning and 267.4 MB in the end (delta: 116.4 MB). Free memory was 125.9 MB in the beginning and 168.6 MB in the end (delta: -42.7 MB). Peak memory consumption was 73.8 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:02,439 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 132.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:25:02,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 455.53 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 112.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:02,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.94 ms. Allocated memory is still 151.0 MB. Free memory was 112.5 MB in the beginning and 110.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:02,440 INFO L168 Benchmark]: Boogie Preprocessor took 67.11 ms. Allocated memory is still 151.0 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:02,440 INFO L168 Benchmark]: RCFGBuilder took 949.72 ms. Allocated memory is still 151.0 MB. Free memory was 107.9 MB in the beginning and 96.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:02,441 INFO L168 Benchmark]: TraceAbstraction took 6443.47 ms. Allocated memory was 151.0 MB in the beginning and 267.4 MB in the end (delta: 116.4 MB). Free memory was 95.6 MB in the beginning and 181.7 MB in the end (delta: -86.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:02,441 INFO L168 Benchmark]: Witness Printer took 176.81 ms. Allocated memory is still 267.4 MB. Free memory was 181.7 MB in the beginning and 168.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-01-06 19:25:02,443 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 151.0 MB. Free memory is still 132.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 455.53 ms. Allocated memory is still 151.0 MB. Free memory was 125.7 MB in the beginning and 112.5 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 58.94 ms. Allocated memory is still 151.0 MB. Free memory was 112.5 MB in the beginning and 110.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 67.11 ms. Allocated memory is still 151.0 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 949.72 ms. Allocated memory is still 151.0 MB. Free memory was 107.9 MB in the beginning and 96.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6443.47 ms. Allocated memory was 151.0 MB in the beginning and 267.4 MB in the end (delta: 116.4 MB). Free memory was 95.6 MB in the beginning and 181.7 MB in the end (delta: -86.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 8.0 GB. * Witness Printer took 176.81 ms. Allocated memory is still 267.4 MB. Free memory was 181.7 MB in the beginning and 168.6 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; [L392] m_i = 1 [L393] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L174] COND TRUE m_i == 1 [L175] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L263] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L268] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L273] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L278] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L140] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L144] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L159] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L291] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L296] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L432] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] kernel_st = 1 [L210] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L92] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L47] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L140] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L144] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L159] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 [L112] E_M = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 [L130] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L39] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L61] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L66] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L67] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L74] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L12] reach_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.2s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3984 SDtfs, 5328 SDslu, 3898 SDs, 0 SdLazy, 453 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2426occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 1746 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1087 ConstructedInterpolants, 0 QuantifiedInterpolants, 147019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 204/204 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...