/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.03.cil-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:24:58,881 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:24:58,884 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:24:58,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:24:58,930 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:24:58,935 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:24:58,938 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:24:58,944 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:24:58,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:24:58,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:24:58,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:24:58,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:24:58,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:24:58,963 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:24:58,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:24:58,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:24:58,981 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:24:58,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:24:58,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:24:58,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:24:58,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:24:58,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:24:59,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:24:59,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:24:59,004 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:24:59,004 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:24:59,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:24:59,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:24:59,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:24:59,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:24:59,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:24:59,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:24:59,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:24:59,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:24:59,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:24:59,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:24:59,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:24:59,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:24:59,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:24:59,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:24:59,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:24:59,016 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:59,044 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:24:59,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:24:59,046 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:24:59,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:24:59,047 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:24:59,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:24:59,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:24:59,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:24:59,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:24:59,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:24:59,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:24:59,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:24:59,048 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:24:59,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:24:59,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:24:59,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:24:59,049 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:24:59,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:24:59,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:24:59,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:24:59,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:24:59,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:24:59,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:24:59,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:24:59,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:24:59,051 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:59,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:24:59,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:24:59,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:24:59,539 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:24:59,540 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:24:59,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-01-06 19:24:59,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0b115ee13/c4c440c9dbcb4caea176c2ec712d2882/FLAG8b06ec0a3 [2021-01-06 19:25:00,254 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:25:00,257 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2021-01-06 19:25:00,278 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0b115ee13/c4c440c9dbcb4caea176c2ec712d2882/FLAG8b06ec0a3 [2021-01-06 19:25:00,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/0b115ee13/c4c440c9dbcb4caea176c2ec712d2882 [2021-01-06 19:25:00,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:25:00,606 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:25:00,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:25:00,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:25:00,615 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:25:00,617 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:25:00" (1/1) ... [2021-01-06 19:25:00,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6587bc16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:00, skipping insertion in model container [2021-01-06 19:25:00,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:25:00" (1/1) ... [2021-01-06 19:25:00,629 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:25:00,689 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:25:00,848 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.03.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~5,] [2021-01-06 19:25:00,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:25:00,967 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:25:00,987 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.03.cil-1.c[366,379] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~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~5,] [2021-01-06 19:25:01,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:25:01,095 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:25:01,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01 WrapperNode [2021-01-06 19:25:01,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:25:01,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:25:01,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:25:01,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:25:01,107 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:25:01" (1/1) ... [2021-01-06 19:25:01,119 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:25:01" (1/1) ... [2021-01-06 19:25:01,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:25:01,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:25:01,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:25:01,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:25:01,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01" (1/1) ... [2021-01-06 19:25:01,241 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01" (1/1) ... [2021-01-06 19:25:01,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01" (1/1) ... [2021-01-06 19:25:01,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01" (1/1) ... [2021-01-06 19:25:01,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01" (1/1) ... [2021-01-06 19:25:01,337 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01" (1/1) ... [2021-01-06 19:25:01,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01" (1/1) ... [2021-01-06 19:25:01,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:25:01,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:25:01,370 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:25:01,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:25:01,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01" (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:25:01,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:25:01,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:25:01,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:25:01,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:25:02,932 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:25:02,933 INFO L299 CfgBuilder]: Removed 132 assume(true) statements. [2021-01-06 19:25:02,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:25:02 BoogieIcfgContainer [2021-01-06 19:25:02,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:25:02,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:25:02,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:25:02,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:25:02,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:25:00" (1/3) ... [2021-01-06 19:25:02,950 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccbdf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:25:02, skipping insertion in model container [2021-01-06 19:25:02,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:25:01" (2/3) ... [2021-01-06 19:25:02,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ccbdf5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:25:02, skipping insertion in model container [2021-01-06 19:25:02,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:25:02" (3/3) ... [2021-01-06 19:25:02,956 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2021-01-06 19:25:02,963 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:25:02,970 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 19:25:02,991 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 19:25:03,045 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:25:03,045 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:25:03,046 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:25:03,046 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:25:03,046 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:25:03,046 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:25:03,046 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:25:03,046 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:25:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states. [2021-01-06 19:25:03,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:03,087 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:03,088 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:03,089 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:03,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:03,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1976596934, now seen corresponding path program 1 times [2021-01-06 19:25:03,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:03,107 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998528284] [2021-01-06 19:25:03,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:03,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:03,407 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:25:03,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998528284] [2021-01-06 19:25:03,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:03,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:03,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950749901] [2021-01-06 19:25:03,420 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:03,420 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:03,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:03,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:03,439 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 3 states. [2021-01-06 19:25:03,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:03,554 INFO L93 Difference]: Finished difference Result 627 states and 979 transitions. [2021-01-06 19:25:03,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:03,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 19:25:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:03,575 INFO L225 Difference]: With dead ends: 627 [2021-01-06 19:25:03,576 INFO L226 Difference]: Without dead ends: 312 [2021-01-06 19:25:03,581 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2021-01-06 19:25:03,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2021-01-06 19:25:03,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2021-01-06 19:25:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 474 transitions. [2021-01-06 19:25:03,658 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 474 transitions. Word has length 61 [2021-01-06 19:25:03,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:03,659 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 474 transitions. [2021-01-06 19:25:03,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:03,659 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 474 transitions. [2021-01-06 19:25:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:03,662 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:03,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:03,662 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:25:03,663 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:03,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1057453112, now seen corresponding path program 1 times [2021-01-06 19:25:03,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:03,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463313433] [2021-01-06 19:25:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:03,741 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:25:03,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463313433] [2021-01-06 19:25:03,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:03,743 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:03,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353235014] [2021-01-06 19:25:03,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:03,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:03,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:03,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:03,747 INFO L87 Difference]: Start difference. First operand 312 states and 474 transitions. Second operand 3 states. [2021-01-06 19:25:03,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:03,852 INFO L93 Difference]: Finished difference Result 848 states and 1286 transitions. [2021-01-06 19:25:03,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:03,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 19:25:03,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:03,858 INFO L225 Difference]: With dead ends: 848 [2021-01-06 19:25:03,859 INFO L226 Difference]: Without dead ends: 544 [2021-01-06 19:25:03,862 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:25:03,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2021-01-06 19:25:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2021-01-06 19:25:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2021-01-06 19:25:03,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 818 transitions. [2021-01-06 19:25:03,923 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 818 transitions. Word has length 61 [2021-01-06 19:25:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:03,923 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 818 transitions. [2021-01-06 19:25:03,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 818 transitions. [2021-01-06 19:25:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:03,926 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:03,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:03,926 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:25:03,927 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:03,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:03,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1933472118, now seen corresponding path program 1 times [2021-01-06 19:25:03,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:03,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47227816] [2021-01-06 19:25:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:04,005 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:25:04,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47227816] [2021-01-06 19:25:04,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:04,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:04,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529364420] [2021-01-06 19:25:04,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:04,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:04,010 INFO L87 Difference]: Start difference. First operand 540 states and 818 transitions. Second operand 4 states. [2021-01-06 19:25:04,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:04,168 INFO L93 Difference]: Finished difference Result 1302 states and 1969 transitions. [2021-01-06 19:25:04,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:04,169 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 19:25:04,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:04,176 INFO L225 Difference]: With dead ends: 1302 [2021-01-06 19:25:04,176 INFO L226 Difference]: Without dead ends: 771 [2021-01-06 19:25:04,182 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:25:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2021-01-06 19:25:04,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 540. [2021-01-06 19:25:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2021-01-06 19:25:04,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 815 transitions. [2021-01-06 19:25:04,262 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 815 transitions. Word has length 61 [2021-01-06 19:25:04,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:04,270 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 815 transitions. [2021-01-06 19:25:04,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:04,270 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 815 transitions. [2021-01-06 19:25:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:04,275 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:04,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:04,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:25:04,276 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:04,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:04,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1917594504, now seen corresponding path program 1 times [2021-01-06 19:25:04,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:04,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031381712] [2021-01-06 19:25:04,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:04,375 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:25:04,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031381712] [2021-01-06 19:25:04,376 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:04,376 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:04,377 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510017666] [2021-01-06 19:25:04,377 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:04,377 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:04,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:04,379 INFO L87 Difference]: Start difference. First operand 540 states and 815 transitions. Second operand 4 states. [2021-01-06 19:25:04,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:04,495 INFO L93 Difference]: Finished difference Result 1300 states and 1959 transitions. [2021-01-06 19:25:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:04,496 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 19:25:04,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:04,501 INFO L225 Difference]: With dead ends: 1300 [2021-01-06 19:25:04,501 INFO L226 Difference]: Without dead ends: 770 [2021-01-06 19:25:04,503 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:25:04,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2021-01-06 19:25:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 540. [2021-01-06 19:25:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2021-01-06 19:25:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 812 transitions. [2021-01-06 19:25:04,545 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 812 transitions. Word has length 61 [2021-01-06 19:25:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:04,545 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 812 transitions. [2021-01-06 19:25:04,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 812 transitions. [2021-01-06 19:25:04,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:04,547 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:04,548 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:04,548 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:25:04,548 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:04,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:04,549 INFO L82 PathProgramCache]: Analyzing trace with hash -379254474, now seen corresponding path program 1 times [2021-01-06 19:25:04,549 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:04,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251748408] [2021-01-06 19:25:04,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:04,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:04,618 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:25:04,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251748408] [2021-01-06 19:25:04,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:04,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:04,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707386040] [2021-01-06 19:25:04,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:04,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:04,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:04,623 INFO L87 Difference]: Start difference. First operand 540 states and 812 transitions. Second operand 3 states. [2021-01-06 19:25:04,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:04,675 INFO L93 Difference]: Finished difference Result 1069 states and 1609 transitions. [2021-01-06 19:25:04,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:04,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 19:25:04,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:04,679 INFO L225 Difference]: With dead ends: 1069 [2021-01-06 19:25:04,679 INFO L226 Difference]: Without dead ends: 540 [2021-01-06 19:25:04,681 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:25:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-01-06 19:25:04,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2021-01-06 19:25:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2021-01-06 19:25:04,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 804 transitions. [2021-01-06 19:25:04,716 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 804 transitions. Word has length 61 [2021-01-06 19:25:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:04,717 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 804 transitions. [2021-01-06 19:25:04,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 804 transitions. [2021-01-06 19:25:04,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:04,719 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:04,719 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:04,720 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:25:04,720 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:04,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:04,721 INFO L82 PathProgramCache]: Analyzing trace with hash 198182970, now seen corresponding path program 1 times [2021-01-06 19:25:04,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:04,721 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191453387] [2021-01-06 19:25:04,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:04,769 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:25:04,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191453387] [2021-01-06 19:25:04,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:04,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:04,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152452664] [2021-01-06 19:25:04,771 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:04,771 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:04,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:04,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:04,772 INFO L87 Difference]: Start difference. First operand 540 states and 804 transitions. Second operand 3 states. [2021-01-06 19:25:04,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:04,850 INFO L93 Difference]: Finished difference Result 1068 states and 1592 transitions. [2021-01-06 19:25:04,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:04,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 19:25:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:04,854 INFO L225 Difference]: With dead ends: 1068 [2021-01-06 19:25:04,854 INFO L226 Difference]: Without dead ends: 540 [2021-01-06 19:25:04,856 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:25:04,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-01-06 19:25:04,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2021-01-06 19:25:04,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2021-01-06 19:25:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 786 transitions. [2021-01-06 19:25:04,892 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 786 transitions. Word has length 61 [2021-01-06 19:25:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:04,892 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 786 transitions. [2021-01-06 19:25:04,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 786 transitions. [2021-01-06 19:25:04,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:04,907 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:04,907 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:04,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:25:04,908 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:04,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:04,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1144447607, now seen corresponding path program 1 times [2021-01-06 19:25:04,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:04,914 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595020741] [2021-01-06 19:25:04,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:05,014 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:25:05,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595020741] [2021-01-06 19:25:05,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:05,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:05,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91660664] [2021-01-06 19:25:05,019 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:05,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:05,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:05,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:05,021 INFO L87 Difference]: Start difference. First operand 540 states and 786 transitions. Second operand 3 states. [2021-01-06 19:25:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:05,098 INFO L93 Difference]: Finished difference Result 1066 states and 1553 transitions. [2021-01-06 19:25:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:05,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 19:25:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:05,102 INFO L225 Difference]: With dead ends: 1066 [2021-01-06 19:25:05,102 INFO L226 Difference]: Without dead ends: 540 [2021-01-06 19:25:05,104 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:25:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-01-06 19:25:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2021-01-06 19:25:05,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2021-01-06 19:25:05,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 768 transitions. [2021-01-06 19:25:05,144 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 768 transitions. Word has length 61 [2021-01-06 19:25:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:05,144 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 768 transitions. [2021-01-06 19:25:05,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:05,145 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 768 transitions. [2021-01-06 19:25:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:05,145 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:05,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:05,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:25:05,146 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:05,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:05,147 INFO L82 PathProgramCache]: Analyzing trace with hash 485983540, now seen corresponding path program 1 times [2021-01-06 19:25:05,147 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:05,147 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154434009] [2021-01-06 19:25:05,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:05,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:05,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154434009] [2021-01-06 19:25:05,226 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:05,226 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:05,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541452795] [2021-01-06 19:25:05,227 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:05,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:05,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:05,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:05,229 INFO L87 Difference]: Start difference. First operand 540 states and 768 transitions. Second operand 3 states. [2021-01-06 19:25:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:05,306 INFO L93 Difference]: Finished difference Result 1065 states and 1516 transitions. [2021-01-06 19:25:05,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:05,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 19:25:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:05,311 INFO L225 Difference]: With dead ends: 1065 [2021-01-06 19:25:05,311 INFO L226 Difference]: Without dead ends: 540 [2021-01-06 19:25:05,313 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:25:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2021-01-06 19:25:05,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2021-01-06 19:25:05,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2021-01-06 19:25:05,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 750 transitions. [2021-01-06 19:25:05,351 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 750 transitions. Word has length 61 [2021-01-06 19:25:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:05,351 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 750 transitions. [2021-01-06 19:25:05,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 750 transitions. [2021-01-06 19:25:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:05,352 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:05,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:05,353 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:25:05,353 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:05,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1475481145, now seen corresponding path program 1 times [2021-01-06 19:25:05,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:05,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46775811] [2021-01-06 19:25:05,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:05,441 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:25:05,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46775811] [2021-01-06 19:25:05,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:05,442 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:05,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239646864] [2021-01-06 19:25:05,443 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:05,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:05,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:05,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:05,444 INFO L87 Difference]: Start difference. First operand 540 states and 750 transitions. Second operand 5 states. [2021-01-06 19:25:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:05,631 INFO L93 Difference]: Finished difference Result 1372 states and 1926 transitions. [2021-01-06 19:25:05,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:05,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2021-01-06 19:25:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:05,637 INFO L225 Difference]: With dead ends: 1372 [2021-01-06 19:25:05,637 INFO L226 Difference]: Without dead ends: 854 [2021-01-06 19:25:05,639 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:25:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-01-06 19:25:05,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 546. [2021-01-06 19:25:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2021-01-06 19:25:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 746 transitions. [2021-01-06 19:25:05,686 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 746 transitions. Word has length 61 [2021-01-06 19:25:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:05,687 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 746 transitions. [2021-01-06 19:25:05,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 746 transitions. [2021-01-06 19:25:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:05,688 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:05,688 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:05,688 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:25:05,688 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:05,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:05,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1899127867, now seen corresponding path program 1 times [2021-01-06 19:25:05,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:05,689 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686967530] [2021-01-06 19:25:05,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:05,743 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:25:05,743 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686967530] [2021-01-06 19:25:05,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:05,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:05,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346790616] [2021-01-06 19:25:05,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:05,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:05,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:05,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:05,746 INFO L87 Difference]: Start difference. First operand 546 states and 746 transitions. Second operand 5 states. [2021-01-06 19:25:06,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:06,040 INFO L93 Difference]: Finished difference Result 1918 states and 2625 transitions. [2021-01-06 19:25:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:06,042 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2021-01-06 19:25:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:06,052 INFO L225 Difference]: With dead ends: 1918 [2021-01-06 19:25:06,052 INFO L226 Difference]: Without dead ends: 1401 [2021-01-06 19:25:06,055 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:25:06,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2021-01-06 19:25:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 582. [2021-01-06 19:25:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2021-01-06 19:25:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 782 transitions. [2021-01-06 19:25:06,120 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 782 transitions. Word has length 61 [2021-01-06 19:25:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:06,121 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 782 transitions. [2021-01-06 19:25:06,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 782 transitions. [2021-01-06 19:25:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:06,124 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:06,124 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:06,125 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:25:06,125 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:06,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1055122365, now seen corresponding path program 1 times [2021-01-06 19:25:06,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:06,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113192393] [2021-01-06 19:25:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:06,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113192393] [2021-01-06 19:25:06,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:06,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:06,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574480587] [2021-01-06 19:25:06,220 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:06,220 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:06,223 INFO L87 Difference]: Start difference. First operand 582 states and 782 transitions. Second operand 5 states. [2021-01-06 19:25:06,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:06,429 INFO L93 Difference]: Finished difference Result 1559 states and 2113 transitions. [2021-01-06 19:25:06,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:06,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2021-01-06 19:25:06,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:06,436 INFO L225 Difference]: With dead ends: 1559 [2021-01-06 19:25:06,437 INFO L226 Difference]: Without dead ends: 1016 [2021-01-06 19:25:06,440 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:25:06,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2021-01-06 19:25:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 588. [2021-01-06 19:25:06,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2021-01-06 19:25:06,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 778 transitions. [2021-01-06 19:25:06,501 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 778 transitions. Word has length 61 [2021-01-06 19:25:06,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:06,501 INFO L481 AbstractCegarLoop]: Abstraction has 588 states and 778 transitions. [2021-01-06 19:25:06,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:06,501 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 778 transitions. [2021-01-06 19:25:06,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:06,502 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:06,502 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:06,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:25:06,503 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:06,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:06,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1853641537, now seen corresponding path program 1 times [2021-01-06 19:25:06,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:06,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412552080] [2021-01-06 19:25:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:06,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412552080] [2021-01-06 19:25:06,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:06,545 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:25:06,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434772762] [2021-01-06 19:25:06,546 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:25:06,546 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:06,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:25:06,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:25:06,547 INFO L87 Difference]: Start difference. First operand 588 states and 778 transitions. Second operand 5 states. [2021-01-06 19:25:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:06,788 INFO L93 Difference]: Finished difference Result 1612 states and 2151 transitions. [2021-01-06 19:25:06,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:06,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2021-01-06 19:25:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:06,795 INFO L225 Difference]: With dead ends: 1612 [2021-01-06 19:25:06,795 INFO L226 Difference]: Without dead ends: 1070 [2021-01-06 19:25:06,797 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:25:06,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2021-01-06 19:25:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 594. [2021-01-06 19:25:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2021-01-06 19:25:06,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 774 transitions. [2021-01-06 19:25:06,872 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 774 transitions. Word has length 61 [2021-01-06 19:25:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:06,873 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 774 transitions. [2021-01-06 19:25:06,873 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:25:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 774 transitions. [2021-01-06 19:25:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:06,874 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:06,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:06,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:25:06,874 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:06,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:06,875 INFO L82 PathProgramCache]: Analyzing trace with hash 635887425, now seen corresponding path program 1 times [2021-01-06 19:25:06,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:06,875 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337049271] [2021-01-06 19:25:06,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:06,935 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:25:06,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337049271] [2021-01-06 19:25:06,936 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:06,936 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:06,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608194003] [2021-01-06 19:25:06,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:06,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:06,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:06,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:06,939 INFO L87 Difference]: Start difference. First operand 594 states and 774 transitions. Second operand 4 states. [2021-01-06 19:25:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:07,085 INFO L93 Difference]: Finished difference Result 1389 states and 1813 transitions. [2021-01-06 19:25:07,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:07,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 19:25:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:07,092 INFO L225 Difference]: With dead ends: 1389 [2021-01-06 19:25:07,092 INFO L226 Difference]: Without dead ends: 843 [2021-01-06 19:25:07,100 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:25:07,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-01-06 19:25:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 594. [2021-01-06 19:25:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2021-01-06 19:25:07,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 769 transitions. [2021-01-06 19:25:07,170 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 769 transitions. Word has length 61 [2021-01-06 19:25:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:07,171 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 769 transitions. [2021-01-06 19:25:07,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:07,171 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 769 transitions. [2021-01-06 19:25:07,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:07,172 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:07,172 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:07,172 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:25:07,172 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:07,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:07,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1058589251, now seen corresponding path program 1 times [2021-01-06 19:25:07,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:07,173 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907431088] [2021-01-06 19:25:07,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:07,221 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:25:07,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907431088] [2021-01-06 19:25:07,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:07,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:07,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471597518] [2021-01-06 19:25:07,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:07,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:07,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:07,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:07,225 INFO L87 Difference]: Start difference. First operand 594 states and 769 transitions. Second operand 4 states. [2021-01-06 19:25:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:07,392 INFO L93 Difference]: Finished difference Result 1388 states and 1801 transitions. [2021-01-06 19:25:07,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:07,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 19:25:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:07,397 INFO L225 Difference]: With dead ends: 1388 [2021-01-06 19:25:07,397 INFO L226 Difference]: Without dead ends: 843 [2021-01-06 19:25:07,399 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:25:07,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2021-01-06 19:25:07,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 594. [2021-01-06 19:25:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2021-01-06 19:25:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 764 transitions. [2021-01-06 19:25:07,469 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 764 transitions. Word has length 61 [2021-01-06 19:25:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:07,471 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 764 transitions. [2021-01-06 19:25:07,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:07,471 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 764 transitions. [2021-01-06 19:25:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:07,472 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:07,472 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:07,472 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:25:07,472 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:07,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash 240940801, now seen corresponding path program 1 times [2021-01-06 19:25:07,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:07,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851622151] [2021-01-06 19:25:07,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:07,530 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:25:07,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851622151] [2021-01-06 19:25:07,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:07,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:07,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89077113] [2021-01-06 19:25:07,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:07,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:07,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:07,533 INFO L87 Difference]: Start difference. First operand 594 states and 764 transitions. Second operand 4 states. [2021-01-06 19:25:07,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:07,727 INFO L93 Difference]: Finished difference Result 1516 states and 1931 transitions. [2021-01-06 19:25:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:07,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2021-01-06 19:25:07,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:07,733 INFO L225 Difference]: With dead ends: 1516 [2021-01-06 19:25:07,733 INFO L226 Difference]: Without dead ends: 951 [2021-01-06 19:25:07,737 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:25:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2021-01-06 19:25:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 681. [2021-01-06 19:25:07,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2021-01-06 19:25:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 848 transitions. [2021-01-06 19:25:07,826 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 848 transitions. Word has length 61 [2021-01-06 19:25:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:07,826 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 848 transitions. [2021-01-06 19:25:07,826 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 848 transitions. [2021-01-06 19:25:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-01-06 19:25:07,827 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:07,827 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:07,828 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:25:07,828 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:07,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:07,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1347407101, now seen corresponding path program 1 times [2021-01-06 19:25:07,829 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:07,829 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122789473] [2021-01-06 19:25:07,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:07,883 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:25:07,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122789473] [2021-01-06 19:25:07,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:07,886 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:07,886 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013602053] [2021-01-06 19:25:07,887 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:07,887 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:07,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:07,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:07,889 INFO L87 Difference]: Start difference. First operand 681 states and 848 transitions. Second operand 3 states. [2021-01-06 19:25:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:08,045 INFO L93 Difference]: Finished difference Result 1893 states and 2357 transitions. [2021-01-06 19:25:08,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:08,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2021-01-06 19:25:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:08,052 INFO L225 Difference]: With dead ends: 1893 [2021-01-06 19:25:08,053 INFO L226 Difference]: Without dead ends: 1233 [2021-01-06 19:25:08,055 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:25:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2021-01-06 19:25:08,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1175. [2021-01-06 19:25:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1175 states. [2021-01-06 19:25:08,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1451 transitions. [2021-01-06 19:25:08,171 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1451 transitions. Word has length 61 [2021-01-06 19:25:08,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:08,171 INFO L481 AbstractCegarLoop]: Abstraction has 1175 states and 1451 transitions. [2021-01-06 19:25:08,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:08,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1451 transitions. [2021-01-06 19:25:08,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 19:25:08,173 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:08,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:25:08,174 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:08,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:08,176 INFO L82 PathProgramCache]: Analyzing trace with hash -648263858, now seen corresponding path program 1 times [2021-01-06 19:25:08,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:08,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894015056] [2021-01-06 19:25:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:08,280 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:08,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894015056] [2021-01-06 19:25:08,281 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:08,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:08,281 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819576427] [2021-01-06 19:25:08,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:08,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:08,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:08,284 INFO L87 Difference]: Start difference. First operand 1175 states and 1451 transitions. Second operand 4 states. [2021-01-06 19:25:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:08,642 INFO L93 Difference]: Finished difference Result 3772 states and 4664 transitions. [2021-01-06 19:25:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:25:08,642 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2021-01-06 19:25:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:08,655 INFO L225 Difference]: With dead ends: 3772 [2021-01-06 19:25:08,656 INFO L226 Difference]: Without dead ends: 2634 [2021-01-06 19:25:08,658 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:25:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states. [2021-01-06 19:25:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 2065. [2021-01-06 19:25:08,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2021-01-06 19:25:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 2544 transitions. [2021-01-06 19:25:08,857 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 2544 transitions. Word has length 99 [2021-01-06 19:25:08,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:08,858 INFO L481 AbstractCegarLoop]: Abstraction has 2065 states and 2544 transitions. [2021-01-06 19:25:08,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:08,858 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 2544 transitions. [2021-01-06 19:25:08,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-01-06 19:25:08,860 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:08,860 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:25:08,861 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:08,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash -838618223, now seen corresponding path program 1 times [2021-01-06 19:25:08,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:08,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331740484] [2021-01-06 19:25:08,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:08,912 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:08,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331740484] [2021-01-06 19:25:08,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:08,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:08,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567128973] [2021-01-06 19:25:08,913 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:08,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:08,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:08,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:08,915 INFO L87 Difference]: Start difference. First operand 2065 states and 2544 transitions. Second operand 3 states. [2021-01-06 19:25:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:09,329 INFO L93 Difference]: Finished difference Result 5823 states and 7152 transitions. [2021-01-06 19:25:09,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:09,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-01-06 19:25:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:09,348 INFO L225 Difference]: With dead ends: 5823 [2021-01-06 19:25:09,348 INFO L226 Difference]: Without dead ends: 3841 [2021-01-06 19:25:09,353 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:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3841 states. [2021-01-06 19:25:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3841 to 3837. [2021-01-06 19:25:09,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3837 states. [2021-01-06 19:25:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3837 states to 3837 states and 4666 transitions. [2021-01-06 19:25:09,759 INFO L78 Accepts]: Start accepts. Automaton has 3837 states and 4666 transitions. Word has length 99 [2021-01-06 19:25:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:09,759 INFO L481 AbstractCegarLoop]: Abstraction has 3837 states and 4666 transitions. [2021-01-06 19:25:09,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 3837 states and 4666 transitions. [2021-01-06 19:25:09,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:25:09,762 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:09,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,763 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:25:09,763 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:09,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:09,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1280283035, now seen corresponding path program 1 times [2021-01-06 19:25:09,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:09,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371090733] [2021-01-06 19:25:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:09,834 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:09,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371090733] [2021-01-06 19:25:09,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:09,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:09,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497116480] [2021-01-06 19:25:09,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:09,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:09,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:09,838 INFO L87 Difference]: Start difference. First operand 3837 states and 4666 transitions. Second operand 3 states. [2021-01-06 19:25:10,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:10,544 INFO L93 Difference]: Finished difference Result 10822 states and 13146 transitions. [2021-01-06 19:25:10,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:10,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:25:10,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:10,583 INFO L225 Difference]: With dead ends: 10822 [2021-01-06 19:25:10,583 INFO L226 Difference]: Without dead ends: 7068 [2021-01-06 19:25:10,592 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:10,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7068 states. [2021-01-06 19:25:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7068 to 7064. [2021-01-06 19:25:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7064 states. [2021-01-06 19:25:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7064 states to 7064 states and 8530 transitions. [2021-01-06 19:25:11,288 INFO L78 Accepts]: Start accepts. Automaton has 7064 states and 8530 transitions. Word has length 100 [2021-01-06 19:25:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:11,288 INFO L481 AbstractCegarLoop]: Abstraction has 7064 states and 8530 transitions. [2021-01-06 19:25:11,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 7064 states and 8530 transitions. [2021-01-06 19:25:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-01-06 19:25:11,293 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:11,293 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:25:11,293 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1663299043, now seen corresponding path program 1 times [2021-01-06 19:25:11,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:11,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988848443] [2021-01-06 19:25:11,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:11,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:25:11,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988848443] [2021-01-06 19:25:11,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:11,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:11,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034465175] [2021-01-06 19:25:11,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:11,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:11,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:11,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:11,326 INFO L87 Difference]: Start difference. First operand 7064 states and 8530 transitions. Second operand 3 states. [2021-01-06 19:25:11,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:11,890 INFO L93 Difference]: Finished difference Result 13968 states and 16884 transitions. [2021-01-06 19:25:11,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:11,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2021-01-06 19:25:11,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:11,911 INFO L225 Difference]: With dead ends: 13968 [2021-01-06 19:25:11,911 INFO L226 Difference]: Without dead ends: 6987 [2021-01-06 19:25:11,920 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:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6987 states. [2021-01-06 19:25:12,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6987 to 6987. [2021-01-06 19:25:12,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6987 states. [2021-01-06 19:25:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6987 states to 6987 states and 8445 transitions. [2021-01-06 19:25:12,594 INFO L78 Accepts]: Start accepts. Automaton has 6987 states and 8445 transitions. Word has length 100 [2021-01-06 19:25:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:12,594 INFO L481 AbstractCegarLoop]: Abstraction has 6987 states and 8445 transitions. [2021-01-06 19:25:12,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 6987 states and 8445 transitions. [2021-01-06 19:25:12,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 19:25:12,599 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:12,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12,599 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:25:12,600 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:12,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:12,601 INFO L82 PathProgramCache]: Analyzing trace with hash 291949850, now seen corresponding path program 1 times [2021-01-06 19:25:12,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:12,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416994772] [2021-01-06 19:25:12,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:12,664 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:12,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416994772] [2021-01-06 19:25:12,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:12,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:12,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658736809] [2021-01-06 19:25:12,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:12,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:12,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:12,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:12,667 INFO L87 Difference]: Start difference. First operand 6987 states and 8445 transitions. Second operand 3 states. [2021-01-06 19:25:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:13,934 INFO L93 Difference]: Finished difference Result 19767 states and 23907 transitions. [2021-01-06 19:25:13,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:13,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2021-01-06 19:25:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:13,965 INFO L225 Difference]: With dead ends: 19767 [2021-01-06 19:25:13,965 INFO L226 Difference]: Without dead ends: 12863 [2021-01-06 19:25:13,977 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:13,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12863 states. [2021-01-06 19:25:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12863 to 12859. [2021-01-06 19:25:14,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2021-01-06 19:25:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 15495 transitions. [2021-01-06 19:25:14,965 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 15495 transitions. Word has length 101 [2021-01-06 19:25:14,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:14,966 INFO L481 AbstractCegarLoop]: Abstraction has 12859 states and 15495 transitions. [2021-01-06 19:25:14,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 15495 transitions. [2021-01-06 19:25:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-01-06 19:25:14,973 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:14,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:25:14,973 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:14,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:14,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1643335068, now seen corresponding path program 1 times [2021-01-06 19:25:14,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:14,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531088531] [2021-01-06 19:25:14,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-01-06 19:25:15,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531088531] [2021-01-06 19:25:15,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:15,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:15,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691616049] [2021-01-06 19:25:15,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:15,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:15,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:15,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:15,004 INFO L87 Difference]: Start difference. First operand 12859 states and 15495 transitions. Second operand 3 states. [2021-01-06 19:25:15,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:15,867 INFO L93 Difference]: Finished difference Result 25559 states and 30817 transitions. [2021-01-06 19:25:15,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:15,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2021-01-06 19:25:15,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:15,899 INFO L225 Difference]: With dead ends: 25559 [2021-01-06 19:25:15,899 INFO L226 Difference]: Without dead ends: 12783 [2021-01-06 19:25:15,916 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:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12783 states. [2021-01-06 19:25:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12783 to 12783. [2021-01-06 19:25:16,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12783 states. [2021-01-06 19:25:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12783 states to 12783 states and 15412 transitions. [2021-01-06 19:25:16,961 INFO L78 Accepts]: Start accepts. Automaton has 12783 states and 15412 transitions. Word has length 101 [2021-01-06 19:25:16,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:16,963 INFO L481 AbstractCegarLoop]: Abstraction has 12783 states and 15412 transitions. [2021-01-06 19:25:16,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:16,963 INFO L276 IsEmpty]: Start isEmpty. Operand 12783 states and 15412 transitions. [2021-01-06 19:25:16,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-01-06 19:25:16,969 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:16,970 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,970 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:25:16,970 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:16,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:16,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1739654126, now seen corresponding path program 1 times [2021-01-06 19:25:16,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:16,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303741644] [2021-01-06 19:25:16,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:17,026 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:17,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303741644] [2021-01-06 19:25:17,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:17,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:25:17,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533363244] [2021-01-06 19:25:17,029 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:17,031 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:17,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:17,032 INFO L87 Difference]: Start difference. First operand 12783 states and 15412 transitions. Second operand 4 states. [2021-01-06 19:25:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:18,930 INFO L93 Difference]: Finished difference Result 36486 states and 43733 transitions. [2021-01-06 19:25:18,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:25:18,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2021-01-06 19:25:18,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:18,967 INFO L225 Difference]: With dead ends: 36486 [2021-01-06 19:25:18,967 INFO L226 Difference]: Without dead ends: 18163 [2021-01-06 19:25:18,997 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:19,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18163 states. [2021-01-06 19:25:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18163 to 18159. [2021-01-06 19:25:20,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18159 states. [2021-01-06 19:25:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18159 states to 18159 states and 21519 transitions. [2021-01-06 19:25:20,214 INFO L78 Accepts]: Start accepts. Automaton has 18159 states and 21519 transitions. Word has length 102 [2021-01-06 19:25:20,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:20,214 INFO L481 AbstractCegarLoop]: Abstraction has 18159 states and 21519 transitions. [2021-01-06 19:25:20,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:20,214 INFO L276 IsEmpty]: Start isEmpty. Operand 18159 states and 21519 transitions. [2021-01-06 19:25:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2021-01-06 19:25:20,227 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:20,227 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:25:20,228 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1679759540, now seen corresponding path program 1 times [2021-01-06 19:25:20,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:20,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33336730] [2021-01-06 19:25:20,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:20,283 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:20,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33336730] [2021-01-06 19:25:20,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:20,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:20,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314391878] [2021-01-06 19:25:20,285 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:20,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:20,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:20,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:20,286 INFO L87 Difference]: Start difference. First operand 18159 states and 21519 transitions. Second operand 3 states. [2021-01-06 19:25:22,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:22,033 INFO L93 Difference]: Finished difference Result 41753 states and 49348 transitions. [2021-01-06 19:25:22,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:22,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2021-01-06 19:25:22,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:22,068 INFO L225 Difference]: With dead ends: 41753 [2021-01-06 19:25:22,069 INFO L226 Difference]: Without dead ends: 23653 [2021-01-06 19:25:22,089 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:25:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23653 states. [2021-01-06 19:25:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23653 to 23557. [2021-01-06 19:25:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23557 states. [2021-01-06 19:25:23,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23557 states to 23557 states and 27643 transitions. [2021-01-06 19:25:23,857 INFO L78 Accepts]: Start accepts. Automaton has 23557 states and 27643 transitions. Word has length 131 [2021-01-06 19:25:23,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:23,858 INFO L481 AbstractCegarLoop]: Abstraction has 23557 states and 27643 transitions. [2021-01-06 19:25:23,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:23,858 INFO L276 IsEmpty]: Start isEmpty. Operand 23557 states and 27643 transitions. [2021-01-06 19:25:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-01-06 19:25:23,878 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:23,878 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:23,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:25:23,878 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:23,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:23,879 INFO L82 PathProgramCache]: Analyzing trace with hash 736996014, now seen corresponding path program 1 times [2021-01-06 19:25:23,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:23,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561845078] [2021-01-06 19:25:23,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:23,934 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561845078] [2021-01-06 19:25:23,934 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:23,934 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:25:23,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348089282] [2021-01-06 19:25:23,935 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:23,935 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:23,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:23,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:23,936 INFO L87 Difference]: Start difference. First operand 23557 states and 27643 transitions. Second operand 4 states. [2021-01-06 19:25:25,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:25,603 INFO L93 Difference]: Finished difference Result 41645 states and 49079 transitions. [2021-01-06 19:25:25,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:25:25,604 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2021-01-06 19:25:25,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:25,635 INFO L225 Difference]: With dead ends: 41645 [2021-01-06 19:25:25,636 INFO L226 Difference]: Without dead ends: 23569 [2021-01-06 19:25:25,650 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:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23569 states. [2021-01-06 19:25:27,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23569 to 23557. [2021-01-06 19:25:27,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23557 states. [2021-01-06 19:25:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23557 states to 23557 states and 27583 transitions. [2021-01-06 19:25:27,511 INFO L78 Accepts]: Start accepts. Automaton has 23557 states and 27583 transitions. Word has length 148 [2021-01-06 19:25:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:27,512 INFO L481 AbstractCegarLoop]: Abstraction has 23557 states and 27583 transitions. [2021-01-06 19:25:27,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 23557 states and 27583 transitions. [2021-01-06 19:25:27,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2021-01-06 19:25:27,533 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:27,533 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:27,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:25:27,534 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1335072729, now seen corresponding path program 1 times [2021-01-06 19:25:27,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:27,535 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963525304] [2021-01-06 19:25:27,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:27,622 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-01-06 19:25:27,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963525304] [2021-01-06 19:25:27,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:27,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:25:27,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925564430] [2021-01-06 19:25:27,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:27,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:27,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:27,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:27,624 INFO L87 Difference]: Start difference. First operand 23557 states and 27583 transitions. Second operand 3 states. [2021-01-06 19:25:29,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:29,487 INFO L93 Difference]: Finished difference Result 52059 states and 60812 transitions. [2021-01-06 19:25:29,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:29,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 177 [2021-01-06 19:25:29,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:29,517 INFO L225 Difference]: With dead ends: 52059 [2021-01-06 19:25:29,517 INFO L226 Difference]: Without dead ends: 28547 [2021-01-06 19:25:29,531 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:25:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28547 states. [2021-01-06 19:25:31,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28547 to 28419. [2021-01-06 19:25:31,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28419 states. [2021-01-06 19:25:31,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28419 states to 28419 states and 33011 transitions. [2021-01-06 19:25:31,272 INFO L78 Accepts]: Start accepts. Automaton has 28419 states and 33011 transitions. Word has length 177 [2021-01-06 19:25:31,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:31,273 INFO L481 AbstractCegarLoop]: Abstraction has 28419 states and 33011 transitions. [2021-01-06 19:25:31,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:31,273 INFO L276 IsEmpty]: Start isEmpty. Operand 28419 states and 33011 transitions. [2021-01-06 19:25:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2021-01-06 19:25:31,290 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:31,290 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:31,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:25:31,291 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:31,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:31,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1751786614, now seen corresponding path program 1 times [2021-01-06 19:25:31,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:31,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393959573] [2021-01-06 19:25:31,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:31,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:31,355 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:31,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393959573] [2021-01-06 19:25:31,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:31,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:25:31,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073593746] [2021-01-06 19:25:31,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:31,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:31,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:31,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:31,357 INFO L87 Difference]: Start difference. First operand 28419 states and 33011 transitions. Second operand 4 states. [2021-01-06 19:25:33,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:33,389 INFO L93 Difference]: Finished difference Result 51907 states and 60515 transitions. [2021-01-06 19:25:33,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:25:33,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2021-01-06 19:25:33,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:33,419 INFO L225 Difference]: With dead ends: 51907 [2021-01-06 19:25:33,419 INFO L226 Difference]: Without dead ends: 28431 [2021-01-06 19:25:33,436 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:33,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28431 states. [2021-01-06 19:25:35,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28431 to 28419. [2021-01-06 19:25:35,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28419 states. [2021-01-06 19:25:35,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28419 states to 28419 states and 32911 transitions. [2021-01-06 19:25:35,186 INFO L78 Accepts]: Start accepts. Automaton has 28419 states and 32911 transitions. Word has length 180 [2021-01-06 19:25:35,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:35,187 INFO L481 AbstractCegarLoop]: Abstraction has 28419 states and 32911 transitions. [2021-01-06 19:25:35,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 28419 states and 32911 transitions. [2021-01-06 19:25:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-01-06 19:25:35,204 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:35,206 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:35,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:25:35,206 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:35,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:35,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1117959826, now seen corresponding path program 1 times [2021-01-06 19:25:35,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:35,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450185192] [2021-01-06 19:25:35,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-01-06 19:25:35,281 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450185192] [2021-01-06 19:25:35,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:35,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-01-06 19:25:35,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130990838] [2021-01-06 19:25:35,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:25:35,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:35,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:25:35,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:25:35,283 INFO L87 Difference]: Start difference. First operand 28419 states and 32911 transitions. Second operand 4 states. [2021-01-06 19:25:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:37,335 INFO L93 Difference]: Finished difference Result 56771 states and 65747 transitions. [2021-01-06 19:25:37,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-01-06 19:25:37,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 212 [2021-01-06 19:25:37,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:37,367 INFO L225 Difference]: With dead ends: 56771 [2021-01-06 19:25:37,367 INFO L226 Difference]: Without dead ends: 25869 [2021-01-06 19:25:37,391 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:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25869 states. [2021-01-06 19:25:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25869 to 25849. [2021-01-06 19:25:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2021-01-06 19:25:38,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 29820 transitions. [2021-01-06 19:25:38,988 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 29820 transitions. Word has length 212 [2021-01-06 19:25:38,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:38,988 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 29820 transitions. [2021-01-06 19:25:38,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:25:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 29820 transitions. [2021-01-06 19:25:38,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2021-01-06 19:25:38,998 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:38,999 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:38,999 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:25:38,999 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:38,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:38,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1763021255, now seen corresponding path program 1 times [2021-01-06 19:25:39,000 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:39,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558532496] [2021-01-06 19:25:39,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:39,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558532496] [2021-01-06 19:25:39,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:39,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:39,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685603975] [2021-01-06 19:25:39,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:39,069 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:39,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:39,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:39,070 INFO L87 Difference]: Start difference. First operand 25849 states and 29820 transitions. Second operand 3 states. [2021-01-06 19:25:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:40,813 INFO L93 Difference]: Finished difference Result 47941 states and 55471 transitions. [2021-01-06 19:25:40,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:40,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2021-01-06 19:25:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:40,840 INFO L225 Difference]: With dead ends: 47941 [2021-01-06 19:25:40,840 INFO L226 Difference]: Without dead ends: 25897 [2021-01-06 19:25:40,854 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:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25897 states. [2021-01-06 19:25:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25897 to 25849. [2021-01-06 19:25:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2021-01-06 19:25:42,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 29228 transitions. [2021-01-06 19:25:42,499 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 29228 transitions. Word has length 212 [2021-01-06 19:25:42,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:42,500 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 29228 transitions. [2021-01-06 19:25:42,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 29228 transitions. [2021-01-06 19:25:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2021-01-06 19:25:42,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:42,509 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:42,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:25:42,509 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:42,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1865011049, now seen corresponding path program 1 times [2021-01-06 19:25:42,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:42,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337917414] [2021-01-06 19:25:42,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:42,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337917414] [2021-01-06 19:25:42,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:42,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:42,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209969310] [2021-01-06 19:25:42,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:42,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:42,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:42,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:42,581 INFO L87 Difference]: Start difference. First operand 25849 states and 29228 transitions. Second operand 3 states. [2021-01-06 19:25:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:44,333 INFO L93 Difference]: Finished difference Result 45103 states and 51221 transitions. [2021-01-06 19:25:44,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:44,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 215 [2021-01-06 19:25:44,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:44,370 INFO L225 Difference]: With dead ends: 45103 [2021-01-06 19:25:44,370 INFO L226 Difference]: Without dead ends: 25905 [2021-01-06 19:25:44,384 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:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25905 states. [2021-01-06 19:25:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25905 to 25849. [2021-01-06 19:25:46,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2021-01-06 19:25:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 28728 transitions. [2021-01-06 19:25:46,150 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 28728 transitions. Word has length 215 [2021-01-06 19:25:46,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:46,150 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 28728 transitions. [2021-01-06 19:25:46,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:46,151 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 28728 transitions. [2021-01-06 19:25:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2021-01-06 19:25:46,159 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:46,159 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:46,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:25:46,160 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash 562185031, now seen corresponding path program 1 times [2021-01-06 19:25:46,160 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:46,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639975244] [2021-01-06 19:25:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:46,224 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:46,224 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639975244] [2021-01-06 19:25:46,224 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:46,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:46,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724913070] [2021-01-06 19:25:46,225 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:46,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:46,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:46,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:46,226 INFO L87 Difference]: Start difference. First operand 25849 states and 28728 transitions. Second operand 3 states. [2021-01-06 19:25:48,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:48,059 INFO L93 Difference]: Finished difference Result 42795 states and 47751 transitions. [2021-01-06 19:25:48,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:48,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2021-01-06 19:25:48,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:48,086 INFO L225 Difference]: With dead ends: 42795 [2021-01-06 19:25:48,087 INFO L226 Difference]: Without dead ends: 26663 [2021-01-06 19:25:48,098 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:48,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26663 states. [2021-01-06 19:25:49,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26663 to 25849. [2021-01-06 19:25:49,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25849 states. [2021-01-06 19:25:49,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25849 states to 25849 states and 28326 transitions. [2021-01-06 19:25:49,682 INFO L78 Accepts]: Start accepts. Automaton has 25849 states and 28326 transitions. Word has length 218 [2021-01-06 19:25:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:49,682 INFO L481 AbstractCegarLoop]: Abstraction has 25849 states and 28326 transitions. [2021-01-06 19:25:49,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 25849 states and 28326 transitions. [2021-01-06 19:25:49,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2021-01-06 19:25:49,690 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:49,690 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:49,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:25:49,691 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:49,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:49,691 INFO L82 PathProgramCache]: Analyzing trace with hash -928723252, now seen corresponding path program 1 times [2021-01-06 19:25:49,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:49,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691940227] [2021-01-06 19:25:49,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:25:49,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691940227] [2021-01-06 19:25:49,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:49,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:49,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866790410] [2021-01-06 19:25:49,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:49,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:49,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:49,866 INFO L87 Difference]: Start difference. First operand 25849 states and 28326 transitions. Second operand 3 states. [2021-01-06 19:25:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:50,954 INFO L93 Difference]: Finished difference Result 43179 states and 47446 transitions. [2021-01-06 19:25:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:25:50,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2021-01-06 19:25:50,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:50,971 INFO L225 Difference]: With dead ends: 43179 [2021-01-06 19:25:50,972 INFO L226 Difference]: Without dead ends: 17409 [2021-01-06 19:25:50,985 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:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17409 states. [2021-01-06 19:25:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17409 to 17377. [2021-01-06 19:25:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17377 states. [2021-01-06 19:25:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17377 states to 17377 states and 18817 transitions. [2021-01-06 19:25:52,189 INFO L78 Accepts]: Start accepts. Automaton has 17377 states and 18817 transitions. Word has length 220 [2021-01-06 19:25:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:52,190 INFO L481 AbstractCegarLoop]: Abstraction has 17377 states and 18817 transitions. [2021-01-06 19:25:52,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:25:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 17377 states and 18817 transitions. [2021-01-06 19:25:52,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2021-01-06 19:25:52,198 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:52,199 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:52,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:25:52,199 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:52,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1613896568, now seen corresponding path program 1 times [2021-01-06 19:25:52,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:52,200 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037678444] [2021-01-06 19:25:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:52,413 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-01-06 19:25:52,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037678444] [2021-01-06 19:25:52,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:52,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-01-06 19:25:52,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025489795] [2021-01-06 19:25:52,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-01-06 19:25:52,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:52,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-01-06 19:25:52,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:25:52,415 INFO L87 Difference]: Start difference. First operand 17377 states and 18817 transitions. Second operand 6 states. [2021-01-06 19:25:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:25:56,468 INFO L93 Difference]: Finished difference Result 66251 states and 71727 transitions. [2021-01-06 19:25:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:25:56,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2021-01-06 19:25:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:25:56,534 INFO L225 Difference]: With dead ends: 66251 [2021-01-06 19:25:56,534 INFO L226 Difference]: Without dead ends: 59635 [2021-01-06 19:25:56,548 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-01-06 19:25:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59635 states. [2021-01-06 19:25:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59635 to 32304. [2021-01-06 19:25:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32304 states. [2021-01-06 19:25:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32304 states to 32304 states and 35058 transitions. [2021-01-06 19:25:59,256 INFO L78 Accepts]: Start accepts. Automaton has 32304 states and 35058 transitions. Word has length 223 [2021-01-06 19:25:59,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:25:59,256 INFO L481 AbstractCegarLoop]: Abstraction has 32304 states and 35058 transitions. [2021-01-06 19:25:59,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-01-06 19:25:59,257 INFO L276 IsEmpty]: Start isEmpty. Operand 32304 states and 35058 transitions. [2021-01-06 19:25:59,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2021-01-06 19:25:59,267 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:25:59,268 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:25:59,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:25:59,268 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:25:59,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:25:59,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1852984938, now seen corresponding path program 1 times [2021-01-06 19:25:59,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:25:59,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453960161] [2021-01-06 19:25:59,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:25:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:25:59,355 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-01-06 19:25:59,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453960161] [2021-01-06 19:25:59,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:25:59,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:25:59,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255889961] [2021-01-06 19:25:59,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:25:59,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:25:59,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:25:59,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:25:59,358 INFO L87 Difference]: Start difference. First operand 32304 states and 35058 transitions. Second operand 3 states. [2021-01-06 19:26:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:26:02,779 INFO L93 Difference]: Finished difference Result 69579 states and 75699 transitions. [2021-01-06 19:26:02,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:26:02,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2021-01-06 19:26:02,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:26:02,835 INFO L225 Difference]: With dead ends: 69579 [2021-01-06 19:26:02,835 INFO L226 Difference]: Without dead ends: 50858 [2021-01-06 19:26:02,852 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:26:02,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50858 states. [2021-01-06 19:26:05,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50858 to 32320. [2021-01-06 19:26:05,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32320 states. [2021-01-06 19:26:05,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32320 states to 32320 states and 35074 transitions. [2021-01-06 19:26:05,411 INFO L78 Accepts]: Start accepts. Automaton has 32320 states and 35074 transitions. Word has length 227 [2021-01-06 19:26:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:26:05,412 INFO L481 AbstractCegarLoop]: Abstraction has 32320 states and 35074 transitions. [2021-01-06 19:26:05,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:26:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32320 states and 35074 transitions. [2021-01-06 19:26:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2021-01-06 19:26:05,421 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:26:05,422 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:26:05,422 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:26:05,422 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:26:05,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:26:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1845395018, now seen corresponding path program 1 times [2021-01-06 19:26:05,423 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:26:05,423 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473790853] [2021-01-06 19:26:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:26:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:26:05,457 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:26:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-01-06 19:26:05,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-01-06 19:26:05,639 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-01-06 19:26:05,640 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-01-06 19:26:05,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:26:05,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.01 07:26:05 BoogieIcfgContainer [2021-01-06 19:26:05,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-01-06 19:26:05,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-01-06 19:26:05,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-01-06 19:26:05,944 INFO L275 PluginConnector]: Witness Printer initialized [2021-01-06 19:26:05,944 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:25:02" (3/4) ... [2021-01-06 19:26:05,947 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-01-06 19:26:06,177 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/systemc/token_ring.03.cil-1.c-witness.graphml [2021-01-06 19:26:06,177 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-01-06 19:26:06,179 INFO L168 Benchmark]: Toolchain (without parser) took 65572.73 ms. Allocated memory was 151.0 MB in the beginning and 6.7 GB in the end (delta: 6.5 GB). Free memory was 126.3 MB in the beginning and 4.7 GB in the end (delta: -4.6 GB). Peak memory consumption was 1.9 GB. Max. memory is 8.0 GB. [2021-01-06 19:26:06,180 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-01-06 19:26:06,180 INFO L168 Benchmark]: CACSL2BoogieTranslator took 485.76 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 110.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:06,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.70 ms. Allocated memory is still 151.0 MB. Free memory was 110.8 MB in the beginning and 107.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:06,181 INFO L168 Benchmark]: Boogie Preprocessor took 152.41 ms. Allocated memory is still 151.0 MB. Free memory was 107.1 MB in the beginning and 103.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:06,181 INFO L168 Benchmark]: RCFGBuilder took 1573.25 ms. Allocated memory is still 151.0 MB. Free memory was 103.8 MB in the beginning and 59.9 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.8 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:06,182 INFO L168 Benchmark]: TraceAbstraction took 63000.92 ms. Allocated memory was 151.0 MB in the beginning and 6.7 GB in the end (delta: 6.5 GB). Free memory was 59.9 MB in the beginning and 4.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 8.0 GB. [2021-01-06 19:26:06,182 INFO L168 Benchmark]: Witness Printer took 233.80 ms. Allocated memory is still 6.7 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.8 MB. Max. memory is 8.0 GB. [2021-01-06 19:26:06,184 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.20 ms. Allocated memory is still 151.0 MB. Free memory is still 123.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 485.76 ms. Allocated memory is still 151.0 MB. Free memory was 126.0 MB in the beginning and 110.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 14.7 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 114.70 ms. Allocated memory is still 151.0 MB. Free memory was 110.8 MB in the beginning and 107.1 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 152.41 ms. Allocated memory is still 151.0 MB. Free memory was 107.1 MB in the beginning and 103.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1573.25 ms. Allocated memory is still 151.0 MB. Free memory was 103.8 MB in the beginning and 59.9 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 63000.92 ms. Allocated memory was 151.0 MB in the beginning and 6.7 GB in the end (delta: 6.5 GB). Free memory was 59.9 MB in the beginning and 4.7 GB in the end (delta: -4.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 8.0 GB. * Witness Printer took 233.80 ms. Allocated memory is still 6.7 GB. Free memory was 4.7 GB in the beginning and 4.7 GB in the end (delta: 38.3 MB). Peak memory consumption was 38.8 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 t2_pc = 0; [L19] int t3_pc = 0; [L20] int m_st ; [L21] int t1_st ; [L22] int t2_st ; [L23] int t3_st ; [L24] int m_i ; [L25] int t1_i ; [L26] int t2_i ; [L27] int t3_i ; [L28] int M_E = 2; [L29] int T1_E = 2; [L30] int T2_E = 2; [L31] int T3_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L34] int E_2 = 2; [L35] int E_3 = 2; [L41] int token ; [L43] int local ; VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L727] int __retres1 ; [L640] m_i = 1 [L641] t1_i = 1 [L642] t2_i = 1 [L643] t3_i = 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L668] int kernel_st ; [L669] int tmp ; [L670] int tmp___0 ; [L674] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L296] COND TRUE m_i == 1 [L297] m_st = 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L301] COND TRUE t1_i == 1 [L302] t1_st = 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L306] COND TRUE t2_i == 1 [L307] t2_st = 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L311] COND TRUE t3_i == 1 [L312] t3_st = 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L433] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L438] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L443] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L448] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L453] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L458] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L463] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L468] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L224] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L231] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L243] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L250] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L262] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L269] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L281] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L481] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L486] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L491] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L496] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L501] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L506] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L511] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L516] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L682] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L685] kernel_st = 1 [L352] int tmp ; VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L356] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L321] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L347] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L104] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L115] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L140] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L151] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L176] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L187] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L356] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L321] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L347] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L59] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L62] token = __VERIFIER_nondet_int() [L63] local = token [L64] E_1 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L212] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L222] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L224] return (__retres1); VAL [E_1=1, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L228] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L231] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L232] COND TRUE E_1 == 1 [L233] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L243] return (__retres1); VAL [E_1=1, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L541] tmp___0 = is_transmit1_triggered() [L543] COND TRUE \read(tmp___0) [L544] t1_st = 0 VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L247] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L250] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L251] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L260] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L262] return (__retres1); VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L266] int __retres1 ; VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L269] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L270] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L279] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L281] return (__retres1); VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L66] E_1 = 2 [L67] m_pc = 1 [L68] m_st = 2 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L380] COND TRUE t1_st == 0 [L381] int tmp_ndt_2; [L382] tmp_ndt_2 = __VERIFIER_nondet_int() [L383] COND TRUE \read(tmp_ndt_2) [L385] t1_st = 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L104] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L107] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L123] token += 1 [L124] E_2 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L222] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L224] return (__retres1); VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L228] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L241] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L243] return (__retres1); VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L247] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L251] COND TRUE E_2 == 1 [L252] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L262] return (__retres1); VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L549] tmp___1 = is_transmit2_triggered() [L551] COND TRUE \read(tmp___1) [L552] t2_st = 0 VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L266] int __retres1 ; VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L279] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L281] return (__retres1); VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L126] E_2 = 2 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L115] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L117] t1_pc = 1 [L118] t1_st = 2 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L394] COND TRUE t2_st == 0 [L395] int tmp_ndt_3; [L396] tmp_ndt_3 = __VERIFIER_nondet_int() [L397] COND TRUE \read(tmp_ndt_3) [L399] t2_st = 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L140] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L143] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=1] [L159] token += 1 [L160] E_3 = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L213] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L222] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L224] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L533] tmp = is_master_triggered() [L535] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L243] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L262] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L270] COND TRUE E_3 == 1 [L271] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L281] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=2] [L557] tmp___2 = is_transmit3_triggered() [L559] COND TRUE \read(tmp___2) [L560] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, 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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L162] E_3 = 2 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L151] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L153] t2_pc = 1 [L154] t2_st = 2 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=2] [L408] COND TRUE t3_st == 0 [L409] int tmp_ndt_4; [L410] tmp_ndt_4 = __VERIFIER_nondet_int() [L411] COND TRUE \read(tmp_ndt_4) [L413] t3_st = 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L176] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L179] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=2] [L195] token += 1 [L196] E_M = 1 [L526] int tmp ; [L527] int tmp___0 ; [L528] int tmp___1 ; [L529] int tmp___2 ; [L209] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L212] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L213] COND TRUE E_M == 1 [L214] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L224] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L533] tmp = is_master_triggered() [L535] COND TRUE \read(tmp) [L536] m_st = 0 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L228] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L231] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L232] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L241] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L243] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L541] tmp___0 = is_transmit1_triggered() [L543] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L247] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L250] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L251] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L260] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L262] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L549] tmp___1 = is_transmit2_triggered() [L551] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L266] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L269] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L270] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L279] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L281] return (__retres1); VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L557] tmp___2 = is_transmit3_triggered() [L559] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=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=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L198] E_M = 2 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L187] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=3] [L189] t3_pc = 1 [L190] t3_st = 2 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L356] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L321] int __retres1 ; VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L324] COND TRUE m_st == 0 [L325] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L347] return (__retres1); VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L359] tmp = exists_runnable_thread() [L361] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L366] COND TRUE m_st == 0 [L367] int tmp_ndt_1; [L368] tmp_ndt_1 = __VERIFIER_nondet_int() [L369] COND TRUE \read(tmp_ndt_1) [L371] m_st = 1 [L46] int tmp_var = __VERIFIER_nondet_int(); [L48] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L51] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L73] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L84] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L85] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L86] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] [L12] reach_error() VAL [E_1=2, E_2=2, E_3=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, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 316 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 62.5s, OverallIterations: 35, TraceHistogramMax: 3, AutomataDifference: 32.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 17417 SDtfs, 20944 SDslu, 17522 SDs, 0 SdLazy, 949 SolverSat, 346 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32320occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 50994 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 4069 NumberOfCodeBlocks, 4069 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 3807 ConstructedInterpolants, 0 QuantifiedInterpolants, 1090171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 449/449 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...