/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.15.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-178dd20 [2021-01-06 19:28:44,170 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-01-06 19:28:44,174 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-01-06 19:28:44,225 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-01-06 19:28:44,226 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-01-06 19:28:44,227 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-01-06 19:28:44,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-01-06 19:28:44,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-01-06 19:28:44,234 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-01-06 19:28:44,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-01-06 19:28:44,236 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-01-06 19:28:44,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-01-06 19:28:44,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-01-06 19:28:44,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-01-06 19:28:44,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-01-06 19:28:44,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-01-06 19:28:44,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-01-06 19:28:44,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-01-06 19:28:44,258 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-01-06 19:28:44,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-01-06 19:28:44,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-01-06 19:28:44,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-01-06 19:28:44,265 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-01-06 19:28:44,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-01-06 19:28:44,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-01-06 19:28:44,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-01-06 19:28:44,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-01-06 19:28:44,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-01-06 19:28:44,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-01-06 19:28:44,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-01-06 19:28:44,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-01-06 19:28:44,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-01-06 19:28:44,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-01-06 19:28:44,288 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-01-06 19:28:44,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-01-06 19:28:44,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-01-06 19:28:44,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-01-06 19:28:44,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-01-06 19:28:44,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-01-06 19:28:44,299 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-01-06 19:28:44,300 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-01-06 19:28:44,301 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:28:44,358 INFO L113 SettingsManager]: Loading preferences was successful [2021-01-06 19:28:44,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-01-06 19:28:44,363 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-01-06 19:28:44,363 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-01-06 19:28:44,364 INFO L138 SettingsManager]: * Use SBE=true [2021-01-06 19:28:44,364 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-01-06 19:28:44,364 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-01-06 19:28:44,365 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-01-06 19:28:44,365 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-01-06 19:28:44,365 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-01-06 19:28:44,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-01-06 19:28:44,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-01-06 19:28:44,367 INFO L138 SettingsManager]: * Use constant arrays=true [2021-01-06 19:28:44,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-01-06 19:28:44,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-01-06 19:28:44,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-01-06 19:28:44,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-01-06 19:28:44,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-01-06 19:28:44,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-01-06 19:28:44,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-01-06 19:28:44,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-01-06 19:28:44,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-01-06 19:28:44,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-01-06 19:28:44,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-01-06 19:28:44,370 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-01-06 19:28:44,371 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:28:44,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-01-06 19:28:44,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-01-06 19:28:44,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-01-06 19:28:44,795 INFO L271 PluginConnector]: Initializing CDTParser... [2021-01-06 19:28:44,796 INFO L275 PluginConnector]: CDTParser initialized [2021-01-06 19:28:44,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.15.cil.c [2021-01-06 19:28:44,878 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/019d23ad8/784319ef328d42ff9e776b7b8f05bbbd/FLAG8ccc16f79 [2021-01-06 19:28:45,556 INFO L306 CDTParser]: Found 1 translation units. [2021-01-06 19:28:45,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.15.cil.c [2021-01-06 19:28:45,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/019d23ad8/784319ef328d42ff9e776b7b8f05bbbd/FLAG8ccc16f79 [2021-01-06 19:28:45,826 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/019d23ad8/784319ef328d42ff9e776b7b8f05bbbd [2021-01-06 19:28:45,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-01-06 19:28:45,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-01-06 19:28:45,843 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-01-06 19:28:45,843 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-01-06 19:28:45,848 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-01-06 19:28:45,849 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:28:45" (1/1) ... [2021-01-06 19:28:45,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@157d43a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:45, skipping insertion in model container [2021-01-06 19:28:45,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.01 07:28:45" (1/1) ... [2021-01-06 19:28:45,860 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-01-06 19:28:45,939 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-01-06 19:28:46,156 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.15.cil.c[364,377] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_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~15,] [2021-01-06 19:28:46,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:28:46,435 INFO L203 MainTranslator]: Completed pre-run [2021-01-06 19:28:46,454 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.15.cil.c[364,377] left hand side expression in assignment: lhs: VariableLHS[~token~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~local~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_pc~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~0,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~1,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~2,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~3,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~4,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~5,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~6,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~7,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~8,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~9,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~10,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~11,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~12,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~13,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~__retres1~14,] left hand side expression in assignment: lhs: VariableLHS[~tmp~0,] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_1~0,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_2~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_3~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_4~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_5~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_6~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_7~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_8~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_9~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_10~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_11~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_12~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_13~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp_ndt_14~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp~1,] left hand side expression in assignment: lhs: VariableLHS[~m_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___0~0,] left hand side expression in assignment: lhs: VariableLHS[~t1_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___1~0,] left hand side expression in assignment: lhs: VariableLHS[~t2_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___2~0,] left hand side expression in assignment: lhs: VariableLHS[~t3_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___3~0,] left hand side expression in assignment: lhs: VariableLHS[~t4_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___4~0,] left hand side expression in assignment: lhs: VariableLHS[~t5_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___5~0,] left hand side expression in assignment: lhs: VariableLHS[~t6_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___6~0,] left hand side expression in assignment: lhs: VariableLHS[~t7_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___7~0,] left hand side expression in assignment: lhs: VariableLHS[~t8_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___8~0,] left hand side expression in assignment: lhs: VariableLHS[~t9_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___9~0,] left hand side expression in assignment: lhs: VariableLHS[~t10_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___10~0,] left hand side expression in assignment: lhs: VariableLHS[~t11_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___11~0,] left hand side expression in assignment: lhs: VariableLHS[~t12_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~tmp___12~0,] left hand side expression in assignment: lhs: VariableLHS[~t13_st~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~M_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T1_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T2_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T3_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T4_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T5_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T6_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T7_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T8_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T9_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T10_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T11_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T12_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~T13_E~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_M~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_1~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_2~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_3~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_4~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_5~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_6~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_7~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_8~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_9~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_10~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_11~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_12~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~E_13~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~m_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t1_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t2_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t3_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t4_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t5_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t6_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t7_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t8_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t9_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t10_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t11_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t12_i~0,GLOBAL] left hand side expression in assignment: lhs: VariableLHS[~t13_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~15,] [2021-01-06 19:28:46,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-01-06 19:28:46,625 INFO L208 MainTranslator]: Completed translation [2021-01-06 19:28:46,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46 WrapperNode [2021-01-06 19:28:46,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-01-06 19:28:46,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-01-06 19:28:46,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-01-06 19:28:46,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-01-06 19:28:46,636 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:28:46" (1/1) ... [2021-01-06 19:28:46,655 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:28:46" (1/1) ... [2021-01-06 19:28:46,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-01-06 19:28:46,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-01-06 19:28:46,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-01-06 19:28:46,878 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-01-06 19:28:46,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46" (1/1) ... [2021-01-06 19:28:46,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46" (1/1) ... [2021-01-06 19:28:46,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46" (1/1) ... [2021-01-06 19:28:46,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46" (1/1) ... [2021-01-06 19:28:46,975 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46" (1/1) ... [2021-01-06 19:28:47,043 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46" (1/1) ... [2021-01-06 19:28:47,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46" (1/1) ... [2021-01-06 19:28:47,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-01-06 19:28:47,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-01-06 19:28:47,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-01-06 19:28:47,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-01-06 19:28:47,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46" (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:28:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-01-06 19:28:47,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-01-06 19:28:47,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-01-06 19:28:47,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-01-06 19:28:50,028 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-01-06 19:28:50,029 INFO L299 CfgBuilder]: Removed 622 assume(true) statements. [2021-01-06 19:28:50,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:28:50 BoogieIcfgContainer [2021-01-06 19:28:50,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-01-06 19:28:50,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-01-06 19:28:50,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-01-06 19:28:50,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-01-06 19:28:50,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.01 07:28:45" (1/3) ... [2021-01-06 19:28:50,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c0b869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:28:50, skipping insertion in model container [2021-01-06 19:28:50,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.01 07:28:46" (2/3) ... [2021-01-06 19:28:50,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c0b869 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.01 07:28:50, skipping insertion in model container [2021-01-06 19:28:50,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.01 07:28:50" (3/3) ... [2021-01-06 19:28:50,044 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.15.cil.c [2021-01-06 19:28:50,051 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-01-06 19:28:50,058 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-01-06 19:28:50,078 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-01-06 19:28:50,117 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-01-06 19:28:50,117 INFO L378 AbstractCegarLoop]: Hoare is true [2021-01-06 19:28:50,117 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-01-06 19:28:50,117 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-01-06 19:28:50,118 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-01-06 19:28:50,118 INFO L382 AbstractCegarLoop]: Difference is false [2021-01-06 19:28:50,118 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-01-06 19:28:50,118 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-01-06 19:28:50,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states. [2021-01-06 19:28:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:50,186 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:50,188 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:50,188 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:50,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:50,196 INFO L82 PathProgramCache]: Analyzing trace with hash 585149193, now seen corresponding path program 1 times [2021-01-06 19:28:50,208 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:50,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420981966] [2021-01-06 19:28:50,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:50,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:50,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420981966] [2021-01-06 19:28:50,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:50,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:50,669 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721869761] [2021-01-06 19:28:50,676 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:50,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:50,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:50,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:50,700 INFO L87 Difference]: Start difference. First operand 1994 states. Second operand 3 states. [2021-01-06 19:28:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:50,933 INFO L93 Difference]: Finished difference Result 3983 states and 5991 transitions. [2021-01-06 19:28:50,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:50,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:50,972 INFO L225 Difference]: With dead ends: 3983 [2021-01-06 19:28:50,972 INFO L226 Difference]: Without dead ends: 1990 [2021-01-06 19:28: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:28:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2021-01-06 19:28:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1990. [2021-01-06 19:28:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2021-01-06 19:28:51,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2960 transitions. [2021-01-06 19:28:51,150 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2960 transitions. Word has length 171 [2021-01-06 19:28:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:51,151 INFO L481 AbstractCegarLoop]: Abstraction has 1990 states and 2960 transitions. [2021-01-06 19:28:51,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2960 transitions. [2021-01-06 19:28:51,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:51,154 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:51,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:51,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-01-06 19:28:51,155 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:51,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:51,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1992875143, now seen corresponding path program 1 times [2021-01-06 19:28:51,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:51,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926728190] [2021-01-06 19:28:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:51,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:51,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926728190] [2021-01-06 19:28:51,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:51,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:51,382 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951243208] [2021-01-06 19:28:51,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:51,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:51,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:51,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:51,387 INFO L87 Difference]: Start difference. First operand 1990 states and 2960 transitions. Second operand 3 states. [2021-01-06 19:28:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:51,505 INFO L93 Difference]: Finished difference Result 3967 states and 5898 transitions. [2021-01-06 19:28:51,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:51,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:51,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:51,518 INFO L225 Difference]: With dead ends: 3967 [2021-01-06 19:28:51,519 INFO L226 Difference]: Without dead ends: 1990 [2021-01-06 19:28:51,525 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:28:51,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1990 states. [2021-01-06 19:28:51,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1990 to 1990. [2021-01-06 19:28:51,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2021-01-06 19:28:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2959 transitions. [2021-01-06 19:28:51,618 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2959 transitions. Word has length 171 [2021-01-06 19:28:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:51,621 INFO L481 AbstractCegarLoop]: Abstraction has 1990 states and 2959 transitions. [2021-01-06 19:28:51,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2959 transitions. [2021-01-06 19:28:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:51,631 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:51,632 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:51,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-01-06 19:28:51,632 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:51,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:51,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1325493253, now seen corresponding path program 1 times [2021-01-06 19:28:51,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:51,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471925198] [2021-01-06 19:28:51,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:51,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:51,844 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471925198] [2021-01-06 19:28:51,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:51,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:51,845 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408071709] [2021-01-06 19:28:51,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:51,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:51,849 INFO L87 Difference]: Start difference. First operand 1990 states and 2959 transitions. Second operand 3 states. [2021-01-06 19:28:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:52,036 INFO L93 Difference]: Finished difference Result 5682 states and 8423 transitions. [2021-01-06 19:28:52,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:52,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:52,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:52,057 INFO L225 Difference]: With dead ends: 5682 [2021-01-06 19:28:52,058 INFO L226 Difference]: Without dead ends: 3710 [2021-01-06 19:28:52,066 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:28:52,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2021-01-06 19:28:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3706. [2021-01-06 19:28:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5489 transitions. [2021-01-06 19:28:52,234 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5489 transitions. Word has length 171 [2021-01-06 19:28:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:52,241 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5489 transitions. [2021-01-06 19:28:52,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:52,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5489 transitions. [2021-01-06 19:28:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:52,243 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:52,243 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:52,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-01-06 19:28:52,244 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash 962370689, now seen corresponding path program 1 times [2021-01-06 19:28:52,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:52,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202579978] [2021-01-06 19:28:52,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:52,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202579978] [2021-01-06 19:28:52,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:52,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:52,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684400785] [2021-01-06 19:28:52,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:52,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:52,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:52,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:52,413 INFO L87 Difference]: Start difference. First operand 3706 states and 5489 transitions. Second operand 4 states. [2021-01-06 19:28:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:52,771 INFO L93 Difference]: Finished difference Result 9112 states and 13478 transitions. [2021-01-06 19:28:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:52,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:52,801 INFO L225 Difference]: With dead ends: 9112 [2021-01-06 19:28:52,802 INFO L226 Difference]: Without dead ends: 5425 [2021-01-06 19:28:52,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:52,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5425 states. [2021-01-06 19:28:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5425 to 3706. [2021-01-06 19:28:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5486 transitions. [2021-01-06 19:28:53,006 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5486 transitions. Word has length 171 [2021-01-06 19:28:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:53,006 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5486 transitions. [2021-01-06 19:28:53,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5486 transitions. [2021-01-06 19:28:53,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:53,008 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:53,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:53,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-01-06 19:28:53,009 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:53,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash -442820989, now seen corresponding path program 1 times [2021-01-06 19:28:53,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:53,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668475373] [2021-01-06 19:28:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:53,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:53,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668475373] [2021-01-06 19:28:53,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:53,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:53,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454816980] [2021-01-06 19:28:53,147 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:53,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:53,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:53,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:53,149 INFO L87 Difference]: Start difference. First operand 3706 states and 5486 transitions. Second operand 3 states. [2021-01-06 19:28:53,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:53,380 INFO L93 Difference]: Finished difference Result 7392 states and 10939 transitions. [2021-01-06 19:28:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:53,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:53,409 INFO L225 Difference]: With dead ends: 7392 [2021-01-06 19:28:53,410 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:53,420 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:28:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:53,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5478 transitions. [2021-01-06 19:28:53,668 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5478 transitions. Word has length 171 [2021-01-06 19:28:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:53,669 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5478 transitions. [2021-01-06 19:28:53,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:53,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5478 transitions. [2021-01-06 19:28:53,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:53,673 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:53,674 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:53,674 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-01-06 19:28:53,675 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash 79705599, now seen corresponding path program 1 times [2021-01-06 19:28:53,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:53,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825832328] [2021-01-06 19:28:53,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:53,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:53,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825832328] [2021-01-06 19:28:53,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:53,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:53,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231585972] [2021-01-06 19:28:53,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:53,863 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:53,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:53,864 INFO L87 Difference]: Start difference. First operand 3706 states and 5478 transitions. Second operand 3 states. [2021-01-06 19:28:54,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:54,104 INFO L93 Difference]: Finished difference Result 7390 states and 10920 transitions. [2021-01-06 19:28:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:54,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:54,125 INFO L225 Difference]: With dead ends: 7390 [2021-01-06 19:28:54,125 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:54,133 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:28:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:54,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:54,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5470 transitions. [2021-01-06 19:28:54,330 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5470 transitions. Word has length 171 [2021-01-06 19:28:54,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:54,331 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5470 transitions. [2021-01-06 19:28:54,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:54,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5470 transitions. [2021-01-06 19:28:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:54,334 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:54,334 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:54,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-01-06 19:28:54,335 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1872821125, now seen corresponding path program 1 times [2021-01-06 19:28:54,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:54,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849238946] [2021-01-06 19:28:54,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:54,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:54,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849238946] [2021-01-06 19:28:54,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:54,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:54,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675528948] [2021-01-06 19:28:54,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:54,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:54,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:54,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:54,431 INFO L87 Difference]: Start difference. First operand 3706 states and 5470 transitions. Second operand 3 states. [2021-01-06 19:28:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:54,687 INFO L93 Difference]: Finished difference Result 7389 states and 10903 transitions. [2021-01-06 19:28:54,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:54,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:54,707 INFO L225 Difference]: With dead ends: 7389 [2021-01-06 19:28:54,707 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:54,714 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:28:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5462 transitions. [2021-01-06 19:28:54,942 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5462 transitions. Word has length 171 [2021-01-06 19:28:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:54,942 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5462 transitions. [2021-01-06 19:28:54,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:54,943 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5462 transitions. [2021-01-06 19:28:54,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:54,945 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:54,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:54,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-01-06 19:28:54,947 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:54,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:54,947 INFO L82 PathProgramCache]: Analyzing trace with hash -827427201, now seen corresponding path program 1 times [2021-01-06 19:28:54,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:54,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556106392] [2021-01-06 19:28:54,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:55,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556106392] [2021-01-06 19:28:55,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:55,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:55,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522295791] [2021-01-06 19:28:55,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:55,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:55,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:55,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:55,072 INFO L87 Difference]: Start difference. First operand 3706 states and 5462 transitions. Second operand 4 states. [2021-01-06 19:28:55,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:55,442 INFO L93 Difference]: Finished difference Result 9102 states and 13401 transitions. [2021-01-06 19:28:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:28:55,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:28:55,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:55,469 INFO L225 Difference]: With dead ends: 9102 [2021-01-06 19:28:55,469 INFO L226 Difference]: Without dead ends: 5420 [2021-01-06 19:28:55,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:28:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5420 states. [2021-01-06 19:28:55,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5420 to 3706. [2021-01-06 19:28:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5459 transitions. [2021-01-06 19:28:55,754 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5459 transitions. Word has length 171 [2021-01-06 19:28:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:55,756 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5459 transitions. [2021-01-06 19:28:55,756 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:28:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5459 transitions. [2021-01-06 19:28:55,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:55,758 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:55,758 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:55,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-01-06 19:28:55,759 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:55,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:55,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1092074691, now seen corresponding path program 1 times [2021-01-06 19:28:55,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:55,760 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870796613] [2021-01-06 19:28:55,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:55,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870796613] [2021-01-06 19:28:55,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:55,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:55,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305332574] [2021-01-06 19:28:55,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:55,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:55,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:55,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:55,844 INFO L87 Difference]: Start difference. First operand 3706 states and 5459 transitions. Second operand 3 states. [2021-01-06 19:28:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:56,058 INFO L93 Difference]: Finished difference Result 7387 states and 10879 transitions. [2021-01-06 19:28:56,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:56,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:56,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:56,079 INFO L225 Difference]: With dead ends: 7387 [2021-01-06 19:28:56,079 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:56,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:28:56,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5451 transitions. [2021-01-06 19:28:56,322 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5451 transitions. Word has length 171 [2021-01-06 19:28:56,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:56,322 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5451 transitions. [2021-01-06 19:28:56,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:56,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5451 transitions. [2021-01-06 19:28:56,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:56,324 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:56,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:56,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-01-06 19:28:56,325 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:56,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:56,326 INFO L82 PathProgramCache]: Analyzing trace with hash -4954559, now seen corresponding path program 1 times [2021-01-06 19:28:56,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:56,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862773338] [2021-01-06 19:28:56,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:56,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:56,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862773338] [2021-01-06 19:28:56,435 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:56,435 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:56,435 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186005082] [2021-01-06 19:28:56,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:56,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:56,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:56,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:56,437 INFO L87 Difference]: Start difference. First operand 3706 states and 5451 transitions. Second operand 3 states. [2021-01-06 19:28:56,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:56,654 INFO L93 Difference]: Finished difference Result 7386 states and 10862 transitions. [2021-01-06 19:28:56,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:56,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:56,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:56,666 INFO L225 Difference]: With dead ends: 7386 [2021-01-06 19:28:56,666 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:56,675 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:28:56,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:56,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5443 transitions. [2021-01-06 19:28:56,894 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5443 transitions. Word has length 171 [2021-01-06 19:28:56,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:56,894 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5443 transitions. [2021-01-06 19:28:56,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5443 transitions. [2021-01-06 19:28:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:56,896 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:56,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:56,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-01-06 19:28:56,897 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:56,897 INFO L82 PathProgramCache]: Analyzing trace with hash 722850493, now seen corresponding path program 1 times [2021-01-06 19:28:56,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:56,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394840558] [2021-01-06 19:28:56,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:56,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:56,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394840558] [2021-01-06 19:28:56,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:56,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:56,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921267616] [2021-01-06 19:28:56,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:56,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:56,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:56,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:56,969 INFO L87 Difference]: Start difference. First operand 3706 states and 5443 transitions. Second operand 3 states. [2021-01-06 19:28:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:57,225 INFO L93 Difference]: Finished difference Result 7385 states and 10845 transitions. [2021-01-06 19:28:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:57,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:57,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:57,234 INFO L225 Difference]: With dead ends: 7385 [2021-01-06 19:28:57,235 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:57,241 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:28:57,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:57,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:57,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5435 transitions. [2021-01-06 19:28:57,441 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5435 transitions. Word has length 171 [2021-01-06 19:28:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:57,441 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5435 transitions. [2021-01-06 19:28:57,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5435 transitions. [2021-01-06 19:28:57,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:57,443 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:57,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:57,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-01-06 19:28:57,444 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:57,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:57,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1675137345, now seen corresponding path program 1 times [2021-01-06 19:28:57,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:57,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869517525] [2021-01-06 19:28:57,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:57,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869517525] [2021-01-06 19:28:57,514 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:57,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:57,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452361473] [2021-01-06 19:28:57,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:57,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:57,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:57,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:57,515 INFO L87 Difference]: Start difference. First operand 3706 states and 5435 transitions. Second operand 3 states. [2021-01-06 19:28:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:57,708 INFO L93 Difference]: Finished difference Result 7384 states and 10828 transitions. [2021-01-06 19:28:57,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:57,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:57,718 INFO L225 Difference]: With dead ends: 7384 [2021-01-06 19:28:57,718 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:57,726 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:28:57,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:58,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:58,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5427 transitions. [2021-01-06 19:28:58,013 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5427 transitions. Word has length 171 [2021-01-06 19:28:58,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:58,014 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5427 transitions. [2021-01-06 19:28:58,014 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:58,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5427 transitions. [2021-01-06 19:28:58,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:58,017 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:58,017 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:58,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-01-06 19:28:58,017 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1062090181, now seen corresponding path program 1 times [2021-01-06 19:28:58,018 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:58,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652465224] [2021-01-06 19:28:58,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:58,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:58,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652465224] [2021-01-06 19:28:58,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:58,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:58,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962868064] [2021-01-06 19:28:58,129 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:58,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:58,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:58,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:58,131 INFO L87 Difference]: Start difference. First operand 3706 states and 5427 transitions. Second operand 3 states. [2021-01-06 19:28:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:58,390 INFO L93 Difference]: Finished difference Result 7382 states and 10809 transitions. [2021-01-06 19:28:58,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:58,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:58,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:58,400 INFO L225 Difference]: With dead ends: 7382 [2021-01-06 19:28:58,400 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:58,415 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:28:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:58,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:58,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5419 transitions. [2021-01-06 19:28:58,640 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5419 transitions. Word has length 171 [2021-01-06 19:28:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:58,641 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5419 transitions. [2021-01-06 19:28:58,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5419 transitions. [2021-01-06 19:28:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:58,643 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:58,644 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:58,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-01-06 19:28:58,644 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1579887433, now seen corresponding path program 1 times [2021-01-06 19:28:58,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:58,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296099574] [2021-01-06 19:28:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:58,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296099574] [2021-01-06 19:28:58,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:58,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:58,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273181945] [2021-01-06 19:28:58,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:58,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:58,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:58,736 INFO L87 Difference]: Start difference. First operand 3706 states and 5419 transitions. Second operand 3 states. [2021-01-06 19:28:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:58,975 INFO L93 Difference]: Finished difference Result 7381 states and 10792 transitions. [2021-01-06 19:28:58,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:58,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:58,983 INFO L225 Difference]: With dead ends: 7381 [2021-01-06 19:28:58,983 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:58,991 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:28:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:59,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5411 transitions. [2021-01-06 19:28:59,190 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5411 transitions. Word has length 171 [2021-01-06 19:28:59,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:59,190 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5411 transitions. [2021-01-06 19:28:59,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:59,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5411 transitions. [2021-01-06 19:28:59,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:59,192 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:59,192 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:59,192 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-01-06 19:28:59,193 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:59,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash -349664581, now seen corresponding path program 1 times [2021-01-06 19:28:59,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:59,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511255014] [2021-01-06 19:28:59,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:59,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511255014] [2021-01-06 19:28:59,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:59,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:28:59,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215773847] [2021-01-06 19:28:59,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:28:59,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:59,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:28:59,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:28:59,287 INFO L87 Difference]: Start difference. First operand 3706 states and 5411 transitions. Second operand 3 states. [2021-01-06 19:28:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:28:59,521 INFO L93 Difference]: Finished difference Result 7380 states and 10775 transitions. [2021-01-06 19:28:59,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:28:59,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:28:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:28:59,531 INFO L225 Difference]: With dead ends: 7380 [2021-01-06 19:28:59,532 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:28:59,541 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:28:59,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:28:59,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:28:59,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:28:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5373 transitions. [2021-01-06 19:28:59,739 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5373 transitions. Word has length 171 [2021-01-06 19:28:59,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:28:59,740 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5373 transitions. [2021-01-06 19:28:59,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:28:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5373 transitions. [2021-01-06 19:28:59,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:28:59,742 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:28:59,742 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:28:59,742 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-01-06 19:28:59,743 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:28:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:28:59,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2066981880, now seen corresponding path program 1 times [2021-01-06 19:28:59,745 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:28:59,745 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518873984] [2021-01-06 19:28:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:28:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:28:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:28:59,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518873984] [2021-01-06 19:28:59,819 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:28:59,819 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:28:59,819 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803216876] [2021-01-06 19:28:59,820 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:28:59,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:28:59,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:28:59,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:28:59,821 INFO L87 Difference]: Start difference. First operand 3706 states and 5373 transitions. Second operand 4 states. [2021-01-06 19:29:00,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:00,274 INFO L93 Difference]: Finished difference Result 8986 states and 13027 transitions. [2021-01-06 19:29:00,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:00,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:00,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:00,287 INFO L225 Difference]: With dead ends: 8986 [2021-01-06 19:29:00,287 INFO L226 Difference]: Without dead ends: 5313 [2021-01-06 19:29:00,295 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:29:00,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2021-01-06 19:29:00,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 3706. [2021-01-06 19:29:00,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5370 transitions. [2021-01-06 19:29:00,521 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5370 transitions. Word has length 171 [2021-01-06 19:29:00,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:00,521 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5370 transitions. [2021-01-06 19:29:00,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:00,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5370 transitions. [2021-01-06 19:29:00,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:00,525 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:00,525 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:00,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-01-06 19:29:00,526 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:00,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:00,526 INFO L82 PathProgramCache]: Analyzing trace with hash 279112058, now seen corresponding path program 1 times [2021-01-06 19:29:00,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:00,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114565499] [2021-01-06 19:29:00,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:00,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:00,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114565499] [2021-01-06 19:29:00,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:00,598 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:00,598 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861902778] [2021-01-06 19:29:00,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:00,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:00,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:00,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:00,601 INFO L87 Difference]: Start difference. First operand 3706 states and 5370 transitions. Second operand 3 states. [2021-01-06 19:29:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:00,897 INFO L93 Difference]: Finished difference Result 7378 states and 10691 transitions. [2021-01-06 19:29:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:00,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:00,909 INFO L225 Difference]: With dead ends: 7378 [2021-01-06 19:29:00,910 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:29:00,917 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:29:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:29:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:29:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5332 transitions. [2021-01-06 19:29:01,129 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5332 transitions. Word has length 171 [2021-01-06 19:29:01,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:01,129 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5332 transitions. [2021-01-06 19:29:01,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5332 transitions. [2021-01-06 19:29:01,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:01,131 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:01,132 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:01,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-01-06 19:29:01,132 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:01,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:01,133 INFO L82 PathProgramCache]: Analyzing trace with hash -778106057, now seen corresponding path program 1 times [2021-01-06 19:29:01,133 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:01,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132618188] [2021-01-06 19:29:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:01,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132618188] [2021-01-06 19:29:01,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:01,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:01,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330155591] [2021-01-06 19:29:01,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:01,200 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:01,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:01,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:01,201 INFO L87 Difference]: Start difference. First operand 3706 states and 5332 transitions. Second operand 3 states. [2021-01-06 19:29:01,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:01,458 INFO L93 Difference]: Finished difference Result 7377 states and 10614 transitions. [2021-01-06 19:29:01,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:01,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:01,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:01,469 INFO L225 Difference]: With dead ends: 7377 [2021-01-06 19:29:01,469 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:29:01,483 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:29:01,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:29:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:29:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:01,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5294 transitions. [2021-01-06 19:29:01,711 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5294 transitions. Word has length 171 [2021-01-06 19:29:01,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:01,712 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5294 transitions. [2021-01-06 19:29:01,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:01,712 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5294 transitions. [2021-01-06 19:29:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:01,714 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:01,715 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:01,715 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-01-06 19:29:01,715 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:01,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash -708458183, now seen corresponding path program 1 times [2021-01-06 19:29:01,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:01,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587941580] [2021-01-06 19:29:01,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:01,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:01,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587941580] [2021-01-06 19:29:01,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:01,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:01,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219565220] [2021-01-06 19:29:01,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:01,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:01,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:01,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:01,841 INFO L87 Difference]: Start difference. First operand 3706 states and 5294 transitions. Second operand 3 states. [2021-01-06 19:29:02,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:02,181 INFO L93 Difference]: Finished difference Result 7376 states and 10537 transitions. [2021-01-06 19:29:02,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:02,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:02,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:02,190 INFO L225 Difference]: With dead ends: 7376 [2021-01-06 19:29:02,190 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:29:02,196 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:29:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:29:02,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:29:02,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5256 transitions. [2021-01-06 19:29:02,482 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5256 transitions. Word has length 171 [2021-01-06 19:29:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:02,482 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5256 transitions. [2021-01-06 19:29:02,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5256 transitions. [2021-01-06 19:29:02,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:02,485 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:02,485 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:02,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-01-06 19:29:02,485 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:02,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1454574730, now seen corresponding path program 1 times [2021-01-06 19:29:02,486 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:02,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471095943] [2021-01-06 19:29:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:02,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471095943] [2021-01-06 19:29:02,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:02,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:02,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186371185] [2021-01-06 19:29:02,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:02,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:02,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:02,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:02,583 INFO L87 Difference]: Start difference. First operand 3706 states and 5256 transitions. Second operand 3 states. [2021-01-06 19:29:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:02,860 INFO L93 Difference]: Finished difference Result 7374 states and 10458 transitions. [2021-01-06 19:29:02,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:02,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:02,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:02,871 INFO L225 Difference]: With dead ends: 7374 [2021-01-06 19:29:02,871 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:29:02,877 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:29:02,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:29:03,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:29:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5218 transitions. [2021-01-06 19:29:03,161 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5218 transitions. Word has length 171 [2021-01-06 19:29:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:03,161 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5218 transitions. [2021-01-06 19:29:03,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:03,161 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5218 transitions. [2021-01-06 19:29:03,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:03,163 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:03,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:03,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-01-06 19:29:03,164 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:03,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:03,164 INFO L82 PathProgramCache]: Analyzing trace with hash 55125555, now seen corresponding path program 1 times [2021-01-06 19:29:03,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:03,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881431242] [2021-01-06 19:29:03,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:03,251 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881431242] [2021-01-06 19:29:03,253 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:03,253 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:03,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261712360] [2021-01-06 19:29:03,253 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:03,254 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:03,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:03,254 INFO L87 Difference]: Start difference. First operand 3706 states and 5218 transitions. Second operand 4 states. [2021-01-06 19:29:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:03,711 INFO L93 Difference]: Finished difference Result 8974 states and 12637 transitions. [2021-01-06 19:29:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:03,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:03,725 INFO L225 Difference]: With dead ends: 8974 [2021-01-06 19:29:03,726 INFO L226 Difference]: Without dead ends: 5307 [2021-01-06 19:29:03,732 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:29:03,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5307 states. [2021-01-06 19:29:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5307 to 3706. [2021-01-06 19:29:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5215 transitions. [2021-01-06 19:29:03,963 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5215 transitions. Word has length 171 [2021-01-06 19:29:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:03,963 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5215 transitions. [2021-01-06 19:29:03,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5215 transitions. [2021-01-06 19:29:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:03,965 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:03,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:03,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-01-06 19:29:03,966 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:03,966 INFO L82 PathProgramCache]: Analyzing trace with hash 418592053, now seen corresponding path program 1 times [2021-01-06 19:29:03,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:03,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623644498] [2021-01-06 19:29:03,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:04,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623644498] [2021-01-06 19:29:04,035 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:04,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:04,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42105569] [2021-01-06 19:29:04,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:04,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:04,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:04,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:04,036 INFO L87 Difference]: Start difference. First operand 3706 states and 5215 transitions. Second operand 4 states. [2021-01-06 19:29:04,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:04,542 INFO L93 Difference]: Finished difference Result 8972 states and 12627 transitions. [2021-01-06 19:29:04,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:04,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:04,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:04,556 INFO L225 Difference]: With dead ends: 8972 [2021-01-06 19:29:04,557 INFO L226 Difference]: Without dead ends: 5306 [2021-01-06 19:29:04,562 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:29:04,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5306 states. [2021-01-06 19:29:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5306 to 3706. [2021-01-06 19:29:04,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5212 transitions. [2021-01-06 19:29:04,804 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5212 transitions. Word has length 171 [2021-01-06 19:29:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:04,804 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5212 transitions. [2021-01-06 19:29:04,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5212 transitions. [2021-01-06 19:29:04,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:04,807 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:04,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:04,807 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-01-06 19:29:04,807 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash 707411443, now seen corresponding path program 1 times [2021-01-06 19:29:04,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:04,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545402300] [2021-01-06 19:29:04,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:04,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:04,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545402300] [2021-01-06 19:29:04,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:04,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:04,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294849892] [2021-01-06 19:29:04,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:04,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:04,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:04,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:04,876 INFO L87 Difference]: Start difference. First operand 3706 states and 5212 transitions. Second operand 3 states. [2021-01-06 19:29:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,157 INFO L93 Difference]: Finished difference Result 7371 states and 10367 transitions. [2021-01-06 19:29:05,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:05,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,169 INFO L225 Difference]: With dead ends: 7371 [2021-01-06 19:29:05,169 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:29:05,174 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:29:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:29:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:29:05,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5174 transitions. [2021-01-06 19:29:05,461 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5174 transitions. Word has length 171 [2021-01-06 19:29:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:05,461 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5174 transitions. [2021-01-06 19:29:05,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:05,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5174 transitions. [2021-01-06 19:29:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:05,463 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:05,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:05,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-01-06 19:29:05,463 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:05,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:05,465 INFO L82 PathProgramCache]: Analyzing trace with hash 813241208, now seen corresponding path program 1 times [2021-01-06 19:29:05,465 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:05,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078515693] [2021-01-06 19:29:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:05,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:29:05,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078515693] [2021-01-06 19:29:05,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:05,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:05,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683236093] [2021-01-06 19:29:05,531 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:05,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:05,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:05,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:05,532 INFO L87 Difference]: Start difference. First operand 3706 states and 5174 transitions. Second operand 3 states. [2021-01-06 19:29:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:05,787 INFO L93 Difference]: Finished difference Result 7370 states and 10290 transitions. [2021-01-06 19:29:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:05,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:05,798 INFO L225 Difference]: With dead ends: 7370 [2021-01-06 19:29:05,798 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:29:05,804 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:29:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:29:06,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:29:06,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5136 transitions. [2021-01-06 19:29:06,051 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5136 transitions. Word has length 171 [2021-01-06 19:29:06,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:06,051 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5136 transitions. [2021-01-06 19:29:06,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5136 transitions. [2021-01-06 19:29:06,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:06,052 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:06,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:06,053 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-01-06 19:29:06,053 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:06,054 INFO L82 PathProgramCache]: Analyzing trace with hash -505743372, now seen corresponding path program 1 times [2021-01-06 19:29:06,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:06,054 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174778165] [2021-01-06 19:29:06,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:06,119 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174778165] [2021-01-06 19:29:06,120 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:06,120 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:06,120 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530877714] [2021-01-06 19:29:06,121 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:06,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:06,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:06,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:06,121 INFO L87 Difference]: Start difference. First operand 3706 states and 5136 transitions. Second operand 3 states. [2021-01-06 19:29:06,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:06,410 INFO L93 Difference]: Finished difference Result 7369 states and 10213 transitions. [2021-01-06 19:29:06,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:06,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:06,417 INFO L225 Difference]: With dead ends: 7369 [2021-01-06 19:29:06,417 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:29:06,422 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:29:06,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:29:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:29:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5098 transitions. [2021-01-06 19:29:06,776 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5098 transitions. Word has length 171 [2021-01-06 19:29:06,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:06,776 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5098 transitions. [2021-01-06 19:29:06,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5098 transitions. [2021-01-06 19:29:06,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:06,778 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:06,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:06,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-01-06 19:29:06,778 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:06,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:06,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1809841143, now seen corresponding path program 1 times [2021-01-06 19:29:06,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:06,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91570519] [2021-01-06 19:29:06,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:06,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:06,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91570519] [2021-01-06 19:29:06,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:06,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:06,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821023842] [2021-01-06 19:29:06,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:06,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:06,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:06,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:06,863 INFO L87 Difference]: Start difference. First operand 3706 states and 5098 transitions. Second operand 3 states. [2021-01-06 19:29:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:07,165 INFO L93 Difference]: Finished difference Result 7368 states and 10136 transitions. [2021-01-06 19:29:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:07,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2021-01-06 19:29:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:07,170 INFO L225 Difference]: With dead ends: 7368 [2021-01-06 19:29:07,170 INFO L226 Difference]: Without dead ends: 3706 [2021-01-06 19:29:07,177 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:29:07,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3706 states. [2021-01-06 19:29:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 3706. [2021-01-06 19:29:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3706 states. [2021-01-06 19:29:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5060 transitions. [2021-01-06 19:29:07,442 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5060 transitions. Word has length 171 [2021-01-06 19:29:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:07,442 INFO L481 AbstractCegarLoop]: Abstraction has 3706 states and 5060 transitions. [2021-01-06 19:29:07,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5060 transitions. [2021-01-06 19:29:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:07,444 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:07,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:07,444 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-01-06 19:29:07,444 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:07,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:07,445 INFO L82 PathProgramCache]: Analyzing trace with hash 204001139, now seen corresponding path program 1 times [2021-01-06 19:29:07,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:07,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914300599] [2021-01-06 19:29:07,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:07,554 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914300599] [2021-01-06 19:29:07,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:07,554 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:07,554 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696993943] [2021-01-06 19:29:07,555 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:07,555 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:07,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:07,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:07,556 INFO L87 Difference]: Start difference. First operand 3706 states and 5060 transitions. Second operand 5 states. [2021-01-06 19:29:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:08,162 INFO L93 Difference]: Finished difference Result 8346 states and 11476 transitions. [2021-01-06 19:29:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:08,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2021-01-06 19:29:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:08,168 INFO L225 Difference]: With dead ends: 8346 [2021-01-06 19:29:08,168 INFO L226 Difference]: Without dead ends: 4692 [2021-01-06 19:29:08,172 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:29:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4692 states. [2021-01-06 19:29:08,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4692 to 3712. [2021-01-06 19:29:08,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3712 states. [2021-01-06 19:29:08,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 5036 transitions. [2021-01-06 19:29:08,418 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 5036 transitions. Word has length 171 [2021-01-06 19:29:08,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:08,418 INFO L481 AbstractCegarLoop]: Abstraction has 3712 states and 5036 transitions. [2021-01-06 19:29:08,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:08,418 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 5036 transitions. [2021-01-06 19:29:08,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:08,419 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:08,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:08,420 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-01-06 19:29:08,420 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:08,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:08,423 INFO L82 PathProgramCache]: Analyzing trace with hash 692048245, now seen corresponding path program 1 times [2021-01-06 19:29:08,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:08,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566994811] [2021-01-06 19:29:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:08,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566994811] [2021-01-06 19:29:08,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:08,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:08,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421847627] [2021-01-06 19:29:08,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:08,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:08,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:08,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:08,495 INFO L87 Difference]: Start difference. First operand 3712 states and 5036 transitions. Second operand 5 states. [2021-01-06 19:29:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:09,100 INFO L93 Difference]: Finished difference Result 8714 states and 11884 transitions. [2021-01-06 19:29:09,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:09,101 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2021-01-06 19:29:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:09,108 INFO L225 Difference]: With dead ends: 8714 [2021-01-06 19:29:09,109 INFO L226 Difference]: Without dead ends: 5068 [2021-01-06 19:29:09,115 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:29:09,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5068 states. [2021-01-06 19:29:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5068 to 3718. [2021-01-06 19:29:09,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3718 states. [2021-01-06 19:29:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 5012 transitions. [2021-01-06 19:29:09,456 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 5012 transitions. Word has length 171 [2021-01-06 19:29:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:09,457 INFO L481 AbstractCegarLoop]: Abstraction has 3718 states and 5012 transitions. [2021-01-06 19:29:09,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 5012 transitions. [2021-01-06 19:29:09,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:09,458 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:09,459 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:09,459 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-01-06 19:29:09,459 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:09,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:09,459 INFO L82 PathProgramCache]: Analyzing trace with hash -346536329, now seen corresponding path program 1 times [2021-01-06 19:29:09,460 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:09,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536087252] [2021-01-06 19:29:09,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:09,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536087252] [2021-01-06 19:29:09,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:09,600 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:09,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60342706] [2021-01-06 19:29:09,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:09,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:09,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:09,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:09,602 INFO L87 Difference]: Start difference. First operand 3718 states and 5012 transitions. Second operand 5 states. [2021-01-06 19:29:10,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:10,188 INFO L93 Difference]: Finished difference Result 8907 states and 12042 transitions. [2021-01-06 19:29:10,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:10,189 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2021-01-06 19:29:10,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:10,194 INFO L225 Difference]: With dead ends: 8907 [2021-01-06 19:29:10,195 INFO L226 Difference]: Without dead ends: 5262 [2021-01-06 19:29:10,200 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:29:10,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5262 states. [2021-01-06 19:29:10,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5262 to 3724. [2021-01-06 19:29:10,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3724 states. [2021-01-06 19:29:10,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 4988 transitions. [2021-01-06 19:29:10,531 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 4988 transitions. Word has length 171 [2021-01-06 19:29:10,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:10,532 INFO L481 AbstractCegarLoop]: Abstraction has 3724 states and 4988 transitions. [2021-01-06 19:29:10,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:10,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 4988 transitions. [2021-01-06 19:29:10,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:10,533 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:10,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:10,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-01-06 19:29:10,533 INFO L429 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1915036921, now seen corresponding path program 1 times [2021-01-06 19:29:10,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:10,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62330545] [2021-01-06 19:29:10,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:10,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:10,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62330545] [2021-01-06 19:29:10,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:10,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:10,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944247690] [2021-01-06 19:29:10,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:10,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:10,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:10,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:10,606 INFO L87 Difference]: Start difference. First operand 3724 states and 4988 transitions. Second operand 5 states. [2021-01-06 19:29:11,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:11,205 INFO L93 Difference]: Finished difference Result 9100 states and 12200 transitions. [2021-01-06 19:29:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:11,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2021-01-06 19:29:11,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:11,211 INFO L225 Difference]: With dead ends: 9100 [2021-01-06 19:29:11,211 INFO L226 Difference]: Without dead ends: 5456 [2021-01-06 19:29:11,216 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:29:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2021-01-06 19:29:11,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 3730. [2021-01-06 19:29:11,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3730 states. [2021-01-06 19:29:11,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3730 states to 3730 states and 4964 transitions. [2021-01-06 19:29:11,461 INFO L78 Accepts]: Start accepts. Automaton has 3730 states and 4964 transitions. Word has length 171 [2021-01-06 19:29:11,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:11,461 INFO L481 AbstractCegarLoop]: Abstraction has 3730 states and 4964 transitions. [2021-01-06 19:29:11,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:11,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3730 states and 4964 transitions. [2021-01-06 19:29:11,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:11,462 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:11,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:11,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-01-06 19:29:11,463 INFO L429 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:11,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:11,464 INFO L82 PathProgramCache]: Analyzing trace with hash -778859269, now seen corresponding path program 1 times [2021-01-06 19:29:11,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:11,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086450961] [2021-01-06 19:29:11,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:11,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086450961] [2021-01-06 19:29:11,528 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:11,528 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:11,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269899859] [2021-01-06 19:29:11,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:11,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:11,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:11,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:11,530 INFO L87 Difference]: Start difference. First operand 3730 states and 4964 transitions. Second operand 5 states. [2021-01-06 19:29:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:12,640 INFO L93 Difference]: Finished difference Result 13274 states and 17745 transitions. [2021-01-06 19:29:12,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:12,641 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2021-01-06 19:29:12,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:12,651 INFO L225 Difference]: With dead ends: 13274 [2021-01-06 19:29:12,652 INFO L226 Difference]: Without dead ends: 9631 [2021-01-06 19:29:12,658 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:29:12,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9631 states. [2021-01-06 19:29:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9631 to 3826. [2021-01-06 19:29:13,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3826 states. [2021-01-06 19:29:13,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3826 states to 3826 states and 5060 transitions. [2021-01-06 19:29:13,056 INFO L78 Accepts]: Start accepts. Automaton has 3826 states and 5060 transitions. Word has length 171 [2021-01-06 19:29:13,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:13,056 INFO L481 AbstractCegarLoop]: Abstraction has 3826 states and 5060 transitions. [2021-01-06 19:29:13,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3826 states and 5060 transitions. [2021-01-06 19:29:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:13,057 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:13,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:13,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-01-06 19:29:13,058 INFO L429 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1575526013, now seen corresponding path program 1 times [2021-01-06 19:29:13,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:13,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352106526] [2021-01-06 19:29:13,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:13,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:13,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352106526] [2021-01-06 19:29:13,121 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:13,121 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:13,121 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859989054] [2021-01-06 19:29:13,122 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:13,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:13,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:13,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:13,123 INFO L87 Difference]: Start difference. First operand 3826 states and 5060 transitions. Second operand 5 states. [2021-01-06 19:29:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:13,815 INFO L93 Difference]: Finished difference Result 9747 states and 12887 transitions. [2021-01-06 19:29:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:13,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2021-01-06 19:29:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:13,822 INFO L225 Difference]: With dead ends: 9747 [2021-01-06 19:29:13,823 INFO L226 Difference]: Without dead ends: 6018 [2021-01-06 19:29:13,829 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:29:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6018 states. [2021-01-06 19:29:14,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6018 to 3832. [2021-01-06 19:29:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3832 states. [2021-01-06 19:29:14,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3832 states to 3832 states and 5036 transitions. [2021-01-06 19:29:14,200 INFO L78 Accepts]: Start accepts. Automaton has 3832 states and 5036 transitions. Word has length 171 [2021-01-06 19:29:14,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:14,201 INFO L481 AbstractCegarLoop]: Abstraction has 3832 states and 5036 transitions. [2021-01-06 19:29:14,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:14,201 INFO L276 IsEmpty]: Start isEmpty. Operand 3832 states and 5036 transitions. [2021-01-06 19:29:14,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-01-06 19:29:14,202 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:14,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:14,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-01-06 19:29:14,203 INFO L429 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:14,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:14,203 INFO L82 PathProgramCache]: Analyzing trace with hash -842958465, now seen corresponding path program 1 times [2021-01-06 19:29:14,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:14,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615973594] [2021-01-06 19:29:14,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:14,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:29:14,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615973594] [2021-01-06 19:29:14,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:14,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:14,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147811340] [2021-01-06 19:29:14,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:14,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:14,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:14,284 INFO L87 Difference]: Start difference. First operand 3832 states and 5036 transitions. Second operand 4 states. [2021-01-06 19:29:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:15,503 INFO L93 Difference]: Finished difference Result 14512 states and 19054 transitions. [2021-01-06 19:29:15,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:15,503 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2021-01-06 19:29:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:15,517 INFO L225 Difference]: With dead ends: 14512 [2021-01-06 19:29:15,517 INFO L226 Difference]: Without dead ends: 10727 [2021-01-06 19:29:15,523 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:29:15,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10727 states. [2021-01-06 19:29:16,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10727 to 10421. [2021-01-06 19:29:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10421 states. [2021-01-06 19:29:16,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10421 states to 10421 states and 13601 transitions. [2021-01-06 19:29:16,477 INFO L78 Accepts]: Start accepts. Automaton has 10421 states and 13601 transitions. Word has length 171 [2021-01-06 19:29:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:16,478 INFO L481 AbstractCegarLoop]: Abstraction has 10421 states and 13601 transitions. [2021-01-06 19:29:16,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 10421 states and 13601 transitions. [2021-01-06 19:29:16,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 19:29:16,480 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:16,481 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:16,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-01-06 19:29:16,481 INFO L429 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:16,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:16,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1542462421, now seen corresponding path program 1 times [2021-01-06 19:29:16,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:16,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539181397] [2021-01-06 19:29:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:16,560 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539181397] [2021-01-06 19:29:16,560 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:16,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:16,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046996814] [2021-01-06 19:29:16,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:16,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:16,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:16,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:16,562 INFO L87 Difference]: Start difference. First operand 10421 states and 13601 transitions. Second operand 5 states. [2021-01-06 19:29:18,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:18,599 INFO L93 Difference]: Finished difference Result 26135 states and 34254 transitions. [2021-01-06 19:29:18,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:18,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2021-01-06 19:29:18,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:18,615 INFO L225 Difference]: With dead ends: 26135 [2021-01-06 19:29:18,616 INFO L226 Difference]: Without dead ends: 15816 [2021-01-06 19:29:18,627 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:29:18,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15816 states. [2021-01-06 19:29:19,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15816 to 10514. [2021-01-06 19:29:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10514 states. [2021-01-06 19:29:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10514 states to 10514 states and 13637 transitions. [2021-01-06 19:29:19,588 INFO L78 Accepts]: Start accepts. Automaton has 10514 states and 13637 transitions. Word has length 195 [2021-01-06 19:29:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:19,588 INFO L481 AbstractCegarLoop]: Abstraction has 10514 states and 13637 transitions. [2021-01-06 19:29:19,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 10514 states and 13637 transitions. [2021-01-06 19:29:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 19:29:19,592 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:19,592 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:19,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-01-06 19:29:19,592 INFO L429 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:19,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:19,593 INFO L82 PathProgramCache]: Analyzing trace with hash -490931625, now seen corresponding path program 1 times [2021-01-06 19:29:19,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:19,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479111877] [2021-01-06 19:29:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:19,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479111877] [2021-01-06 19:29:19,679 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:19,679 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:19,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315892967] [2021-01-06 19:29:19,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:19,680 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:19,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:19,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:19,680 INFO L87 Difference]: Start difference. First operand 10514 states and 13637 transitions. Second operand 5 states. [2021-01-06 19:29:21,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:21,841 INFO L93 Difference]: Finished difference Result 28690 states and 37233 transitions. [2021-01-06 19:29:21,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:21,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2021-01-06 19:29:21,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:21,863 INFO L225 Difference]: With dead ends: 28690 [2021-01-06 19:29:21,863 INFO L226 Difference]: Without dead ends: 18292 [2021-01-06 19:29:21,871 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:29:21,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18292 states. [2021-01-06 19:29:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18292 to 10532. [2021-01-06 19:29:22,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10532 states. [2021-01-06 19:29:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10532 states to 10532 states and 13573 transitions. [2021-01-06 19:29:22,834 INFO L78 Accepts]: Start accepts. Automaton has 10532 states and 13573 transitions. Word has length 195 [2021-01-06 19:29:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:22,834 INFO L481 AbstractCegarLoop]: Abstraction has 10532 states and 13573 transitions. [2021-01-06 19:29:22,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 10532 states and 13573 transitions. [2021-01-06 19:29:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 19:29:22,836 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:22,836 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:22,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-01-06 19:29:22,837 INFO L429 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1863453657, now seen corresponding path program 1 times [2021-01-06 19:29:22,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:22,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664198778] [2021-01-06 19:29:22,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:22,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664198778] [2021-01-06 19:29:22,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:22,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:22,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588543708] [2021-01-06 19:29:22,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:22,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:22,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:22,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:22,920 INFO L87 Difference]: Start difference. First operand 10532 states and 13573 transitions. Second operand 5 states. [2021-01-06 19:29:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:25,115 INFO L93 Difference]: Finished difference Result 29241 states and 37691 transitions. [2021-01-06 19:29:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:25,115 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2021-01-06 19:29:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:25,134 INFO L225 Difference]: With dead ends: 29241 [2021-01-06 19:29:25,134 INFO L226 Difference]: Without dead ends: 18832 [2021-01-06 19:29:25,142 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:29:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18832 states. [2021-01-06 19:29:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18832 to 10550. [2021-01-06 19:29:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10550 states. [2021-01-06 19:29:26,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10550 states to 10550 states and 13509 transitions. [2021-01-06 19:29:26,143 INFO L78 Accepts]: Start accepts. Automaton has 10550 states and 13509 transitions. Word has length 195 [2021-01-06 19:29:26,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:26,143 INFO L481 AbstractCegarLoop]: Abstraction has 10550 states and 13509 transitions. [2021-01-06 19:29:26,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 10550 states and 13509 transitions. [2021-01-06 19:29:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 19:29:26,145 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:26,145 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:26,145 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-01-06 19:29:26,145 INFO L429 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:26,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:26,146 INFO L82 PathProgramCache]: Analyzing trace with hash -555030821, now seen corresponding path program 1 times [2021-01-06 19:29:26,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:26,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320891516] [2021-01-06 19:29:26,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:26,225 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320891516] [2021-01-06 19:29:26,225 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:26,225 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:26,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222203173] [2021-01-06 19:29:26,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:26,226 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:26,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:26,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:26,227 INFO L87 Difference]: Start difference. First operand 10550 states and 13509 transitions. Second operand 5 states. [2021-01-06 19:29:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:28,424 INFO L93 Difference]: Finished difference Result 29792 states and 38149 transitions. [2021-01-06 19:29:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:28,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2021-01-06 19:29:28,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:28,445 INFO L225 Difference]: With dead ends: 29792 [2021-01-06 19:29:28,445 INFO L226 Difference]: Without dead ends: 19372 [2021-01-06 19:29:28,454 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:29:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19372 states. [2021-01-06 19:29:29,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19372 to 10568. [2021-01-06 19:29:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10568 states. [2021-01-06 19:29:29,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10568 states to 10568 states and 13445 transitions. [2021-01-06 19:29:29,510 INFO L78 Accepts]: Start accepts. Automaton has 10568 states and 13445 transitions. Word has length 195 [2021-01-06 19:29:29,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:29,511 INFO L481 AbstractCegarLoop]: Abstraction has 10568 states and 13445 transitions. [2021-01-06 19:29:29,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 10568 states and 13445 transitions. [2021-01-06 19:29:29,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 19:29:29,513 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:29,513 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:29,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-01-06 19:29:29,514 INFO L429 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash -314791075, now seen corresponding path program 1 times [2021-01-06 19:29:29,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:29,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585184563] [2021-01-06 19:29:29,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:29,580 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:29,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585184563] [2021-01-06 19:29:29,581 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:29,581 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:29,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113707578] [2021-01-06 19:29:29,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:29,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:29,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:29,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:29,582 INFO L87 Difference]: Start difference. First operand 10568 states and 13445 transitions. Second operand 5 states. [2021-01-06 19:29:31,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:31,822 INFO L93 Difference]: Finished difference Result 30343 states and 38607 transitions. [2021-01-06 19:29:31,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:31,822 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2021-01-06 19:29:31,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:31,842 INFO L225 Difference]: With dead ends: 30343 [2021-01-06 19:29:31,843 INFO L226 Difference]: Without dead ends: 19912 [2021-01-06 19:29:31,851 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:29:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19912 states. [2021-01-06 19:29:33,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19912 to 10586. [2021-01-06 19:29:33,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10586 states. [2021-01-06 19:29:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10586 states to 10586 states and 13381 transitions. [2021-01-06 19:29:33,097 INFO L78 Accepts]: Start accepts. Automaton has 10586 states and 13381 transitions. Word has length 195 [2021-01-06 19:29:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:33,097 INFO L481 AbstractCegarLoop]: Abstraction has 10586 states and 13381 transitions. [2021-01-06 19:29:33,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 10586 states and 13381 transitions. [2021-01-06 19:29:33,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2021-01-06 19:29:33,100 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:33,100 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:33,100 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-01-06 19:29:33,100 INFO L429 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:33,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:33,101 INFO L82 PathProgramCache]: Analyzing trace with hash 2069133663, now seen corresponding path program 1 times [2021-01-06 19:29:33,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:33,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849922627] [2021-01-06 19:29:33,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:33,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:33,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849922627] [2021-01-06 19:29:33,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:33,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:33,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935849207] [2021-01-06 19:29:33,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:33,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:33,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:33,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:33,203 INFO L87 Difference]: Start difference. First operand 10586 states and 13381 transitions. Second operand 4 states. [2021-01-06 19:29:36,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:36,754 INFO L93 Difference]: Finished difference Result 40404 states and 51013 transitions. [2021-01-06 19:29:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:29:36,755 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2021-01-06 19:29:36,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:36,785 INFO L225 Difference]: With dead ends: 40404 [2021-01-06 19:29:36,785 INFO L226 Difference]: Without dead ends: 29957 [2021-01-06 19:29:36,798 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:29:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29957 states. [2021-01-06 19:29:40,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29957 to 29471. [2021-01-06 19:29:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29471 states. [2021-01-06 19:29:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29471 states to 29471 states and 36992 transitions. [2021-01-06 19:29:40,065 INFO L78 Accepts]: Start accepts. Automaton has 29471 states and 36992 transitions. Word has length 195 [2021-01-06 19:29:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:40,066 INFO L481 AbstractCegarLoop]: Abstraction has 29471 states and 36992 transitions. [2021-01-06 19:29:40,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:29:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 29471 states and 36992 transitions. [2021-01-06 19:29:40,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:29:40,069 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:40,070 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:40,070 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-01-06 19:29:40,070 INFO L429 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:40,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:40,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1374515614, now seen corresponding path program 1 times [2021-01-06 19:29:40,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:40,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52597017] [2021-01-06 19:29:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:40,147 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:40,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52597017] [2021-01-06 19:29:40,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:40,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-01-06 19:29:40,147 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123825961] [2021-01-06 19:29:40,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-01-06 19:29:40,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:40,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-01-06 19:29:40,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:29:40,149 INFO L87 Difference]: Start difference. First operand 29471 states and 36992 transitions. Second operand 5 states. [2021-01-06 19:29:45,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:45,297 INFO L93 Difference]: Finished difference Result 70498 states and 88835 transitions. [2021-01-06 19:29:45,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-01-06 19:29:45,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2021-01-06 19:29:45,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:45,346 INFO L225 Difference]: With dead ends: 70498 [2021-01-06 19:29:45,347 INFO L226 Difference]: Without dead ends: 41170 [2021-01-06 19:29:45,365 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:29:45,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41170 states. [2021-01-06 19:29:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41170 to 29732. [2021-01-06 19:29:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29732 states. [2021-01-06 19:29:49,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29732 states to 29732 states and 37094 transitions. [2021-01-06 19:29:49,506 INFO L78 Accepts]: Start accepts. Automaton has 29732 states and 37094 transitions. Word has length 199 [2021-01-06 19:29:49,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:49,506 INFO L481 AbstractCegarLoop]: Abstraction has 29732 states and 37094 transitions. [2021-01-06 19:29:49,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-01-06 19:29:49,506 INFO L276 IsEmpty]: Start isEmpty. Operand 29732 states and 37094 transitions. [2021-01-06 19:29:49,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:29:49,509 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:49,510 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:49,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-01-06 19:29:49,510 INFO L429 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:49,510 INFO L82 PathProgramCache]: Analyzing trace with hash 407164960, now seen corresponding path program 1 times [2021-01-06 19:29:49,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:49,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543434952] [2021-01-06 19:29:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:49,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:49,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543434952] [2021-01-06 19:29:49,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:49,610 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:29:49,610 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727899511] [2021-01-06 19:29:49,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:29:49,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:49,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:29:49,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:29:49,612 INFO L87 Difference]: Start difference. First operand 29732 states and 37094 transitions. Second operand 3 states. [2021-01-06 19:29:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:29:53,343 INFO L93 Difference]: Finished difference Result 59443 states and 74154 transitions. [2021-01-06 19:29:53,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:29:53,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2021-01-06 19:29:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:29:53,375 INFO L225 Difference]: With dead ends: 59443 [2021-01-06 19:29:53,375 INFO L226 Difference]: Without dead ends: 29732 [2021-01-06 19:29:53,392 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:29:53,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29732 states. [2021-01-06 19:29:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29732 to 29732. [2021-01-06 19:29:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29732 states. [2021-01-06 19:29:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29732 states to 29732 states and 37038 transitions. [2021-01-06 19:29:57,028 INFO L78 Accepts]: Start accepts. Automaton has 29732 states and 37038 transitions. Word has length 199 [2021-01-06 19:29:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:29:57,028 INFO L481 AbstractCegarLoop]: Abstraction has 29732 states and 37038 transitions. [2021-01-06 19:29:57,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:29:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 29732 states and 37038 transitions. [2021-01-06 19:29:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:29:57,030 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:29:57,030 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:29:57,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-01-06 19:29:57,030 INFO L429 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:29:57,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:29:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash -808988766, now seen corresponding path program 1 times [2021-01-06 19:29:57,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:29:57,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44289241] [2021-01-06 19:29:57,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:29:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:29:57,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:29:57,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44289241] [2021-01-06 19:29:57,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:29:57,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:29:57,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208617833] [2021-01-06 19:29:57,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:29:57,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:29:57,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:29:57,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:29:57,257 INFO L87 Difference]: Start difference. First operand 29732 states and 37038 transitions. Second operand 4 states. [2021-01-06 19:30:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:02,751 INFO L93 Difference]: Finished difference Result 73394 states and 91431 transitions. [2021-01-06 19:30:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:02,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2021-01-06 19:30:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:02,796 INFO L225 Difference]: With dead ends: 73394 [2021-01-06 19:30:02,797 INFO L226 Difference]: Without dead ends: 43812 [2021-01-06 19:30:02,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:02,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43812 states. [2021-01-06 19:30:06,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43812 to 29732. [2021-01-06 19:30:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29732 states. [2021-01-06 19:30:06,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29732 states to 29732 states and 37001 transitions. [2021-01-06 19:30:06,906 INFO L78 Accepts]: Start accepts. Automaton has 29732 states and 37001 transitions. Word has length 199 [2021-01-06 19:30:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:06,907 INFO L481 AbstractCegarLoop]: Abstraction has 29732 states and 37001 transitions. [2021-01-06 19:30:06,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 29732 states and 37001 transitions. [2021-01-06 19:30:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:30:06,908 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:06,909 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:06,909 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-01-06 19:30:06,909 INFO L429 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:06,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash -863381664, now seen corresponding path program 1 times [2021-01-06 19:30:06,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:06,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479834700] [2021-01-06 19:30:06,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:07,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:30:07,001 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479834700] [2021-01-06 19:30:07,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:07,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:07,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520833576] [2021-01-06 19:30:07,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:07,002 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:07,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:07,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:07,002 INFO L87 Difference]: Start difference. First operand 29732 states and 37001 transitions. Second operand 3 states. [2021-01-06 19:30:10,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:10,750 INFO L93 Difference]: Finished difference Result 59435 states and 73960 transitions. [2021-01-06 19:30:10,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:10,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2021-01-06 19:30:10,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:10,782 INFO L225 Difference]: With dead ends: 59435 [2021-01-06 19:30:10,782 INFO L226 Difference]: Without dead ends: 29732 [2021-01-06 19:30:10,799 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29732 states. [2021-01-06 19:30:14,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29732 to 29732. [2021-01-06 19:30:14,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29732 states. [2021-01-06 19:30:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29732 states to 29732 states and 36945 transitions. [2021-01-06 19:30:14,618 INFO L78 Accepts]: Start accepts. Automaton has 29732 states and 36945 transitions. Word has length 199 [2021-01-06 19:30:14,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:14,618 INFO L481 AbstractCegarLoop]: Abstraction has 29732 states and 36945 transitions. [2021-01-06 19:30:14,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 29732 states and 36945 transitions. [2021-01-06 19:30:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:30:14,621 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:14,621 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:14,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-01-06 19:30:14,621 INFO L429 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -302681886, now seen corresponding path program 1 times [2021-01-06 19:30:14,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:14,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055788569] [2021-01-06 19:30:14,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:14,717 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:30:14,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055788569] [2021-01-06 19:30:14,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:14,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:14,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497565169] [2021-01-06 19:30:14,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:14,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:14,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:14,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:14,719 INFO L87 Difference]: Start difference. First operand 29732 states and 36945 transitions. Second operand 4 states. [2021-01-06 19:30:20,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:20,640 INFO L93 Difference]: Finished difference Result 73826 states and 91728 transitions. [2021-01-06 19:30:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:20,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2021-01-06 19:30:20,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:20,685 INFO L225 Difference]: With dead ends: 73826 [2021-01-06 19:30:20,686 INFO L226 Difference]: Without dead ends: 44149 [2021-01-06 19:30:20,704 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44149 states. [2021-01-06 19:30:24,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44149 to 29732. [2021-01-06 19:30:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29732 states. [2021-01-06 19:30:24,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29732 states to 29732 states and 36670 transitions. [2021-01-06 19:30:24,931 INFO L78 Accepts]: Start accepts. Automaton has 29732 states and 36670 transitions. Word has length 199 [2021-01-06 19:30:24,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:24,932 INFO L481 AbstractCegarLoop]: Abstraction has 29732 states and 36670 transitions. [2021-01-06 19:30:24,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:24,932 INFO L276 IsEmpty]: Start isEmpty. Operand 29732 states and 36670 transitions. [2021-01-06 19:30:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:30:24,934 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:24,934 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:24,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-01-06 19:30:24,934 INFO L429 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1084103524, now seen corresponding path program 1 times [2021-01-06 19:30:24,934 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:24,934 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138586015] [2021-01-06 19:30:24,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:25,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:30:25,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138586015] [2021-01-06 19:30:25,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:25,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:25,026 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037302920] [2021-01-06 19:30:25,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:25,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:25,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:25,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:25,027 INFO L87 Difference]: Start difference. First operand 29732 states and 36670 transitions. Second operand 3 states. [2021-01-06 19:30:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:28,802 INFO L93 Difference]: Finished difference Result 58743 states and 72378 transitions. [2021-01-06 19:30:28,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:28,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2021-01-06 19:30:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:28,834 INFO L225 Difference]: With dead ends: 58743 [2021-01-06 19:30:28,834 INFO L226 Difference]: Without dead ends: 29048 [2021-01-06 19:30:28,858 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:28,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29048 states. [2021-01-06 19:30:32,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29048 to 29048. [2021-01-06 19:30:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29048 states. [2021-01-06 19:30:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29048 states to 29048 states and 35474 transitions. [2021-01-06 19:30:32,737 INFO L78 Accepts]: Start accepts. Automaton has 29048 states and 35474 transitions. Word has length 199 [2021-01-06 19:30:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:32,737 INFO L481 AbstractCegarLoop]: Abstraction has 29048 states and 35474 transitions. [2021-01-06 19:30:32,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:30:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 29048 states and 35474 transitions. [2021-01-06 19:30:32,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:30:32,739 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:32,739 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:32,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-01-06 19:30:32,739 INFO L429 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:32,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:32,740 INFO L82 PathProgramCache]: Analyzing trace with hash -944482586, now seen corresponding path program 1 times [2021-01-06 19:30:32,740 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:32,740 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515863374] [2021-01-06 19:30:32,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:30:32,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515863374] [2021-01-06 19:30:32,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:32,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:32,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693656168] [2021-01-06 19:30:32,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:32,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:32,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:32,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:32,844 INFO L87 Difference]: Start difference. First operand 29048 states and 35474 transitions. Second operand 4 states. [2021-01-06 19:30:38,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:38,576 INFO L93 Difference]: Finished difference Result 70704 states and 86380 transitions. [2021-01-06 19:30:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:38,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2021-01-06 19:30:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:38,627 INFO L225 Difference]: With dead ends: 70704 [2021-01-06 19:30:38,628 INFO L226 Difference]: Without dead ends: 41818 [2021-01-06 19:30:38,646 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41818 states. [2021-01-06 19:30:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41818 to 28805. [2021-01-06 19:30:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28805 states. [2021-01-06 19:30:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28805 states to 28805 states and 35032 transitions. [2021-01-06 19:30:42,591 INFO L78 Accepts]: Start accepts. Automaton has 28805 states and 35032 transitions. Word has length 199 [2021-01-06 19:30:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:42,591 INFO L481 AbstractCegarLoop]: Abstraction has 28805 states and 35032 transitions. [2021-01-06 19:30:42,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 28805 states and 35032 transitions. [2021-01-06 19:30:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:30:42,593 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:42,593 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:42,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2021-01-06 19:30:42,593 INFO L429 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:42,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:42,594 INFO L82 PathProgramCache]: Analyzing trace with hash -960001304, now seen corresponding path program 1 times [2021-01-06 19:30:42,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:42,594 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292041792] [2021-01-06 19:30:42,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:42,687 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:30:42,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292041792] [2021-01-06 19:30:42,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:42,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:30:42,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75427157] [2021-01-06 19:30:42,688 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-01-06 19:30:42,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:42,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-01-06 19:30:42,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-01-06 19:30:42,689 INFO L87 Difference]: Start difference. First operand 28805 states and 35032 transitions. Second operand 4 states. [2021-01-06 19:30:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:48,518 INFO L93 Difference]: Finished difference Result 71091 states and 86495 transitions. [2021-01-06 19:30:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-01-06 19:30:48,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 199 [2021-01-06 19:30:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:48,575 INFO L225 Difference]: With dead ends: 71091 [2021-01-06 19:30:48,576 INFO L226 Difference]: Without dead ends: 42389 [2021-01-06 19:30:48,606 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-01-06 19:30:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42389 states. [2021-01-06 19:30:52,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42389 to 28805. [2021-01-06 19:30:52,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28805 states. [2021-01-06 19:30:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28805 states to 28805 states and 34755 transitions. [2021-01-06 19:30:52,656 INFO L78 Accepts]: Start accepts. Automaton has 28805 states and 34755 transitions. Word has length 199 [2021-01-06 19:30:52,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:30:52,656 INFO L481 AbstractCegarLoop]: Abstraction has 28805 states and 34755 transitions. [2021-01-06 19:30:52,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-01-06 19:30:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 28805 states and 34755 transitions. [2021-01-06 19:30:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:30:52,658 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:30:52,658 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:30:52,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-01-06 19:30:52,659 INFO L429 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:30:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:30:52,659 INFO L82 PathProgramCache]: Analyzing trace with hash 979160742, now seen corresponding path program 1 times [2021-01-06 19:30:52,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:30:52,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289097982] [2021-01-06 19:30:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:30:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:30:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-01-06 19:30:52,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289097982] [2021-01-06 19:30:52,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:30:52,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-01-06 19:30:52,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871617165] [2021-01-06 19:30:52,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:30:52,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:30:52,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:30:52,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:52,734 INFO L87 Difference]: Start difference. First operand 28805 states and 34755 transitions. Second operand 3 states. [2021-01-06 19:30:56,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:30:56,377 INFO L93 Difference]: Finished difference Result 57322 states and 69128 transitions. [2021-01-06 19:30:56,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:30:56,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2021-01-06 19:30:56,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:30:56,404 INFO L225 Difference]: With dead ends: 57322 [2021-01-06 19:30:56,405 INFO L226 Difference]: Without dead ends: 28562 [2021-01-06 19:30:56,419 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:30:56,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28562 states. [2021-01-06 19:31:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28562 to 28562. [2021-01-06 19:31:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28562 states. [2021-01-06 19:31:00,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28562 states to 28562 states and 34294 transitions. [2021-01-06 19:31:00,355 INFO L78 Accepts]: Start accepts. Automaton has 28562 states and 34294 transitions. Word has length 199 [2021-01-06 19:31:00,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:00,356 INFO L481 AbstractCegarLoop]: Abstraction has 28562 states and 34294 transitions. [2021-01-06 19:31:00,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:00,356 INFO L276 IsEmpty]: Start isEmpty. Operand 28562 states and 34294 transitions. [2021-01-06 19:31:00,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-01-06 19:31:00,357 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:00,358 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:00,358 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-01-06 19:31:00,358 INFO L429 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:00,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:00,358 INFO L82 PathProgramCache]: Analyzing trace with hash 81767464, now seen corresponding path program 1 times [2021-01-06 19:31:00,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:00,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361354787] [2021-01-06 19:31:00,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:00,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:31:00,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361354787] [2021-01-06 19:31:00,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:00,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:00,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465387296] [2021-01-06 19:31:00,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:00,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:00,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:00,449 INFO L87 Difference]: Start difference. First operand 28562 states and 34294 transitions. Second operand 3 states. [2021-01-06 19:31:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:07,638 INFO L93 Difference]: Finished difference Result 83920 states and 100189 transitions. [2021-01-06 19:31:07,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:07,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2021-01-06 19:31:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:07,702 INFO L225 Difference]: With dead ends: 83920 [2021-01-06 19:31:07,702 INFO L226 Difference]: Without dead ends: 55526 [2021-01-06 19:31:07,723 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:31:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55526 states. [2021-01-06 19:31:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55526 to 55526. [2021-01-06 19:31:15,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55526 states. [2021-01-06 19:31:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55526 states to 55526 states and 66017 transitions. [2021-01-06 19:31:15,315 INFO L78 Accepts]: Start accepts. Automaton has 55526 states and 66017 transitions. Word has length 199 [2021-01-06 19:31:15,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:15,315 INFO L481 AbstractCegarLoop]: Abstraction has 55526 states and 66017 transitions. [2021-01-06 19:31:15,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 55526 states and 66017 transitions. [2021-01-06 19:31:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2021-01-06 19:31:15,319 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:15,319 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:15,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-01-06 19:31:15,320 INFO L429 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:15,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1414377257, now seen corresponding path program 1 times [2021-01-06 19:31:15,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:15,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876367390] [2021-01-06 19:31:15,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:15,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:31:15,416 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876367390] [2021-01-06 19:31:15,416 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:15,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:15,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653001886] [2021-01-06 19:31:15,416 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:15,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:15,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:15,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:15,417 INFO L87 Difference]: Start difference. First operand 55526 states and 66017 transitions. Second operand 3 states. [2021-01-06 19:31:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-01-06 19:31:29,920 INFO L93 Difference]: Finished difference Result 164674 states and 195201 transitions. [2021-01-06 19:31:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-01-06 19:31:29,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 200 [2021-01-06 19:31:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-01-06 19:31:30,062 INFO L225 Difference]: With dead ends: 164674 [2021-01-06 19:31:30,062 INFO L226 Difference]: Without dead ends: 109480 [2021-01-06 19:31:30,118 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:31:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109480 states. [2021-01-06 19:31:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109480 to 106284. [2021-01-06 19:31:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106284 states. [2021-01-06 19:31:44,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106284 states to 106284 states and 125791 transitions. [2021-01-06 19:31:44,602 INFO L78 Accepts]: Start accepts. Automaton has 106284 states and 125791 transitions. Word has length 200 [2021-01-06 19:31:44,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-01-06 19:31:44,602 INFO L481 AbstractCegarLoop]: Abstraction has 106284 states and 125791 transitions. [2021-01-06 19:31:44,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-01-06 19:31:44,602 INFO L276 IsEmpty]: Start isEmpty. Operand 106284 states and 125791 transitions. [2021-01-06 19:31:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2021-01-06 19:31:44,609 INFO L414 BasicCegarLoop]: Found error trace [2021-01-06 19:31:44,609 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-01-06 19:31:44,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2021-01-06 19:31:44,609 INFO L429 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-01-06 19:31:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-01-06 19:31:44,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1817351523, now seen corresponding path program 1 times [2021-01-06 19:31:44,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-01-06 19:31:44,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753769360] [2021-01-06 19:31:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-01-06 19:31:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-01-06 19:31:44,936 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-01-06 19:31:44,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753769360] [2021-01-06 19:31:44,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-01-06 19:31:44,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-01-06 19:31:44,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124202126] [2021-01-06 19:31:44,937 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-01-06 19:31:44,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-01-06 19:31:44,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-01-06 19:31:44,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-01-06 19:31:44,938 INFO L87 Difference]: Start difference. First operand 106284 states and 125791 transitions. Second operand 3 states.